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 条
  • [31] LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes
    Ghazi, Badih
    Lee, Euiwoong
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (06) : 4423 - 4437
  • [32] Topological lower bounds on algebraic random access machines
    Ben-Amram, AM
    Galil, Z
    SIAM JOURNAL ON COMPUTING, 2002, 31 (03) : 722 - 761
  • [33] To the mathematical analysis of algebraic sequential decoding
    Zigangirov, K.Sh.
    Problemy Peredachi Informatsii, 1992, 28 (01): : 3 - 13
  • [34] Analysis of a Reservation-Based Random Access Network: Throughput Region and Power Consumption
    Hsu, Fu-Te
    Su, Hsuan-Jung
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (01) : 237 - 247
  • [35] Exact throughput analysis of random cooperative medium access control networks in the presence of shadowing
    Nikbakht, Homa
    Rabiei, Amir Masoud
    Shah-Mansouri, Vahid
    IET COMMUNICATIONS, 2017, 11 (15) : 2261 - 2268
  • [36] Throughput Analysis of the Nonorthogonal CSK/SS Random Access System on Communication between Users
    Komuro, Nobuyoshi
    Habuchi, Hiromasa
    2009 IEEE 20TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2009, : 162 - 166
  • [37] Stable Throughput and Delay Analysis of a Random Access Network With Queue-Aware Transmission
    Dimitriou, Ioannis
    Pappas, Nikolaos
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (05) : 3170 - 3184
  • [38] Throughput Analysis and User Barring Design for Uplink NOMA-Enabled Random Access
    Yu, Wenjuan
    Foh, Chuan Heng
    Quddus, Atta Ul
    Liu, Yuanwei
    Tafazolli, Rahim
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2021, 20 (10) : 6298 - 6314
  • [39] Throughput bound minimization for random access channel assignment
    Dutta, Abhinanda
    Weber, Steven
    2021 19TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC, AND WIRELESS NETWORKS (WIOPT), 2021,
  • [40] Sum throughput on a random access erasure collision channel
    Narayanan, Hariharan
    Weber, Steven
    2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 687 - 694