Probability routing algorithm for mobile ad hoc networks' resources management

Authors:
O. H. Hussein;T. N. Saadawi;Myung Jong Lee
Affiliations:
Dept. of Comput. Eng. Technol., New York City Coll. of Technol., Brooklyn, NY, USA;-;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 7

Interdisciplinary issues for the management of next generation autonomic wireless systems: nature-inspired techniques and organic computing

International Journal of Mobile Network Design and Innovation
ANT Based Routing Algorithm over a HAP Network with Integrated Services

MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
QoS-aware ant routing with colored pheromones in wireless mesh networks

Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
Swarm intelligence based energy saving and load balancing in wireless ad hoc networks

BADS '09 Proceedings of the 2009 workshop on Bio-inspired algorithms for distributed systems
Energy saving and load balancing in wireless ad hoc networks through ant-based routing

SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Destination-assisted routing enhancement (DARE) protocol for ad-hoc mobile networks

SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
An autonomic bio-inspired algorithm for wireless sensor network self-organization and efficient routing

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.07

Visualization

Abstract

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.