Dependable k-coverage algorithms for sensor networks

Details Dependable k-coverage algorithms for sensor networks Dependable k-coverage algorithms for sensor networks

2007-10-21

arxiv.org/abs/0710.3918v1

Dans Instrumentation and Measurement Technology Conference Proceedings - IEEE Instrumentation and Measurement Technology Confe

Computer Science

Networking and Internet Architecture

Scientific paper

10.1109/IMTC.2007.379153

Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same time high sensor redundancy offers the possibility of increasing network lifetime by scheduling sleep intervals for some sensors and still providing continuous service with help of the remaining active sensors. In this paper centralized and distributed algorithms are proposed to solve the k-coverage sensing problem and maximize network lifetime. When physically possible, the proposed robust Controlled Greedy Sleep Algorithm provides guaranteed service independently of node and communication errors in the network. The performance of the algorithm is illustrated and compared to results of a random solution by simulation examples.

Affiliated with

Also associated with

No associations

Rating

Dependable k-coverage algorithms for sensor networks 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 Dependable k-coverage algorithms for sensor networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dependable k-coverage algorithms for sensor networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210440