移动自组织网络中基于可信和负载均衡的蚁群路由

V. Aakanksha, Ravish Sharma, Punam Bedi
{"title":"移动自组织网络中基于可信和负载均衡的蚁群路由","authors":"V. Aakanksha, Ravish Sharma, Punam Bedi","doi":"10.1504/IJAISC.2014.062825","DOIUrl":null,"url":null,"abstract":"This paper presents an ant-based trusted routing algorithm with load-balancing for mobile ad hoc networks within the framework of mobile process groups MPGs. The proposed algorithm uses a hybrid approach as it proactively forms the group views of mobile processes agents in initialisation phase and maintains and updates these group views reactively in accordance with the topology change in maintenance phase. Route is discovered reactively on-demand when a source node sends a route request for routing. Reactive path setup is instigated by sending ant packets on the trusted paths. These ant packets update the routing path with a pheromone value which is computed using trust on that node and the node's load taking capability. Therefore, ant packets always follow the path which is most trustworthy and has low traffic load density. The proposed approach was implemented in JADE and the results show that the nodes having high trust and less traffic load density were always chosen as forwarding nodes forming the trusted path with less load.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Trusted and load-balanced ant-based routing in mobile ad hoc networks\",\"authors\":\"V. Aakanksha, Ravish Sharma, Punam Bedi\",\"doi\":\"10.1504/IJAISC.2014.062825\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an ant-based trusted routing algorithm with load-balancing for mobile ad hoc networks within the framework of mobile process groups MPGs. The proposed algorithm uses a hybrid approach as it proactively forms the group views of mobile processes agents in initialisation phase and maintains and updates these group views reactively in accordance with the topology change in maintenance phase. Route is discovered reactively on-demand when a source node sends a route request for routing. Reactive path setup is instigated by sending ant packets on the trusted paths. These ant packets update the routing path with a pheromone value which is computed using trust on that node and the node's load taking capability. Therefore, ant packets always follow the path which is most trustworthy and has low traffic load density. The proposed approach was implemented in JADE and the results show that the nodes having high trust and less traffic load density were always chosen as forwarding nodes forming the trusted path with less load.\",\"PeriodicalId\":364571,\"journal\":{\"name\":\"Int. J. Artif. Intell. Soft Comput.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Artif. Intell. Soft Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/IJAISC.2014.062825\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Artif. Intell. Soft Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJAISC.2014.062825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在移动进程组mpg框架下,提出了一种基于蚁群的负载均衡可信路由算法。该算法采用混合方法,在初始化阶段主动形成移动进程代理的组视图,在维护阶段根据拓扑变化主动维护和更新这些组视图。当源节点发送路由请求时,根据需要发现路由。响应路径设置是通过在可信路径上发送蚂蚁包来启动的。这些蚂蚁包使用信息素值更新路由路径,该信息素值是使用该节点的信任和节点的负载承受能力计算的。因此,蚂蚁包总是沿着最可信且流量负载密度低的路径运行。在JADE中实现了该方法,结果表明,始终选择具有高信任且流量负载密度较小的节点作为转发节点,形成负载较小的可信路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Trusted and load-balanced ant-based routing in mobile ad hoc networks
This paper presents an ant-based trusted routing algorithm with load-balancing for mobile ad hoc networks within the framework of mobile process groups MPGs. The proposed algorithm uses a hybrid approach as it proactively forms the group views of mobile processes agents in initialisation phase and maintains and updates these group views reactively in accordance with the topology change in maintenance phase. Route is discovered reactively on-demand when a source node sends a route request for routing. Reactive path setup is instigated by sending ant packets on the trusted paths. These ant packets update the routing path with a pheromone value which is computed using trust on that node and the node's load taking capability. Therefore, ant packets always follow the path which is most trustworthy and has low traffic load density. The proposed approach was implemented in JADE and the results show that the nodes having high trust and less traffic load density were always chosen as forwarding nodes forming the trusted path with less load.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信