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

Authors:
Ka-Shun Hung;King-Shan Lui
Affiliations:
Department of Electrical and Electronics Engineering, The University of Hong Kong, Hong Kong;Department of Electrical and Electronics Engineering, The University of Hong Kong, Hong Kong
Venue:
EURASIP Journal on Wireless Communications and Networking - Special issue on theoretical and algorithmic foundations of wireless ad hoc and sensor networks
Year:
2010

Citing 21
Cited 0

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
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Differentiated surveillance for sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms

Proceedings of the 3rd international symposium on Information processing in sensor networks
Maximizing system lifetime in wireless sensor networks

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Decentralized energy-conserving and coverage-preserving protocols for wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Energy Efficient Fractional Coverage Schemes for Low Cost Wireless Sensor Networks

ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Maximal Lifetime Scheduling for Sensor Surveillance Systems with K Sensors to One Target

IEEE Transactions on Parallel and Distributed Systems
Design and Analysis of Sensing Scheduling Algorithms under Partial Coverage for Object Detection in Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Designing localized algorithms for barrier coverage

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Barrier coverage with wireless sensors

Wireless Networks
Improving network lifetime using sensors with adjustable sensing ranges

International Journal of Sensor Networks
Strong barrier coverage of wireless sensor networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Monitoring schedules for randomly deployed sensor networks

Proceedings of the fifth international workshop on Foundations of mobile computing
Sacrificing a little coverage can substantially increase network lifetime

Ad Hoc Networks
On the lifetime of wireless sensor networks

ACM Transactions on Sensor Networks (TOSN)
Lifetime maximization for connected target coverage in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Wireless sensor networks scheduling for full angle coverage

Multidimensional Systems and Signal Processing
Balanced-energy sleep scheduling scheme for high-density cluster-based sensor networks

Computer Communications
Perimeter coverage made practical in wireless sensor networks

ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

In target monitoring problem, it is generally assumed that the whole target object can be monitored by a single sensor if the target falls within its sensing range. Unfortunately, this assumption becomes invalid when the target object is very large that a sensor can only monitor part of it. In this paper, we study the perimeter coverage problem where the perimeter of a big object needs to be monitored, but each sensor can only cover a single continuous portion of the perimeter. We describe how to schedule the sensors so as to maximize the network lifetime in this problem.We formally prove that the perimeter coverage scheduling problem is NPhard in general. However, polynomial time solution exists in some special cases. We further identify the sufficient conditions for a scheduling algorithm to be a 2-approximation solution to the general problem, and propose a simple distributed 2-approximation solution with a small message overhead.