Zone based ant colony routing in mobile ad-hoc network

Maumita Bandyopadhyay, Parama Bhaumik
{"title":"Zone based ant colony routing in mobile ad-hoc network","authors":"Maumita Bandyopadhyay, Parama Bhaumik","doi":"10.1109/COMSNETS.2010.5431989","DOIUrl":null,"url":null,"abstract":"Ant colony optimization (ACO) is a stochastic approach for solving combinatorial optimization problems like routing in computer networks. The idea of this optimization is based on the food accumulation methodology of the ant community. Zone based routing algorithms is build on the concept of individual node's position for routing of packets in mobile ad-hoc networks. Here the nodes' position can be further utilized to discover routes by the Ants in optimized way. Position based routing algorithms (POSANT) had some significant loopholes to find route (source to destination) like it never guarantees the route would be the shortest one, in cases while it is able to find it. On the contrary, routing algorithms which are based on ant colony optimization find routing paths that are close in length to the shortest paths. The drawback of these algorithms is the large number of control messages that needs to be sent or the long delay before the routes are established from a source to a destination. Here In this paper we have used Zone based ANT colony using Clustering which assures to find shortest route using the DIR principle (In this principle, the source or intermediate node transmits message to several neighbors and the node whose direction is closest to the direction of destination gets selected as the next hop forwarding node.) together with minimum overhead for route discovery and mobility management. Unlike other Zone based approach, in clustering it is not required to consider zone related information of each node while finding shortest path. Here, it is being proposed a new routing algorithm for mobile ad hoc network by combining the concept of Ant Colony approach and Zone based routing approach using clustering to get shortest path with small number of control messages to minimize the overhead. Simulations show that Zone Based ant colony routing algorithm has relatively short route establishment overhead than other zone based ant colony algorithms in highly mobile scenarios.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2010.5431989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Ant colony optimization (ACO) is a stochastic approach for solving combinatorial optimization problems like routing in computer networks. The idea of this optimization is based on the food accumulation methodology of the ant community. Zone based routing algorithms is build on the concept of individual node's position for routing of packets in mobile ad-hoc networks. Here the nodes' position can be further utilized to discover routes by the Ants in optimized way. Position based routing algorithms (POSANT) had some significant loopholes to find route (source to destination) like it never guarantees the route would be the shortest one, in cases while it is able to find it. On the contrary, routing algorithms which are based on ant colony optimization find routing paths that are close in length to the shortest paths. The drawback of these algorithms is the large number of control messages that needs to be sent or the long delay before the routes are established from a source to a destination. Here In this paper we have used Zone based ANT colony using Clustering which assures to find shortest route using the DIR principle (In this principle, the source or intermediate node transmits message to several neighbors and the node whose direction is closest to the direction of destination gets selected as the next hop forwarding node.) together with minimum overhead for route discovery and mobility management. Unlike other Zone based approach, in clustering it is not required to consider zone related information of each node while finding shortest path. Here, it is being proposed a new routing algorithm for mobile ad hoc network by combining the concept of Ant Colony approach and Zone based routing approach using clustering to get shortest path with small number of control messages to minimize the overhead. Simulations show that Zone Based ant colony routing algorithm has relatively short route establishment overhead than other zone based ant colony algorithms in highly mobile scenarios.
移动自组网中基于区域的蚁群路由
蚁群算法是解决计算机网络中路由等组合优化问题的一种随机方法。这种优化的思想是基于蚁群的食物积累方法。基于区域的路由算法是建立在移动自组织网络中单个节点位置的概念之上的。在这种情况下,蚂蚁可以进一步利用节点的位置,以优化的方式发现路径。基于位置的路由算法(POSANT)在寻找路由(从源到目的地)方面存在一些重大漏洞,比如在能够找到路由的情况下,它永远不能保证路由是最短的。相反,基于蚁群优化的路由算法寻找与最短路径长度接近的路由路径。这些算法的缺点是需要发送大量的控制消息,或者在从源到目的建立路由之前有很长的延迟。本文采用基于区域的蚁群聚类技术,利用DIR原则(源节点或中间节点向多个相邻节点发送消息,并选择方向最接近目的地方向的节点作为下一跳转发节点)确保找到最短的路由,同时保证了路由发现和移动性管理的开销最小。与其他基于Zone的聚类方法不同,它在寻找最短路径时不需要考虑每个节点的Zone相关信息。本文提出了一种新的移动自组织网络路由算法,该算法将蚁群算法的概念与基于区域的路由方法相结合,利用聚类方法获得控制消息数量较少的最短路径,从而使开销最小化。仿真结果表明,在高移动场景下,基于区域的蚁群路由算法比其他基于区域的蚁群算法具有相对较短的路由建立开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信