Improving the topological resilience of mobile ad hoc networks

In order to effectively deploy survivability techniques to improve the resilience of mobile ad hoc networks, one must be able to identify all the weak points of the network topology. The weak or critical points of the topology are those links and nodes whose failure results in partitioning of the network. Here we propose a new algorithm based on results from algebraic graph theory, that can find the critical points in the network for single and multiple failure cases. Utilizing this algorithm we present numerical results that examine how the number of critical points varies with nodal density. Secondly, we propose three localized topological control schemes to improve the network connectivity around critical points to lessen their importance and improve the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions are presented.

[1]  Ivan Stojmenovic,et al.  Localized detection of k-connectivity in wireless ad hoc, actuator and sensor networks , 2007, 2007 16th International Conference on Computer Communications and Networks.

[2]  James Caffery,et al.  Partitioning avoidance in mobile ad hoc networks using network survivability concepts , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[3]  Jan M. Rabaey,et al.  Location in distributed ad-hoc wireless sensor networks , 2001, 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221).

[4]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[5]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[6]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[7]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[8]  Miroslaw Malek,et al.  Adaptation of the breadth first search algorithm for cut-edge detection in wireless multihop networks , 2007, MSWiM '07.

[9]  Jennifer C. Hou,et al.  On the critical total power for asymptotic k-connectivity in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  David Levin,et al.  Survivable mobile wireless networks: issues, challenges, and research directions , 2002, WiSE '02.

[11]  Qing Ling,et al.  Minimum Node Degree and k-Connectivity of a Wireless Multihop Network in Bounded Area , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[12]  Imrich Chlamtac,et al.  Mobile ad hoc networking: imperatives and challenges , 2003, Ad Hoc Networks.

[13]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[14]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[15]  Prashant Krishnamurthy,et al.  Connectivity and critical point behavior in mobile ad hoc and sensor networks , 2009, 2009 IEEE Symposium on Computers and Communications.