The Effect of Node Density and Propagation Model on Throughput Scaling of Wireless Networks

This paper derives a lower bound of the form ngamma-1 to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius ngamma, 0 < gamma < 1/2 and propagation is modeled by an attenuation of the form 1/(1 + d)alpha, alpha > 2

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

[2]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[3]  G. Chartrand.  Introductory Graph Theory , 1984 .

[4]  Hesham El Gamal.  On the scaling laws of dense wireless sensor networks: the data gathering channel , 2005, IEEE Trans. Inf. Theory.

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

[6]  Mingyan Liu,et al.  On the Many-to-One Transport Capacity of a Dense Wireless Sensor Network and the Compressibility of Its Data , 2003, IPSN.

[7]  Mingyan Liu,et al.  Data-gathering wireless sensor networks: organization and capacity , 2003, Comput. Networks.

[8]  Sergio D. Servetto,et al.  On the maximum stable throughput problem in random networks with directional antennas , 2003, MobiHoc '03.

[9]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[11]  Z.J. Haas,et al.  On the scalability and capacity of wireless networks with omnidirectional antennas , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.