.png){kind=icon}
.png){kind=icon}
Return
Practical Splitting Algorithm for Multi-Channel Slotted Random Access Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TMC.2019.2935970.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For slotted random access systems with a single channel, the slotted ALOHA (S-ALOHA) protocol shows 0.368 (packets/slot) as the maximum throughput, whereas some splitting (or tree) algorithms exhibit 0.487 (packets/slot). The S-ALOHA protocol has been widely adopted even for multi-channel systems such as Long-Term Evolution (LTE), as it is more practically implementable. However, the throughput of each channel in multi-channel S-ALOHA is limited to 0.368. In order to overcome this limit and some implementational drawbacks of the existing splitting algorithms, this paper proposes a novel splitting algorithm for multi-channel slotted systems which can also adapt to dynamic system situations through estimating the number of users who have packet to transmit. We analyze the throughput of our proposed algorithm and show that the proposed algorithm is more practical than the first-come first-serve (FCFS) algorithm and shows smaller access delay than the FCFS algorithm even for a single channel system. For M-channel systems, the proposed algorithm yields the maximum throughput of 0.487M. Extensive simulations validate our analytical results.
Keywords:
S-ALOHA
Bayesian estimation
multi-channel
first-come first-serve (FCFS)
collision resolution period (CRP)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.2
Papers:
5.6K
Citations:
1.8W
View more organizations