Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks

A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other's transmission range. The critical transmission radius for k-connectivity is the smallest r such that if all nodes have the transmission radius r,the induce topology is k-connected. The critical neighbor number for k-connectivity is the smallest integer l such that if every node sets its transmission radius equal to the distance between itself an its l-th nearest neighbor, the induce topology is k-connecte. In this paper, we study the asymptotic critical transmission radius for k-connectivity an asymptotic critical neighbor number for k-connectivity in a wireless ad hoc network whose nodes are uniformly an independently distribute in a unit-area square or disk. We provide a precise asymptotic distribution of the critical transmission radius for k-connectivity and an improve asymptotic almost sure upper bound on the critical neighbor number for k-connectivity.

[1]  L. Kleinrock,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[2]  John A. Silvester.  On the spatial capacity of packet radio networks , 1981, Perform. Evaluation.

[3]  Bruce Hajek,et al.  ADAPTIVE TRANSMISSION STRATEGIES AND ROUTING IN MOBILE RADIO NETWORKS. , 1983 .

[4]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[5]  Ting-Chao Hou,et al.  Transmission Range Control in Multihop Packet Radio Networks , 1986, IEEE Trans. Commun..

[6]  Thomas G. Robertazzi,et al.  Critical connectivity phenomena in multihop radio models , 1989, IEEE Trans. Commun..

[7]  N. Henze,et al.  The limit distribution of the largest nearest-neighbour link in the unit d-cube , 1989, Journal of Applied Probability.

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

[9]  Philippe Piret.  On the connectivity of radio networks , 1991, IEEE Trans. Inf. Theory.

[10]  John A. Silvester,et al.  Maximum number of independent paths and radio connectivity , 1993, IEEE Trans. Commun..

[11]  S.A.G. Chandler,et al.  Connectivity properties of a random radio network , 1994 .

[12]  Rudolf Mathar,et al.  Analyzing routing strategy NFP in multihop packet radio networks on a line , 1995, IEEE Trans. Commun..

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

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

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

[16]  Stephen B. Wicker,et al.  Phase transition phenomena in wireless ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

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

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

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