The Limit of Information Propagation Speed in Large-Scale Multihop Wireless Networks

This paper investigates the speed limit of information propagation in large-scale multihop 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 exists a unified speed upper bound for broadcast and unicast communications in large-scale wireless networks. When network connectivity is considered, this speed bound is a function of node density. If the network noise is constant, the bound is a constant when node density exceeds a threshold; if the network noise is an increasing function of node density, the bound decreases to zero when node density approaches infinity. As achieving the speed bound places strict requirements on node locations, we also quantify the gap between the actual achieved speed and the desired bound in random networks in which the relay nodes are not located as desired. We find that the gap converges to zero exponentially as node density increases to infinity.

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

[2]  Leandros Tassiulas,et al.  Throughput capacity of random ad hoc networks with infrastructure support , 2003, MobiCom '03.

[3]  Devavrat Shah,et al.  Throughput-delay trade-off in energy constrained wireless networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[4]  Paolo Giaccone,et al.  On the Capacity of Ad Hoc Wireless Networks Under General Node Mobility , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Aravind Srinivasan,et al.  Cross-layer latency minimization in wireless networks with SINR constraints , 2007, MobiHoc '07.

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

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

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

[9]  Shahrokh Valaee,et al.  Link Scheduling for Minimum Delay in Spatial Re-Use TDMA , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[10]  Robin Kravets,et al.  Achieving Delay Guarantees in Ad Hoc Networks through Dynamic Contention Window Adaptation , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[12]  Domenico Ferrari,et al.  Exact admission control for networks with a bounded delay service , 1996, TNET.

[13]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Marwan Krunz,et al.  Fluid analysis of delay and packet discard performance for QoS support in wireless networks , 2001, IEEE J. Sel. Areas Commun..

[15]  Riccardo Bettati,et al.  Providing statistical delay guarantees in wireless networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

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

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

[18]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[19]  Sem C. Borst,et al.  Heavy-Traffic Delay Minimization in Bandwidth-Sharing Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[20]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

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

[22]  Eylem Ekici,et al.  Throughput and delay optimization in interference-limited multihop networks , 2006, MobiHoc '06.

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

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

[25]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[26]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.