EMP-DSR: An Enhanced Multi-path Dynamic Source Routing Algorithm for MANETs Based on Ant Colony Optimization

E. K. Asl, M. Damanafshan, M. Abbaspour, Majid Noorhosseini, Kamran Shekoufandeh
{"title":"EMP-DSR: An Enhanced Multi-path Dynamic Source Routing Algorithm for MANETs Based on Ant Colony Optimization","authors":"E. K. Asl, M. Damanafshan, M. Abbaspour, Majid Noorhosseini, Kamran Shekoufandeh","doi":"10.1109/AMS.2009.43","DOIUrl":null,"url":null,"abstract":"Routing in MANETs becomes a more sophisticated issue especially when a certain QoS requirement is to be satisfied. One of the most important QoS metrics is end-to-end reliability. Multi-path routing can be considered as an effective method to support end-to-end reliability. However, the path discovery in current multi-path routing algorithms considering reliability relies mostly on local link availability information at intermediate nodes to perform the route request message forwarding. Selecting a reliable link at an intermediate node solely based on local information may not necessarily lead to finding a satisfactory reliable end-to-end path. To mitigate this problem, in this paper we have proposed an Enhanced Multi-Path Dynamic Source Routing Algorithm (EMP-DSR) which is an enhanced version of MP-DSR. The proposed method uses an ant-colony optimization method to provide global information. The simulation results show that the EMP-DSR outperforms MP-DSR both in finding reliable paths and end-to-end delay with a little tolerable overhead.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third Asia International Conference on Modelling & Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2009.43","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

Routing in MANETs becomes a more sophisticated issue especially when a certain QoS requirement is to be satisfied. One of the most important QoS metrics is end-to-end reliability. Multi-path routing can be considered as an effective method to support end-to-end reliability. However, the path discovery in current multi-path routing algorithms considering reliability relies mostly on local link availability information at intermediate nodes to perform the route request message forwarding. Selecting a reliable link at an intermediate node solely based on local information may not necessarily lead to finding a satisfactory reliable end-to-end path. To mitigate this problem, in this paper we have proposed an Enhanced Multi-Path Dynamic Source Routing Algorithm (EMP-DSR) which is an enhanced version of MP-DSR. The proposed method uses an ant-colony optimization method to provide global information. The simulation results show that the EMP-DSR outperforms MP-DSR both in finding reliable paths and end-to-end delay with a little tolerable overhead.
EMP-DSR:一种基于蚁群优化的增强多路径动态源路由算法
manet中的路由成为一个更复杂的问题,特别是当需要满足一定的QoS要求时。最重要的QoS指标之一是端到端可靠性。多路径路由可以被认为是支持端到端可靠性的有效方法。然而,目前考虑可靠性的多路径路由算法的路径发现主要依赖于中间节点的本地链路可用性信息来完成路由请求消息的转发。仅根据本地信息在中间节点上选择可靠的链路不一定能找到令人满意的可靠的端到端路径。为了解决这个问题,本文提出了一种增强型多路径动态源路由算法(EMP-DSR),它是MP-DSR的增强版本。该方法采用蚁群优化方法提供全局信息。仿真结果表明,EMP-DSR在寻找可靠路径和端到端延迟方面都优于MP-DSR,并且开销很小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信