Title: Trusted and load-balanced ant-based routing in mobile ad hoc networks

Authors: Aakanksha; Ravish Sharma; Punam Bedi

Addresses: Department of Computer Science, University of Delhi, Delhi-110007, India ' Department of Computer Science, PGDAV College, Nehru Nagar, New Delhi-110065, India ' Department of Computer Science, University of Delhi, Delhi-110007, India

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.

Keywords: ant colony optimisation; ACO; load balancing; mobile process groups; MPGs; trust; MANETs; ant-based routing; mobile ad hoc networks; mobile networks.

DOI: 10.1504/IJAISC.2014.062825

International Journal of Artificial Intelligence and Soft Computing, 2014 Vol.4 No.2/3, pp.195 - 211

Received: 13 Jul 2012
Accepted: 14 Nov 2013
Published online: 28 Jun 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article