Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding
Mathematical Analysis of Throughput Bounds in Random Access with ZigZag Decoding
复制标题
ZigZag 解码随机访问吞吐量界限的数学分析
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
M. Neely
中科院分区：
文献类型：
--
作者：
Jeongyeup Paek;M. Neely
我们研究了ZigZag解码（Gollakota和Katabi 2008）在多用户随机接入系统中可以实现的吞吐量提高。ZigZag是最近提出的802.11接收器设计，其允许成功接收分组而不管冲突。因此，无线LAN的最大可实现吞吐量可以通过使用ZigZag解码来显著提高。我们分析了吞吐量的界限，在四个不同的理想化的多址系统模型的情况下，使用ZigZag解码。我们还提供了Aloha和CSMA模型的精确封闭形式的解决方案是不可行的计算结果。我们的分析和仿真结果表明，ZigZag解码可以显着提高随机接入系统的最大吞吐量。
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.