Modified Ant Colony Optimization to enhance MANET routing in Adhoc on demand Distance Vector

2014 2nd International Conference on Business and Information Management (ICBIM) Pub Date : 2014-12-04 DOI:10.1109/ICBIM.2014.6970938

B. Nancharaiah, R. Scholar

{"title":"Modified Ant Colony Optimization to enhance MANET routing in Adhoc on demand Distance Vector","authors":"B. Nancharaiah, R. Scholar","doi":"10.1109/ICBIM.2014.6970938","DOIUrl":null,"url":null,"abstract":"A Mobile Adhoc Network (MANET) is an assortment of mobile nodes that can establish an adhoc network without any centralized structures. Networking infrastructure such as the base stations is unavailable for MANET. The interconnected collection of wireless nodes depends on its position and, its transmitting and receiving radio capacity to create a wireless connectivity and form a multi-hop graph or an “adhoc” network. Routing in MANET is used for finding the multi-hop paths to transmit the data flow through the network while optimizing one or more performance measures. In this paper, modified Ant Colony Optimization (ACO) has been proposed for the optimization for MANET routing protocol. The modifications have been incorporated in Adhoc On-demand Distance Vector (AODV) routing. The proposed modified Ant Colony Optimization algorithm performs better compared to existing algorithms(AODV and Cooperative Opportunistic Routing in Mobile Adhoc Networks i.e. CORMAN) in terms of end- to-end delay, route acquisition time, throughput, total cache replies and packet delivery ratio.","PeriodicalId":6549,"journal":{"name":"2014 2nd International Conference on Business and Information Management (ICBIM)","volume":"84 1","pages":"81-85"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 2nd International Conference on Business and Information Management (ICBIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBIM.2014.6970938","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

Abstract

A Mobile Adhoc Network (MANET) is an assortment of mobile nodes that can establish an adhoc network without any centralized structures. Networking infrastructure such as the base stations is unavailable for MANET. The interconnected collection of wireless nodes depends on its position and, its transmitting and receiving radio capacity to create a wireless connectivity and form a multi-hop graph or an “adhoc” network. Routing in MANET is used for finding the multi-hop paths to transmit the data flow through the network while optimizing one or more performance measures. In this paper, modified Ant Colony Optimization (ACO) has been proposed for the optimization for MANET routing protocol. The modifications have been incorporated in Adhoc On-demand Distance Vector (AODV) routing. The proposed modified Ant Colony Optimization algorithm performs better compared to existing algorithms(AODV and Cooperative Opportunistic Routing in Mobile Adhoc Networks i.e. CORMAN) in terms of end- to-end delay, route acquisition time, throughput, total cache replies and packet delivery ratio.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

改进蚁群算法在Adhoc随需距离矢量中增强自组网路由

移动自组网(MANET)是一种可以建立自组网而不需要任何集中结构的移动节点组合。诸如基站之类的网络基础设施对于MANET是不可用的。相互连接的无线节点集合取决于其位置和发送和接收无线电的能力，以创建无线连接并形成多跳图或“特设”网络。MANET中的路由用于寻找多跳路径以在网络中传输数据流，同时优化一个或多个性能指标。本文提出了一种改进的蚁群算法(蚁群算法)来优化MANET路由协议。这些修改已被纳入自组织按需距离矢量(AODV)路由。提出的改进蚁群优化算法在端到端延迟、路由获取时间、吞吐量、总缓存应答和包投递率等方面优于现有算法(AODV和CORMAN)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2014 2nd International Conference on Business and Information Management (ICBIM)

自引率

0.00%

发文量