Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Throughput capacity of random ad hoc networks with infrastructure support
Proceedings of the 9th annual international conference on Mobile computing and networking
Providing Statistical Delay Guarantees in Wireless Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Error Control Coding, Second Edition
Error Control Coding, Second Edition
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
Throughput and delay optimization in interference-limited multihop networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
The capacity of wireless networks
IEEE Transactions on Information Theory
Fluid analysis of delay and packet discard performance for QoS support in wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.