DocumentCode
3663053
Title
Slotted ALOHA with compute-and-forward
Author
Shwan Ashrafi;Chen Feng;Sumit Roy;Frank R. Kschischang
Author_Institution
EE Department, University of Washington, Seattle, USA
fYear
2015
fDate
6/1/2015 12:00:00 AM
Firstpage
571
Lastpage
575
Abstract
The benefit of applying compute-and-forward (C&F) to slotted ALOHA (S-ALOHA) systems is studied. A Markov chain model is introduced, and an approximate stability region is given. It is shown that the approximate region is asymptotically exact as the number of users tends to infinity. It is also shown that the approximate region is very accurate even for systems with a small number of users. Further, based on the approximate region, simple expressions for the throughput and delay performance of S-ALOHA with C&F are derived, demonstrating the significant advantages offered by C&F.
Keywords
"Stability analysis","Asymptotic stability","Delays","Approximation methods","Throughput","Markov processes","Receivers"
Publisher
ieee
Conference_Titel
Information Theory (ISIT), 2015 IEEE International Symposium on
Electronic_ISBN
2157-8117
Type
conf
DOI
10.1109/ISIT.2015.7282519
Filename
7282519
Link To Document