Selfish Users in Graph-Based Random Access

被引：0
|
作者：
Clazzer, Federico [1 ]
机构：
[1] German Aerosp Ctr DLR, Inst Commun & Nav, D-82234 Oberpfaffenhofen, Wessling, Germany
来源：
2018 IEEE 29TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC) | 2018年
关键词：
CODED SLOTTED ALOHA; GAME; CRDSA;
D O I：
暂无
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
Recent advances in random access (RA) have highlighted the performance improvement yield by the joint use of proactive replication of packets and successive interference cancellation (SIC). Users send multiple replicas and collisions are resolved via iterative cancellation of the interference. The optimal choice for the number of replicas is drawn from a properly designed probability mass function (PMF). Selfish uncoordinated users are prone to choose the maximum number of replicas and diverge from the designed PMF. Exploiting game theoretic tools, we describe such scenario as a non-cooperative game. Properly setting the cost per replica transmission, we are able to drive the Nash equilibrium to the designed PMF and thus hinder the users to diverge. Numerical results complement the study, showing the practical impact of the proposed solution.
引用
收藏
页码：1960 / 1966
页数：7
相关论文
共 50 条
  • [1] Graph-Based Random Sampling for Massive Access in IoT Networks
    Zhai, Shiyu
    Li, Guobing
    Qi, Zefeng
    Zhang, Guomei
    2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
  • [2] Distributed Dynamic Spectrum Access in Multichannel Random Access Networks with Selfish Users
    Ozyagci, Ali
    Zander, Jens
    2010 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC 2010), 2010,
  • [3] A Graph-Based Collision Resolution Scheme for Asynchronous Unsourced Random Access
    Li, Tianya
    Wu, Yongpeng
    Zhang, Wenjun
    Xia, Xiang-Gen
    Xiao, Chengshan
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 4014 - 4019
  • [4] A Graph-Based Random Access Protocol for Crowded Massive MIMO Systems
    Han, Huimei
    Li, Ying
    Guo, Xudong
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (11) : 7348 - 7361
  • [5] Efficient Incentive Scheme for Wireless Random Channel Access with Selfish Users
    Karouit, Abdelillah
    ADVANCES IN UBIQUITOUS NETWORKING, 2016, 366 : 27 - 38
  • [6] Graph-Based Random Access for the Collision Channel without Feedback: Capacity Bound
    Paolini, Enrico
    Liva, Gianluigi
    Chiani, Marco
    2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011), 2011,
  • [7] On the Performance of a Full-Duplex Receiver for Graph-Based Random Access Schemes
    Munari, Andrea
    Clazzer, Federico
    Maehoenen, Petri
    2017 IEEE 18TH INTERNATIONAL WORKSHOP ON SIGNAL PROCESSING ADVANCES IN WIRELESS COMMUNICATIONS (SPAWC), 2017,
  • [8] Vehicular Massive Multiway Relay Networks Applying Graph-Based Random Access
    Purwita, Ardimas Andi
    Anwar, Khoirul
    2015 IEEE VEHICULAR NETWORKING CONFERENCE (VNC), 2015, : 227 - 234
  • [9] Sparse IDMA: A Joint Graph-Based Coding Scheme for Unsourced Random Access
    Pradhan, Asit Kumar
    Amalladinne, Vamsi K.
    Vem, Avinash
    Narayanan, Krishna R.
    Chamberland, Jean-Francois
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (11) : 7124 - 7133
  • [10] Shifted Coded Slotted ALOHA: A Graph-Based Random Access with Shift Operation
    Emoto, Tomokazu
    Nozaki, Takayuki
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2019, E102A (12) : 1611 - 1621
12345