1989
DOI: 10.1109/18.42219
|View full text |Cite
|
Sign up to set email alerts
|

Connectivity properties of a packet radio network model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

6
138
1
5

Year Published

2005
2005
2018
2018

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 230 publications
(150 citation statements)
references
References 8 publications
6
138
1
5
Order By: Relevance
“…In the same paper Philips et al (1989), the authors show also a theorem about the connectivity. Connectivity and coverage must not be confused.…”
Section: The Problem Of Connectivitymentioning
confidence: 88%
See 1 more Smart Citation
“…In the same paper Philips et al (1989), the authors show also a theorem about the connectivity. Connectivity and coverage must not be confused.…”
Section: The Problem Of Connectivitymentioning
confidence: 88%
“…The most interesting paper dealing with this subject is Philips et al (1989) dating from 1989. The authors study (among other things) the probability that each point of the plane be covered when the used model is a "Poisson blob-model" with parameter λ and R. To do this, they consider a finite surface A and they make tend this surface towards the infinity.…”
Section: The Problem Of Coveragementioning
confidence: 99%
“…To date, there is unfortunately no explicit expression of θ, nor of λ c . Bounds on λ c have been obtained in [4], [10], [9], whereas θ can be evaluated by simulation. Figure 2 shows θ as a function of λ. Percolation probability θ in 2 dim.…”
Section: Theorem 3-[9] Pp 45-68mentioning
confidence: 99%
“…However, such a process would be unlikely to perform efficiently in MANET. The disadvantages of GPSR are the control overhead and slow recovery process [4,8,17,25].…”
Section: A Greedy Perimeter Stateless Routingmentioning
confidence: 99%