Multi working sets alternate covering scheme for continuous partial coverage in WSNs

被引:57
作者
Huang, Mingfeng [1 ]
Liu, Anfeng [1 ]
Zhao, Ming [2 ]
Wang, Tian [3 ]
机构
[1] Cent South Univ, Sch Informat Sci & Engn, Changsha, Hunan, Peoples R China
[2] Cent South Univ, Sch Software, Changsha, Hunan, Peoples R China
[3] Huaqiao Univ, Dept Comp Sci & Technol, Xiamen, Peoples R China
基金
中国国家自然科学基金;
关键词
Partial coverage; Wireless sensor networks; Sleep scheduling; Multi working sets; SCHEDULING SCHEME; NODE DEPLOYMENT; SENSOR; CONNECTIVITY; NETWORKS;
D O I
10.1007/s12083-018-0647-z
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Coverage of wireless sensor networks is a fundamental problem which has been studied for more than two decades. In duty cycle based wireless sensor networks, the nodes are sleep/wake periodic working, and the sleeping of nodes selected to achieve coverage results in a lack of network coverage, which make the coverage of the research difficult to apply in practice. In this paper, a Multi Working Sets Alternate Covering (MWSAC) scheme is proposed to achieve continuous partial coverage of the network. Firstly, a distributed algorithm is proposed to construct the maximum number of working sets, each working set is required to satisfy the partial coverage requirement of the application. Then, the sleeping time of the working nodes is scheduled, which makes the nodes belonging to the same working set wake up synchronously and nodes between multiple working sets wake up asynchronously. Thus, at any time, as long as the nodes of one working set are in waking state, the nodes of other working sets are adjusted to sleeping state to save energy. Due to multiple working sets are alternately covered under MWSAC, the workload and wake-up time of each working node is greatly reduced, which makes the energy consumption more balanced and the network lifetime longer. Both the theoretical analysis and the experimental results show that, compared with the previous continuous coverage scheme, MWSAC scheme has obvious advantages in terms of coverage, network lifetime and node utilization.
引用
收藏
页码:553 / 567
页数:15
相关论文
共 42 条
[1]  
[Anonymous], 2002, P 1 ACM INT WORKSH W, DOI DOI 10.1145/570738.570744
[2]  
[Anonymous], TVT
[3]   Improving wireless sensor network lifetime through power aware organization [J].
Cardei, M ;
Du, DZ .
WIRELESS NETWORKS, 2005, 11 (03) :333-340
[4]   Grid coverage for surveillance and target location in distributed sensor networks [J].
Chakrabarty, K ;
Iyengar, SS ;
Qi, HR ;
Cho, EC .
IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (12) :1448-1453
[5]   Dynamic power management and adaptive packet size selection for IoT in e-Healthcare [J].
Chen, Xi ;
Ma, Ming ;
Liu, Anfeng .
COMPUTERS & ELECTRICAL ENGINEERING, 2018, 65 :357-375
[6]   Complexity of barrier coverage with relocatable sensors in the plane [J].
Dobrev, Stefan ;
Durocher, Stephane ;
Eftekhari, Mohsen ;
Georgiou, Konstantinos ;
Kranakis, Evangelos ;
Krizanc, Danny ;
Narayanan, Lata ;
Opatrny, Jaroslav ;
Shende, Sunil ;
Urrutia, Jorge .
THEORETICAL COMPUTER SCIENCE, 2015, 579 :64-73
[7]  
Ghosh A, 2005, LECT NOTES COMPUT SC, V3560, P340
[8]   Mobility and Intruder Prior Information Improving the Barrier Coverage of Sparse Sensor Networks [J].
He, Shibo ;
Chen, Jiming ;
Li, Xu ;
Shen, Xuemin ;
Sun, Youxian .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2014, 13 (06) :1268-1282
[9]  
HOCHBAUM DS, 1938, NAV RES LOG, V45, P615, DOI DOI 10.1002/(SICI)1520-6750(199809)45:6
[10]   Green Data Gathering under Delay Differentiated Services Constraint for Internet of Things [J].
Huang, Mingfeng ;
Liu, Anfeng ;
Wang, Tian ;
Huang, Changqin .
WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2018,