On the Achievable Throughput in Two-Scale Wireless Networks

We propose a new model of wireless networks which we refer to as "two-scale networks". At a local scale, characterized by nodes being within a distance r, channel strengths are drawn independently and identically from a distance-independent distribution. At a global scale, characterized by nodes being further apart from each other than a distance r, channel connections are governed by a Rayleigh distribution, with the power satisfying a distance-based decay law. Thus, at a local scale, channel strengths are determined primarily by random effects such as obstacles and scatterers whereas at the global scale channel strengths depend on distance. For such networks, we propose a hybrid communications scheme, combining elements of P. Gupta et al. (2000) (for distance-dependent networks) and R. Gowaikar et al. (2006) (for random networks). For a particular class of two-scale networks with N nodes, we show that an aggregate throughput of the form N[1divide(t-1)] /log2N is achievable, where t > 2 is a parameter that depends on the distribution of the connection at the local scale and is independent of the decay law that operates at a global scale. For t < 3, this offers a significant improvement over the O(radicN) results of P. Gupta et al. (2000)

[1]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[2]  Patrick Thiran,et al.  Connectivity vs capacity in dense ad hoc networks , 2004, IEEE INFOCOM 2004.

[3]  Babak Hassibi,et al.  Communication over a wireless network with random connections , 2006, IEEE Transactions on Information Theory.

[4]  Babak Hassibi,et al.  An achievability result for random networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

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

[6]  Jeffrey G. Andrews,et al.  Transmission capacity of wireless ad hoc networks with outage constraints , 2005, IEEE Transactions on Information Theory.

[7]  E. Rosado,et al.  ABSTRACT , 1990 .

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

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

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

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

[12]  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.

[13]  Alan M. Frieze,et al.  An efficient algorithm for the vertex-disjoint paths problem in random graphs , 1996, SODA '96.

[14]  Henry L. Bertoni,et al.  Radio Propagation for Modern Wireless Systems , 1999 .

[15]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[16]  Massimo Franceschetti,et al.  On the throughput scaling of wireless relay networks , 2006, IEEE Transactions on Information Theory.

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

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

[19]  Michael Gastpar,et al.  On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  R. Hekmat Study of Connectivity in Wireless Ad-hoc Networks with an Improved Radio Model , 2004 .

[21]  François Baccelli,et al.  Stochastic geometry and architecture of communication networks , 1997, Telecommun. Syst..

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