A Novel Algorithm for Barrier Coverage Based on Hybrid Wireless Sensor Nodes

Barrier coverage is one of the research hot spots of wireless sensor network coverage control. In order to fix the defects and deficiencies of the network, which is composed of all isomorphic nodes in the barrier coverage, Voronoi diagram is introduced to divide the entire deployment area. According to the principle of the least square method, a mixed network deployment mechanism consisting of static nodes and dynamic nodes is established with static nodes working as the reference barrier line. By monitoring whether there is a barrier covering the blind spot in the deployed area, the monitoring area can be effectively covered by determining whether dynamic nodes need limited movement to redeploy the monitored area. And puts forward mixed node barrier covered in this algorithm, algorithm Voronoi diagram was used for continuous path problem domain discretization, and from different dimensions to compare coverage performance of each algorithm, the simulation experiments show that the algorithm improves the quality of monitoring area coverage, under the same conditions as other algorithms, a mobile node distance and low energy consumption, less expected to cover requirements and goals are met.

[1]  Antonio Iera,et al.  The Internet of Things: A survey , 2010, Comput. Networks.

[2]  Li-Hsing Yen,et al.  Range-Based Sleep Scheduling (RBSS) for Wireless Sensor Networks , 2009, Wirel. Pers. Commun..

[3]  Ai Chen,et al.  Local Barrier Coverage in Wireless Sensor Networks , 2010, IEEE Transactions on Mobile Computing.

[4]  Kang Chen,et al.  An Energy-Efficient and Distributed Cooperation Mechanism for k-Coverage Hole Detection and Healing in WSNs , 2018, 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems.

[5]  Walid Osamy,et al.  Distributed coverage hole detection and recovery scheme for heterogeneous wireless sensor networks , 2018, Comput. Commun..

[6]  Xiaojun Shen,et al.  A study on the weak barrier coverage problem in wireless sensor networks , 2011, Comput. Networks.

[7]  Ban Dong Constructing k-Barrier Coverage in Mobile Wireless Sensor Networks , 2011 .

[8]  Lu Ke Greedy Approximation Algorithm of Minimum Cover Set in Wireless Sensor Networks , 2010 .

[9]  Jiming Chen,et al.  Cost-effective barrier coverage by mobile sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[10]  Guoliang Xing,et al.  Barrier coverage with sensors of limited mobility , 2010, MobiHoc '10.

[11]  Mohammad Reza Meybodi,et al.  An Energy Efficient Barrier Coverage Algorithm for Wireless Sensor Networks , 2014, Wirel. Pers. Commun..

[12]  Benyuan Liu,et al.  Barrier coverage in wireless sensor networks , 2010 .

[13]  Sun Ze-y An Enhanced Coverage Control Algorithm for Wireless Sensor Networks Based on Adjustable Parameters , 2015 .

[14]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[15]  Liang Jun-bin,et al.  An Energy-Balanced Connected Dominating Sets for Data Gatheringin Wireless Sensor Networks , 2013 .

[16]  Wang Zhu,et al.  The Novel Block Encryption Scheme Based on Hybrid Chaotic Maps for the Wireless Sensor Networks , 2012 .

[17]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[18]  Wensheng Zhang,et al.  2 D k-barrier duty-cycle scheduling for intruder detection in Wireless Sensor Networks , 2014 .