Coverage Hole Problem Under Sensing Topology In Wireless Sensor Network

Wireless sensor networks have a wide range of applications in industry, transportation, medical and defense fields. The research of wireless sensor networks has become an important branch of the computer research area. In wireless sensor networks, one of the hot topics is the coverage problem. This is, whether a given region can be sufficiently covered by sensing disks of sensors? In this paper, we consider the coverage problem under sensing topology in a different way. By giving a math model of sensing topology, we figure out the relationship between the graph Gn,n+i and sensing holes, and conclude that if m <(3/2)n-(5-(-1)n)/4, there must exist a sensing hole for the closed graph Gn,m, which has a cut point but no cut edge and if m< 2n-3, there must exist a sensing hole for the closed graph Gn,m with no cut point. And the completed covered graph must be the chordal graph. Finally, the simulation shows that the proposed approach is effective for some nodes randomly distributed in a region.