The Speed of Information Propagation in Large Wireless Networks

This paper investigates the speed limit of information propagation in large wireless networks, which provides fundamental understanding of the fastest information transportation and delivery that a wireless network is able to accommodate. We show that there is a unified speed upper bound for broadcast and unicast communications in large wireless networks. When network connectivity and successful packet delivery are considered, this speed upper bound is a function of node density. As this bound is unreachable with finite node density, we also quantify the gap between the actually achieved speed and the desired upper bound, which converges to zero exponentially as the node density increases to infinity.

[1]  Yong Pei,et al.  On the capacity improvement of ad hoc wireless networks using directional antennas , 2003, MobiHoc '03.

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

[3]  Mischa Schwartz,et al.  Mobile Wireless Communications: Access and scheduling techniques in cellular systems , 2004 .

[4]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Linear Capacity Scaling in Ad Hoc Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels , 2005, IEEE/ACM Transactions on Networking.

[6]  Rong Zheng,et al.  Information Dissemination in Power-Constrained Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[7]  Stavros Toumpis,et al.  Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid , 2004, MobiHoc '04.

[8]  Michael Gastpar,et al.  On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[10]  Patrick Thiran,et al.  Connectivity vs capacity in dense ad hoc networks , 2004, IEEE INFOCOM 2004.

[11]  Shu Lin,et al.  Error control coding : fundamentals and applications , 1983 .

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

[13]  Aravind Srinivasan,et al.  Algorithmic aspects of capacity in wireless networks , 2005, SIGMETRICS '05.

[14]  Jennifer C. Hou,et al.  Capacity of wireless ad-hoc networks under ultra wide band with power constraint , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Donald F. Towsley,et al.  On the capacity of hybrid wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).