A Simulation-Based Method for Predicting Connectivity in Wireless Multihop Networks

This study presents an approach to the problem of predicting k-connectivity in wireless multihop networks. Assuming the network consists of randomly placed nodes with a common transmission range, the threshold range for k-connectivity is a random variable. Knowing the distribution of this random variable under the circumstances of interest allows one to determine how the number of nodes, the transmission range, and the network area are related so that a random network realization is k-connected with a given probability.

[1]  M. Penrose.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[2]  Asser N. Tantawi,et al.  Connectivity properties of a packet radio network model , 1989, IEEE Trans. Inf. Theory.

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

[4]  Jaroslav Nesetril,et al.  Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history , 2001, Discret. Math..

[5]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[6]  Mark Allen Weiss,et al.  Data structures and algorithm analysis , 1991 .

[7]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[8]  Roberto Tamassia,et al.  On-line maintenance of triconnected components with SPQR-trees , 1996, Algorithmica.

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

[10]  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.

[11]  Christian Bettstetter,et al.  How to achieve a connected ad hoc network with homogeneous range assignment: an analytical study with consideration of border effects , 2002, 4th International Workshop on Mobile and Wireless Communications Network.

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

[13]  Reinhard Diestel,et al.  Graph Theory , 1997 .

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