Iterative Collision Resolution for Slotted ALOHA: An Optimal Uncoordinated Transmission Policy Conference Paper

abstract

• 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. 2012 IEEE.

name of conference

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

authors

• Narayanan, Krishna

published proceedings

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

author list (cited authors)

• Narayanan, K. R., & Pfister, H. D.

citation count

• 70

complete list of authors

• Narayanan, Krishna R||Pfister, Henry D

publication date

• August 2012

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• International Symposium on Turbo Codes and Iterative Information Processing, ISTC  Journal

Digital Object Identifier (DOI)

• 10.1109/istc.2012.6325214

International Standard Book Number (ISBN) 13

• 9781457721151

start page

• 136

end page

• 139

URL

• http://dx.doi.org/10.1109/istc.2012.6325214