Optimal coverage deployment for wireless sensor networks

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 quality of service. This paper stu...

Full description

Saved in:
Bibliographic Details
Main Authors: Yung-Tsung Hou, Tzu-Chen Lee, Bing-Chiang Jeng, Chia-Mei Chen
Format: Conference Proceeding
Language:English
Subjects:
best-case coverage
Computational geometry
coverage
deployment
Environmental management
Graph theory
Hazards
Monitoring
Observability
Polynomials
Quality of service
Sensor networks
Surveillance
Wireless sensor networks
worst-case coverage
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 quality of service. This paper studies the deployment of new sensor nodes such that the improvement of the coverage is optimized. Based on computational geometry and graph theory, we propose an optimal polynomial time algorithm for sensor node deployment. We also prove the properties of such deployment and the correctness of the optimal solution
DOI:10.1109/ICACT.2006.206022