Finding the quality of line coverage of a sensor network

Authors:
Dinesh Dash;Arijit Bishnu;Arobinda Gupta;Subhas C. Nandy
Affiliations:
Dept. of CSE, Indian Institute of Technology Kharagpur, India;ACM Unit, Indian Statistical Institute, Kolkata, India;Dept. of CSE, Indian Institute of Technology Kharagpur, India;ACM Unit, Indian Statistical Institute, Kolkata, India
Venue:
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Year:
2012

Citing 2
Cited 0

Worst and Best-Case Coverage in Sensor Networks

IEEE Transactions on Mobile Computing
Barrier coverage with wireless sensors

Proceedings of the 11th annual international conference on Mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The coverage problem in wireless sensor networks addresses the problem of covering a region with sensors. Many different definitions of coverage exist depending on the goal of the coverage. In this paper, we address the problem of covering lines in a bounded rectangular region R by a set of sensors. We first introduce two new metrics, smallest k-covered line segment and longest k-uncovered line segment, for measuring the quality of line coverage achieved by a sensor deployment. Polynomial time algorithms are then proposed for finding the smallest k-covered axis-parallel line segment and the longest k-uncovered axis-parallel line segment in a bounded rectangular region R.