Listen (on the frequency domain) before you talk

Hotnets-IX Pub Date : 2010-10-20 DOI:10.1145/1868447.1868463
Souvik Sen, Romit Roy Choudhury, Srihari Nelakuditi
{"title":"Listen (on the frequency domain) before you talk","authors":"Souvik Sen, Romit Roy Choudhury, Srihari Nelakuditi","doi":"10.1145/1868447.1868463","DOIUrl":null,"url":null,"abstract":"Conventional WiFi networks perform channel contention in time domain. This is known to be wasteful because the channel is forced to remain idle, while all contending nodes are backing off for multiple time slots. This paper proposes to break away from convention and recreate the backing off operation in the frequency domain. Our basic idea is to pretend that OFDM subcarriers are integer numbers, and thereby, view today's random backoff process as equivalent to transmitting on a randomly chosen subcarrier. By employing a second antenna to listen to all the subcarriers, each node can determine whether its chosen integer (or subcarrier) is the smallest among all others. In fact, each node can even determine the rank of its chosen integer, enabling the feasibility of a TDMA-like schedule from every round of contention. We develop these ideas into a Time to Frequency (T2F) protocol and prototype it on a small testbed of 8 USRPs. Experiments confirm its feasibility, along with promising throughput gains of more than 35% at high bit rates. A fuller design and thorough evaluation of T2F is a topic of ongoing work.","PeriodicalId":408335,"journal":{"name":"Hotnets-IX","volume":"104 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Hotnets-IX","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1868447.1868463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43

Abstract

Conventional WiFi networks perform channel contention in time domain. This is known to be wasteful because the channel is forced to remain idle, while all contending nodes are backing off for multiple time slots. This paper proposes to break away from convention and recreate the backing off operation in the frequency domain. Our basic idea is to pretend that OFDM subcarriers are integer numbers, and thereby, view today's random backoff process as equivalent to transmitting on a randomly chosen subcarrier. By employing a second antenna to listen to all the subcarriers, each node can determine whether its chosen integer (or subcarrier) is the smallest among all others. In fact, each node can even determine the rank of its chosen integer, enabling the feasibility of a TDMA-like schedule from every round of contention. We develop these ideas into a Time to Frequency (T2F) protocol and prototype it on a small testbed of 8 USRPs. Experiments confirm its feasibility, along with promising throughput gains of more than 35% at high bit rates. A fuller design and thorough evaluation of T2F is a topic of ongoing work.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
说话前先听(在频域上)
传统WiFi网络在时域内进行信道争用。众所周知,这是一种浪费,因为通道被迫保持空闲状态,而所有竞争节点都退出多个时隙。本文提出了打破常规,在频域内重建退变运算的方法。我们的基本思想是假设OFDM子载波是整数,因此,将今天的随机回退过程视为等同于在随机选择的子载波上传输。通过使用第二个天线来监听所有子载波,每个节点可以确定其选择的整数(或子载波)是否在所有其他整数中最小。实际上,每个节点甚至可以确定其选择的整数的秩,从而在每一轮争用中实现类似tdma的调度的可行性。我们将这些想法发展成时间对频率(T2F)协议,并在8个usrp的小型测试平台上对其进行原型化。实验证实了它的可行性,以及在高比特率下超过35%的吞吐量增益。更全面地设计和彻底地评估T2F是一个正在进行的工作主题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Listen (on the frequency domain) before you talk DevoFlow: cost-effective flow management for high performance enterprise networks "Extra-sensory perception" for wireless networks Using strongly typed networking to architect for tussle Diagnosing mobile applications in the wild
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1