Effects of topology on local throughput-capacity of ad hoc networks

Most publications on the capacity and performance of wireless ad hoc networks share the underlying assumption of a uniform random distribution of nodes. In this paper, we study the effects of different node distributions on the local throughput of the slotted ALOHA MAC protocol. The throughput achieved in a network where the nodes are distributed according to a Poisson point process is used as a baseline performance measure for the comparison with other point distributions. Our simulations show that non-uniform random node distributions have a strong impact on the local throughput which is related to the network capacity and performance. This means that the node topology should be taken into account in more detailed analyses and simulations of ad hoc, sensor, and mesh networks.

[1]  Hüseyin Arslan,et al.  Utilization of Location Information in Cognitive Wireless Networks , 2007, IEEE Wireless Communications.

[2]  L. Kleinrock,et al.  Spatial reuse in multihop packet radio networks , 1987, Proceedings of the IEEE.

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

[4]  Martin Haenggi,et al.  Interference and Outage in Clustered Wireless Ad Hoc Networks , 2007, IEEE Transactions on Information Theory.

[5]  John A. Silvester,et al.  Optimum transmission radii for packet radio networks or why six is a magic number , 1978 .

[6]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[7]  Norman Abramson,et al.  The Throughput of Packet Broadcasting Channels , 1977, IEEE Trans. Commun..

[8]  Martin Haenggi,et al.  Throughput Analysis of Fading Sensor Networks with Regular and Random Topologies , 2005, EURASIP J. Wirel. Commun. Netw..

[9]  Paolo Santi,et al.  The Critical Transmitting Range for Connectivity in Sparse Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[10]  Leonard Kleinrock,et al.  Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals , 1984, IEEE Trans. Commun..

[11]  Bu-Sung Lee,et al.  A closed form network connectivity formula one-dimensional MANETs , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[12]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[13]  G. Ferrari,et al.  Impact of clustering on the BER performance in ad hoc wireless networks , 2004, International Zurich Seminar on Communications, 2004.

[14]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[15]  Devavrat Shah,et al.  Optimal throughput-delay scaling in wireless networks - part I: the fluid model , 2006, IEEE Transactions on Information Theory.

[16]  Janne Riihijärvi,et al.  Connectivity Analysis of Clustered Ad Hoc and Mesh Networks , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[17]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[18]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[19]  Jens C. Arnbak,et al.  Capacity of Slotted ALOHA in Rayleigh-Fading Channels , 1987, IEEE J. Sel. Areas Commun..

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

[21]  Janne Riihijarvi,et al.  Characterizing wireless networks by spatial correlations , 2007, IEEE Communications Letters.

[22]  Lachlan L. H. Andrew,et al.  Meeting connectivity requirements in a wireless multihop network , 2006, IEEE Communications Letters.