Impact of interferences on connectivity in ad hoc networks

We study the impact of interferences on the connectivity of large-scale ad hoc networks, using percolation theory. We assume that a bi-directional connection can be set up between two nodes if the signal to noise ratio at the receiver is larger than some threshold. The noise is the sum of the contribution of interferences from all other nodes, weighted by a coefficient /spl gamma/, and of a background noise. We find that there is a critical value of /spl gamma/ above which the network is made of disconnected clusters of nodes. We also prove that if /spl gamma/ is nonzero but small enough, there exist node spatial densities for which the network contains a large (theoretically infinite) cluster of nodes, enabling distant nodes to communicate in multiple hops. Since small values of /spl gamma/ cannot be achieved without efficient CDMA codes, we investigate the use of a very simple TDMA scheme, where nodes can emit only every nth time slot. We show that it achieves connectivity similar to the previous system with a parameter /spl gamma//n.

[1]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[2]  Jehoshua Bruck,et al.  Covering Algorithms, Continuum Percolation, and the Geometry of Wireless Networks. , 2003 .

[3]  D. Daley.  The definition of a multi-dimensional generalization of shot noise , 1971, Journal of Applied Probability.

[4]  Paolo Santi,et al.  An evaluation of connectivity in mobile wireless ad hoc networks , 2002, Proceedings International Conference on Dependable Systems and Networks.

[5]  Patrick Thiran,et al.  Connectivity in ad-hoc and hybrid networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

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

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

[9]  F. Baccelli,et al.  On a coverage process ranging from the Boolean model to the Poisson–Voronoi tessellation with applications to wireless communications , 2001, Advances in Applied Probability.

[10]  R. Meester,et al.  Continuum percolation: References , 1996 .

[11]  Thomas G. Robertazzi,et al.  Critical connectivity phenomena in multihop radio models , 1989, IEEE Trans. Commun..

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

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

[14]  H. Poincaré,et al.  Percolation ? , 1982 .

[15]  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).

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

[17]  R. Schonmann,et al.  Domination by product measures , 1997 .

[18]  Asser N. Tantawi,et al.  Connectivity properties of a packet radio network model , 1989, IEEE Trans. Inf. Theory.

[19]  Andrew Sendonaris,et al.  The coverage-capacity tradeoff in cellular CDMA systems , 1999 .

[20]  Daniel Mossé,et al.  Providing a bidirectional abstraction for unidirectional ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[21]  François Baccelli,et al.  Impact of interferences on connectivity in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[22]  Bartomiej Baszczyszyn,et al.  On a Coverage Process Ranging from the Boolean Model to the Poisson Voronoi Tessellation , 2000 .

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