Distributed fair channel access in NOMA random access systems

  • Qu, Miao; 
  • Liu, Jie; 
  • Seo, Jun bae; 
  • Jin, Hu
Citations

WEB OF SCIENCE

4
Citations

SCOPUS

8

초록

This paper considers non-orthogonal multiple access (NOMA) systems in which users randomly transmit packets in each slot while the transmit power is adjusted so that the receive power of each packet at the base station can be one of two predetermined values. While the NOMA random access system can support simultaneous transmissions from up to two users with different target receive powers, it complicates the access protocol design as each user not only has to optimize the transmission probability but also has to suitably choose the target receive power. By considering the fact that users may have different capability of choosing the target receive power due to their diverse locations in a cell, we propose an online distributed channel access algorithm which enables the users to adaptively choose the target receive power and control the transmission probability over time through observing channel outcomes such as idle, success and collision. Numerical results demonstrate that the proposed algorithm can optimize the system performance in terms of throughput and access fairness. © 2019 IEEE.

키워드

Fairness; Non-orthogonal multiple access (NOMA); Random access; S-ALOHA; Distributed channels; Fairness; Multiple access; Random access; Random access systems; S- ALOHA; Simultaneous transmission; Transmission probabilities
제목
Distributed fair channel access in NOMA random access systems
저자
Qu, Miao; Liu, Jie; Seo, Jun bae; Jin, Hu
DOI
10.1109/GLOBECOM38437.2019.9013283
발행일
2019-12
유형
Conference Paper
저널명
IEEE Global Communications Conference, Exhibition, & Industry Forum (GLOBECOM)
페이지
1 ~ 6