Prioritized Random MAC Optimization Via Graph-Based Analysis

被引:19
|
作者
Toni, Laura [1 ]
Frossard, Pascal [1 ]
机构
[1] Ecole Polytech Fed Lausanne, Signal Proc Lab LTS4, CH-1015 Lausanne, Switzerland
基金
瑞士国家科学基金会;
关键词
Random MAC strategies; slotted ALOHA; prioritized transmission schemes; successive interference cancellation; bipartite graphs; unequal resource allocation; UNEQUAL ERROR PROTECTION; POISSON BINOMIAL-DISTRIBUTION; RANDOM-ACCESS; NETWORKS; CODES; SELECTION; PROTOCOL; DESIGN;
D O I
10.1109/TCOMM.2015.2494044
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access control protocols. In this work, we consider generic systems where sources in different importance classes compete for a common channel. We propose a new prioritized IRSA algorithm and derive the probability to correctly resolve collisions for data from each source class. We then make use of our theoretical analysis to formulate a new optimization problem for selecting the transmission strategies of heterogenous sources. We optimize both the replication probability per class and the source rate per class, in such a way that the overall system utility is maximized. We then propose a heuristic-based algorithm for the selection of the transmission strategy, which is built on intrinsic characteristics of the iterative decoding methods adopted for recovering from collisions. Experimental results validate the accuracy of the theoretical study and show the gain of well-chosen prioritized transmission strategies for transmission of data from heterogenous classes over shared wireless channels.
引用
收藏
页码:5002 / 5013
页数:12
相关论文
共 50 条
  • [1] Dilution of Ferromagnets via a Random Graph-Based Strategy
    Javarone, Marco Alberto
    Marinazzo, Daniele
    [J]. COMPLEXITY, 2018,
  • [2] Compensation of Motion Artifacts in MRI via Graph-Based Optimization
    Lee, Tung-Ying
    Su, Hong-Ren
    Lai, Shang-Hong
    Chang, Ti-chiun
    [J]. CVPR: 2009 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-4, 2009, : 2192 - +
  • [3] Graph-Based Translation Via Graph Segmentation
    Li, Liangyou
    Way, Andy
    Liu, Qun
    [J]. PROCEEDINGS OF THE 54TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 1, 2016, : 97 - 107
  • [4] Neighbor Discovery in Wireless Networks: A Graph-based Analysis and Optimization
    Stajkic, Andrea
    Clazzer, Federico
    Liva, Gianluigi
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC), 2016, : 511 - 516
  • [5] Graph-based clustering of random point set
    Imiya, A
    Tatara, K
    [J]. STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, PROCEEDINGS, 2004, 3138 : 948 - 956
  • [6] Selfish Users in Graph-Based Random Access
    Clazzer, Federico
    [J]. 2018 IEEE 29TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2018, : 1960 - 1966
  • [7] Graph-based prediction of missing KPIs through optimization and random forests for KPI systems
    Marvin Carl May
    Zeyu Fang
    Michael B. M. Eitel
    Nicole Stricker
    Debarghya Ghoshdastidar
    Gisela Lanza
    [J]. Production Engineering, 2023, 17 : 211 - 222
  • [8] Graph-based prediction of missing KPIs through optimization and random forests for KPI systems
    May, Marvin Carl
    Fang, Zeyu
    Eitel, Michael B. M.
    Stricker, Nicole
    Ghoshdastidar, Debarghya
    Lanza, Gisela
    [J]. PRODUCTION ENGINEERING-RESEARCH AND DEVELOPMENT, 2023, 17 (02): : 211 - 222
  • [9] Graph-Based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA
    Liva, Gianluigi
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2011, 59 (02) : 477 - 487
  • [10] Graph-Based Optimization of Public Lighting Retrofit
    Sedziwy, Adam
    Kotulski, Leszek
    [J]. INTELLIGENT INFORMATION AND DATABASE SYSTEMS (ACIIDS 2020), PT I, 2020, 12033 : 239 - 248