Node Placement for Optimal Coverage in Sensor Networks

Authors:
Yung-Tsung Hou;Tzu-Chen Lee;Chia-Mei Chen;Bingchiang Jeng
Affiliations:
National Sun Yat-Sen University, Taiwan;National Sun Yat-Sen University, Taiwan;National Sun Yat-Sen University, Taiwan;National Sun Yat-Sen University, Taiwan
Venue:
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing -Vol 1 (SUTC'06) - Volume 01
Year:
2006

Citing 0
Cited 5

Node fault robustness for heterogeneous dynamic sensor networks

IMACS'08 Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems
Mobile sensors networks under communication constraints

WSEAS TRANSACTIONS on SYSTEMS
Measurement noise reduction in dynamic sensor networks

ICS'08 Proceedings of the 12th WSEAS international conference on Systems
A decentralized protocol for wireless communication in mobile sensor networks

ICCOM Proceedings of the 13th WSEAS international conference on Communications
A local information based protocol for networks data exchange with application to mobile sensor networks

WSEAS TRANSACTIONS on COMMUNICATIONS

Quantified Score

Hi-index	0.00

Visualization

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.