By Topic

Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy

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
$31 $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

2 Author(s)
Narayanan, K.R. ; Dept. of Electr. & Comput. Eng., Texas A&M Univ., College Station, TX, USA ; Pfister, H.D.

We consider a multi-user wireless network in which each user has one packet of information to transmit to a central receiver. We study an uncoordinated paradigm where the users send their packet a random number of times according to a probability distribution. Instead of discarding the collided packets, the receiver performs iterative collision resolution. Recently, a few studies have shown that the iterative collision resolution process can be viewed as message-passing decoding on an appropriately defined Tanner graph. Using this equivalence, they used standard techniques to numerically optimize the probability distribution and demonstrated substantial throughput improvement over slotted ALOHA. In this paper, we show that the well-known soliton distribution is an optimal probability distribution and that the resulting throughput efficiency can be arbitrarily close to 1.

Published in:

Turbo Codes and Iterative Information Processing (ISTC), 2012 7th International Symposium on

Date of Conference:

27-31 Aug. 2012