Trusted and load-balanced ant-based routing in mobile ad hoc networks
by Aakanksha; Ravish Sharma; Punam Bedi
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 4, No. 2/3, 2014

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.

Online publication date: Thu, 19-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email