IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37
DOI: 10.1109/infcom.2003.1209195
|View full text |Cite
|
Sign up to set email alerts
|

Impact of interferences on connectivity in ad hoc networks

Abstract: Abstract-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 γ, and of a background noise.We find that there is a critical value of γ above which the network is made of disconnected clusters of n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

9
184
1

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 158 publications
(194 citation statements)
references
References 18 publications
9
184
1
Order By: Relevance
“…It is worth noting that a stochastic ordering among the distributions corresponding to various values of σ is possible 4 , 4 Given two random variables A and B, we say that A is stochastically smaller than B, A B if…”
Section: Characterizing the Communication Range Statistics In The Prementioning
confidence: 99%
See 1 more Smart Citation
“…It is worth noting that a stochastic ordering among the distributions corresponding to various values of σ is possible 4 , 4 Given two random variables A and B, we say that A is stochastically smaller than B, A B if…”
Section: Characterizing the Communication Range Statistics In The Prementioning
confidence: 99%
“…The growing interest in the field of self-organizing wireless networks, often referred to as ad hoc, has led to a considerable amount of literature dealing with the characterization of the limiting performance of such networks, in terms of both connectivity [1][2][3][4] and capacity [5][6][7][8][9][10], two intimately related issues [11]. In this paper, we focus on one-dimensional ad hoc networks, in which nodes are randomly deployed over an infinite line, and present novel results on connectivity and coverage.…”
Section: Introductionmentioning
confidence: 99%
“…These results support the application of approximation algorithms and numerical investigations. Concerning the analysis of the impact of interferences, we mention [9,16] and references therein. These papers are based on a model of interferences called the capture model which assumes that a communication can be established given that the ratio of the signal to noise is large enough.…”
Section: Related Workmentioning
confidence: 99%
“…A powerful technique for solving this issue comes from the percolation theory [7]. Recently, the percolation theory has been proven to be a very useful tool for the analysis of large-scale wireless networks [3] [6].…”
Section: Introductionmentioning
confidence: 99%
“…So far, percolation-based connectiviy has been investigated in large-scale distributed networks such as ad-hoc and wireless sensor networks [3] [6]. Recently, the connectivity of cognitive radio ad-hoc networks was also studied from the perspective of percolation theory [9].…”
Section: Introductionmentioning
confidence: 99%