Multi-User Communication Systems 1981
DOI: 10.1007/978-3-7091-2900-5_4
|View full text |Cite
|
Sign up to set email alerts
|

Collision-Resolution Algorithms and Random-Access Communications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

6
144
0

Year Published

1981
1981
2019
2019

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 229 publications
(159 citation statements)
references
References 6 publications
6
144
0
Order By: Relevance
“…They essentially try to save 'doomed' slots. This can lead for example to the following recursive relationships for the L, : Massey (1981) and Fayolle and Hofri (1982)). …”
Section: Resultsmentioning
confidence: 99%
“…They essentially try to save 'doomed' slots. This can lead for example to the following recursive relationships for the L, : Massey (1981) and Fayolle and Hofri (1982)). …”
Section: Resultsmentioning
confidence: 99%
“…When there is a collision, the reader will not be able to distinguish these signals and identify each individual tag correctly. To overcome this collision problem, several anti-collision algorithms have been proposed in literature [5][6][7][8][9], some of which are presented in the following section in greater details.…”
Section: Rfid Technologymentioning
confidence: 99%
“…It is well known that, although ALOHA-type protocols are easy to implement and attain minimum delays under light load, they suffer from long delays and instability under heavy traffic load. Enhancements of ALOHA include collision resolution techniques that increase the maximum achievable stable throughput [12]. Centrally controlled demand assignment protocols reserve a variable portion of bandwidth for each connection, adjustable to its needs.…”
Section: Medium Access Control In Wireless Atm Backgroundmentioning
confidence: 99%