Cooperative packet recovery in enterprise WLANs

Mahanth K. Gowda, Souvik Sen, Romit Roy Choudhury, Sung-Ju Lee
{"title":"Cooperative packet recovery in enterprise WLANs","authors":"Mahanth K. Gowda, Souvik Sen, Romit Roy Choudhury, Sung-Ju Lee","doi":"10.1109/INFCOM.2013.6566928","DOIUrl":null,"url":null,"abstract":"Cooperative packet recovery has been widely investigated in wireless networks, where corrupt copies of a packet are combined to recover the original packet. While previous work such as MRD (Multi Radio Diversity) and Soft apply combining to bits and bit-confidences, combining at the symbol level has been avoided. The reason is rooted in the prohibitive overhead of sharing raw symbol information between different APs of an enterprise WLAN. We present Epicenter that overcomes this constraint, and combines multiple copies of incorrectly received “symbols” to infer the actual transmitted symbol. Our core finding is that symbols need not be represented in full fidelity - coarse representation of symbols can preserve most of their diversity, while substantially lowering the overhead. We then develop a rate estimation algorithm that actually exploits symbol level combining. Our USRP/GNURadio testbed confirms the viability of our ideas, yielding 40% throughput gain over Soft, and 25-90% over 802.11. While the gains are modest, we believe that they are realistic, and available with minimal modifications to today's EWLAN systems.","PeriodicalId":206346,"journal":{"name":"2013 Proceedings IEEE INFOCOM","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Proceedings IEEE INFOCOM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2013.6566928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

Abstract

Cooperative packet recovery has been widely investigated in wireless networks, where corrupt copies of a packet are combined to recover the original packet. While previous work such as MRD (Multi Radio Diversity) and Soft apply combining to bits and bit-confidences, combining at the symbol level has been avoided. The reason is rooted in the prohibitive overhead of sharing raw symbol information between different APs of an enterprise WLAN. We present Epicenter that overcomes this constraint, and combines multiple copies of incorrectly received “symbols” to infer the actual transmitted symbol. Our core finding is that symbols need not be represented in full fidelity - coarse representation of symbols can preserve most of their diversity, while substantially lowering the overhead. We then develop a rate estimation algorithm that actually exploits symbol level combining. Our USRP/GNURadio testbed confirms the viability of our ideas, yielding 40% throughput gain over Soft, and 25-90% over 802.11. While the gains are modest, we believe that they are realistic, and available with minimal modifications to today's EWLAN systems.
企业无线局域网中的协同包恢复
协作包恢复在无线网络中得到了广泛的研究,在无线网络中,一个包的损坏副本被组合起来恢复原始包。虽然以前的工作如MRD(多无线电分集)和Soft将组合应用于位和位置信度,但避免了符号级的组合。其根源在于在企业WLAN的不同ap之间共享原始符号信息的开销过高。我们提出了克服这一限制的震中,并结合了错误接收的“符号”的多个副本来推断实际传输的符号。我们的核心发现是符号不需要完全保真地表示——符号的粗表示可以保留它们的大部分多样性,同时大大降低开销。然后,我们开发了一种实际利用符号级组合的速率估计算法。我们的USRP/GNURadio测试平台证实了我们想法的可行性,比Soft的吞吐量提高40%,比802.11的吞吐量提高25-90%。虽然收益不大,但我们相信它们是现实的,并且可以对当今的EWLAN系统进行最小的修改。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信