2014
DOI: 10.5296/npa.v6i3.5557
|View full text |Cite
|
Sign up to set email alerts
|

Framed ALOHA Protocol with FIFO-Blocking and LIFO-Push out Discipline.

Abstract: This paper considers the framed ALOHA protocol for a finite number of terminals. Terminals are single-buffered, i.e. each one can store only one data packet. We derive the throughput and the delay under two types of queue disciplines, first-in-first-out (FIFO) and last-in-first-out (LIFO). It is assumed that terminals are independent each other and generate packets of constant size according to a Bernoulli process. The one slot duration equals to the one packet transmission. The analysis is carried out by mean… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…Then, recounting the number of nodes that are finally considered, it comes to result as N m (r max ) = N c (r max ) × (1 + #M c (r max )), i.e., 1 × (1 + 363) = 364, 7 × (1 + 51) = 364, 19 × (1 + 18) = 361, 37 × (1 + 9) = 370, 61 × (1 + 5) = 366 and 91 × (1 + 3) = 364 which show a small difference of, respectively 0, 0, −3, 6, 2 and 0 nodes, differences that we believe are not significant for our numerical evaluation. For the traffic model, the probability of activity per each sensor has been set to p act = 0.001 and, adopting the FSA protocol during the CONT sub-frame, the permission probability equal to r = 1 [33]. For each one of the six scenarios we did an exhaustive search to find the most suitable parameters N msC , N intra , N msT and N inter ; they are given in Table 7.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…Then, recounting the number of nodes that are finally considered, it comes to result as N m (r max ) = N c (r max ) × (1 + #M c (r max )), i.e., 1 × (1 + 363) = 364, 7 × (1 + 51) = 364, 19 × (1 + 18) = 361, 37 × (1 + 9) = 370, 61 × (1 + 5) = 366 and 91 × (1 + 3) = 364 which show a small difference of, respectively 0, 0, −3, 6, 2 and 0 nodes, differences that we believe are not significant for our numerical evaluation. For the traffic model, the probability of activity per each sensor has been set to p act = 0.001 and, adopting the FSA protocol during the CONT sub-frame, the permission probability equal to r = 1 [33]. For each one of the six scenarios we did an exhaustive search to find the most suitable parameters N msC , N intra , N msT and N inter ; they are given in Table 7.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…For the contention process in the CONT sub-frame, many random access protocols can be considered [2]. For our study, we borrow the proposal presented in [33] where the FSA is adopted. Here we have derived the corresponding output of the contention process at each CH.…”
Section: The Contention Processmentioning
confidence: 99%
See 2 more Smart Citations
“…Finally the second number of the JITEL 2013 Special Issue includes the paper [12] co-authored by V. Casares-Giner et al, from Universidad Politécnica de Valencia. It considers the framed ALOHA protocol for a finite number of terminals.…”
Section: Cellular Sensor and Wireless Communications Papersmentioning
confidence: 99%