2006
DOI: 10.1016/j.peva.2006.05.011
|View full text |Cite
|
Sign up to set email alerts
|

On the performance of ad hoc wireless LANs: A practical queuing theoretic model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
18
0

Year Published

2008
2008
2015
2015

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 22 publications
(18 citation statements)
references
References 35 publications
0
18
0
Order By: Relevance
“…It follows that the system is an M/G/1 queue with vacation, where the server vacation time accounts for the post-backoff procedure during which the node does not undertake any contention. The derivation of the service time draws on the work in [9,10]. Below, we first present the approximate expression for the collision probability in the case of unsaturated sources, as obtained in [9]; then, we derive the collision probability when sources are unsaturated and the presence of hidden terminals is taken into account.…”
Section: The Dcf Queuementioning
confidence: 99%
See 4 more Smart Citations
“…It follows that the system is an M/G/1 queue with vacation, where the server vacation time accounts for the post-backoff procedure during which the node does not undertake any contention. The derivation of the service time draws on the work in [9,10]. Below, we first present the approximate expression for the collision probability in the case of unsaturated sources, as obtained in [9]; then, we derive the collision probability when sources are unsaturated and the presence of hidden terminals is taken into account.…”
Section: The Dcf Queuementioning
confidence: 99%
“…The derivation of the service time draws on the work in [9,10]. Below, we first present the approximate expression for the collision probability in the case of unsaturated sources, as obtained in [9]; then, we derive the collision probability when sources are unsaturated and the presence of hidden terminals is taken into account. Finally, we derive the waiting time for the DCF queue.…”
Section: The Dcf Queuementioning
confidence: 99%
See 3 more Smart Citations