Title :
Node placement for optimal coverage in sensor networks
Author :
Hou, Yung-Tsung ; Lee, Tzu-Chen ; Chen, Chia-Mei ; Jeng, Bingchiang
Author_Institution :
Dept. of Inf. Manage., Nat. Sun Yat-Sen Univ., Kaohsiung
Abstract :
Wireless sensor networks provide an alternative way of improving our environments, such as environment surveillance, hazard monitoring, and other customized environmental applications. Good coverage of service in a sensor network is an essential issue to ensure the service of quality. This paper studies the deployment of new sensor nodes so that the improvement of coverage is optimized. We propose an optimal polynomial time algorithm for this problem. Based on computational geometry and graph theory, we show the properties of such a deployment and the correctness of its optimality
Keywords :
computational geometry; graph theory; quality of service; wireless sensor networks; computational geometry; graph theory; optimal coverage; polynomial time algorithm; quality of service; wireless sensor network; Computational geometry; Distributed algorithms; Hazards; Intelligent networks; Monitoring; Observability; Polynomials; Quality of service; Surveillance; Wireless sensor networks;
Conference_Titel :
Sensor Networks, Ubiquitous, and Trustworthy Computing, 2006. IEEE International Conference on
Conference_Location :
Taichung
Print_ISBN :
0-7695-2553-9
DOI :
10.1109/SUTC.2006.1636200
