FINDING SHORTEST ROUTING SOLUTION IN MOBILE AD HOC NETWORKS USING FIREFLY ALGORITHM AND QUEUING NETWORK ANALYSIS
DOI:
https://doi.org/10.11113/jt.v77.6485Keywords:
MANET, routing protocols, queuing theory, firefly algorithmAbstract
Mobile ad hoc network (MANET) is a group of mobile nodes establishing a wireless network without using centralized and fixed infrastructure. In MANET, nodes may function as hosts and routers. The nodes can move freely and in arbitrary ways. The network topology in MANET is dynamic because of the frequent mobility of nodes, thus routing is challenging aspects in MANET. Routing protocol plays a role in choosing and selecting the optimal route for transferring the packets of data from the source node to the destination node efficiently. Mostly the previous routing protocols are not practical to this dynamic network topology. Therefore designing an efficient routing protocol for this dynamic network is vital issue. In this paper, the author has proposed an approach, which selects shortest route for transferring the packets of data from source node to the destination node combining firefly algorithm and queuing network analysis. Firefly algorithm can be applied to find the shortest route in this routing problem. The response times taken to send packets of data can be calculated using the suggested queuing model. The result reveals that attractiveness of node in MANET decreases with the increasing value of response time.
References
J. Loo, et al. 2012. Mobile Ad Hoc Networks : Current Status and Future Trends. Taylor & Francis Group.
A. H. Zakaria, et al. 2014. Performance Analysis of Mobile Ad Hoc Networks Using Queuing Theory. First International Conference on Advanced Data and Information Engineering (DaEng-2013). Kuala Lumpur, Malaysia. 16-18 December 2013.
L. J. GarcÃa Villalba, et al. 2011. Auto-Configuration Protocols in Mobile Ad Hoc Networks. Sensors. 11: 3652.
S. Kaur, et al. 2012. MANET Link Performance Parameters using Ant Colony Optimization Approach. International Journal of Computer Applications (IJCA). 47.
T. H. Ahmed. 2005. Simulation of Mobility and Routing in Ad Hoc Networks Using Ant Colony Algorithms. Information Technology: Coding and Computing (ITCC 2005). Las Vegas, NV, USA. 4-6 April 2005.
S. S. Dhillon and P. Van Mieghem. 2007. Performance Analysis of the AntNet Algorithm. Computer Networks. 51(8): 2104-2125.
A. Rout, et al. 2011. Optimized Ant Based Routing Protocol for MANET. Proceedings of the 2011 International Conference on Communication, Computing & Security. India. 12-14 February 2011.
M. Gunes, et al. 2002. ARA-the ant-colony based routing algorithm for MANETs. Parallel Processing Workshops, Proceedings. International Conference on Parallel Processing.
J. Wang, et al. 2009. HOPNET: A Hybrid Ant Colony Optimization Routing Algorithm for Mobile Ad Hoc Network. Ad Hoc Networks. 7(4): 690-705.
J. S. Baras and H. Mehta. 2003. A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks. Wiopt'03: Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks. France. 3-5 March 2003.
D. Subramanian, et al. 1997. Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks. IJCAI (2).
I. Fister, et al. 2013. A Comprehensive Review of Firefly Algorithms. Swarm and Evolutionary Computation. 13(2013): 34-46.
X.-S. Yang. 2010. Nature-Inspired Metaheuristic Algorithms: Second Edition. Luniver Press.
C. Liu, et al. 2012. A New Path Planning Method Based on Firefly Algorithm. Computational Sciences and Optimization. 23-26 June 2012.
S. Talatahari, et al. 2014. Optimum Design of Tower Structures Using Firefly Algorithm. The Structural Design of Tall and Special Buildings. 23(5): 350-361.
M. Ismail, et al. 2012. Firefly Algorithm for Path Optimization in PCB Holes Drilling Process. Green and Ubiquitous Technology (GUT). Jakarta, Indonesia. 30 June-1 July 2012.
J. Yuan, et al. 2013. QoS Multicast Routing Based on Firefly Algorithm. Computational Intelligence and Design (ISCID). Hangzhou, China. 28-29 October 2013.
J. Kwiecień and B. Filipowicz. 2012. Firefly Algorithm In Optimization of Queueing Systems. Bulletin of the Polish Academy of Sciences: Technical Sciences. 60(2): 363-368.
E. Lazowska, et al. 1984. Quantitative System Performance, Computer System Analysis Using Queuing Network Models. Prentice-Hall.
S. N. Kumbharana and G. M. Pandey. 2013. Solving Travelling Salesman Problem using Firefly Algorithm. International Journal for Research in Science & Advanced Technologies. 2(2): 053-057.
S. Palit, et al. 2011. A Cryptanalytic Attack on the Knapsack Cryptosystem Using Binary Firefly Algorithm. Computer and Communication Technology (ICCCT). India. 15-17 September 2011.
Downloads
Published
Issue
Section
License
Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.
