Time-Offset ALOHA With SIC
- Authors
- Seo, J.; Hu, Y.; Jin, H.
- Issue Date
- Nov-2023
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- Decoding; Interference cancellation; Internet of Things; Iterative decoding; NOMA; Online control; Quality of service; random access; renewal theorem; slotted ALOHA; Throughput; time offset
- Citation
- IEEE Transactions on Mobile Computing, v.22, no.11, pp 1 - 13
- Pages
- 13
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE Transactions on Mobile Computing
- Volume
- 22
- Number
- 11
- Start Page
- 1
- End Page
- 13
- URI
- https://scholarworks.gnu.ac.kr/handle/sw.gnu/2646
- DOI
- 10.1109/TMC.2022.3197208
- ISSN
- 1536-1233
1558-0660
- Abstract
- Internet-of-Things (IoT) applications for real-time control gradually increase and become computationally demanding. To provide better quality-of-service (QoS) in random access (RA) system based on slotted ALOHA (S-ALOHA), this work proposes a novel S-ALOHA system with cross-slot successive interference cancellation (SIC). To facilitate SIC, we design each slot with several time offsets (TOs) and one packet transmission time, where the length of overall TOs is a fraction of a packet transmission time. Users (re)transmit at the boundary of a TO randomly selected. This enables the base station (BS) to distinguish who makes the first and last transmissions in a collision slot and ask immediate retransmissions from them in the subsequent one or two slots. With these retransmitted packets, the BS performs SIC for the previously collided packets. We analyze the system throughput and the distribution of RA delay. The results show that the proposed system can achieve throughput from 0.5 (packets per packet transmission time) at minimum to 0.856 at maximum, depending on the number of TOs and the length of TO. In addition, to run this system stably, we propose a Bayesian-optimized backoff algorithm that enables users to use throughput-optimal (re)transmission probability. It is demonstrated that the proposed backoff algorithms can achieve the throughput close to genie-aided (GA) system. IEEE
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 해양과학대학 > 지능형통신공학과 > Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.