面向无线网状网络的拥塞感知多路径跨层路由设计

Wenming Song, Shengming Jiang, G. Wei
{"title":"面向无线网状网络的拥塞感知多路径跨层路由设计","authors":"Wenming Song, Shengming Jiang, G. Wei","doi":"10.1109/APCC.2009.5375514","DOIUrl":null,"url":null,"abstract":"Many existing routing protocols for wireless mesh networks (WMNs) are based on minimal hop counts and cannot fit WMNs because they did not take into account congestions in networks. Although other multipath routing protocols use node- or link-disjoint routes, they are still based on minimal hop counts and may even cause extra congestion into networks. This is because a node-disjoint path may contain link-joined segments, which could be congested as many flows use them to forward packets. This paper proposes two congestion-aware routing metrics to enable routing protocols to consider congestion issues by exploring information available at the data link layer. One metric is called buffer occupancy ratio which considers the congestion status of nodes. The other metric is called successful frame sending rate which considers the congestion status of links. These two metrics are used to design a multipath routing protocol to find multiple less congested routes to improve network throughput. The simulation study has shown that the proposed routing scheme achieves significant throughput improvement with much more reliable packet delivery.","PeriodicalId":217893,"journal":{"name":"2009 15th Asia-Pacific Conference on Communications","volume":"127 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"A congestion-aware multipath routing with cross layer design for wireless mesh networks\",\"authors\":\"Wenming Song, Shengming Jiang, G. Wei\",\"doi\":\"10.1109/APCC.2009.5375514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many existing routing protocols for wireless mesh networks (WMNs) are based on minimal hop counts and cannot fit WMNs because they did not take into account congestions in networks. Although other multipath routing protocols use node- or link-disjoint routes, they are still based on minimal hop counts and may even cause extra congestion into networks. This is because a node-disjoint path may contain link-joined segments, which could be congested as many flows use them to forward packets. This paper proposes two congestion-aware routing metrics to enable routing protocols to consider congestion issues by exploring information available at the data link layer. One metric is called buffer occupancy ratio which considers the congestion status of nodes. The other metric is called successful frame sending rate which considers the congestion status of links. These two metrics are used to design a multipath routing protocol to find multiple less congested routes to improve network throughput. The simulation study has shown that the proposed routing scheme achieves significant throughput improvement with much more reliable packet delivery.\",\"PeriodicalId\":217893,\"journal\":{\"name\":\"2009 15th Asia-Pacific Conference on Communications\",\"volume\":\"127 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 15th Asia-Pacific Conference on Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2009.5375514\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 15th Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2009.5375514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

现有的许多无线网状网络路由协议都是基于最小跳数的路由协议,由于没有考虑网络的拥塞问题而无法适应无线网状网络。尽管其他多路径路由协议使用节点或链路分离路由,但它们仍然基于最小跳数,甚至可能导致网络额外拥塞。这是因为节点分离路径可能包含链接连接的段,当许多流使用它们来转发数据包时,这些段可能会拥塞。本文提出了两个拥塞感知路由度量,使路由协议能够通过探索数据链路层上可用的信息来考虑拥塞问题。其中一个度量被称为缓冲区占用率,它考虑了节点的拥塞状态。另一个度量称为成功帧发送速率,它考虑了链路的拥塞状态。这两个指标用于设计多路径路由协议,以找到多条拥塞较少的路由,从而提高网络吞吐量。仿真研究表明,所提出的路由方案显著提高了吞吐量,数据包的传输更加可靠。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A congestion-aware multipath routing with cross layer design for wireless mesh networks
Many existing routing protocols for wireless mesh networks (WMNs) are based on minimal hop counts and cannot fit WMNs because they did not take into account congestions in networks. Although other multipath routing protocols use node- or link-disjoint routes, they are still based on minimal hop counts and may even cause extra congestion into networks. This is because a node-disjoint path may contain link-joined segments, which could be congested as many flows use them to forward packets. This paper proposes two congestion-aware routing metrics to enable routing protocols to consider congestion issues by exploring information available at the data link layer. One metric is called buffer occupancy ratio which considers the congestion status of nodes. The other metric is called successful frame sending rate which considers the congestion status of links. These two metrics are used to design a multipath routing protocol to find multiple less congested routes to improve network throughput. The simulation study has shown that the proposed routing scheme achieves significant throughput improvement with much more reliable packet delivery.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信