Estimating contention of IEEE 802.11 broadcasts based on inter-frame idle slots

Q. Tse, Weisheng Si, J. Taheri
{"title":"Estimating contention of IEEE 802.11 broadcasts based on inter-frame idle slots","authors":"Q. Tse, Weisheng Si, J. Taheri","doi":"10.1109/LCNW.2013.6758508","DOIUrl":null,"url":null,"abstract":"Recent advances in communication technology has enabled vehicles to communicate with each other autonomously through the use of IEEE 802.11p protocol. Vehicle-to-vehicle communication regularly makes use of the broadcast mode transmissions, which are not often used prior to this application. Broadcast mode transmissions are more prone to frame loss from channel contention than unicasts due to its inability to adapt, and are unable to recover lost frames. This makes them very sensitive to channel congestion. In this paper, we first apply a variant of Bianchi et al.'s Markov model of the Distributed Coordination Function (DCF), to show that the observed inter-frame idle slots can be expressed as a probability distribution conditional on the number of saturated stations. It therefore follows that the probability distribution for the number of saturated stations can be estimated from inter-frame idle slots through Bayes Law. Second, we present a novel passive channel congestion estimation technique that observes the inter-frame idle slot counts in any given IEEE 802.11 network and uses a naïve Bayes classifier to estimate the current channel contention in terms of the number of concurrent saturated stations. This technique is evaluated using computer simulations, and is shown to produce more accurate estimates with faster convergence time than the existing technique of observing collision probability using channel busy status as a proxy.","PeriodicalId":290924,"journal":{"name":"38th Annual IEEE Conference on Local Computer Networks - Workshops","volume":"2050 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"38th Annual IEEE Conference on Local Computer Networks - Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCNW.2013.6758508","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Recent advances in communication technology has enabled vehicles to communicate with each other autonomously through the use of IEEE 802.11p protocol. Vehicle-to-vehicle communication regularly makes use of the broadcast mode transmissions, which are not often used prior to this application. Broadcast mode transmissions are more prone to frame loss from channel contention than unicasts due to its inability to adapt, and are unable to recover lost frames. This makes them very sensitive to channel congestion. In this paper, we first apply a variant of Bianchi et al.'s Markov model of the Distributed Coordination Function (DCF), to show that the observed inter-frame idle slots can be expressed as a probability distribution conditional on the number of saturated stations. It therefore follows that the probability distribution for the number of saturated stations can be estimated from inter-frame idle slots through Bayes Law. Second, we present a novel passive channel congestion estimation technique that observes the inter-frame idle slot counts in any given IEEE 802.11 network and uses a naïve Bayes classifier to estimate the current channel contention in terms of the number of concurrent saturated stations. This technique is evaluated using computer simulations, and is shown to produce more accurate estimates with faster convergence time than the existing technique of observing collision probability using channel busy status as a proxy.
基于帧间空闲时隙的IEEE 802.11广播争用估计
通信技术的最新进展使车辆能够通过使用IEEE 802.11p协议自主地相互通信。车对车通信经常使用广播模式传输,在此应用之前通常不使用广播模式传输。广播模式传输比单播更容易因信道争用而丢失帧,因为它无法适应,并且无法恢复丢失的帧。这使得它们对信道拥塞非常敏感。本文首先应用Bianchi等人的分布式协调函数(Distributed Coordination Function, DCF)的马尔可夫模型的一种变体,证明观测到的帧间空闲时隙可以表示为以饱和台站数为条件的概率分布。因此,可以通过贝叶斯定律从帧间空闲时隙估计饱和台站数的概率分布。其次,我们提出了一种新的无源信道拥塞估计技术,该技术在任何给定的IEEE 802.11网络中观察帧间空闲时隙计数,并使用naïve贝叶斯分类器根据并发饱和站的数量估计当前信道争用。利用计算机模拟对该技术进行了评估,结果表明,与使用信道繁忙状态作为代理来观察碰撞概率的现有技术相比,该技术可以产生更准确的估计,并且收敛时间更快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信