Shifted Coded Slotted ALOHA: A Graph-Based Random Access with Shift Operation

Tomokazu EMOTO  Takayuki NOZAKI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E102-A   No.12   pp.1611-1621
Publication Date: 2019/12/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E102.A.1611
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Erasure Correction
Keyword: 
random access,  successive interference cancellation,  shift operation,  zigzag decoding,  density evolution,  

Full Text: PDF(834.2KB)>>
Buy this Article




Summary: 
A random access scheme is a fundamental scenario in which the users transmit through a shared channel and cannot coordinate with each other. Recently, successive interference cancellation (SIC) is introduced into the random access scheme. The SIC decodes the transmitted packets using collided packets. The coded slotted ALOHA (CSA) is a random access scheme using the SIC. The CSA encodes each packet by a local code prior to transmission. It is known that the CSA achieves excellent throughput. On the other hand, it is reported that shift operation improves the decoding performance for packet-oriented erasure correcting coding systems. In this paper, we propose a protocol which applies the shift operation to the CSA. Numerical simulations show that the proposed protocol achieves better throughput and packet loss rate than the CSA. Moreover, we analyze the asymptotic behavior of the throughput and the decoding erasure rate for the proposed protocol by the density evolution.