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

Authors:
Yung-Tsung Hou;Chia-Mei Chen;Bingchiang Jeng
Affiliations:
Department of Information Management, National Sun Yat-Sen University, Kaohsiung, Taiwan;Department of Information Management, National Sun Yat-Sen University, Kaohsiung, Taiwan;Department of Information Management, National Sun Yat-Sen University, Kaohsiung, Taiwan
Venue:
Wireless Networks
Year:
2010

Citing 13
Cited 3

Computational geometry: an introduction

Computational geometry: an introduction
Introduction to algorithms

Introduction to algorithms
Voronoi diagrams and Delaunay triangulations

Handbook of discrete and computational geometry
Exposure in wireless Ad-Hoc sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors

Proceedings of the 7th annual international conference on Mobile computing and networking
Computational Geometry in C

Computational Geometry in C
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems

Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems
Worst and Best-Case Coverage in Sensor Networks

IEEE Transactions on Mobile Computing
Dynamic coverage in ad-hoc sensor networks

Mobile Networks and Applications
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
The coverage problem in a wireless sensor network

Mobile Networks and Applications
Coverage in wireless ad hoc sensor networks

IEEE Transactions on Computers

Coverage problems in sensor networks: A survey

ACM Computing Surveys (CSUR)
The euclidean bottleneck steiner path problem

Proceedings of the twenty-seventh annual symposium on Computational geometry
Wireless Sensor Node Placement Using Hybrid Genetic Programming and Genetic Algorithms

International Journal of Intelligent Information Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.