Optimizing Routes Quality and Scattering in the AODV Routing Protocol

Authors

  • Mustapha Guezouri Signal Image Laboratory, Department of Electronics, Faculty of Electrical Engineering, University of Science and Technology (USTO), P.O. Box 1505 – El-m’naouar, Oran, Algeria
  • Abdelaziz Ouamri Signal Image Laboratory, Department of Electronics, Faculty of Electrical Engineering, University of Science and Technology (USTO), P.O. Box 1505 – El-m’naouar, Oran, Algeria

Keywords:

Manet, Ad-hoc networks, Mobile networks, Wireless networks, Dynamic routing

Abstract

An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. Routing protocols are used to discover routes between nodes. Many mobile ad-hoc networks protocols such as AODV construct route only when desired by the source node (reactively). The advantage hereof is that no prior assumptions of the network topology are required. In highly mobile networks this is an attractive property. Other used protocols (such as OLSR) are said proactive. Such protocols maintain information about routes to all destinations all times. The consequence of this approach is that the amount of control traffic is independent of the actual traffic and mobility in the network. In this paper we describe three major optimization schemes for the well-known AODV routing protocol in order to get some of the proactive protocols features in it. The targeted characteristics are: traffic independent control and shortest path routes.

Downloads

Download data is not yet available.

References

[1] André P., "Aspects probabilistes du problème de la satisfaction d'une formule booléenne. Etude des problèmes SAT, #SAT et Max-SAT". Thèse de doctorat de l'Université Paris VI, 1993.
[2] Benatchba K., Koudil M, Drias H., Oumsalem H. et Chaouche K.,"PARME UN ENVIRONNEMENT POUR LA RESOLUTION DU PROBLEME MAX-SAT",CARI'02,OCT. 2002.
[3] Benatchba K., Admane L., Koudil M. and Drias H. "Application of ant colonies to data-mining expressed as Max-Sat problems", International Conference on Mathematical Methods for Learning, MML'2004, Italy, June 2004.
[4] Burke E., Kingston J., Jackson K. and Weare R., “Automated University Timetabling: The State of the Art”, The Computer Journal 40 (9) 565-571, 1997.
[5]Cook S.A., "The complexity of theorem-proving procedures". Proc. 3rd ACP symp. On theory of computing Association of Computing Machinery, New York, p151-1158, 1971.
[6] Dorigo M. and Gambardella L.M., "Ant Colony system : A cooperation learning approch to the traveling salesman problem. IEEE Trans. Evol. Comp., 1(1):53-66, 1997.
[7] Dorigo M. and Dicaro G., "Ant Colony Optimisation : A new meta-heuristic", IEEE, 1999.
[8] Dorigo M. and DicaroG., "Ant Colony Optimisation meta-heuristic: In D. Corne, M. Dorigo, et F. Glover, editors, New Ideas in Optimization, pages11-32. McGraw-Hill, 1999.
[9] Dorigo M., "The Ant Colony Optimization Metaheuristic:Algorithms, Applications, and Advances". Université Libre de Bruxelles, IRIDIA.Thomas Stützle, TU Darmstadt, Computer Science, Intellectics Group, 2001.
[10] Eierman M. A., Niederman F. et al., “DSS theory: a model of constructs and relationships”, Decision Support Systems 14(1): 1-26, 1995.
[11] Gallaire H., Minker J. and Nicolas J.M., "Logic and databases : A deductible approch". Computing Surveys, 1984.
[12] Garey R.M. and Johnson, "Computers and Intractability, A guide to the Theory of NP-Completeness". W.H. Freeman and CO., San Francisco, 1979.
[13] Hayes E.D.A. Waterman and LENAT D.B., "Building expert system", Addisson-Westely, 1983.
[14] Kamath A.P., Karmakar N.K. Ramakrishnan K.G. and Resende M.G.C.,"A continous approach to inductive inference", MATHEMATICAL PROGRAMMING,57, 1992.
[15] Klein M. and Methlie L. B., “Expert Systems: A Decision Support Approach with applications in management and finance”, Addison-Wesley Publishing Compagny, 1990.
[16] Koudil M., Benatchba K. and Dours D., "Using genetic algorithms for solving partitioning problem in codesign", Lecture Notes in Computer Science, Springer-Verlag, Vol. 2687, pp. 393–400, June 2003.
[17] Koudil M., Benatchba K., Gharout S. and Hamani N., "Solving partitioning problem in codesign with ant colonies", International Work -conference on the Interplay between Natural and Artificial Computation,Lecture Notes in Computer Science, Springer-Verlag, Vol. 3562, June 2005.
[18] Landry M., “Les rapports entre la complexité et la dimension cognitive de la formulation des problèmes”, Association française des sciences et technologies de l’information et des systèmes, p. 3-32, 1987.
[19] Martel J.M., Rousseau A., “Cadre de référence d’une démarche multicritère de gestion intégrée des ressources en milieu forestier”, Projet de développement de la gestion intégrée des ressources, document technique 93011, Université Laval, Québec, 1993.
[20] Nguyen, Perkins, Laffey and Pecora, "Checking an expert systems Knowledge base for consistency and completeness, IJCAI 85, Arvind Joshi (ed.), Los Altos California, pp.375-378, 1985.
[21] Pictet J., « Dépasser l’évaluation environnementale, Procédure d’étude et insertion dans la décision globale”, Collection Meta, Presses Polytechnique et Universitaires Romandes, 1015, Lausanne, Suisse, 1996.
[22] Roy B., "The optimisation problem formulation: criticism and overstepping", The Journal of the Operational Research Society, Vol. 32, N06, pp. 427-436, 1994.
[23] Vodoz L., "Enjeux et limites du recours à la négociation", La négociation son rôle, sa place dans l'aménagement du territoire et la protection de l'environnement”, Edité par Ruegg J., Mettan N., Vodoz L., Presses Polytechniques et Universitaires Romandes, CH-1015 Lausanne, 1994.

Downloads

Published

2007-10-01

How to Cite

Guezouri, M., & Ouamri, A. (2007). Optimizing Routes Quality and Scattering in the AODV Routing Protocol. Journal of Computer Science and Technology, 7(03), p. 209–216. Retrieved from https://journal.info.unlp.edu.ar/JCST/article/view/773

Issue

Section

Original Articles