Scheduling Sensors for Guaranteed Sparse Coverage

Details Scheduling Sensors for Guaranteed Sparse Coverage Scheduling Sensors for Guaranteed Sparse Coverage

2009-11-23

arxiv.org/abs/0911.4332v2

Computer Science

Networking and Internet Architecture

Scientific paper

Sensor networks are particularly applicable to the tracking of objects in motion. For such applications, it may not necessary that the whole region be covered by sensors as long as the uncovered region is not too large. This notion has been formalized by Balasubramanian et.al. as the problem of $\kappa$-weak coverage. This model of coverage provides guarantees about the regions in which the objects may move undetected. In this paper, we analyse the theoretical aspects of the problem and provide guarantees about the lifetime achievable. We introduce a number of practical algorithms and analyse their significance. The main contribution is a novel linear programming based algorithm which provides near-optimal lifetime. Through extensive experimentation, we analyse the performance of these algorithms based on several parameters defined.

Affiliated with

Also associated with

No associations

Rating

Scheduling Sensors for Guaranteed Sparse Coverage does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scheduling Sensors for Guaranteed Sparse Coverage, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling Sensors for Guaranteed Sparse Coverage will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-172926