Comb Decoding towards Collision-Free WiFi

被引:0
作者
Zhao, Shangqing [1 ]
Qu, Zhe [1 ]
Luo, Zhengping [1 ]
Lu, Zhuo [1 ]
Liu, Yao [1 ]
机构
[1] Univ S Florida, Tampa, FL 33620 USA
来源
PROCEEDINGS OF THE 17TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION | 2020年
关键词
ALGORITHMS; RECOVERY;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Packet collisions happen every day in WiFi networks. RT-S/CTS is a widely-used approach to reduce the cost of collisions of long data packets as well as combat the hidden terminal problem. In this paper, we present a new design called comb decoding (CombDec) to efficiently resolve RTS collisions without changing the 802.11 standard. We observe that an RTS payload, when treated as a vector in a vector space, exhibits a comb-like distribution; i.e., a limited number of vectors aremuchmore likely to be used than the others due to RTS payload construction and firmware design. This enables us to reformulate RTS collision resolution as a sparse recovery problem. We create algorithms that carefully construct the search range for sparse recovery, making the complexity feasible for system design and implementation. Experimental results show that CombDec boosts the WiFi throughput by 33.6% - 46.2% in various evaluation scenarios.
引用
收藏
页码:933 / 951
页数:19
相关论文
共 63 条
[41]  
Katti S., 2007, P ACM SIGCOMM
[42]  
Katti S., 2006, P ACM SIGCOMM
[43]  
Kim S. M., 2015, P ACM MOBICOM
[44]  
Kong Linghe, 2015, P ACM MOBICOM
[45]  
Kumar S., 2013, Proc. ACM SIGCOMM
[46]  
Li Tianji, 2011, P ACM MOBICOM
[47]  
Miller Kyle, 2012, P ACM MOBIHOC
[48]   INTERIOR PATH FOLLOWING PRIMAL-DUAL ALGORITHMS .1. LINEAR-PROGRAMMING [J].
MONTEIRO, RDC ;
ADLER, I .
MATHEMATICAL PROGRAMMING, 1989, 44 (01) :27-41
[49]  
Nayak P, 2017, IEEE INFOCOM SER
[50]  
Qualcomm, 2019, QUALC IPQ4018 SOC