Random Multiple Access With Hierarchical Users

被引:2
|
作者
Heydaryan, Faeze [1 ]
Luo, Jie [1 ]
机构
[1] Colorado State Univ, Dept Elect & Comp Engn, Ft Collins, CO 80523 USA
基金
美国国家科学基金会;
关键词
Media Access Protocol; Receivers; Channel coding; Wireless sensor networks; Wireless networks; Transmitters; Reliability; Random access; hierarchical users; distributed algorithm; wireless network; STOCHASTIC-APPROXIMATION; DECENTRALIZED CONTROL; COMMUNICATION; STRATEGIES;
D O I
10.1109/TWC.2021.3075451
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Classical random access protocols support prioritized user groups by allowing a high priority user to transmit with a relatively high probability. However, when a high priority user competes for the channel with a large number of low priority users, transmission success probability of the high priority user can still diminish to zero. In this paper, a distributed medium access control (MAC) framework is proposed to support hierarchical user groups in a random multiple access system in the following senses. First, when the number of primary users is small, the MAC framework guarantees that channel availability should stay above a pre-determined threshold no matter how many secondary users are competing for the channel. Second, when the number of primary users is large, the MAC framework drives transmission probabilities of the secondary users to zero but does not reject channel access to the primary users. These properties are achieved in a distributed environment without direct message exchange between users, without knowledge on the number of users, and without knowing whether each transmission should belong to a primary or a secondary user. The MAC framework is also extended to systems where each user can be equipped with multiple transmission options.
引用
收藏
页码:6622 / 6633
页数:12
相关论文
共 50 条
  • [1] Supporting Hierarchical Users in a Random Multiple Access System
    Heydaryan, Faeze
    Luo, Jie
    2022 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2022, : 1761 - 1766
  • [2] Random access algorithm for users with multiple priorities
    Buot, T
    Watanabe, F
    IEICE TRANSACTIONS ON COMMUNICATIONS, 1996, E79B (03) : 237 - 243
  • [3] Hierarchical Beamforming in Random Access Channels
    Agustin, Adrian
    Vidal, Josep
    Cabrera-Bean, Margarita
    2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
  • [4] Multiple Access Channels with Byzantine Users
    Sangwan, Neha
    Akshi, Mayank B.
    Dey, Bikash Kumar
    Prabhakaran, Vinod M.
    2019 IEEE INFORMATION THEORY WORKSHOP (ITW), 2019, : 160 - 164
  • [5] Multiple Access Channels with Adversarial Users
    Sangwan, Nara
    Bakshi, Mayank
    Dey, Bikash Kurnar
    Prahliakaran, Vinod M.
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 435 - 439
  • [6] On Multiple Access Random Medium Access Control
    Cui, Tao
    Ho, Tracey
    2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, : 1869 - 1873
  • [7] Spatial random multiple access with multiple departure
    Foss, Sergey
    Turlikov, Andrey
    Grankin, Maxim
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 2728 - 2731
  • [8] Selfish Users in Graph-Based Random Access
    Clazzer, Federico
    2018 IEEE 29TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2018, : 1960 - 1966
  • [9] Index Modulation Multiple Access for Unsourced Random Access
    Su, Yiwei
    Zheng, Jianping
    IEEE WIRELESS COMMUNICATIONS LETTERS, 2023, 12 (05) : 794 - 798
  • [10] A Hierarchical Game for Uplink CDMA Transmissions with Random Active Users
    Hayel, Yezekael
    Ramos R, Victor M.
    Tuffin, Bruno
    ICN 2008: SEVENTH INTERNATIONAL CONFERENCE ON NETWORKING, PROCEEDINGS, 2008, : 551 - +