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


Conference Paper

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.

Full Text

Duke Authors

Cited Authors

  • Narayanan, KR; Pfister, HD

Published Date

  • December 14, 2012

Published In

Start / End Page

  • 136 - 139

Electronic International Standard Serial Number (EISSN)

  • 2165-4719

International Standard Serial Number (ISSN)

  • 2165-4700

International Standard Book Number 13 (ISBN-13)

  • 9781457721151

Digital Object Identifier (DOI)

  • 10.1109/ISTC.2012.6325214

Citation Source

  • Scopus