Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Bandwidth- and power-efficient routing in linear wireless networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Scaling laws for ad hoc wireless networks: an information theoretic approach
Foundations and Trends® in Networking
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
On unbounded path-loss models: effects of singularity on wireless network performance
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Spectrum sharing between cellular and mobile ad hoc networks: transmission-capacity trade-off
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
The capacity of wireless networks: information-theoretic and physical limits
IEEE Transactions on Information Theory
On capacity scaling in arbitrary wireless networks
IEEE Transactions on Information Theory
Interference and outage in clustered wireless ad hoc networks
IEEE Transactions on Information Theory
A delay-minimizing routing strategy for wireless multi-hop networks
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Scaling laws for overlaid wireless networks: a cognitive radio network versus a primary network
IEEE/ACM Transactions on Networking (TON)
Transmission capacity of ad hoc networks with spatial diversity
IEEE Transactions on Wireless Communications - Part 1
Bandwidth partitioning in decentralized wireless networks
IEEE Transactions on Wireless Communications - Part 2
The capacity of wireless networks
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
The transport capacity of wireless networks over fading channels
IEEE Transactions on Information Theory
Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks
IEEE Transactions on Information Theory
Stability and capacity of regular wireless networks
IEEE Transactions on Information Theory
Transmission capacity of wireless ad hoc networks with outage constraints
IEEE Transactions on Information Theory
An Aloha protocol for multihop mobile wireless networks
IEEE Transactions on Information Theory
Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks
IEEE Transactions on Information Theory
Routing in ad hoc networks: a case for long hops
IEEE Communications Magazine
Ad Hoc Networks: To Spread or Not to Spread? [Ad Hoc and Sensor Networks]
IEEE Communications Magazine
A simple upper bound on random access transport capacity
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A primer on spatial modeling and analysis in wireless networks
IEEE Communications Magazine
An overview of the transmission capacity of wireless networks
IEEE Transactions on Communications
Hi-index | 0.01 |
We develop a new metric for quantifying end-toend throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the average maximum rate of successful end-to-end transmissions, multiplied by the communication distance, and normalized by the network area. We show that a simple upper bound on this quantity is computable in closed-form in terms of key network parameters when the number of retransmissions is not restricted and the hops are assumed to be equally spaced on a line between the source and destination. We also derive the optimum number of hops and optimal per hop success probability and show that our result follows the well-known square root scaling law while providing exact expressions for the preconstants, which contain most of the design-relevant network parameters. Numerical results demonstrate that the upper bound is accurate for the purpose of determining the optimal hop count and success (or outage) probability.