Maximum End-to-End Throughput of Chain-Topology Wireless Multi-Hop Networks

Jae-Yong Yoo, JongWon Kim
{"title":"Maximum End-to-End Throughput of Chain-Topology Wireless Multi-Hop Networks","authors":"Jae-Yong Yoo, JongWon Kim","doi":"10.1109/WCNC.2007.781","DOIUrl":null,"url":null,"abstract":"Understanding the maximum end-to-end throughput available with any given wireless multi-hop network is an important, but very challenging task. It may be approximated up to certain degree for several simplified topologies such as chain, cross, and others. Typically, in case of chain-topology wireless multi-hop networks employing IEEE 802.11 DCF (distributed coordination function), the maximum throughput can be derived by calculating 1-hop average throughput considering the so-called bottleneck region. However, this approximation method that utilizes only the 1-hop average throughput is limited in terms of accuracy. Thus, in this paper, after verifying the limitation of 1-hop average approximation for the throughput calculation of chain-topology multi-hop wireless networks, a refined calculation scheme is proposed by additionally considering the deviation of throughput. Especially, we focus on the fact that the throughput deviation could lead to collisions, and the throughput deviation happens due to the summation of uniformly distributed backoff times of IEEE 802.11 DCF. With several ns-2-based network simulations, we verify the impact of selected temporal variations to the throughput calculation and thus validate the improved accuracy of proposed calculation scheme.","PeriodicalId":292621,"journal":{"name":"2007 IEEE Wireless Communications and Networking Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Wireless Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2007.781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

Understanding the maximum end-to-end throughput available with any given wireless multi-hop network is an important, but very challenging task. It may be approximated up to certain degree for several simplified topologies such as chain, cross, and others. Typically, in case of chain-topology wireless multi-hop networks employing IEEE 802.11 DCF (distributed coordination function), the maximum throughput can be derived by calculating 1-hop average throughput considering the so-called bottleneck region. However, this approximation method that utilizes only the 1-hop average throughput is limited in terms of accuracy. Thus, in this paper, after verifying the limitation of 1-hop average approximation for the throughput calculation of chain-topology multi-hop wireless networks, a refined calculation scheme is proposed by additionally considering the deviation of throughput. Especially, we focus on the fact that the throughput deviation could lead to collisions, and the throughput deviation happens due to the summation of uniformly distributed backoff times of IEEE 802.11 DCF. With several ns-2-based network simulations, we verify the impact of selected temporal variations to the throughput calculation and thus validate the improved accuracy of proposed calculation scheme.
链拓扑无线多跳网络的最大端到端吞吐量
了解任何给定的无线多跳网络的最大端到端吞吐量是一项重要但非常具有挑战性的任务。它可以在一定程度上近似于一些简化的拓扑结构,如链、交叉和其他。通常,在采用IEEE 802.11 DCF (distributed coordination function)的链拓扑无线多跳网络中,考虑到所谓的瓶颈区域,通过计算1跳平均吞吐量可以得到最大吞吐量。然而,这种仅利用1跳平均吞吐量的近似方法在准确性方面受到限制。因此,本文在验证了链拓扑多跳无线网络吞吐量计算中1跳平均近似的局限性后,提出了一种额外考虑吞吐量偏差的精细化计算方案。我们特别关注了吞吐量偏差可能导致碰撞的事实,而吞吐量偏差的发生是由于IEEE 802.11 DCF的均匀分布后退时间的总和。通过几个基于ns-2的网络模拟,我们验证了所选择的时间变化对吞吐量计算的影响,从而验证了所提出的计算方案的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信