Throughput of CDM-based Random Access With SINR Capture

by   Hoesang Choi, et al.

Code division multiplexing (CDM)-based random access is used in many practical wireless systems. With CDM-based random access, a set of sequences is reserved for random access. A remote station transmits a random access packet using a randomly selected sequence among the set. If more than one remote stations transmit random access packets using the same sequence simultaneously, performance degrades due to sequence collision. In addition, if more than one remote stations transmit random access packets using different sequences simultaneously, performance also degrades due to interference. Therefore, the performance of CDM-based random access is dependent on both sequence collision and interference. There has been no previous research to analyze the performance of CDM-based random access considering both sequence collision and interference. In this paper, throughput of CDM-based random access is investigated considering both sequence collision and interference based on a signal to interference plus noise ratio (SINR) capture model. Analysis and numerical simulation compare the throughputs of several random access schemes including conventional and channel-adaptive random access. The results show that channel-adaptive random access can achieve significantly higher throughput than conventional random access. In addition, based on the results of this paper, it is possible to analyze the trade-off between the throughput and implementation complexity with increased number of sequences.


page 4

page 5

page 6

page 7

page 15

page 20

page 21

page 23


Shifted Coded Slotted ALOHA

The random access scheme is a fundamental scenario in which users transm...

A Doub-station Access Protocol based on CSMA/CA for Optical Wireless Networks

We propose a doub-station access protocol based on CSMA/CA (DS-CSMA/CA) ...

A High Capacity Preamble Sequence for Random Access in Beyond 5G Networks: Design and Analysis

The widely used Zadoff-Chu sequence (ZC sequence) for random access prea...

Geometric Sequence Decomposition with k-simplexes Transform

This paper presents a computationally-efficient technique for decomposin...

Multi-sequence Spreading Random Access (MSRA) for Compressive Sensing-based Grant-free Communication

The performance of grant-free random access (GF-RA) is limited by the nu...

Channel State Information Based User Censoring in Irregular Repetition Slotted Aloha

Irregular repetition slotted aloha (IRSA) is a massive random access pro...

Random Access Schemes in Wireless Systems With Correlated User Activity

Traditional random access schemes are designed based on the aggregate pr...

Please sign up or login with your details

Forgot password? Click here to reset