Math @ Duke

Publications [#319343] of Henry Pfister
Papers Published
 Narayanan, KR; Pfister, HD, Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy,
International Symposium on Turbo Codes and Iterative Information Processing, Istc
(December, 2012),
pp. 136139, IEEE, ISBN 9781457721151 [doi]
(last updated on 2019/07/19)
Abstract: We consider a multiuser 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 messagepassing 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 wellknown soliton distribution is an optimal probability distribution and that the resulting throughput efficiency can be arbitrarily close to 1. © 2012 IEEE.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

