Probability routing algorithm for mobile ad hoc networks´ resources management

This paper introduces a resource management application of a probabilistic-based ant routing algorithm for mobile ad hoc networks (ARAMA) that is inspired from the ant´s life . Mobile ad hoc networks (MANETs) are highly dynamic, self-configured and self-built networks. The goal of this paper is to present ARAMA ability to manage MANET´s resources by achieving fair network resources distribution, while considering the dynamic characteristics of MANETs and the need for low control overheads. This paper provides a description for the algorithm. In this algorithm, the nodes´ (node´s energy, processing power, ...) and links´ (bandwidth, ...) parameters are measured and collected in the nodes´ indices. A path index is used to measure the path total resources and serves to minimize the forward control packet (ant) size. The concepts of negative backward ant destination trail are introduced to enhance the performance of the algorithm. The simulation results show the potential of ARAMA to achieve fair energy usage across the network nodes as an example of the network resource management. More, the results show the general ability of the algorithm to solve MANET´s routing problem.