Impact Factor:6.549
 Scopus Suggested Journal: UNDER REVIEW for TITLE INCLUSSION

International Journal
of Computer Engineering in Research Trends (IJCERT)

Scholarly, Peer-Reviewed, Open Access and Multidisciplinary

Welcome to IJCERT

International Journal of Computer Engineering in Research Trends. Scholarly, Peer-Reviewed,Open Access and Multidisciplinary

ISSN(Online):2349-7084                 Submit Paper    Check Paper Status    Conference Proposal

Back to Current Issues

Link quality based Ant based Routing Algorithm (LARA) in MANETs

C.V.Anchugam, Dr.K.Thangadurai, , ,
Link quality based Ant based Routing Algorithm (LARA) in MANETs

Recently a new method is developed to handle the problem of routing in ad hoc network and overcomes the shortcomings of the classical methods; these methods are based on swarm intelligence inspired from biological swarms, such as ants in order to solve some complex problems such as finding food or optimizing route to food in real insect swarms. One of the most known routing algorithms for MANETs, as described Ant based Routing Algorithm (ARA) suffers from some limitations within the pheromone computing since it has not taken the necessary consideration to the characteristics of MANETs such as mobility and the medium constraint. Therefore, in our proposed enhancement to ARA called Link quality based ARA (LARA), it can be included the link quality in route selection and probability computing which have considerably improved the network performance and the system lifetime.

C.V.Anchugam, Dr.K.Thangadurai, “Link quality based Ant based Routing Algorithm (LARA) in MANETs”, International Journal Of Computer Engineering In Research Trends, 4(1):52-60, January-2017. [InnoSpace-2017:Special Edition]

Keywords : MANETs, LARA, Routing, Link quality, Swarm Intelligence, Cross-layer.

[1].	Al Agha K., Pujolle G., Vivier G., “Reseaux de mobiles et reseaux sans fil“, 2nd edition, Eyrolles, 2005. 
[2].	Basagni S., Chlamtac I., Syrotiuk V. R., Woodward B. A., “A Distance Routing Effect Algorithm for Mobility (DREAM)”, In Proceedings ACM/IEEE Mobicom, pages 76-84, October 1998.   
[3].	Camp, T., Boleng, J., Williams, B., Wilcox, L., Navidi, W.,  “Performance comparison of two location based routing protocols for ad hoc networks”, INFOCOM 2002, Twenty-First Annual joint conference of the IEEE Computer and Communications Societies, Proceedings, IEEE, Volume. 3, 2002,  pp. 1678 –168. 
[4].	Clausen T., Jacquet P., Viennot L., “Comparative Study of Routing Protocols for Mobile Ad hoc Networks”, Med-Hoc-Net’02, Sardegna, Italy, September 2002. 

[5].	Daniel Camara, Antonio Alfredo F. Loureiro, “A Novel Routing Algorithm for Hoc Networks”, Baltzer Journal of Telecommunications Systems, 18:1-3, Kluwer Academic Publishers, 2001, pp. 85-100.    
[6].	DiCaro G., Dorigo M., “Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks”, Proceedings PPSN V - Fifth International Conference on Parallel Problem Solving from Nature, Amsterdam, Holland, September 27-30, 1998, pp. 673-682.    
[7].	Gerharz M.L, De Waal C., Frank M., Martini P., “Link Stability in Mobile Wireless Ad Hoc Networks”, Proceedings of the 27th Annual IEEE Conference on Local Computer Networks (LCN), Tampa, Florida, November 2002.  
[8].	Gunes M., Sorges U., Bouazisi I., “ARA - the Ant Colony Based routing Algorithm for MANETs”, Proceedings ICPP Workshop on Ad hoc Networks, Vancouver, Canada, 2002, pp. 7985.  
[9].	Heusse M., Snyers D., Guérin S., Kuntz P., "Adaptive agent-driven routing and load balancing in communication network", Proceedings ANTS'98,First International Workshop on Ant Colony Optimization, Brussels, Belgium, October 15-16, 1998.   
[10].	Iwata A., Chiang C.-C., Pei G., Gerla M., Chen T.-W., "Scalable Routing Strategies for Ad Hoc Wireless Networks", IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, Aug. 1999, pp.1369-1379.   
[11].	Jacquet, Paul Muhlethaler, Amir Qayyum, Anis Laouiti, Laurent Viennot, Thomas Clausen, “Optimized Link State Routing Protocol”, Internet Draft, draft-ietf-manet-olsr-04.txt, work in progress, June 2001.   
[12].	Jagannathan Sarangapani, “Wireless Ad Hoc and Sensor Networks Protocols”, Performance, and Control”, Taylor & Francis Group, LLC, 2007. 
[13].	Jiang M., Li J., Tay Y. C., “Cluster Based Routing Protocol (CBRP)”, Functional Specification Internet Draft, draft-ietf-manet-cbrp.txt, work in progress, June 1999. 
[14].	Jinyang Li, John Janotti, Douglas S. J. De Coutu, David R. Karger, Robert Morris. “A Scalable Location Service for Geographic Ad Hoc Routing”, M.I.T. Laboratory for Computer Science.   
[15].	Johnson D., Maltz D., Y-C. Hu, Jetcheva J., “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks”, Internet Draft, draft-ietf-manet-dsr-09.txt, work in progress, April 2003. 
[16].	Ko Y.-B., V. N. H. “Location-Aided Routing in mobile Ad hoc networks”, In Proceeding ACM/IEEE Mobicom, October 1998, pp. 66-75. 
[17].	Mesut Gunes et. al, “ARA - the ant-colony based routing algorithm for MANETs”, In Stephan Olariu, Proceedings of the 2002 ICPP Workshop on Ad Hoc Networks (IWAHN 2002), IEEE Computer Society Press, August 2002, pp. 79-85. 
[18].	Navid Nikaein, Christian Bonnet, Neda Nikaein. “Hybrid Ad Hoc Routing Protocol – HARP”, proceeding of IST 2001: International Symposium on Telecommunications.  
[19].	Park V., Corson S., ”TORA (Temporally-Ordered Routing Algorithm routing protocol)”,  Internet Draft, draft-IETF-MANET-TORA-spec- 03.txt, work in progress, June 2001. 
[20].	Perkins C., Royer E., Das S., “Ad hoc On-demand Distance Vector (AODV) Routing”, Internet Draft, draft-ietf-manet-aodv-11.txt, work in progress, Aug 2002. 
[21].	Perkins C. E., Bhagwat P., “Highly Dynamic Destination-Sequenced Distance Vector (DSDV) for Mobile Computers”, Proceedings of the SIGCOMM 1994 Conference on Communications Architectures, Protocols and Applications, Aug 1994, pp 234-244.  
[22].	Siva Ram Nurthy C.,  Manoj B.S., “Ad hoc wireless networks Architectures and Protocols”, le Prentice Hall, 2004. 
[23].	Sridhar K. N., Lillykutty J., Rajeev S., “Performance Evaluation and Enhancement of Link Stability Based Routing for MANETs”, lst International Workshop on Mobile and Wireless Networking (MWN 2004), Montreal, Quebec, Canada, August 15, 2004.    
[24].	Tsu-Wei Chen, Mario Gerla, "Global State Routing: A New Routing Scheme for Ad hoc Wireless Networks", Proceedings IEEE ICC'98.   
[25].	White T., "Swarm intelligence and problem solving in telecommunications", Canadian Artificial Intelligence Magazine, Spring, 1997.    
[26].	White T., "Routing with swarm intelligence", Technical Report SCE-97-15, Systems and Computer Engineering Department, Carleton University, September, 1997.    
[27].	Zygmunt J. Haas, Marc R. Pearlman, Prince Samar, “The Bordercast Resolution Protocol (BRP)”, Internet Draft, draft- ietf-manet-zone-zrp-04.txt, work in progress, July 2002. 

DOI Link : NA

Download :

Refbacks : There are currently no refbacks


Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors. 

News & Events

Latest issue :Volume 10 Issue 1 Articles In press

A plagiarism check will be implemented for all the articles using world-renowned software. Turnitin.

Digital Object Identifier will be assigned for all the articles being published in the Journal from September 2016 issue, i.e. Volume 3, Issue 9, 2016.

IJCERT is a member of the prestigious.Each of the IJCERT articles has its unique DOI reference.
DOI Prefix : 10.22362/ijcert

IJCERT is member of The Publishers International Linking Association, Inc. (“PILA”)

Emerging Sources Citation Index (in process)

IJCERT title is under evaluation by Scopus.

Key Dates

☞   LAST DATE OF SUBMISSION : 31st March 2023
In 7 Days

Important Announcements

All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.

Citation Index

Citations Indices All
Citations 1026
h-index 14
i10-index 20
Source: Google Scholar

Acceptance Rate (By Year)

Acceptance Rate (By Year)
Year Rate
2021 10.8%
2020 13.6%
2019 15.9%
2018 14.5%
2017 16.6%
2016 15.8%
2015 18.2%
2014 20.6%

Important Links

Conference Proposal