{"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}
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.