Perimeter coverage made practical in wireless sensor networks
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Energy-efficient k-coverage for wireless sensor networks with variable sensing radii
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
On perimeter coverage in wireless sensor networks with minimum cost
International Journal of Sensor Networks
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Pervasive and Mobile Computing
Sensing task assignment via sensor selection for maximum target coverage in WSNs
Journal of Network and Computer Applications
Hi-index | 0.00 |
tially distributed autonomous devices using sensors to coopera- tively monitor physical or environmental conditions. Generally, sensor nodes are resource-constraint in terms of size, power and bandwidth, therefore energy-efficient design becomes one of the fundamental goals in WSN. To provide reliable service in surveillance as well as energy efficiency, significant attention has recently been devoted to dynamic coverage algorithms based on sensors which are capable of adjusting its transmission and sensing range. In this paper, we propose two local sensing radii optimization schemes based on one-hop approximation of Delaunay Triangulation to minimize the energy consumption and extend the lifetime of networks. Furthermore, we prove that our approximation of Delaunay Triangulation guarantees complete coverage and generates the same radii assignment as traditional Delaunay Triangulation. Our ns-2 based simulation shows performance improvements in many aspects such as coverage ratio, sensing energy consumption, node failure rate, and lifetime of networks. Key words: Wireless Sensor Networks, coverage, Delaunay Tri- angulation