Characterizing the Spread of Correlated Failures in Large Wireless Networks

Correlated failures pose a great challenge for the normal functioning of large wireless networks, because an initial local failure may trigger a global sequence of related failures. Given their potentially devastating impact, we characterize the spread of correlated failures in this paper, which lays the foundation for evaluating and improving the failure resilience of existing wireless networks. We model the failure contagiousness as two generic functions: the failure impact radius distribution function $f_r(x)$ and the failure connection function $g(x)$. By using the percolation theory, we determine the respective characteristic regimes of $f_r(x)$ and $g(x)$ in which correlated failures will and will not percolate in the network. As our model represents various failure scenarios, the results are generally applicable in understanding the spread of a wide range of correlated failures.

[1]  Edmund M. Yeh,et al.  Distributed energy management algorithm for large-scale wireless sensor networks , 2007, MobiHoc '07.

[2]  Patrick Thiran,et al.  Latency of wireless sensor networks with uncoordinated power saving mechanisms , 2004, MobiHoc '04.

[3]  R. Meester,et al.  Continuum percolation: References , 1996 .

[4]  Edmund M. Yeh,et al.  On the latency for information dissemination in mobile wireless networks , 2008, MobiHoc '08.

[5]  Mooi Choo Chuah,et al.  Packetscore: statistics-based overload control against distributed denial-of-service attacks , 2004, IEEE INFOCOM 2004.

[6]  Edmund M. Yeh,et al.  Connectivity and Latency in Large-Scale Wireless Networks with Unreliable Links , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[7]  Tian Bu,et al.  Design and Evaluation of a Fast and Robust Worm Detection Algorithm , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[8]  Yanyong Zhang,et al.  R-Sentry: Providing Continuous Sensor Services against Random Node Failures , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[9]  Yong Guan,et al.  An Efficient Signature-Based Scheme for Securing Network Coding Against Pollution Attacks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[10]  T. V. Lakshman,et al.  Bandwidth guaranteed routing with fast restoration against link and node failures , 2008, TNET.

[11]  Chen-Nee Chuah,et al.  Fast Local Rerouting for Handling Transient Link Failures , 2007, IEEE/ACM Transactions on Networking.

[12]  Nitin H. Vaidya,et al.  Reliable Broadcast in Wireless Networks with Probabilistic Failures , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[13]  Predrag R. Jelenkovic,et al.  Dynamic packet fragmentation for wireless channels with failures , 2008, MobiHoc '08.

[14]  Wenye Wang,et al.  On the critical phase transition time of wireless multi-hop networks with random failures , 2008, MobiCom '08.

[15]  Stamatis Stefanakos.  Reliable Routings in Networks with Generalized Link Failure Events , 2006, Networking.

[16]  Rabin K. Patra,et al.  Using redundancy to cope with failures in a delay tolerant network , 2005, SIGCOMM '05.

[17]  Baruch Awerbuch,et al.  An on-demand secure routing protocol resilient to byzantine failures , 2002, WiSE '02.

[18]  H. Poincaré,et al.  Percolation ? , 1982 .

[19]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .