DocumentCode
939324
Title
Poisson multiple-access contention with binary feedback
Author
Mehravari, Nader ; Berger, Toby
Volume
30
Issue
5
fYear
1984
fDate
9/1/1984 12:00:00 AM
Firstpage
745
Lastpage
751
Abstract
Communication over a random multiple-access, collision-type, time-slotted, packet-switched channel with binary feedback is considered for a Poisson infinite-user model. Three different types of binary feedback are introduced and confusion resolution algorithms (CRA) are discussed for each. The CRA proposed for the feedback that tells only whether or not there was a collision in the previous slot achieves a throughput of
. The CRA proposed for the feedback that tells whether or not the previous slot was empty achieves a throughput of
.
. The CRA proposed for the feedback that tells whether or not the previous slot was empty achieves a throughput of
.Keywords
Feedback communication; Multiaccess communication; Packet switching; Poisson processes; Data compression; Feedback; Image processing; Image recognition; Image restoration; Image texture analysis; Lattices; Speech synthesis; Statistical analysis; Stochastic processes;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1984.1056956
Filename
1056956
Link To Document