Mathematical Analysis of Throughput Bounds in Random Access with ZIGZAG Decoding
- Authors
- Paek, Jeongyeup; Neely, Michael J.
- Issue Date
- Apr-2011
- Publisher
- SPRINGER
- Keywords
- ZigZag decoding; random access; throughput analysis; CSMA
- Citation
- MOBILE NETWORKS & APPLICATIONS, v.16, no.2, pp 255 - 266
- Pages
- 12
- Journal Title
- MOBILE NETWORKS & APPLICATIONS
- Volume
- 16
- Number
- 2
- Start Page
- 255
- End Page
- 266
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/47686
- DOI
- 10.1007/s11036-010-0290-2
- ISSN
- 1383-469X
1572-8153
- 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 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/47686)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.