Capacity Scaling of Wireless Networks with Inhomogeneous Node Density: Lower Bounds

We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area and analyze the scaling laws of their transport capacity as the number of nodes increases. In particular, we consider nodes placed according to a shot-noise Cox process (SNCP), which allows to model the clustering behavior usually recognized in large-scale systems. For this class of networks, we propose novel scheduling and routing schemes that approach previously computed upper bounds to the per-flow throughput as the number of nodes tends to infinity.

[1]  E. N. Gilbert,et al.  Random Plane Networks , 1961 .

[2]  Bruce Hajek,et al.  Scheduling nonuniform traffic in a packet-switching system with small propagation delay , 1997, TNET.

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

[4]  J. Neyman,et al.  Statistical Approach to Problems of Cosmology , 1958 .

[5]  Rudolf H. Riedi,et al.  Bounds for the capacity of wireless multihop networks imposed by topology and demand , 2007, MobiHoc '07.

[6]  Panganamala Ramana Kumar,et al.  Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach , 2006, Found. Trends Netw..

[7]  J. Quintanilla,et al.  Efficient measurement of the percolation threshold for fully penetrable discs , 2000 .

[8]  Sanjeev R. Kulkarni,et al.  A deterministic approach to throughput scaling in wireless networks , 2002, IEEE Transactions on Information Theory.

[9]  Bruce E. Hajek,et al.  Scheduling nonuniform traffic in a packet switching system with small propagation delay , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[10]  M. Thomas.  A generalization of Poisson's binomial limit for use in ecology. , 1949, Biometrika.

[11]  Rick S. Blum,et al.  Capacity of clustered ad hoc networks: how large is "Large"? , 2006, IEEE Transactions on Communications.

[12]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

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

[14]  Isaac Balberg.  Continuum Percolation , 2009, Encyclopedia of Complexity and Systems Science.

[15]  Michele Garetto,et al.  Capacity scaling of wireless networks with inhomogeneous node density: upper bounds , 2009, IEEE Journal on Selected Areas in Communications.

[16]  L. Russo.  On the critical percolation probabilities , 1981 .

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

[18]  Urs Niesen,et al.  On Capacity Scaling in Arbitrary Wireless Networks , 2009, IEEE Transactions on Information Theory.

[19]  Stavros Toumpis,et al.  Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid , 2004, MobiHoc '04.

[20]  J. Møller,et al.  Shot noise Cox processes , 2003, Advances in Applied Probability.

[21]  Massimo Franceschetti,et al.  Closing the gap in the capacity of random wireless networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..