Mathematical analysis of throughput bounds in random access with ZIGZAG decoding

Authors:
Jeongyeup Paek;Michael J. Neely
Affiliations:
Department of Computer Science, University of Southern California;Department of Electrical Engineering, University of Southern California
Venue:
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Year:
2009

Citing 6
Cited 1

Data networks (2nd ed.)

Data networks (2nd ed.)
ALOHA packet system with and without slots and capture

ACM SIGCOMM Computer Communication Review
Zigzag decoding: combating hidden terminals in wireless networks

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
THE ALOHA SYSTEM: another alternative for computer communications

AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Optimal Channel-Aware ALOHA Protocol for Random Access in WLANs With Multipacket Reception and Decentralized Channel State Information

IEEE Transactions on Signal Processing
Information theory and communication networks: an unconsummated union

IEEE Transactions on Information Theory

Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding

Mobile Networks and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 three different idealized slotted 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.