Throughput Scaling Laws for Wireless Networks with Fading Channels

Abstract

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading (i) the maximum throughput scales like $\log n$ (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a decentralized link activation strategy is proposed and analyzed.

Submitted to IEEE Transactions on Information Theory (Revised)

Cited by in corpus (12)

• Parallel Opportunistic Routing in Wireless Networks
• Hierarchical Radio Resource Optimization for Heterogeneous Networks with Enhanced Inter-cell Interference Coordination (eICIC)
• Throughput Scaling of Wireless Networks With Random Connections
• On the Throughput Maximization in Dencentralized Wireless Networks
• Throughput of Large One-hop Wireless Networks with General Fading
• Randomized vs. orthogonal spectrum allocation in decentralized networks: Outage Analysis
• On the Design of Large Scale Wireless Systems (with detailed proofs)
• Throughput of One-Hop Wireless Networks with Noisy Feedback Channel
• Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes
• To Decode the Interference or To Consider it as Noise
• The Asymptotic Limits of Interference in Multicell Networks with Channel Aware Scheduling
• On the Degree of Freedom for Multi-Source Multi-Destination Wireless Network with Multi-layer Relays