Coverage hole problem under sensing topology in flat wireless sensor networks

• Published in: Wireless communications and mobile computing Vol. 16; no. 5; pp. 578 - 589
• Main Authors: An, Wei, Qu, Nan, Shao, Fang‐Ming, Xiong, Xiangjun, Ci, Song
• Format: Journal Article
• Language: English
• Published: Oxford John Wiley & Sons, Inc 10.04.2016
• Subjects: coverage hole; sensing topology; wireless sensor network
• ISSN: 1530-8669; 1530-8677
• DOI: 10.1002/wcm.2555

ABSTRACT In flat wireless sensor networks, one fundamental issue is region coverage, which usually addresses whether the given region is sufficiently covered by sensing disks of sensor nodes or not. Although numerous research works have been carried out on region coverage, it still lacks in‐depth understanding on the relations between region coverage and sensing topology defined with the intersections of sensing areas of sensor nodes. In this paper, we consider the region coverage problem by using the sensing topology proposed in our previous work. Based on the notion of sensing topology, we prove that the given region can be partitioned into a number of the smallest cells, each of which is defined by sensing links among sensor nodes. Then, we investigate the sufficient and necessary conditions for the existence of coverage holes for the specific polygon graph residing in the partitioned cells. Further, two polynomial time algorithms are presented for dividing the given region covered by the whole network and detecting the coverage holes existing in the interior area of the partitioned cells, respectively. The experiment results show that our proposed algorithms are effective for detecting the coverage holes. Copyright © 2014 John Wiley & Sons, Ltd. We prove that the given region can be partitioned into a number of the smallest cells in sensing topology, each of which is defined by sensing links among sensor nodes, investigates the sufficient and necessary conditions for the existence of coverage holes for the specific polygon graph residing in the partitioned cells, and present two polynomial time algorithms are presented for dividing the given region covered by the whole network and detecting the coverage holes existing in the interior area of the partitioned cells, respectively.