Hierarchical Cooperation Achieves Linear Capacity Scaling in Ad Hoc Networks

n source and destination pairs randomly located in a fixed area want to communicate with each other. It is well known that classical multihop architectures that decode and forward packets can deliver at most a radicn-scaling of the aggregate throughput. The performance is limited by the mutual interference between communicating nodes. We show however that a linear scaling of the capacity with n can in fact be achieved by more intelligent node cooperation and distributed MIMO communication. The key ingredient is a hierarchical and digital architecture for nodal exchange of information for realizing the cooperation.

[1]  Emre Telatar,et al.  Capacity of Multi-antenna Gaussian Channels , 1999, Eur. Trans. Telecommun..

[2]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[3]  Pramod Viswanath,et al.  On outer bounds to the capacity region of wireless networks , 2006, IEEE Transactions on Information Theory.

[4]  Abbas El Gamal,et al.  Bounds on capacity and minimum energy-per-bit for AWGN relay channels , 2006, IEEE Transactions on Information Theory.

[5]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[6]  Ayfer Özgür,et al.  Scaling Laws for One- and Two-Dimensional Random Wireless Networks in the Low-Attenuation Regime , 2007, IEEE Transactions on Information Theory.

[7]  Panganamala Ramana Kumar,et al.  A network information theory for wireless communication: scaling laws and optimal operation , 2004, IEEE Transactions on Information Theory.

[8]  Panganamala Ramana Kumar,et al.  On the path-loss attenuation regime for positive cost and linear scaling of transport capacity in wireless networks , 2006, IEEE Transactions on Information Theory.

[9]  Jehoshua Bruck,et al.  A random walk model of wave propagation , 2004, IEEE Transactions on Antennas and Propagation.

[10]  Ayfer Özgür,et al.  Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks , 2006, IEEE Transactions on Information Theory.

[11]  Sanjeev R. Kulkarni,et al.  Upper bounds to transport capacity of wireless networks , 2004, IEEE Transactions on Information Theory.

[12]  Panganamala Ramana Kumar,et al.  The transport capacity of wireless networks over fading channels , 2004, IEEE Transactions on Information Theory.

[13]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[14]  P. Viswanath,et al.  Outer Bounds on the Capacity Region of Wireless Networks , 2005, Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005..

[15]  Massimo Franceschetti,et al.  On the throughput capacity of random wireless networks , 2004 .

[16]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[17]  David Tse,et al.  Degrees of freedom in some underspread MIMO fading channels , 2006, IEEE Transactions on Information Theory.

[18]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[19]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[20]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[21]  Massimo Franceschetti,et al.  Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory , 2007, IEEE Transactions on Information Theory.

[22]  Emre Telatar,et al.  Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks , 2005, IEEE Transactions on Information Theory.

[23]  Venkatesh Saligrama,et al.  Wireless Ad Hoc Networks: Strategies and Scaling Laws for the Fixed SNR Regime , 2006, IEEE Transactions on Information Theory.

[24]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[25]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .