2014
DOI: 10.1049/iet-com.2013.0384
|View full text |Cite
|
Sign up to set email alerts
|

Saturated distributed coordination function Markov model for noisy soft‐real‐time industrial wireless networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 41 publications
0
7
0
Order By: Relevance
“…Similarly, in [8] authors derive a closed-form expression from finding the packet delay using the Markov chain model. Madani et al in [10] considers the backoff freezing and busy channel to estimate the collision probabilities more accurately. Similar to the previous work, Motamedi et al in [11] evaluate the DCF in noisy wireless networks.…”
Section: Literature Surveymentioning
confidence: 99%
“…Similarly, in [8] authors derive a closed-form expression from finding the packet delay using the Markov chain model. Madani et al in [10] considers the backoff freezing and busy channel to estimate the collision probabilities more accurately. Similar to the previous work, Motamedi et al in [11] evaluate the DCF in noisy wireless networks.…”
Section: Literature Surveymentioning
confidence: 99%
“…The performance of the IEEE 802.11 DCF scheme has been extensively studied in the literature using different methods and simplifying assumptions. Because of the lack of a comprehensive model, this performance analysis has been going on up to now . Bianchi's 2D Markov chain model is the first and mostly used one (because of its simplicity) describing the BEB mechanism of DCF.…”
Section: Related Pieces Of Workmentioning
confidence: 99%
“…Most of the models have extended the Bianchi's model to account for other parameters and situations, such as nonsaturated traffic and finite buffer size , finite retransmission attempts , error‐prone channel , channel capture , hidden terminal , and improving the accuracy of the model in predicting performance metrics by considering backoff freezing and so on . From a traffic point of view, most papers assume the saturation condition; each node always has a packet waiting to be transmitted . This can be considered as the worst‐case scenario that simplifies the network analysis and also results in an upper (lower) bound estimation about the normal/noncongested situation of the network delay (throughput).…”
Section: Related Pieces Of Workmentioning
confidence: 99%
See 2 more Smart Citations