An optimal new-node placement to enhance the coverage of wireless sensor networks

Wireless sensor networks provide a wide range of applications, such as environment surveillance, hazard monitoring, traffic control, and other commercial or military applications. The quality of service provided by a sensor network relies on its coverage, i.e., how well an event can be tracked by se...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks 2010-05, Vol.16 (4), p.1033-1043
Main Authors: Hou, Yung-Tsung, Chen, Chia-Mei, Jeng, Bingchiang
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Communications Engineering
Computer Communication Networks
Electrical Engineering
Engineering
Geometry
IT in Business
Military deployment
Networks
Polynomials
Quality of service
Remote sensing systems
Sensors
Studies
Surveillance
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Wireless sensor networks provide a wide range of applications, such as environment surveillance, hazard monitoring, traffic control, and other commercial or military applications. The quality of service provided by a sensor network relies on its coverage, i.e., how well an event can be tracked by sensors. This paper studies how to optimally deploy new sensors in order to improve the coverage of an existing network. The best- and worst-case coverage problems that are related to the observability of a path are addressed and formulated into computational geometry problems. We prove that there exists a duality between the two coverage problems, and then solve the two problems together. The presented placement algorithm is shown to deploy new nodes optimally in polynomial time.
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-009-0186-x