An Approach In Optimization Of AD-Hoc Routing Algorithms
Networking and Internet Architecture
2012-06-11 v1 Information Theory
math.IT
Abstract
In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each node in the network and gets updated after each data transfer using the protocols. The use of optimization algorithm in routing algorithm can reduce the complexity of routing to the least amount possible.
Cite
@article{arxiv.1206.1665,
title = {An Approach In Optimization Of AD-Hoc Routing Algorithms},
author = {Sarvesh Kumar Sharma},
journal= {arXiv preprint arXiv:1206.1665},
year = {2012}
}
Comments
10 pages, 2 figures, International Journal of Distributed and Parallel Systems (IJDPS) Vol.3, No.3, May 2012, ISSN: 0976 - 9757 [Online], 2229 - 3957 [Print]