Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440642
Fuliang Li, Xingwei Wang, Tian Pan, Jiahai Yang
With the exhausting of IPv4 addresses, the transition to IPv6 is imminent. In order to gain a deep understanding of IPv6, this paper revisits several critical IPv6 performance metrics. Our extensive measurement shows that packet delay and loss of IPv6 is similar to IPv4 when the AS-level paths are roughly the same. Specifically, when the link utilization exceeds a threshold, e.g., 0.83 in our study, variation of packet delay presents a similar pattern with the variation of link utilization. If packet delay of a path is large, packet-loss rate of that path is more likely to fluctuate. In addition, we conduct an analysis of packet reordering in IPv6 world. Few IPv6 probe packets are out-of-order and the reordering rate is 2.3×10-6, which is much lower than the average rate of 0.79% in IPv4 world. Our analysis consolidates an experimental basis for IPv6 network operators and researchers.
{"title":"Packet delay, loss and reordering in IPv6 world: A case study","authors":"Fuliang Li, Xingwei Wang, Tian Pan, Jiahai Yang","doi":"10.1109/ICCNC.2016.7440642","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440642","url":null,"abstract":"With the exhausting of IPv4 addresses, the transition to IPv6 is imminent. In order to gain a deep understanding of IPv6, this paper revisits several critical IPv6 performance metrics. Our extensive measurement shows that packet delay and loss of IPv6 is similar to IPv4 when the AS-level paths are roughly the same. Specifically, when the link utilization exceeds a threshold, e.g., 0.83 in our study, variation of packet delay presents a similar pattern with the variation of link utilization. If packet delay of a path is large, packet-loss rate of that path is more likely to fluctuate. In addition, we conduct an analysis of packet reordering in IPv6 world. Few IPv6 probe packets are out-of-order and the reordering rate is 2.3×10-6, which is much lower than the average rate of 0.79% in IPv4 world. Our analysis consolidates an experimental basis for IPv6 network operators and researchers.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116690258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440684
Abdullah Alshalan, Sandeep Pisharody, Dijiang Huang
Virtual Private Network (VPN) is the traditional approach for an end-to-end secure connection between two endpoints. But conventional VPN solutions are intended for wired networks with high-speed, highly reliable connections. In a mobile environment, connections are less reliable. This affects traditional VPN performance resulting in frequent application failure, data loss and reduced productivity. MobiVPN bridges the gap between what users and applications expect from a wired network and the realities of mobility. In this work, system design for a caching model is developed, and modifications to the OpenVPN software is implemented to make disruptions in the VPN transparent to the applications. MobiVPN is able to provide 1) persistency to application despite long unavailability of network connection using caching and freeze TCP techniques; with negligible throughput penalty when there is no disconnections due to extra computation overhead, and 2) improved TCP performance when disconnections occur up to 9.88% increase in throughput.
{"title":"MobiVPN: A mobile VPN providing persistency to applications","authors":"Abdullah Alshalan, Sandeep Pisharody, Dijiang Huang","doi":"10.1109/ICCNC.2016.7440684","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440684","url":null,"abstract":"Virtual Private Network (VPN) is the traditional approach for an end-to-end secure connection between two endpoints. But conventional VPN solutions are intended for wired networks with high-speed, highly reliable connections. In a mobile environment, connections are less reliable. This affects traditional VPN performance resulting in frequent application failure, data loss and reduced productivity. MobiVPN bridges the gap between what users and applications expect from a wired network and the realities of mobility. In this work, system design for a caching model is developed, and modifications to the OpenVPN software is implemented to make disruptions in the VPN transparent to the applications. MobiVPN is able to provide 1) persistency to application despite long unavailability of network connection using caching and freeze TCP techniques; with negligible throughput penalty when there is no disconnections due to extra computation overhead, and 2) improved TCP performance when disconnections occur up to 9.88% increase in throughput.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124629902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440558
I. Cushman, A. Younis, D. Rawat, Lei Chen
Opportunistic spectrum access in cognitive radio networks is regarded as an emerging technology for efficient utilization of under utilized of idle radio frequency spectrum. For opportunistic spectrum access, wireless devices are required to identify idle spectrum through spectrum sensing. The performance study of existing spectrum sensing algorithms often overlooks bandwidth of the detected signal while detecting the signal using peak of the energy spectrum that crosses the pre-specified threshold. This results in high false alarm probability. In this paper, we evaluate an adaptive threshold based RF spectrum sensing approach using USRP Software Defined Radio (SDR) for real-time opportunistic spectrum access in cloud based cognitive radio networks (ROAR) architecture where both signal energy and band-width of the signal are taken into account. We evaluate the performance of the proposed approach using probability of misdetection and false alarms metrics. The proposed approach can be particularized to a scenario with energy based detection or bandwidth based detection. The proposed approach is illustrated through numerical results obtained from experiments.
{"title":"Adaptive threshold-based RF spectrum scanning through joint energy and bandwidth detection with USRPs in cognitive sensor networks for ROAR architecture","authors":"I. Cushman, A. Younis, D. Rawat, Lei Chen","doi":"10.1109/ICCNC.2016.7440558","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440558","url":null,"abstract":"Opportunistic spectrum access in cognitive radio networks is regarded as an emerging technology for efficient utilization of under utilized of idle radio frequency spectrum. For opportunistic spectrum access, wireless devices are required to identify idle spectrum through spectrum sensing. The performance study of existing spectrum sensing algorithms often overlooks bandwidth of the detected signal while detecting the signal using peak of the energy spectrum that crosses the pre-specified threshold. This results in high false alarm probability. In this paper, we evaluate an adaptive threshold based RF spectrum sensing approach using USRP Software Defined Radio (SDR) for real-time opportunistic spectrum access in cloud based cognitive radio networks (ROAR) architecture where both signal energy and band-width of the signal are taken into account. We evaluate the performance of the proposed approach using probability of misdetection and false alarms metrics. The proposed approach can be particularized to a scenario with energy based detection or bandwidth based detection. The proposed approach is illustrated through numerical results obtained from experiments.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121324563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440560
Shuo-Han Chen, Tseng-Yi Chen, Yu-Chun Cheng, H. Wei, T. Hsu, W. Shih
An emerging breakthrough in wireless charging technology is expected to solve the power constraint problem in wireless sensor networks (WSN). In various works, wireless chargers are being bundled with mobile vehicles to recharge sensor nodes. In these works, simulations of mobile vehicles are typically used in experiments because building a wireless sensor network test bed is very costly and many details of a wireless sensor network are neither standardized nor finalized. Accordingly, a simulator is extremely useful in testing new applications or protocols in wireless sensor networks. However, several well-known wireless sensor network simulators have no or limited support for wireless recharging. Researchers may want to construct their own simulating modules, but the highly complex design of current simulators is intimidating and stops researchers from testing their applications. This work develops a framework for simulating a WSN and focuses on the simulation of wireless power transfer and mobile vehicles. This simulator eliminates the need for researchers to build their own simulator or integrate complex wireless charging modules, allowing them simply to implement their algorithm. Moreover, the proposed simulator has been verified by implementing the work of Xie et al. [20].
{"title":"Developing a user-friendly sensor network simulator to imitate wireless charging vehicle behaviors","authors":"Shuo-Han Chen, Tseng-Yi Chen, Yu-Chun Cheng, H. Wei, T. Hsu, W. Shih","doi":"10.1109/ICCNC.2016.7440560","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440560","url":null,"abstract":"An emerging breakthrough in wireless charging technology is expected to solve the power constraint problem in wireless sensor networks (WSN). In various works, wireless chargers are being bundled with mobile vehicles to recharge sensor nodes. In these works, simulations of mobile vehicles are typically used in experiments because building a wireless sensor network test bed is very costly and many details of a wireless sensor network are neither standardized nor finalized. Accordingly, a simulator is extremely useful in testing new applications or protocols in wireless sensor networks. However, several well-known wireless sensor network simulators have no or limited support for wireless recharging. Researchers may want to construct their own simulating modules, but the highly complex design of current simulators is intimidating and stops researchers from testing their applications. This work develops a framework for simulating a WSN and focuses on the simulation of wireless power transfer and mobile vehicles. This simulator eliminates the need for researchers to build their own simulator or integrate complex wireless charging modules, allowing them simply to implement their algorithm. Moreover, the proposed simulator has been verified by implementing the work of Xie et al. [20].","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127663330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440632
Yanchao Wang, Fenghua Li, Ben Niu, R. Xie
Cloud computing is regarded as a promising computing paradigm. More and more people store their sensitive data on the cloud. However, it is a great challenge for data security and accessing the sensitive data on the cloud. In this paper, we propose a novel access control scheme, termed LTS-ACCESS, which achieves Lightweight, Time-specific and Secure data access control for resource-limited devices in cloud storage. Our LTS-ACCESS simultaneously enjoys the following properties: i) constant size of the decryption keys and lower computation cost since we delegate almost all of the decryption cost to the decryption service provider, ii) time-specific, the sensitive data owner may specify a time interval, thus a receiver can decrypt the ciphertext once it is received and a time instant key has been obtained, and iii) provably secure, the proposed scheme is provably secure under the selective security model. Thoroughly theoretical analysis and performance evaluation indicate the effectiveness and efficiency of our proposed LTS-ACCESS.
{"title":"Achieving lightweight, time-specific and secure access control in cloud storage","authors":"Yanchao Wang, Fenghua Li, Ben Niu, R. Xie","doi":"10.1109/ICCNC.2016.7440632","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440632","url":null,"abstract":"Cloud computing is regarded as a promising computing paradigm. More and more people store their sensitive data on the cloud. However, it is a great challenge for data security and accessing the sensitive data on the cloud. In this paper, we propose a novel access control scheme, termed LTS-ACCESS, which achieves Lightweight, Time-specific and Secure data access control for resource-limited devices in cloud storage. Our LTS-ACCESS simultaneously enjoys the following properties: i) constant size of the decryption keys and lower computation cost since we delegate almost all of the decryption cost to the decryption service provider, ii) time-specific, the sensitive data owner may specify a time interval, thus a receiver can decrypt the ciphertext once it is received and a time instant key has been obtained, and iii) provably secure, the proposed scheme is provably secure under the selective security model. Thoroughly theoretical analysis and performance evaluation indicate the effectiveness and efficiency of our proposed LTS-ACCESS.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125489999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440716
Yinxiang Qu, Yang Liu, Li Wang, Mei Song
This paper provides a cross-layer strategy which will combine nodes optimal coverage radius and routing complexity in wireless Ad Hoc networks that using Hop-count routing protocol. Assuming that channel state information(CSI) for all of links is available and constant. Every node is working in half-duplex model and using different channel to guarantee that there is no interference to others. We first consider a scenario that all nodes are deployed in a line, getting an optimal hop distance for different SNR by analysis and simulation. Then we use the optimal hop distance as a metric to determine the optimal coverage radius R of each nodes in Ad Hoc networks and investigate the relationship between the optimal coverage radius R and the optimal hop distance. In the end, we design a new coverage Ring algorithm in wireless networks which will make the network more sparse and reduce routing complexity in Ad Hoc networks. Simulations show that the Ring algorithm can outperform than tradition way in complexity of routing and energy consumption. This paper can provide a reference for a Ad Hoc network to determinate which node should connect directly and which node should act as a relay. Besides, this paper can also provides a reference for sensor networks to determine how many sensors should be deployed in an area to get a more efficient wireless network.
{"title":"Routing and optimal hop distance in wireless ad hoc networks","authors":"Yinxiang Qu, Yang Liu, Li Wang, Mei Song","doi":"10.1109/ICCNC.2016.7440716","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440716","url":null,"abstract":"This paper provides a cross-layer strategy which will combine nodes optimal coverage radius and routing complexity in wireless Ad Hoc networks that using Hop-count routing protocol. Assuming that channel state information(CSI) for all of links is available and constant. Every node is working in half-duplex model and using different channel to guarantee that there is no interference to others. We first consider a scenario that all nodes are deployed in a line, getting an optimal hop distance for different SNR by analysis and simulation. Then we use the optimal hop distance as a metric to determine the optimal coverage radius R of each nodes in Ad Hoc networks and investigate the relationship between the optimal coverage radius R and the optimal hop distance. In the end, we design a new coverage Ring algorithm in wireless networks which will make the network more sparse and reduce routing complexity in Ad Hoc networks. Simulations show that the Ring algorithm can outperform than tradition way in complexity of routing and energy consumption. This paper can provide a reference for a Ad Hoc network to determinate which node should connect directly and which node should act as a relay. Besides, this paper can also provides a reference for sensor networks to determine how many sensors should be deployed in an area to get a more efficient wireless network.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131514274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nowadays, urban parking circumstances are becoming more and more challenging. To solve this problem, many methods have been proposed, such as infrastructure expansion, economic leverage and technical theory. However, these solutions are generally used independently, thus it is infeasible to solve all existing problems. Therefore, a novel and revolutionary solution is urgently required. In this paper, we first comprehensively investigate the background of parking difficulties, and find that all of the current existing solutions are not able to meet the requirements of dynamic, systematization, high efficiency and accuracy. Then we briefly introduce the parallel theory, and propose the intelligent parking system based on the parallel theory, which can provide a systematic intelligent solution to meet the needs of current parking systems. The parallel parking system is made up of three parts, including the artificial system, the computational experiments, and the parallel execution. The proposed parallel parking system not only provides a novel direction to solve the parking problem, but also is an important guidance for the specific implementation of parallel parking theory.
{"title":"Urban intelligent parking system based on the parallel theory","authors":"Fei-Yue Wang, Liuqing Yang, Jian Yang, Yanli Zhang, Shuangshuang Han, Kai Zhao","doi":"10.1109/ICCNC.2016.7440708","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440708","url":null,"abstract":"Nowadays, urban parking circumstances are becoming more and more challenging. To solve this problem, many methods have been proposed, such as infrastructure expansion, economic leverage and technical theory. However, these solutions are generally used independently, thus it is infeasible to solve all existing problems. Therefore, a novel and revolutionary solution is urgently required. In this paper, we first comprehensively investigate the background of parking difficulties, and find that all of the current existing solutions are not able to meet the requirements of dynamic, systematization, high efficiency and accuracy. Then we briefly introduce the parallel theory, and propose the intelligent parking system based on the parallel theory, which can provide a systematic intelligent solution to meet the needs of current parking systems. The parallel parking system is made up of three parts, including the artificial system, the computational experiments, and the parallel execution. The proposed parallel parking system not only provides a novel direction to solve the parking problem, but also is an important guidance for the specific implementation of parallel parking theory.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131688691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440665
Ran Zheng, Long Chen, Hai Jin, Lei Zhu, Qin Zhang
Surveillance videos are increasing massively with monitoring cameras widely deployed in cities. Metadata of moving objects in videos can reduce video storage and be utilized in many video analysis applications. The whole metadata extraction is too time-consuming to be fulfilled quickly. Therefore, it is urgent to parallelize and accelerate the extraction process. However, iterative execution of traditional metadata extraction methods makes the parallelization quite challenging. In this paper, we propose a novel Parallel Metadata Extraction (PME) method for surveillance video. A novel video segmentation algorithm is designed to segment whole video into independent video segments. The metadata of each video segment is extracted independently and simultaneously on computer nodes, which will be integrated later to guarantee the completeness of the metadata. Performance evaluations demonstrate that PME can accelerate extraction process greatly almost without metadata loss.
{"title":"A novel metadata extraction method for surveillance video","authors":"Ran Zheng, Long Chen, Hai Jin, Lei Zhu, Qin Zhang","doi":"10.1109/ICCNC.2016.7440665","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440665","url":null,"abstract":"Surveillance videos are increasing massively with monitoring cameras widely deployed in cities. Metadata of moving objects in videos can reduce video storage and be utilized in many video analysis applications. The whole metadata extraction is too time-consuming to be fulfilled quickly. Therefore, it is urgent to parallelize and accelerate the extraction process. However, iterative execution of traditional metadata extraction methods makes the parallelization quite challenging. In this paper, we propose a novel Parallel Metadata Extraction (PME) method for surveillance video. A novel video segmentation algorithm is designed to segment whole video into independent video segments. The metadata of each video segment is extracted independently and simultaneously on computer nodes, which will be integrated later to guarantee the completeness of the metadata. Performance evaluations demonstrate that PME can accelerate extraction process greatly almost without metadata loss.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126557848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440660
Feng Wang, Fengye Hu, Wei Xiong, Shanshan Wang
Wireless body area network (WBAN) consists of an coordinator and several wearable sensor nodes placed in/on/around human body and monitors human body functions and characteristics, such as blood pressure and heartbeat. However, sensor nodes are energy-constrained and lifetime maximization has become one of the most important problems in WBAN. In this paper, we deduce the lifetime maximization model and propose an optimal coordinator deployment policy to maximize lifetime for WBAN under walking scenery. When sensor nodes have the fixed locations and path loss model is adopted, different deployment policy of coordinator will obtain different lifetime. Our policy is used for confirming the optimal coordinator location with the constraint of bit error rate (BER). Analytical and simulation results provide that the policy is optimal and can acquire the maximal lifetime.
{"title":"Lifetime maximization via optimal coordinator deployment for wireless body area network","authors":"Feng Wang, Fengye Hu, Wei Xiong, Shanshan Wang","doi":"10.1109/ICCNC.2016.7440660","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440660","url":null,"abstract":"Wireless body area network (WBAN) consists of an coordinator and several wearable sensor nodes placed in/on/around human body and monitors human body functions and characteristics, such as blood pressure and heartbeat. However, sensor nodes are energy-constrained and lifetime maximization has become one of the most important problems in WBAN. In this paper, we deduce the lifetime maximization model and propose an optimal coordinator deployment policy to maximize lifetime for WBAN under walking scenery. When sensor nodes have the fixed locations and path loss model is adopted, different deployment policy of coordinator will obtain different lifetime. Our policy is used for confirming the optimal coordinator location with the constraint of bit error rate (BER). Analytical and simulation results provide that the policy is optimal and can acquire the maximal lifetime.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122227387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2016-03-24DOI: 10.1109/ICCNC.2016.7440683
Shuang Liang, Xiaojiang Du, Ping Dong
Smartphones evolve rapidly and become more powerful in computing capabilities. More importantly, they are becoming smarter as more sensors such as the accelerometer, gyroscope, compass and the camera have been embedded on the digital board. In this paper, we propose a novel framework to recognize public scenes based on the sensors embedded in mobile phones. We build individual models for audio, light, wifi and bluetooth first, then integrate these sub-models using dynamically-weighted majority voting. We consider two factors when deciding the voting weight. One factor is the recognition rate of each sub-model and the other factor is recognition precision of the sub-model in specific scenes. We build the data-collecting app on the Android phone and implement the recognition algorithm on a Linux server. Evaluation of the data collected in the bar, cafe, elevator, library, subway station and the office shows that the ensemble recognition model is more accurate and robust than each individual sub-models. We achieved 83.33% (13.33% higher than audio sub-model) recognition accuracy when we evaluated the ensemble model with test dataset.
{"title":"Public scene recognition using mobile phone sensors","authors":"Shuang Liang, Xiaojiang Du, Ping Dong","doi":"10.1109/ICCNC.2016.7440683","DOIUrl":"https://doi.org/10.1109/ICCNC.2016.7440683","url":null,"abstract":"Smartphones evolve rapidly and become more powerful in computing capabilities. More importantly, they are becoming smarter as more sensors such as the accelerometer, gyroscope, compass and the camera have been embedded on the digital board. In this paper, we propose a novel framework to recognize public scenes based on the sensors embedded in mobile phones. We build individual models for audio, light, wifi and bluetooth first, then integrate these sub-models using dynamically-weighted majority voting. We consider two factors when deciding the voting weight. One factor is the recognition rate of each sub-model and the other factor is recognition precision of the sub-model in specific scenes. We build the data-collecting app on the Android phone and implement the recognition algorithm on a Linux server. Evaluation of the data collected in the bar, cafe, elevator, library, subway station and the office shows that the ensemble recognition model is more accurate and robust than each individual sub-models. We achieved 83.33% (13.33% higher than audio sub-model) recognition accuracy when we evaluated the ensemble model with test dataset.","PeriodicalId":308458,"journal":{"name":"2016 International Conference on Computing, Networking and Communications (ICNC)","volume":"37 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114100376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：