Coverage Hole Problem under Sensing Topology in Wireless Sensor Network
- 10.2991/icsecs-13.2013.12How to use a DOI?
- wireless sensor network;coverage; sensing topology
In wireless sensor networks, one of the fundamental issues is the coverage problem. This is, whether a given region can be sufficiently covered by sensing disks of sensors? In this paper, we discuss the coverage-hole problem by using a sensing topology. From the sensing topology, we figure out the relation between the graph Gn,n+i and coverage holes, and obtain that if m <3n/2-(5-(-1)n)/4, there must exist a coverage hole for the closed graph Gn,m, which has a cut point but no cut edge. Finally, the simulation shows that the proposed approach is effective for some nodes randomly distributed in a region.
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Nan Qu AU - Xiangjun Xiong AU - Fangming Shao PY - 2013/09 DA - 2013/09 TI - Coverage Hole Problem under Sensing Topology in Wireless Sensor Network BT - Proceedings of the 2013 International Conference on Software Engineering and Computer Science PB - Atlantis Press SP - 55 EP - 58 SN - 1951-6851 UR - https://doi.org/10.2991/icsecs-13.2013.12 DO - 10.2991/icsecs-13.2013.12 ID - Qu2013/09 ER -