DocumentCode
253124
Title
Sign-compute-resolve for random access
Author
Goseling, Jasper ; Stefanovic, Cedomir ; Popovski, Petar
Author_Institution
Stochastic Oper. Res., Univ. of Twente, Enschede, Netherlands
fYear
2014
fDate
Sept. 30 2014-Oct. 3 2014
Firstpage
675
Lastpage
682
Abstract
We present an approach to random access that is based on three elements: physical-layer network coding, signature codes and tree splitting. Upon occurrence of a collision, physical-layer network coding enables the receiver to decode the sum of the information that was transmitted by the individual users. For each user this information consists of the data that the user wants to communicate as well as the user´s signature. As long as no more than K users collide, their identities can be recovered from the sum of their signatures. A splitting protocol is used to deal with the case that more than K users collide. We measure the performance of the proposed method in terms of user resolution rate as well as overall throughput of the system. The results show that our approach significantly increases the performance of the system even compared to coded random access, where collisions are not wasted, but are reused in successive interference cancellation.
Keywords
interference (signal); network coding; protocols; trees (mathematics); physical-layer network coding; random access; sign-compute-resolve; signature codes; splitting protocol; successive interference cancellation; tree splitting; Adders; Decoding; Network coding; Protocols; Receivers; Throughput; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Communication, Control, and Computing (Allerton), 2014 52nd Annual Allerton Conference on
Conference_Location
Monticello, IL
Type
conf
DOI
10.1109/ALLERTON.2014.7028520
Filename
7028520
Link To Document