Link-quality aware ad hoc on-demand distance vector routing protocol

Hsin-Mu Tsai, N. Wisitpongphan, O. Tonguz
{"title":"Link-quality aware ad hoc on-demand distance vector routing protocol","authors":"Hsin-Mu Tsai, N. Wisitpongphan, O. Tonguz","doi":"10.1109/ISWPC.2006.1613587","DOIUrl":null,"url":null,"abstract":"Current ad hoc wireless routing protocols typically select the route with the shortest-path or minimum hop count to the destination. However, routes chosen according to such criteria tend to include longer hop-length links with possibly bad signal quality. It is expected that the routing protocol can be improved by eliminating the usage of routes with bad links. In this work, we modify the ad hoc on-demand distance vector (AODV) routing protocol to avoid routing through bad quality links. We also integrate the \"hand-off\" concept into our protocol to prevent link breakages during route maintenance. The herein reported OPNET simulation results seem very promising and they show that our protocol introduces a much lower routing overhead while still providing equal or better performance than the original AODV protocol in terms of throughput and delay.","PeriodicalId":145728,"journal":{"name":"2006 1st International Symposium on Wireless Pervasive Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"46","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 1st International Symposium on Wireless Pervasive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWPC.2006.1613587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 46

Abstract

Current ad hoc wireless routing protocols typically select the route with the shortest-path or minimum hop count to the destination. However, routes chosen according to such criteria tend to include longer hop-length links with possibly bad signal quality. It is expected that the routing protocol can be improved by eliminating the usage of routes with bad links. In this work, we modify the ad hoc on-demand distance vector (AODV) routing protocol to avoid routing through bad quality links. We also integrate the "hand-off" concept into our protocol to prevent link breakages during route maintenance. The herein reported OPNET simulation results seem very promising and they show that our protocol introduces a much lower routing overhead while still providing equal or better performance than the original AODV protocol in terms of throughput and delay.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
链路质量感知自组织按需距离矢量路由协议
当前的自组织无线路由协议通常选择到目的地的路径最短或跳数最少的路由。然而,根据这些标准选择的路由往往包括较长的跳长链路,可能信号质量较差。期望通过消除坏链路路由的使用来改进路由协议。在这项工作中,我们修改了ad hoc按需距离矢量(AODV)路由协议,以避免通过质量差的链路进行路由。我们还将“切换”概念集成到我们的协议中,以防止在路由维护期间链路中断。本文报告的OPNET仿真结果看起来非常有希望,它们表明我们的协议引入了更低的路由开销,同时在吞吐量和延迟方面仍然提供与原始AODV协议相同或更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Effects of digital filtering technique in reducing the effects of clipping of an enhanced orthogonal frequency division multiplexing system Secure data aggregation using commitment schemes and quasi commutative functions Periodic Spectrum Transmission for Single-Carrier Frequency-Domain Equalization Employing Space-Time Transmit Diversity Transmit diversity systems with antenna replacement and its application to space time block coding transmission Comparison of opportunistic scheduling policies in time-slotted AMC wireless networks
×
引用
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