Perimeter coverage made practical in wireless sensor networks

Authors:
Ka-Shun Hung;King-Shan Lui
Affiliations:
Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong;Department of Electrical and Electronic Engineering, The University of Hong Kong, Hong Kong
Venue:
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Year:
2009

Citing 12
Cited 1

Parallel circle-cover algorithms

Information Processing Letters
An optimal parallel algorithm for the minimum circle-cover problem

Information Processing Letters
Parallel algorithms on circular-arc graphs

Computational Geometry: Theory and Applications
Connecting the Physical World with Pervasive Networks

IEEE Pervasive Computing
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Maximum Lifetime of Sensor Networks with Adjustable Sensing Range

SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
The coverage problem in a wireless sensor network

Mobile Networks and Applications
A survey on wireless multimedia sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy Efficient Coverage with Variable Sensing Radii in Wireless Sensor Networks

WIMOB '07 Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Improving network lifetime using sensors with adjustable sensing ranges

International Journal of Sensor Networks
Wireless sensor networks scheduling for full angle coverage

Multidimensional Systems and Signal Processing

Perimeter coverage scheduling in wireless sensor networks using sensors with a single continuous cover range

EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many sensor network applications require the tracking and the surveillance of target objects. However, it is generally assumed that the whole target object can be monitored by a sensor in case the target falls within its sensing range. Unfortunately, this assumption may not be realistic in case the target object is a large one, and each sensor can only monitored a certain portion of the perimeter of the target object. The coverage problem which aims at monitoring the whole perimeter of the target object is known as perimeter coverage problem. Previously, we have developed distributed algorithms to find the minimum set of sensors and the set of sensors with the minimum cost to monitor the target. Unfortunately, no known polynomial time optimal solution exists in a practical scenario. Hence, our previously proposed algorithms failed to find the optimal solutions anymore. In this paper, we show that by modifying our previously proposed algorithms, approximation solutions to these problems are found.