On perimeter coverage in wireless sensor networks

Authors:
Ka-Shun Hung;King-Shan Lui
Affiliations:
Department of Electrical and Electronic Engineering, The University of Hong Kong;Department of Electrical and Electronic Engineering, The University of Hong Kong
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 12
Cited 1

Parallel circle-cover algorithms

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

Information Processing Letters
Connecting the Physical World with Pervasive Networks

IEEE Pervasive Computing
Connected sensor cover: self-organization of sensor networks for efficient query execution

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Energy Efficient Fractional Coverage Schemes for Low Cost Wireless Sensor Networks

ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
The coverage problem in a wireless sensor network

Mobile Networks and Applications
Boundary coverage and coverage boundary problems in wireless sensor networks

International Journal of Sensor Networks
Improving network lifetime using sensors with adjustable sensing ranges

International Journal of Sensor Networks
Energy-Efficient Area Monitoring for Sensor Networks

Computer
Wireless sensor networks scheduling for full angle coverage

Multidimensional Systems and Signal Processing

On perimeter coverage in wireless sensor networks with minimum cost

International Journal of Sensor Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many sensor network applications require the tracking and the surveillance of target objects. However, in current research, many studies have assumed that a target object can be sufficiently monitored by a single sensor. This assumption is invalid in some situations, especially, when the target object is so large that a single sensor can only monitor a certain portion of it. In this case, several sensors are required to ensure a 360° coverage of the target. To minimize the amount of energy required to cover the target, the minimum set of sensors should be identified. Centralized algorithms are not suitable for sensor applications. In this paper, we describe our novel distributed algorithm for finding the minimum cover. Our algorithm requires fewer messages than earlier mechanisms and we provide a formal proof of correctness and time of convergence. We further demonstrate our performance improvement through extensive simulations.