Research on the fault tolerance deployment in sensor networks

Abstract

In this paper, we consider the problem of how to place redundant sensor nodes in an arbitrary sensor network to establish multi-connectivity. Specifically, after exploring the existing general k-connectivity algorithm, this paper proves that its approximation ratio is upper-bounded by only 0(k 3α), asymptotically one order of k lower than that presented before. Since establishing k-connectivity is not cost-efficient for many applications, this paper further relaxes k-connectivity to partial k-connectivity and upper-bounds the approximation ratio of partial k-connectivity with 0(k4α). © Springer-Verlag Berlin Heidelberg 2005.