Finding available bandwidth in multihop mobile wireless networks

Hwa-Chun Lin, Ping-Chin Fung
{"title":"Finding available bandwidth in multihop mobile wireless networks","authors":"Hwa-Chun Lin, Ping-Chin Fung","doi":"10.1109/VETECS.2000.851257","DOIUrl":null,"url":null,"abstract":"This paper proposes a new method for finding the available bandwidth of a path in multihop mobile wireless networks. The proposed method finds the link with the minimum current bandwidth and increases its bandwidth. This process is repeated until the bandwidth of the link with the smallest current bandwidth cannot be increased. Then the available bandwidth of the path is found to be the minimum of the current bandwidths of the links along the path. Extensive simulations are performed to compare the performance of the proposed method and that of the method which calculates the path bandwidth hop by hop. Our simulation results show that using the proposed method in a multihop mobile wireless network produces significantly lower call blocking ratio than the method which calculates the path bandwidth hop by hop.","PeriodicalId":318880,"journal":{"name":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECS.2000.851257","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

This paper proposes a new method for finding the available bandwidth of a path in multihop mobile wireless networks. The proposed method finds the link with the minimum current bandwidth and increases its bandwidth. This process is repeated until the bandwidth of the link with the smallest current bandwidth cannot be increased. Then the available bandwidth of the path is found to be the minimum of the current bandwidths of the links along the path. Extensive simulations are performed to compare the performance of the proposed method and that of the method which calculates the path bandwidth hop by hop. Our simulation results show that using the proposed method in a multihop mobile wireless network produces significantly lower call blocking ratio than the method which calculates the path bandwidth hop by hop.
在多跳移动无线网络中寻找可用带宽
提出了一种在多跳移动无线网络中寻找路径可用带宽的新方法。该方法找到当前带宽最小的链路并增加其带宽。重复此过程,直到当前带宽最小的链路的带宽无法增加。然后找出路径的可用带宽是路径上所有链路当前带宽的最小值。进行了大量的仿真,比较了所提出的方法和逐跳计算路径带宽的方法的性能。仿真结果表明,在多跳移动无线网络中使用该方法产生的呼叫阻塞率明显低于逐跳计算路径带宽的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信