Connectivity of Wireless Multihop Networks in a Shadow Fading Environment

This paper investigates the connectivity of wireless multihop networks in a log--normal shadow fading environment. Assuming a spatial Poisson distribution of the network nodes, we derive (a) a closed--form expression for the probability that a node is isolated and (b) a tight bound for the minimum node density that is needed to obtain an almost surely connected subnetwork on a given area. Both results find application in the design and simulation of wireless sensor and ad hoc networks.

[1]  Christian Bettstetter,et al.  Connectivity of Wireless Multihop Networks in a Shadow Fading Environment , 2005, Wirel. Networks.

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

[3]  Werner Wiesbeck,et al.  Planungsmethoden für die Mobilkommunikation , 1998 .

[4]  Paolo Santi,et al.  A probabilistic analysis for the range assignment problem in ad hoc networks , 2001, MobiHoc '01.

[5]  Daryl J. Daley,et al.  An Introduction to the Theory of Point Processes , 2013 .

[6]  H. Thompson.  Distribution of Distance to Nth Neighbour in a Population of Randomly Distributed Individuals , 1956 .

[7]  Hui Li,et al.  Path expiration times in mobile ad hoc networks , 2003 .

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

[9]  Noel A Cressie,et al.  Statistics for Spatial Data. , 1992 .

[10]  Christian Bettstetter,et al.  Mobility modeling in wireless networks: categorization, smooth movement, and border effects , 2001, MOCO.

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

[12]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

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

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

[15]  Mahesh K. Marina,et al.  Routing performance in the presence of unidirectional links in multihop wireless networks , 2002, MobiHoc '02.

[16]  Christian Bettstetter,et al.  On the Connectivity of Ad Hoc Networks , 2004, Comput. J..

[17]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[18]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[19]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

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

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

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

[23]  François Baccelli,et al.  Impact of interferences on connectivity in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[24]  Masakazu Sengoku,et al.  Effect of mobility on connectivity of mobile multihop wireless networks , 2002, Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367).

[25]  Ahmed Helmy,et al.  PATHS: analysis of PATH duration statistics and their impact on reactive MANET routing protocols , 2003, MobiHoc '03.

[26]  Rahul Jain,et al.  Geographical routing using partial information for wireless ad hoc networks , 2001, IEEE Wirel. Commun..

[27]  B. Bollobás.  The evolution of random graphs , 1984 .

[28]  Mineo Takai,et al.  Effects of wireless physical layer modeling in mobile ad hoc networks , 2001, MobiHoc '01.

[29]  Paolo Santi,et al.  A probabilistic analysis for the range assignment problem in ad hoc networks , 2001, MobiHoc.

[30]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[31]  Michele Zorzi,et al.  Optimum transmission ranges in multihop packet radio networks in the presence of fading , 1995, IEEE Trans. Commun..

[32]  Paolo Santi,et al.  The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[33]  Hui Li,et al.  Link expiration times in mobile ad hoc networks , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

[34]  D. Manjunath,et al.  On the connectivity in finite ad hoc networks , 2002, IEEE Communications Letters.

[35]  Massimo Franceschetti,et al.  Ad hoc wireless networks with noisy links , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[36]  Taieb Znati,et al.  A path availability model for wireless ad-hoc networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[37]  Christian Bettstetter,et al.  On the connectivity of wireless multihop networks with homogeneous and inhomogeneous range assignment , 2002, Proceedings IEEE 56th Vehicular Technology Conference.