Distributed Algorithms for Lifetime of Wireless Sensor Networks Based on Dependencies Among Cover Sets

Fault-tolerant Coverage in Dense Wireless Sensor Networks

“…Initial approaches to the problem in (Slijepcevic, 2001;Cardei and Du, 2005;Abrams et al, 2004) considered the problem of finding the maximum number of disjoint covers. A number of distributed heuristics are presented in (Lu and Suda, 2003;Prasad and Dhawan, 2007;Dhawan and Prasad, 2009;Cardei and Du, 2005;Kumar et al, 2004;. We only discuss one specific algorithm below in the interest of space.…”

“…In order to extend the lifetime of a sensor network while maintaining coverage, a minimal subset of the deployed sensors are kept active while the other sensors can enter a low power sleep state. Several distributed algorithms for coverage have been proposed in the literature (Lu and Suda, 2003;Prasad and Dhawan, 2007;Dhawan and Prasad, 2009;Cardei and Du, 2005;Kumar et al, 2004;.…”

Maximum Lifetime Scheduling in Wireless Sensor Networks

“…We also present some simple heuristics based on the graph. The material presented in this section was published in [35]. …”

“…However, the target coverage problem has a useful property -if the local targets for every sensor are covered, then globally, all targets are also covered. In [35], we make use of this property to look at the LD graph locally (fixed 1-2 hop neighbors), and are able to construct all the local covers for the local targets and then model their dependencies. Based on these dependencies, a sensor can then prioritize its covers and negotiate these with its neighbors.…”

“…Based on these dependencies, a sensor can then prioritize its covers and negotiate these with its neighbors. Simple heuristics based on properties of this graph were presented in [35] and showed a 10-15% improvement over comparable algorithms in the literature. [15] built on this work by examining how an optimal sequence would pick covers in the LD graph and designing heuristics that behave in a similar fashion.…”