By Topic

Packet multiple access for channel with binary feedback, capture, and multiple reception

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
B. Tsybakov ; Qualcomm Inc., San Diego, CA, USA

This paper considers the multiple access of mobile users to a common wireless channel. The channel is slotted and the binary feedback (empty slot/nonempty slot) is sent to all accessing users. If a slot was not empty and only one user transmitted in it, the transmission is considered successful. Only the user, which had the successful transmission, receives information about its success. In the Introduction, the paper gives a review of known multiple-access algorithms for such a channel. Then our algorithm is constructed that has none of the weaknesses of the algorithms discussed in the Introduction. The algorithm is stable, in contrast to the ALOHA algorithm. It can work in a channel with capture and multiple reception. Without them, the algorithm has a throughput of 0.2891. It is shown how capture and multiple reception can increase the algorithm throughput to 0.6548 and decrease the packet delay for some fading models. The average packet delay and variance are found for two fading models. The models are Rayleigh fading with incoherent and coherent combining of joint interference power. The accessing traffic is Poisson.

Published in:

IEEE Transactions on Information Theory  (Volume:50 ,  Issue: 6 )