Throughput scaling of wireless networks with random connections

Authors:
Shengshan Cui;Alexander M. Haimovich;Oren Somekh;H. Vincent Poor;Shlomo Shamai
Affiliations:
Qualcomm Inc., San Diego, CA and Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ;Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ;Yahoo! Labs Israel and Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Technion-Israel Institute of Technology, Technion City, Haifa, Israel
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 22
Cited 2

Mobility increases the capacity of ad hoc wireless networks

IEEE/ACM Transactions on Networking (TON)
On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph

SIAM Journal on Computing
On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Opportunistic relaying in wireless networks

IEEE Transactions on Information Theory
Information-theoretic operating regimes of large wireless networks

IEEE Transactions on Information Theory
Peer-to-Peer MIMO Radio Channel Measurements in a Rural Area

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory
Opportunistic beamforming using dumb antennas

IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation

IEEE Transactions on Information Theory
Upper bounds to transport capacity of wireless networks

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
Even One-Dimensional Mobility Increases the Capacity of Wireless Networks

IEEE Transactions on Information Theory
Communication over a wireless network with random connections

IEEE Transactions on Information Theory
On the power efficiency of sensory and ad hoc wireless networks

IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

IEEE Transactions on Information Theory
Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime

IEEE Transactions on Information Theory
Crystallization in Large Wireless Networks

IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

IEEE Transactions on Information Theory
Throughput Scaling Laws for Wireless Networks With Fading Channels

IEEE Transactions on Information Theory
Interference Alignment and Degrees of Freedom of the -User Interference Channel

IEEE Transactions on Information Theory

Throughput scaling of wireless networks with random connections

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Throughput scaling of wireless ad hoc networks with no side information

IEEE Communications Letters

Quantified Score

Hi-index	754.84

Visualization

Abstract

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) for a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by O(n1/3) for single-hop schemes, and O(n1/2) for two-hop (and multihop) schemes; 2) the Θ (n1/2) throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters; 3) by relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling Θ (n) is achievable with Pareto-type fading models.