Mathematical Analysis of Throughput Bounds in Random Access with ZIGZAG Decoding

被引:1
作者
Paek, Jeongyeup [1 ]
Neely, Michael J. [2 ]
机构
[1] Univ So Calif, Dept Comp Sci, Los Angeles, CA 90089 USA
[2] Univ So Calif, Dept Elect Engn, Syst Div, Los Angeles, CA 90089 USA
关键词
ZigZag decoding; random access; throughput analysis; CSMA; CHANNELS; INFORMATION; ALGORITHMS;
D O I
10.1007/s11036-010-0290-2
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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
页数:12
相关论文
共 14 条
[1]  
[Anonymous], AFIPS 70 FALL P NOV
[2]  
Bertsekas D. P., 1992, Data Networks, V2nd
[3]   TREE ALGORITHMS FOR PACKET BROADCAST CHANNELS [J].
CAPETANAKIS, JI .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (05) :505-515
[4]   Information theory and communication networks: An unconsummated union [J].
Ephremides, A ;
Hajek, B .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2416-2434
[5]  
Gollakota S., 2008, SIGCOMM 08
[6]   SUFFICIENT CONDITION FOR NONERGODICITY OF A MARKOV-CHAIN [J].
KAPLAN, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (04) :470-471
[7]  
KLEINROCK L, 1975, IEEE T COMMUN, V23, P1400, DOI 10.1109/TCOM.1975.1092768
[8]   A CLASS OF EFFICIENT CONTENTION RESOLUTION ALGORITHMS FOR MULTIPLE ACCESS CHANNELS [J].
MOSELY, J ;
HUMBLET, PA .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1985, 33 (02) :145-151
[9]  
MUTSUURA K, 1989, IEEE INT C COMMU ICC, V2, P938
[10]  
Namislo C., 1984, IEEE Journal on Selected Areas in Communications, VSAC-2, P583, DOI 10.1109/JSAC.1984.1146088