Reliable Distributed Systems, IEEE Symposium on (2005)
Oct. 26, 2005 to Oct. 28, 2005
Ajoy K. Datta , University of Nevada Las Vegas
Preethi Linga , University of Nevada Las Vegas
Maria Gradinariu , IRISA/INRIA - Universite Rennes
Philippe Raipin-Parvedy , IRISA/INRIA - Universite Rennes
<p>In this paper, we design self- novel solutions to the minimal connected sensor cover problem. The concept of self- is used to include fault-tolerant properties like selfcon figuring, self-reconfiguring/self-healing, etc. We present two self-stabilizing, fully distributed, strictly localized, and scalable solutions, and show that these solutions are both self-configuring and self-healing. The proposed solutions are space optimal in terms of the number of states used per node. Another feature of the proposed algorithms is that the faults are contained only within the neighborhood of the faulty nodes. This paper also includes a comparison of the performance of the two proposed solutions in terms of the stabilization time, cover size metrics, and ability to cope with transient and permanent faults.</p>
P. Raipin-Parvedy, A. K. Datta, M. Gradinariu and P. Linga, "Self Distributed Query Region Covering in Sensor Networks," 24th IEEE Symposium on Reliable Distributed Systems(SRDS), Orlando, Florida, USA, 2005, pp. 50-59.