International Journal of Intelligent Systems and Applications (IJISA)
IJISA Vol. 9, No. 2, 8 Feb. 2017
Cover page and Table of Contents: PDF (size: 561KB)
Optimal Reliable Routing Path Selection in MANET through Novel Approach in GA
Full Text (PDF, 561KB), PP.35-41
Views: 0 Downloads: 0
Author(s)
Krishna S.R.M.
1,*
Seeta Ramanath M.N.
2
Kamakshi Prasad V.
3
Index Terms
Classification, GA, Roughsets, optimality, Performance
Abstract
In MANETs (Mobile Adhoc Network) judgment in optimal reliable routing path between source and destination is a challenging task because of the mobility nature of nodes and is deficient in the infrastructure of the network which is so dynamic. So the objective of this paper is to identify an optimal reliable ordered routing paths between source and destination nodes in MANET.To meet the above challenging task the paper focus on an new novel approach in Genetic Algorithm called Parametric fitness based Genetic Algorithm.Proposed algorithm hybridized with classification model rough sets as one key sub component which offers better accuracy results.
Cite This Paper
Krishna S.R.M., Seeta Ramanath M.N., Kamakshi Prasad V.,"Optimal Reliable Routing Path Selection in MANET through Novel Approach in GA", International Journal of Intelligent Systems and Applications (IJISA), Vol.9, No.2, pp.35-41, 2017. DOI:10.5815/ijisa.2017.02.05
Reference
[1]E.Albayarak and Erensal, Y.C. Using analitic hierarchy process to improve human performance.Journal of Intelligent manufacturing.15.491-503,2006.
[2]Vinay Kumar Saini , AhP,Fuzzy Sets and TOPSIS Based Reliable Route Selection for MANET.978-93-80544-12-0/14,IEEE Conf,2014 .
[3]Principles of soft computing by S.N.Sivanandan, S.N.Deepa Second edition, 2012.
[4]Nadia Qadri, Liotta Antonio, “ A COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS FOR MANETS”,University of Essex,Colchester,UK,IADIS International Conference Wireless Applications and computing 2008.
[5]T.Henderson ,'The NS-2 Network simulator',software package retrived from http://www.nsnam.org.
[6]Arun Biradar, Dr. Ravindra C. Thool, Performance Evaluation ofMobile Ad-hoc Networks Routing Protocols to Employ Genetic Algorithm,3rd World Congress on Information and Communication Technologies(WICT 2013), 15-18 December 2013, Hanoi, Vietnam, IEEE.
[7]Abhishek Roy, Sajal K. Das, "QM2RP : A QoS-BasedMobile Multicast Routing Protocol Using Multi-ObjectiveGenetic Algorithm", Center for Research in Wireless Mobilityand Networking (CRe WMaN),2004.
[8]Kumar Nikhil, Swati Agarwal and Pankaj Sharma, “application of genetic algorithm in designing a security model for mobile adhoc network”, CSIT, 2012.
[9]Clarles E. Per Kins and Pravin Bhagwat “Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for mobile computer “SIGCOMM, ACM (1994).
[10]Tarun Varsheney, Aishwary Katiyar, Pankaj Sharma , “ Performance Improvement of MANET under DSR Protocol using Swarm Optimization”, 978-1-4799-2900-9/14, IEEE Conf, 2014
[11]Arun Biradar, Dr. Ravindra C. Thool, Performance Evaluation ofMobile Ad-hoc Networks Routing Protocols to Employ Genetic Algorithm,3rd World Congress on Information and Communication Technologies (WICT 2013), 15-18 December 2013, Hanoi, Vietnam, IEEE.
[12]Abhishek Roy, Sajal K. Das, "QM2RP : A QoS-BasedMobile Multicast Routing Protocol Using Multi-ObjectiveGenetic Algorithm", Center for Research in Wireless Mobilityand Networking (CRe WMaN),2004.
[13]Kumar Nikhil, Swati Agarwal and Pankaj Sharma, “application of genetic algorithm in designing a security model for mobile adhoc network”, CSIT, 2012.
[14]Clarles E. Per Kins and Pravin Bhagwat “Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for mobile computer “SIGCOMM, ACM (1994).
[15]Aspal Jindal, Vishal Gupta,”Fuzzy Improved Genetic Approach for Route Optimization in MANET”, IJARCSSE, Volume 3, Issue 6, June 20.2013.
[16]Tarun Varsheney, Aishwary Katiyar, Pankaj Sharma , “ Performance Improvement of MANET under DSR Protocol using Swarm Optimization”, 978-1-4799-2900-9/14, IEEE Conf, 2014.
[17]AnpingZeng , TianruiLi, DunLiu, JunboZhang and HongmeiChen “ A fuzzy rough set approach for incremental feature selection onhybrid information systems” Science Direct , 2014, 39-60.
[18]Francisco Rodrigues Lima Junior, Lauro Osiro and Luiz Cesar Ribeiro Carpinetti “A comparison between Fuzzy AHP and Fuzzy TOPSIS methods to supplier selection” Science Direct , 2014, 194-209.
[19]Annapurna P Patil, Dr K Raj ani kanth, Bathey Sharanya, M P Dinesh Kumar, Malavika J, 'Design of Energy Efficient Routing Protocol for MANET based on AODV', International Journal of Computer Science Issues,Vol. 8, Issue 4, No I, July 2011.
[20]William Zhu, Student Member, IEEE and Fei-Yue Wang, Fellow, IEEE,’Relationships among Three Types of Covering RoughSets’,IEEE 11--44224444--00113334--X8, 2006.
[21]T. Jones, S. Forrest, Fitness distance correlation as a measure of problem difficulty for genetic algorithms,in: L.J. Eshelman (Ed.), Proc. 6th Internat. Conf. on Genetic Algorithms, Kaufman, LosAltos, CA, 1995,pp. 184–192
[22]Y.C. Erensal, T. Oncan, M.L. Demircan, Determining key capabilities in technology management using fuzzy analytic hierarchy process: a case study of Turkey, Information Sciences 176 (18) (2006) 2755–2770.
[23]D.Y. Chang, Applications of the extent analysis method on fuzzy AHP, European Journal of Operational Research 95 (1996) 649–655.
[24]F.T. Bozbura, A. Beskese, Prioritization of organizational capital measurement indicators using fuzzy AHP, International Journal of Approximate Reasoning 44 (2) (2007) 124–147.
[25]O.S. Vaidya, S. Kumar, Analytic hierarchy process: an overview of applications, European Journal of Operational Research 169 (2006) 1– 29.
[26]D. Merkle, M. Middendorf, Modelling ACO:composed permutation problems, in: M. Dorigo, G. Di Caro, M. Sampels (Eds.), AntAlgorithms, Proc. ANTS 2002, Third Internat Workshop, Lecture Notes in Computer Science, Vol. 2463, Springer, Berlin, Germany, 2002, pp. 149–162.
[27]M. Dorigo, Optimization, learning and natural algorithms (in Italian), Ph.D. Thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1992.
[28]M. Dorigo, T. Stutzle, Ant Colony Optimization, MIT Press, Cambridge, MA, 2004.
[29]T. Jones, S. Forrest, Fitness distance correlation as a measure of problem difficulty for genetic algorithms, in: L.J. Eshelman (Ed.), Proc. 6th Internat. Conf. on Genetic Algorithms, Kaufman, LosAltos, CA, 1995, pp. 184–192.
[30]D.E. Goldberg, Simple genetic algorithms and the minimal deceptive problem, in: L. Davis (Ed.), Genetic Algorithms and Simulated Annealing, Pitman, London, UK, 1987, pp. 74–88.