Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding

被引:0
|
作者
Jeongyeup Paek
Michael J. Neely
机构
[1] University of Southern California,Department of Computer Science
[2] University of Southern California,Department of Electrical Engineering—Systems Division
来源
Mobile Networks and Applications | 2011年 / 16卷
关键词
ZigZag decoding; random access; throughput analysis; CSMA;
D O I
暂无
中图分类号
学科分类号
摘要
We investigate the throughput improvement that ZigZag decoding (Gollakota and Katabi 2008) can achieve in multi-user random access systems. ZigZag is a recently proposed 802.11 receiver design that allows successful reception of packets despite collision. Thus, the maximum achievable throughput of a wireless LAN can be significantly improved by using ZigZag decoding. We analyze the throughput bounds in four different idealized multi-access system models for the case when ZigZag decoding is used. We also provide results for the Aloha and CSMA models where exact closed form solutions are infeasible to calculate. Our analysis and simulation results show that ZigZag decoding can significantly improve the maximum throughput of the random access system.
引用
收藏
页码:255 / 266
页数:11
相关论文
共 50 条
  • [21] Lower bounds on algebraic random access machines
    BenAmram, AM
    Galil, Z
    AUTOMATA, LANGUAGES AND PROGRAMMING, 1995, 944 : 360 - 371
  • [22] Throughput optimized random access channel assignment
    Dutta, Abhinanda
    Weber, Steven
    2022 58TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2022,
  • [23] Throughput of Random Access without Message Passing
    Proutiere, Alexandre
    Yi, Yung
    Chiang, Mung
    2008 42ND ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1-3, 2008, : 509 - +
  • [24] On the Stability and Throughput of Compressive Random Access in MTC
    Choi, Jinho
    2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2017,
  • [25] Analysis of the throughput of random-access multichannel CDMA systems with multiuser detection
    Liu, QC
    Zhang, Z
    Scholtz, RA
    ICUPC '96 - 1996 5TH IEEE INTERNATIONAL CONFERENCE ON UNIVERSAL PERSONAL COMMUNICATIONS RECORD, VOLS 1 AND 2, 1996, : 881 - 885
  • [26] A RANDOM ACCESS G-NETWORK: STABILITY, STABLE THROUGHPUT, AND QUEUEING ANALYSIS
    Dimitriou, Ioannis
    Pappas, Nikolaos
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2021, 35 (01) : 111 - 137
  • [27] Throughput Analysis in Asymmetric Two-way Relay Channel with Random Access
    Cocco, G.
    Guenduez, D.
    Ibars, C.
    2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
  • [28] Fundamental causal bounds of quantum random access memories
    Wang, Yunfei
    Alexeev, Yuri
    Jiang, Liang
    Chong, Frederic T.
    Liu, Junyu
    NPJ QUANTUM INFORMATION, 2024, 10 (01)
  • [29] Simple and general bounds on quantum random access codes
    Farkas, Mate
    Miklin, Nikolai
    Tavakoli, Armin
    QUANTUM, 2025, 9 : 1 - 14
  • [30] RANDOM CODING BOUNDS ON THE RATE FOR LIST-DECODING SUPERIMPOSED CODES
    RASHAD, AM
    PROBLEMS OF CONTROL AND INFORMATION THEORY-PROBLEMY UPRAVLENIYA I TEORII INFORMATSII, 1990, 19 (02): : 141 - 149