Ant routing algorithm for mobile ad-hoc networks (ARAMA)
Osama Hussein Hussein, Tarek Saadawi · 2003
Routing algorithms in mobile ad-hoc networks (MANETs) should match the special characteristics of MANETs. It should be A self-configured, self-built and distributed routing algorithm. In addition, it should be able to optimize more than one quality of service parameter to achieve good network performance. The remaining energy in each node across the network should be fairly distributed. We are propose the ant routing algorithm for Mobile Ad-hoc networks (ARAMA), which is a biological based routing algorithm. This algorithm is inspired from the ant colonies' life. Forward packets are used to collect information about the network and backward packets are used to update the routing information in the nodes. The paper provides a description of the algorithm. Simulation results show the ability of the algorithm to fairly distribute the remaining energy across the network nodes and solve the MANETs routing problem under different dynamic conditions.