Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

By Ayfer Özgür, Olivier Lévêque, David Tse. IEEE Transactions on Information Theory, 2006

695 citations recorded by the source corpus.

n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r-alpha as well as a random phase. We identify the scaling laws of the information-theoretic capacity of the network when nodes can relay information for each other. In the case of dense networks, where the area is fixed and the density of nodes increasing, we show that the total capacity of the network scales linearly with n. This improves on the best known achievability result of n2/3 of Aeron and Saligrama. In the case of extended networks, where the density of nodes is fixed and the area increasing linearly with n, we show that this capacity scales as n2-alpha/2 for 2lesalpha<3 and radicn for a alphages3. The best known earlier result of Xie and Kumar identified the scaling law for alpha > 4. Thus, much better scaling than multihop can be achieved in dense networks, as well as in extended networks with low attenuation. The performance gain is achieved by intelligent node cooperation and distributed multiple-input multiple-output (MIMO) communication. The key ingredient is a hierarchical and digital architecture for nodal exchange of information for realizing the cooperation.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/25f3ca3366e0d0988bf81230ced95d32b30a42cd

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Fundamental Limits of Wideband Localization— Part II: Cooperative Networks (2010, background): “We focus on two types of random networks: dense networks and extended networks [47], [48].”
Data Offloading Techniques in Cellular Networks: A Survey (2015, neutral): “While classical studies show that the theoretical transport capacity of multi-hop ad hoc networks scales sublinearly as Θ( √ n) [97], [98] with the number n of users, cooperation among nodes brings linear scaling law of Θ(n) [99].”
Fundamental Limits of Wideband Localization— Part I: A General Framework (2010, background): “3In practice, however, an NLOS induced range bias can be as much as a few kilometers depending on the propagation environment [48], [55], and small perturbation may not compensate for NLOS induced error.”
Interference Alignment and Spatial Degrees of Freedom for the K User Interference Channel (2007, background): “First, [3] is asymptotic in the number of users K → ∞ but deals with finite SNR.”
Transmission capacity of ad hoc networks with spatial diversity (2007, background): “Recent advances in characterizing network capacity were sparked by [3] with its notion of transport capacity and a number of works have followed in the same vein including [4], [5], and [6].”
JMB: scaling wireless capacity with user demands (2012, background): “[28] theoretically proved that such a setup can scale wireless capacity with the number of nodes.”
Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective (2009, background): “In large networks, hierarchical clustering can achieve a linear scaling of the total capacity [ 81 ], which is significantly better than scaling under a classic multihop strategy [82].”
The Effect of Fading, Channel Inversion, and Threshold Scheduling on Ad Hoc Networks (2007, neutral): “Channel state feedback”
MegaMIMO : Scaling Wireless Capacity with User Demands (2012, background): “[28] theoretically proved that such a setup can scale wireless capacity with the number of nodes.”
Stochastic geometry and random graphs for the analysis and design of wireless networks (2009, background): “…fading assumptions such as in [84], and [81] are open to debate, as they can lead to non-physical results But does this lead to the conclusion that the sophisticated cooperative strategies described in [84] and [81] do not lead to any improvement over multi-hop operation The general answer is no.”