Comparison of proactive and reactive routing protocol in mobile adhoc network based on “Ant-algorithm”

Future of mobile adhoc network (MANET) is predicted grow due to the capability of network manage independently. One of important role in this network is routing protocols. A number of research about algorithm to find the best path in transmit of data has been done. Some routing protocol used in MANET, such as AODV, DSR and DSDV. This paper presents about investigation result of AODV, DSR and DSDV that applied an Ant-algorithm which are AODV-Ant, DSR-Ant, and DSDV-Ant. DSDV represents of proactive routing type protocol based on table driven, while AODV and DSR represents of reactive routing protocol type based on demand. Performance analysis includes end to end delay, throughput, routing overhead and hop count for various scenario of node velocity, pause time and network traffic. The result shows that proactive routing protocol could improve performance than the reactive routing protocol and more suitable with Ant-algorithm. However, applied an Ant-algorithm on routing protocol is cause to increased of routing overhead and need more computation of each nodes to resulted the best route.

[1]  Chai-Keong Toh,et al.  Ad Hoc Mobile Wireless Networks , 2002 .

[2]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[3]  Benjamín Barán,et al.  A new approach for AntNet routing , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[4]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[5]  R. Moeini,et al.  APPLICATION OF AN ANT COLONY OPTIMIZATION ALGORITHM FOR OPTIMAL OPERATION OF RESERVOIRS: A COMPARATIVE STUDY OF THREE PROPOSED FORMULATIONS , 2009 .

[6]  Marco Dorigo,et al.  Ant colony optimization and its application to adaptive routing in telecommunication networks , 2004 .

[7]  Imed Bouazizi,et al.  ARA-the ant-colony based routing algorithm for MANETs , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[8]  Yuri Kochetov,et al.  Behavior of the Ant Colony Algorithm for the Set Covering Problem , 2000 .

[9]  Luca Maria Gambardella,et al.  Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic , 2002, Ant Algorithms.

[10]  Joseph P. Macker,et al.  Mobile ad hoc networking and the IETF , 1999, MOCO.

[11]  Adiwijaya,et al.  IMPLEMENTATION OF ANT COLONY OPTIMIZATION ALGORITHM ON THE PROJECT RESOURCE SCHEDULING PROBLEM , 2008 .

[12]  Richard F. Hartl,et al.  An ant colony optimization approach for the single machine total tardiness problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[13]  Marco Dorigo,et al.  Ant colony optimization , 2006, IEEE Computational Intelligence Magazine.

[14]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[15]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[16]  Mauro Birattari,et al.  Toward the Formal Foundation of Ant Programming , 2002, Ant Algorithms.