On Capacity Scaling in Arbitrary Wireless Networks
Authors:
- Urs NiesenUNUrs Niesen
- Piyush GuptaPGPiyush Gupta
- Devavrat ShahDSDevavrat Shah
Preprint
Abstract
In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., $n$ nodes are placed uniformly at random in a square region of area $n$). They showed that for small path-loss exponents $\alpha\in(2,3]$ cooperative communication is order optimal, and for large path-loss exponents $\alpha > 3$ multi-hop communication is order optimal. However, their results (both the communication scheme and the proof technique) are strongly dependent on the regularity induced with high probability by the random node placement. In this paper, we consider the problem of characterizing the throughput scaling in extended wireless networks with arbitrary node placement. As a main result, we propose a more general novel cooperative communication scheme that works for arbitrarily placed nodes. For small path-loss exponents $\alpha \in (2,3]$, we show that our scheme is order optimal for all node placements, and achieves exactly the same throughput scaling as in Ozgur et al. This shows that the regularity of the node placement does not affect the scaling of the achievable rates for $\alpha\in (2,3]$. The situation is, however, markedly different for large path-loss exponents $\alpha >3$. We show that in this regime the scaling of the achievable per-node rates depends crucially on the regularity of the node placement. We then present a family of schemes that smoothly "interpolate" between multi-hop and cooperative communication, depending upon the level of regularity in the node placement. We establish order optimality of these schemes under adversarial node placement for $\alpha > 3$.
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networksIEEE Transactions on Information Theory, 2006
- Cooperative strategies and capacity theorems for relay networksIEEE Transactions on Information Theory, 2005
- An Achievable Rate for the Multiple-Level Relay ChannelIEEE Transactions on Information Theory, 2005
- Information-Theoretic Upper Bounds on the Capacity of Large Extended Ad Hoc Wireless NetworksIEEE Transactions on Information Theory, 2005
- The Transport Capacity of Wireless Networks Over Fading ChannelsIEEE Transactions on Information Theory, 2005
- Upper Bounds to Transport Capacity of Wireless NetworksIEEE Transactions on Information Theory, 2004
- A Deterministic Approach to Throughput Scaling in Wireless NetworksIEEE Transactions on Information Theory, 2004
- A Network Information Theory for Wireless Communication: Scaling Laws and Optimal OperationIEEE Transactions on Information Theory, 2004
- Towards an information theory of large networks: an achievable rate regionIEEE Transactions on Information Theory, 2003
- On the capacity of channels with additive non-gaussian noiseInformation and Control, 1978