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

A simple window random access algorithm with advantageous properties

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0
10

Year Published

1991
1991
2007
2007

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 94 publications
(39 citation statements)
references
References 8 publications
0
29
0
10
Order By: Relevance
“…We performed throughput analysis for both cases (A) and (B). The results are exhibited in Table 2, together with those for the 2-Cell Algorithm in [13]. Table 2, we notice that the throughput of the 3-cell algorithm degrades gracefully in the presence of feedback errors.…”
Section: -Cell Algorithmmentioning
confidence: 86%
See 1 more Smart Citation
“…We performed throughput analysis for both cases (A) and (B). The results are exhibited in Table 2, together with those for the 2-Cell Algorithm in [13]. Table 2, we notice that the throughput of the 3-cell algorithm degrades gracefully in the presence of feedback errors.…”
Section: -Cell Algorithmmentioning
confidence: 86%
“…The LSRAH class includes protocols which use as a core some Limited Sensing Random Access (LSRA) protocol [13], in hybrid combination with usually some variation of the same protocol. The LSRA class requires that a user be monitoring consecutive channel feedbacks, from the time that he generates a request for signaling to the time that his signaling is successfully transmitted, a requirement feasible in the wireless environment via carrier sensing on the corresponding signaling channel.…”
Section: Protocols For Signalingmentioning
confidence: 99%
“…Video requirements change frequently over time and it is impossible to ensure that their demands will reach the BS successfully if we use techniques similar to the ones described in [13]. The two-cell stack reservation random access algorithm [14] is used to resolve the collisions, among video request packets. After the end of the video contention period, ftp terminals without a reservation and with sessions ready for transmission, begin their contention in order to reserve information slots.…”
Section: Frame Structure Base Station Scheduling and Actions Of The mentioning
confidence: 99%
“…After the end of the video contention period, ftp terminals without a reservation and with sessions ready for transmission, begin their contention in order to reserve information slots. In the case that two or more ftp request packets collide, the two-cell stack random access algorithm [14] is used to resolve the collision, due to its operational simplicity, stability and high throughput compared to PRMA [15]. Video and data terminals do not exhaust their attempts for a reservation within the request intervals.…”
Section: Frame Structure Base Station Scheduling and Actions Of The mentioning
confidence: 99%
“…The two-cell stack reservation random access algorithm [3] is adopted for use by video, voice and data terminals, due to its operational simplicity, stability and relatively high throughput when compared to the PRMA (Aloha-based) [4] and PRMA-like algorithms [5].…”
Section: Channel Structure Actions Of Terminals and System Parametersmentioning
confidence: 99%