2000
DOI: 10.1109/25.832990
|View full text |Cite
|
Sign up to set email alerts
|

Performance and stability analysis of buffered slotted ALOHA protocols using tagged user approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 64 publications
(5 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…FIGURE 3: Probability flow chart of the transmission buffer analysis of the queue can be carried out similarly to [41]. The total probability flow through any closed boundary must be zero, so for the k-th user according to Figure 3, the following needs to hold,…”
Section: A Delay Analysis Of the Gfra Buffermentioning
confidence: 99%
See 2 more Smart Citations
“…FIGURE 3: Probability flow chart of the transmission buffer analysis of the queue can be carried out similarly to [41]. The total probability flow through any closed boundary must be zero, so for the k-th user according to Figure 3, the following needs to hold,…”
Section: A Delay Analysis Of the Gfra Buffermentioning
confidence: 99%
“…Now that g 0,k is known, every g i,k can be calculated using (5). Furthermore, the average queue length of the k-th user can be found as [41],…”
Section: A Delay Analysis Of the Gfra Buffermentioning
confidence: 99%
See 1 more Smart Citation
“…Several research groups have used the buffers to improve the ALOHA protocol's performance [113,114]. In [115] the authors developed an approximation approach for analyzing the S-ALOHA technique, which is based on a small user group with restricted storage capacity. The assumption of channel asymmetry was the main proof of concept of their method.…”
Section: (V) Buffered Aloha Protocolmentioning
confidence: 99%
“…Develop a novel approach to model a VLC network operating the IEEE 802.15.7 CSM-CA protocol as a network of mutually dependent queues whose inter-arrival and service time distributions are of the general form, i.e., a network of G/G/1 queues. Subsequently, apply the principles of the tagged user analysis [23][24][25][26] to define the key assumptions under which dependency is decoupled, considering the distinct contention behaviour used by each node to access the shared channel. Moreover, this study employs the radiometry and photometry characteristics of the VLC [2] and set theory [27] to develop mathematical expressions describing the hidden and exposed node from a perspective of an arbitrary node within the network.…”
Section: Introductionmentioning
confidence: 99%