IEEE 802.15.4自适应拥塞避免算法的性能评价

Ki-Chul Noh, Seung-Yeon Lee, Youn-Soon Shin, Kang-Woo Lee, Jong-Suk Ahn
{"title":"IEEE 802.15.4自适应拥塞避免算法的性能评价","authors":"Ki-Chul Noh, Seung-Yeon Lee, Youn-Soon Shin, Kang-Woo Lee, Jong-Suk Ahn","doi":"10.1109/CSE.2010.12","DOIUrl":null,"url":null,"abstract":"Like most wireless network protocols, IEEE 802.15.4 adopts a CA (Congestion Avoidance) algorithm to avoid early collisions of new frames by randomizing its first transmission delay instead of delivering them immediately. The traditional CA scheme of IEEE 802.15.4 selects its random access time from the predetermined range without considering the degree of underlying network congestion. This static behavior often incurs a long delay to settle in the suitable range for the current network load or frequent clashes especially when heavy traffic lasts long. This paper proposes an ACA(Adaptive Congestion Avoidance) algorithm which dynamically adjusts the initial back off range according to the measurement of the average collision rate. It also introduces an analytical model to predict the performance spectrum in which ACA algorithm¡¯s throughput falls. With only small deviations from corresponding simulations, our model shows that ACA scheme can improve the throughput of IEEE 802.15.4 by up-to 41% while shortening the frame delays.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Performance Evaluation of an Adaptive Congestion Avoidance Algorithm for IEEE 802.15.4\",\"authors\":\"Ki-Chul Noh, Seung-Yeon Lee, Youn-Soon Shin, Kang-Woo Lee, Jong-Suk Ahn\",\"doi\":\"10.1109/CSE.2010.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Like most wireless network protocols, IEEE 802.15.4 adopts a CA (Congestion Avoidance) algorithm to avoid early collisions of new frames by randomizing its first transmission delay instead of delivering them immediately. The traditional CA scheme of IEEE 802.15.4 selects its random access time from the predetermined range without considering the degree of underlying network congestion. This static behavior often incurs a long delay to settle in the suitable range for the current network load or frequent clashes especially when heavy traffic lasts long. This paper proposes an ACA(Adaptive Congestion Avoidance) algorithm which dynamically adjusts the initial back off range according to the measurement of the average collision rate. It also introduces an analytical model to predict the performance spectrum in which ACA algorithm¡¯s throughput falls. With only small deviations from corresponding simulations, our model shows that ACA scheme can improve the throughput of IEEE 802.15.4 by up-to 41% while shortening the frame delays.\",\"PeriodicalId\":342688,\"journal\":{\"name\":\"2010 13th IEEE International Conference on Computational Science and Engineering\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 13th IEEE International Conference on Computational Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSE.2010.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th IEEE International Conference on Computational Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE.2010.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

与大多数无线网络协议一样,IEEE 802.15.4采用CA(拥塞避免)算法,通过随机分配其第一次传输延迟,而不是立即发送,来避免新帧的早期冲突。传统的IEEE 802.15.4 CA方案在不考虑底层网络拥塞程度的情况下,从预定范围中选择随机接入时间。这种静态行为通常会导致长时间的延迟,以适应当前网络负载或频繁的冲突,特别是当大流量持续很长时间时。本文提出了一种根据平均碰撞率的测量值动态调整初始退离范围的自适应拥塞避免算法(ACA)。并引入了一个分析模型来预测ACA算法吞吐量下降时的性能谱。在与仿真结果偏差很小的情况下,我们的模型表明ACA方案可以在缩短帧延迟的同时将IEEE 802.15.4的吞吐量提高41%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Performance Evaluation of an Adaptive Congestion Avoidance Algorithm for IEEE 802.15.4
Like most wireless network protocols, IEEE 802.15.4 adopts a CA (Congestion Avoidance) algorithm to avoid early collisions of new frames by randomizing its first transmission delay instead of delivering them immediately. The traditional CA scheme of IEEE 802.15.4 selects its random access time from the predetermined range without considering the degree of underlying network congestion. This static behavior often incurs a long delay to settle in the suitable range for the current network load or frequent clashes especially when heavy traffic lasts long. This paper proposes an ACA(Adaptive Congestion Avoidance) algorithm which dynamically adjusts the initial back off range according to the measurement of the average collision rate. It also introduces an analytical model to predict the performance spectrum in which ACA algorithm¡¯s throughput falls. With only small deviations from corresponding simulations, our model shows that ACA scheme can improve the throughput of IEEE 802.15.4 by up-to 41% while shortening the frame delays.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Hybrid Harmony Search Method Based on OBL GPU-RMAP: Accelerating Short-Read Mapping on Graphics Processors Fractional Exponent Coupling of RIO Optimizing Academic Conference Classification Using Social Tags Availability-Aware Cache Management with Improved RAID Reconstruction Performance
×
引用
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