Fault tolerant deployment and topology control in wireless ad hoc networks

We consider a large-scale of wireless ad hoc networks whose nodes are distributed randomly in a two-dimensional region Ω (more specifically, a unit square). Given n wireless nodes V, each with transmission range r n , the wireless networks are often modeled by graph G(V, r n ) in which two nodes are connected if and only if their Euclidean distance is no more than r n . We first consider how to relate the transmission range with the number of nodes in a fixed area such that the resulted network can sustain k fault nodes in its neighborhood with high probability when all nodes have the same transmission range. We show that, for a unit-area square region Ω, the probability that the network G(V, r n ) is k-connected is at least e -e-a when the transmission radius r n satisfies nπr 2 n ≥ 1n n + (2k - 3)ln ln n - 2 ln(k - 1)! + 2a fork > 1 and n sufficiently large. This result also applies to mobile networks when the moving of wireless nodes always generates randomly distributed positions. We also conduct extensive simulations to study the practical transmission range to achieve certain probability the network being k-connectivity, when the number of nodes n is not large enough. The relation between the minimum node degree and the connectivity of graph G(V, r) is also studied. Setting the transmission range of all nodes to r n guarantees the k-connectivity with high probability, but some nodes may have excessive number of neighbors in the graph G(V, r n ). We then present a localized method to construct a subgraph of the network topology G(V, r n ) such that the resulting subgraph is still k-connected but with much fewer communication links maintained. We show that the constructed topology has only O(k . n) links and is a length spanner. Here a graph H ⊂ G is spanner for graph G, if for any two nodes, the length of the shortest path connecting them in H is no more than a small constant factor of the length of the shortest path connecting them in G. Finally, we conduct some simulations to study the practical transmission range to achieve certain probability of k-connected when n is not large enough.

[1]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[2]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[3]  Young Ko,et al.  Using Location Information to Improve Routing in Ad Hoc Networks , 1997 .

[4]  Tamás Lukovszki,et al.  New Results of Fault Tolerant Geometric Spanners , 1999, WADS.

[5]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[6]  Mauro Leoncini,et al.  On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks , 2002, IFIP TCS.

[7]  S. Ramanathan,et al.  A survey of routing techniques for mobile communications networks , 1996, Mob. Networks Appl..

[8]  Ivan Stojmenovic,et al.  Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks , 2001, IEEE Trans. Parallel Distributed Syst..

[9]  Xiang-Yang Li,et al.  Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[10]  Mathew D. Penrose,et al.  Extremes for the minimal spanning tree on normally distributed points , 1998, Advances in Applied Probability.

[11]  Xiang-Yang Li,et al.  Distributed spanner with bounded degree for wireless ad hoc networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[12]  David A. Maltz,et al.  The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

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

[14]  J. Seaman.  Introduction to the theory of coverage processes , 1990 .

[15]  Béla Bollobás,et al.  Random Graphs , 1985 .

[16]  Andrew V. Goldberg,et al.  Flows in Undirected Unit Capacity Networks , 1999, SIAM J. Discret. Math..

[17]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[18]  Imrich Chlamtac,et al.  A new approach to the design and analysis of peer‐to‐peer mobile networks , 1999, Wirel. Networks.

[19]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

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

[21]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[22]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[23]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[24]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[25]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[26]  Imrich Chlamtac,et al.  Bluetrees-scatternet formation to enable Bluetooth-based ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[27]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[28]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[29]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[30]  Tamás Lukovszki,et al.  New results on geometric spanners and their applications , 1999 .

[31]  Pietro Manzoni,et al.  Determination of Critical Transmission Range in Ad-Hoc Networks , 1999 .

[32]  N. Henze,et al.  Some peculiar boundary phenomena for extremes of rth nearest neighbor links , 1990 .

[33]  Paolo Santi,et al.  An evaluation of connectivity in mobile wireless ad hoc networks , 2002, Proceedings International Conference on Dependable Systems and Networks.

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

[35]  Xiang-Yang Li,et al.  Power efficient and sparse spanner for wireless ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

[36]  Vahab S. Mirrokni,et al.  Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks , 2006, Wirel. Networks.

[37]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[38]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[39]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[40]  M. Penrose.  A Strong Law for the Longest Edge of the Minimal Spanning Tree , 1999 .