Crystallization in Large Wireless Networks

We analyze fading interference relay networks where single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of single-antenna relays using half-duplex two-hop relaying. Assuming that the relays have channel state information (CSI), it is shown that in the large-M limit, provided grows fast enough as a function of the network "decouples" in the sense that the individual source-destination terminal pair capacities are strictly positive. The corresponding required rate of growth of as a function of is found to be sufficient to also make the individual source-destination fading links converge to nonfading links. We say that the network "crystallizes" as it breaks up into a set of effectively isolated "wires in the air." A large-deviations analysis is performed to characterize the "crystallization" rate, i.e., the rate (as a function of M, K) at which the decoupled links converge to nonfading links. In the course of this analysis, we develop a new technique for characterizing the large-deviations behavior of certain sums of dependent random variables. For the case of no CSI at the relay level, assuming amplify-and-forward relaying, we compute the per source- destination terminal pair capacity for M, Krarrinfin, with K/Mrarrbeta fixed, using tools from large random matrix theory.

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

[2]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

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

[4]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[5]  Helmut Bölcskei,et al.  Fading relay channels: performance limits and space-time signal design , 2004, IEEE Journal on Selected Areas in Communications.

[6]  Philip Schniter,et al.  On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels , 2005, IEEE Transactions on Information Theory.

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

[8]  Helmut Bölcskei,et al.  Capacity scaling laws in MIMO relay networks , 2006, IEEE Transactions on Wireless Communications.

[9]  J. W. Silverstein.  Strong convergence of the empirical distribution of eigenvalues of large dimensional random matrices , 1995 .

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

[11]  Andreas Maurer.  A bound on the deviation probability for sums of non-negative random variables. , 2003 .

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

[13]  Muriel Médard,et al.  The effect upon channel capacity in wireless communications of perfect and imperfect knowledge of the channel , 2000, IEEE Trans. Inf. Theory.

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

[15]  Olivier Lévêque,et al.  Asymptotic Capacity of Multi-Level Amplify-and-Forward Relay Networks , 2007, 2007 IEEE International Symposium on Information Theory.

[16]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[17]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[18]  Shlomo Shamai,et al.  Fading channels: How perfect need "Perfect side information" be? , 2002, IEEE Trans. Inf. Theory.

[19]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[20]  Michael Gastpar,et al.  On the capacity of large Gaussian relay networks , 2005, IEEE Transactions on Information Theory.

[21]  Antonia Maria Tulino,et al.  Random Matrix Theory and Wireless Communications , 2004, Found. Trends Commun. Inf. Theory.

[22]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.

[23]  Bo Wang,et al.  Achievable Rates and Scaling Laws of Power-Constrained Wireless Sensory Relay Networks , 2006, IEEE Transactions on Information Theory.

[24]  Babak Hassibi,et al.  On the power efficiency of sensory and ad hoc wireless networks , 2003, IEEE Transactions on Information Theory.

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

[26]  Bo Wang,et al.  On the capacity of MIMO relay channels , 2005, IEEE Transactions on Information Theory.

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

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

[29]  V. Marčenko,et al.  DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES , 1967 .

[30]  Aydano B. Carleial,et al.  Interference channels , 1978, IEEE Trans. Inf. Theory.

[31]  Gregory W. Wornell,et al.  Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks , 2003, IEEE Trans. Inf. Theory.

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

[33]  Helmut Bölcskei,et al.  Capacity Scaling Laws in Asynchronous Relay Networks , 2004 .

[34]  Z. Bai,et al.  METHODOLOGIES IN SPECTRAL ANALYSIS OF LARGE DIMENSIONAL RANDOM MATRICES, A REVIEW , 2008 .

[35]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[36]  Panganamala Ramana Kumar,et al.  Towards an information theory of large networks: an achievable rate region , 2003, IEEE Trans. Inf. Theory.