Robust wireless ad hoc networks

We consider a large-scale of wireless ad hoc networks whose nodes are distributed randomly in a two-dimensional region /spl Omega/. Given n wireless nodes V, each with transmission range r/sub n/, the wireless networks are often modeled by graph G(V, r/sub n/) in which two nodes are connected if their Euclidean distance is no more than r/sub n/. We show that, for a unit-area square region /spl Omega/, the probability G(V, r/sub n/) being k-connected is at least (e/sup -e/)/sup -/spl sigma// when n/spl pi/(r/sup 2/)/sub n/ /spl ges/ ln n + (2k - 3) ln ln n - 2 ln (k - 1)! + 2/spl sigma/ for k > 1 and n sufficiently large. This result also applies to mobile networks when the moving of wireless nodes always generates randomly and uniformly distributed positions. We also conduct extensive simulations to study the practical transmission range to achieve certain probability of k-connectivity when n is not large enough. The relation between the minimum node degree and the connectivity of graph G(V, r) is also studied.

[1]  Alan M. Frieze,et al.  On the Connectivity of Random k-th Nearest Neighbour Graphs , 1995, Combinatorics, Probability and Computing.

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

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

[4]  Aura Ganz,et al.  QoS Routing for Mesh-Based Wireless LANs , 2002, Int. J. Wirel. Inf. Networks.

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

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

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

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

[9]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

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

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

[12]  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).

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

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

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

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

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