Investigations on graph-based boundary detection for hole estimation in wireless sensor networks

摘要

Recently Wireless sensor networks (WSNs) plays important role in monitoring physical environments. In mission critical applications like surveillance existence of coverage holes makes communication among sensor nodes impossible. Coverage hole may be defined as the failure of sensor nodes. There are various graph based hole detection approaches and algorithms proposed to detect the coverage hole and to heal the coverage hole. Energy efficiency and communication overhead are the important parameters in detecting the holes and successful delivery of data packets without delay. Most of the existing algorithms have disadvantages depending upon their computational model. This survey compares the various approaches and identifies their shortcomings based on computational model and communication overhead. A new model is also proposed for coverage hole detection.