Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach

Abstract

Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

DOI: 10.1155/2014/872526

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Kim2014AdaptiveMM, title={Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach}, author={Sungwook Kim}, booktitle={TheScientificWorldJournal}, year={2014} }