Coverage hole detection and restoration algorithm for wireless sensor networks

被引:0
作者
Tarachand Amgoth
Prasanta K. Jana
机构
[1] Indian School of Mines,Department of Computer Science and Engineering
来源
Peer-to-Peer Networking and Applications | 2017年 / 10卷
关键词
Wireless sensor networks; Coverage preservation; Coverage hole; Coverage restoration; Energy efficient;
D O I
暂无
中图分类号
学科分类号
摘要
In wireless sensor networks (WSNs), preserving coverage of the target area by the sensor nodes is crucial to deliver certain services. However, a few sensor nodes die during the network operation due to energy constraints which may break the coverage of the target area. We refer this as a coverage hole problem. In this paper, we propose a new algorithm called CHD-CR which attempts to restore the coverage after detecting a coverage hole in the target area. The proposed algorithm mainly consists of coverage hole detection (CHD) and coverage restoration (CR) phases. We design an efficient local mechanism for coverage hole detection and energy efficient technique for its restoration. We test the performance of the proposed algorithm through simulation and the results are compared with the existing algorithms. Simulation results show that the proposed CHD-CR algorithm outperforms the existing algorithms in terms of coverage preservation for longer time.
引用
收藏
页码:66 / 78
页数:12
相关论文
共 48 条
  • [1] Akyildiz IF(2002)Wireless Sensor Networks: survey Comput Netw 38 393-422
  • [2] Su W(2014)Dynamic adjustment of sensing range for event coverage in wireless sensor networks J Netw Comput Appl 46 139-153
  • [3] Sankarasubramaniam Y(2015)Probabilistic coverage based sensor scheduling for target tracking sensor networks Inf Sci 292 95-110
  • [4] Cayirci E(2014)2D k-barrier duty-cycle scheduling for intruder detection in Wireless Sensor Networks Comput Commun 43 31-42
  • [5] Alam KM(2007)Coverage-preserving routing protocols for randomly distributed wireless sensor networks IEEE Trans Wirel Commun 6 1240-1245
  • [6] Kamruzzaman J(2009)On the planning of wireless sensor networks: energy-efficient clustering under the joint routing and coverage constraint IEEE Trans Mob Comput 8 1077-1086
  • [7] Karmakar G(2009)Cluster head election techniques for coverage preservation in wireless sensor networks Ad Hoc Netw 7 955-972
  • [8] Murshed M(2013)Flow-balanced routing for multi-hop clustered wireless sensor networks Ad Hoc Netw 11 541-554
  • [9] Shi K(2012)A coverage-aware clustering protocol for wireless sensor networks Comput Netw 56 1599-1611
  • [10] Chen H(2014)ECDC: an energy and coverage-aware distributed clustering protocol for wireless sensor networks Comput Electr Eng 40 384-398