AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING
|
|
- Lindsay Benson
- 6 years ago
- Views:
Transcription
1 International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No , May-June ISSN (Online): AN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING Sunita Beniwal 1, 2,Dharminder Kumar 2 1 Department of Information Technology, Maharishi Markandeshwar University Mullana, Ambala, Haryana , India 2 Department of Computer Science and Engineering, Guru Jambheshwar University of Science and Technology Hisar, Haryana , India Abstract- Distance vector routing algorithms operate by having each router maintain a table giving the best known distance to each destination and which line to use to get there. Genetic algorithms are search algorithms based on mechanics of natural selection and natural genetics. To overcome some of the problems of traditional adaptive routing techniques genetic algorithms can be used. GA s have the capacity of solving complicated solutions in practical systems. Hardware implementation of GA is very fast and it is not sensitive to network size. GA s are very flexible as quality of solution can be adjusted as a function of population size. GA hardware scale well to network that may not even fit in memory. Due to the above reasons GA offers very promising solutions to many problems. In the proposed work parameters used for calculating the routes are hop count and queue length. For better performance of any network, path which is selected for transmission should be such that path with lowest hop count and shortest queue length is selected. Various parameters i.e. throughput, packet delivery ratio, delay, hop count etc. are analyzed to see the performance of the network with and without using GA in distance vector routing. Keywords: Crossover, Encoding, Fitness Function, Hop Count, Queue Length, Throughput. 1. INTRODUCTION Routing is a fundamental engineering task on the internet. It consists of finding a path from source to destination host. The routing algorithm is that part of network layer software responsible for deciding which output line an incoming packet should be transmitted on. Routing algorithms can be grouped into two major categories: Adaptive and Nonadaptive. Nonadaptive algorithms do not base their routing decisions on measurements or estimates of current traffic and topology. Instead the choice of the route to use to get from source to destination is computed in advance offline and downloaded when network is booted. This procedure is also called static routing. Adaptive algorithms in contrast change their routing decisions to reflect changes in the topology as well as traffic. Adaptive algorithms differ in where they get their information from, when they change the routes, what metric is used for optimization. Modern computer networks generally use dynamic routing algorithms rather than the static ones. Two dynamic algorithms in particular: Distance vector routing and Link state routing, are the most popular. The present work emphasize on distance vector routing technique. In distance vector routing, the router measures the distance directly with the help of special ECHO packets that the receiver just timestamps and sends it back. All the routers should carry out this process simultaneously. Thus regardless of the router being used or not, all of them connected in the network have to transmit the ECHO packets. Thus apart from the normal data packets, the ECHO packets must also be sent by the router in order refresh its routing table [1]. 2. GENETIC ALGORITHM The origin of Genetic Algorithm is attributed to John H. Holland [2]. Genetic algorithms are search algorithms based on mechanics of natural selection and natural genetics. Solutions are represented in the form of individuals (chromosome) which represent knowledge. A chromosome is represented by a vector storing genes. Population of GA is composed of group of individuals. Fitness is computed for all the individuals and the individuals with higher fitness survive and are selected for next generation. Crossover and mutation are genetic operators used for exploiting possible search spaces and for maintaining diversity in the population respectively [3]. 3. RELATED WORK Genetic algorithms have been applied widely to network problems in various domains such as network design problems, shortest path problems etc. Gen et al. [4] considered hybrid GAs (called spanning tree-based GAs) for difficult-to-solve network design problems inherent in industrial engineering and computer communication networks, such as degree-constrained minimum spanning tree problems, capacitated minimum spanning tree problems, fixed charge transportation problems, network topological design problems and so on. Davies and Lingras [5] used ISSN:
2 genetic algorithms for finding the shortest path in a dynamic network, which adapts to the changing network information by rerouting during the course of its execution. The technique proposed by Masillamani et al. [6] for optimization of distance vector routing technique minimizes the congestion by reducing the number of ECHO packets transmitted and uses genetic algorithm to optimize the path selection. In this technique only the routing tables through which the packet is forwarded are updated instead of all as in normal distance vector routing algorithm. The technique proposed optimizes the conventional distance vector algorithm. Selamat and Selamat [7] proposed a method to minimize network routing time taken by the mobile agents to collect information from different sites using genetic algorithm (GA). The proposed mobile agent for routing algorithm tries to minimize the query retrieval cost while maintaining a reasonable path delay. Zhu et al. [8] presented an algorithm for the Point to Multipoint Routing Problem that uses a genetic algorithm and a heuristic Steiner tree algorithm that allows the scheduler to find an optimal or near-optimal path through the network for each request. Genetic algorithm employed use permutation of number of requests for representing a chromosome. By using Steiner tree based routing instead of treating the point to multipoint requests as several point to point requests, there will generally be fewer simultaneous copies of a signal on a link, resulting in less network traffic and a potential for more requests to be sent. Ahn and Ramakrishna [9] presented a genetic algorithm based approach to the shortest path routing problem. A population-sizing equation that facilitates a solution with desired quality is developed based on the gambler s ruin model. The proposed algorithm exhibits a much better quality of solution and a much higher rate of convergence than other algorithms. 4. PROPOSED GENETIC ALGORITHM Distance vector routing technique makes use of the routing tables for calculating routes for incoming packets. Getting route information from routing tables is a tedious and time consuming procedure if network changes very rapidly. The objective of this work is to design a distance vector routing algorithm with elements of genetic algorithm in it so that route calculation become less time consuming and better routes are known faster than the traditional distance vector routing technique. The present work has been carried out using GloMoSim network simulator. For implementation of Genetic algorithm, encoding which is to be used i.e. how chromosomes are represented and used to store data for routing packets is selected. Then value of crossover operator and technique used for crossover is selected while maintaining the feasibility of paths. By feasible paths what is meant is that paths which are generated actually exist and intermediate routers which are there in the path one after another are connected to each other. 4.1 Encoding To solve a problem it is important to select proper encoding. Encoding represents transformation of solved problem to N-dimensional space of real (integer) numbers (mostly). Encoding used is list of nodes for reaching from source to destination. The size of chromosomes is not fixed. It is variable because number of nodes in a route is not fixed and can vary from two to total number of nodes in the network. The maximum size is obviously equal to total number of nodes. As different paths come as a reply to the source, those paths are stored as a sequence of nodes in the chromosome. So the structure of chromosomes is list of nodes in a sequence in which they are used to reach the destination. 4.2 Population Chromosomes store routes. So for initialization of population routes are used. Population is initialized using simple DSR in the beginning. The size of population is taken to be equal to maximum number of nodes in the network. Population of chromosomes is initialized by sending normal route request packets to the destination. After the number of route replies exceeds two GA is applied on them. 4.3 Crossover Crossover is basic chromosome operation used for creation of new individuals. New solutions produced are supposed to be in search space somewhere between parent solutions. Crossover used in this work is one point crossover i.e. crossover is done only at a single point. After the parents are selected randomly for crossover, it is checked whether they have some node in common. If they have some node in common then only crossover is applied otherwise crossover is not done on those chromosomes. After selection of common node the parts after that node are swapped and two new offspring are created and stored in the population. 4.4 Fitness Function Fitness function or objective function is that function which needs to be optimized that is either minimized or maximized according to the problem. In this study fitness function used is inversely proportional to sum of hop count and queue length. Fitness function=1/(hop count + queue length) As can be seen, if the number of nodes between source and destination is large, hop count is also large and so the value of fitness function is small. Similarly longer queue length means lesser value of fitness function. 4.5 Reproduction For selection of chromosomes for next generation roulette wheel selection is used. The chromosomes with high value of fitness function have more probability of selection than the chromosomes with lesser value of fitness. So those chromosomes with lower hop count and queue length have more probability of being selected. 4.6 Genetic Distance Vector Routing When a node has data to be send to another node it checks its route cache table to check for the presence of any path to that node. If path is present it is used for sending packet otherwise a route request is sent to all neighbors. If neighbors have a path to that node they send that information ISSN:
3 to the source node else they forward the packet. This process is repeated until either a path is found or the destination is reached. If the packet reaches the destination it see that the route request is for it only so it collect the path information from the packet and sends back a reply to source telling the route followed by the request path as route to it. Destination may receive multiple route request packets by multiple links connected to it. It sends back all replies to the source. After source receives the replies sent by the destination, GA comes into picture. For the time number of replies is less than two, simple reply handling procedure is carried out. After the number of replies exceeds one GA is applied, selection of chromosomes for next generation is done using the recombination technique described above. Crossover is then applied to selected chromosomes as per the crossover probability. Fitness is then calculated based on the hop count values and queue length. For the next generation, which are more fit that is whose fitness is more are selected more number of times for next generation. This process is repeated for many times unless the solution converges to a best solution. After the convergence the route whichever is best is selected and copied to the route cache table and then that route is used as a path from source to destination. 5.2 Throughput with Varying Number of Nodes As shown in fig 2 the addition of GA to DSR improves the performance of DSR by increasing its throughput. As the number of nodes increase the DSR with GA has more throughput than the DSR without GA. For lesser number of nodes the performance of both algorithms that is with and without using GA is nearly same, the difference comes when number of nodes is more than 50.After 50 number of nodes the performance of DSR with GA keeps on getting better. So it can be concluded from this graph that GA is helpful in case of more number of nodes. 5. RESULTS AND DISCUSSION GA is applied to DSR. The effect of applying GA on DSR is analyzed. In this section we will analyze the performance of the network by changing the various parameters like number of nodes, queue length etc. Then we will analyze the effect of GA on performance of DSR. 5.1 Hop Count v/s throughput Fig 1 shows that as number of hops between sender and receiver increases average throughput decreases. For less number of nodes between sender and receiver the number of packets transmitted per unit of time is more than if number of hops is less that is both are inversely proportional to each other. Fig 2 Average throughput vs No. of nodes 5.3 Hop count with Varying Number of nodes In any network as the number of nodes increase the average hop count of routes selected will increase. As shown in fig 3 as the number of nodes increase the difference between average hop count for with GA and without GA increase. For less number of nodes the average hop count is nearly same in both cases, but as the number of nodes increase the average hop count of DSR with GA decrease that is in this case the route with less hop count are generated and selected for transmission of packets. Fig 3 Average hop count v/s No. of nodes Fig 1 Hop count v/s throughput ISSN:
4 5.4 Average Queue Length and Average Throughput Vs Number of Nodes As can be seen from fig 4 throughput is more for less number of nodes because number of nodes are less which make the path length less and thus increases throughput. For queue length also for lesser number of nodes queue length is less because less number of nodes will transmit fastly on shorter paths. It is also seen from the graph that as queue length increases throughput decreases. It is because for longer queues most of the packets to be transmitted ar queued up waiting to be transmitted and thus more time needed for processing packets on intermediate routers and hence the decreased throughput. Fig 4 Average throughput and average queue length v/s No. of nodes 5.5 Average Throughput vs Average Queue Length Fig 5 Shows The Comparison Of Throughputs between DSR with GA and DSR without GA. As the average queue length is less the throughput is high whereas for more number of packets in queues average throughput is less. In DSR without GA the throughput is less than in case of DSR with GA. It means that GA decreases the probability of selection of a route with greater average queue length whereas in case DSR without GA the route with more average queue length more number of times for transmission before selecting the best possible path. Fig 5 Average queue length v/s average throughput 6. CONCLUSION Genetic Algorithms are nowadays used to solve problems with large search space and which are difficult to solve. GA s have many advantages because of which they are preferred. First of all, GA s have the capacity of solving complicated solutions in practical systems. Hardware implementations of GA are very fast and it is not sensitive to network size. GA s are very flexible as quality of solution can be adjusted as a function of population size. GA hardware scale well to network that may not even fit in memory. So due to the above reasons GA offers very promising solutions to many problems. In this paper an explanation of GA s, Distance Vector Routing technique and their advantages and disadvantages has been presented. Then various encoding, crossover and reproduction operators to be used in the proposed system is discussed. In the present work fitness function used is dependent on two parameters namely hop count and queue length. Only these two parameters affect the routes computed by the GA designed. For future work different variables and their combination can be taken into account to compute the fitness of the routes. Some of the parameters which can be considered are: ISSN: Capacity of the links can be taken as a parameter. Different constraints can be applied like whether to send all packets via same route or the priority of some routes can be set to high depending on their reliability in data delivery. Different combinations of parameters can be used to construct a multi parameter GA which can improve the performance of DSR even more. Advanced crossover scheme should be implemented wherein more than one vector of the two chromosomes can be crossover. REFERENCES Some method to implement mutation may also be devised to maintain diversity in the population. 1. Tanenbaum, A.S., Computer Networks. 4th Edn., Prentice-Hall Inc. 2. Holland, J.H., Adaptation in Natural and Artificial Systems. 1st Edn., University of Michigan Press, Ann Arbor. 3. De Jong, K., Learning with genetic algorithms: An overview, Machine learning, vol. 3, Gen, M., A. Kumar and J.R. Kim, Recent network design techniques using evolutionary algorithms. Int. J. Prod. Econ., 98: Davies C. and P. Lingras, Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks. Eur. J. Oper. Res., 144: Masillamani, M.R., A.V. Suriyakumar, R. Ponnurangam and G.V. Uma, Genetic algorithm for distance vector routing technique. Int. J. Artif. Intell. Mach. Learn., 6: Selamat, A. and M.H. Selamat, Routing algorithm of mobile agents for query retrieval using genetic algorithm. Malaysian J. Comput. Sci., 17: Zhu, L., R.L. Wainwright and D.A. Schoenefeld, A genetic algorithm for the point to multipoint routing problem with varying number of requests. Proceedings of
5 the IEEE International Conference on Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence, May 4-9, 1998, Anchorage, AK., USA., pp: Ahn, C.W. and R.S. Ramakrishna, A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans. Evol. Comput., 6 (6): ISSN:
Role of Genetic Algorithm in Routing for Large Network
Role of Genetic Algorithm in Routing for Large Network *Mr. Kuldeep Kumar, Computer Programmer, Krishi Vigyan Kendra, CCS Haryana Agriculture University, Hisar. Haryana, India verma1.kuldeep@gmail.com
More informationNetwork Routing Protocol using Genetic Algorithms
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:0 No:02 40 Network Routing Protocol using Genetic Algorithms Gihan Nagib and Wahied G. Ali Abstract This paper aims to develop a
More informationDesign of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm
Design of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm UMIT ATILA 1, ISMAIL RAKIP KARAS 2, CEVDET GOLOGLU 3, BEYZA YAMAN 2, ILHAMI MUHARREM ORAK 2 1 Directorate of Computer
More informationGenetic Algorithms. Kang Zheng Karl Schober
Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization
More informationA New Approach for Energy Efficient Routing in MANETs Using Multi Objective Genetic Algorithm
A New Approach for Energy Efficient in MANETs Using Multi Objective Genetic Algorithm Neha Agarwal, Neeraj Manglani Abstract Mobile ad hoc networks (MANET) are selfcreating networks They contain short
More informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
28 Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 1 Tanu Gupta, 2 Anil Kumar 1 Research Scholar, IFTM, University, Moradabad, India. 2 Sr. Lecturer, KIMT, Moradabad, India. Abstract Many
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationResearch Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
More informationTime Complexity Analysis of the Genetic Algorithm Clustering Method
Time Complexity Analysis of the Genetic Algorithm Clustering Method Z. M. NOPIAH, M. I. KHAIRIR, S. ABDULLAH, M. N. BAHARIN, and A. ARIFIN Department of Mechanical and Materials Engineering Universiti
More informationRouting in Dynamic Network using Ants and Genetic Algorithm
194 Routing in Dynamic Network using Ants and Genetic Algorithm Cauvery N K + and Dr K V Viswanatha * R V College of Engineering, Bangalore, India. Summary Routing in dynamic network is a challenging one,
More informationGenetic algorithm based on number of children and height task for multiprocessor task Scheduling
Genetic algorithm based on number of children and height task for multiprocessor task Scheduling Marjan Abdeyazdan 1,Vahid Arjmand 2,Amir masoud Rahmani 3, Hamid Raeis ghanavati 4 1 Department of Computer
More informationGrid Scheduling Strategy using GA (GSSGA)
F Kurus Malai Selvi et al,int.j.computer Technology & Applications,Vol 3 (5), 8-86 ISSN:2229-693 Grid Scheduling Strategy using GA () Dr.D.I.George Amalarethinam Director-MCA & Associate Professor of Computer
More informationAn Energy Efficient Multicast Routing Based On Genetic Algorithm for MANET
An Energy Efficient Multicast Routing Based On Genetic Algorithm for MANET P.Prasanna 1, D.Saravanan 2, RM.Chandrasekaran 3 PG scholar, Pavendar Bharathidasan College of Engg and Tech, Tiruchirappalli,
More informationA genetic algorithm approach for finding the shortest driving time on mobile devices
Scientific Research and Essays Vol. 6(2), pp. 394-405, 18 January, 2011 Available online at http://www.academicjournals.org/sre DOI: 10.5897/SRE10.896 ISSN 1992-2248 2011 Academic Journals Full Length
More informationComputation of Multiple Node Disjoint Paths
Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes
More informationA Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2
Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications
More informationCHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN
97 CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 5.1 INTRODUCTION Fuzzy systems have been applied to the area of routing in ad hoc networks, aiming to obtain more adaptive and flexible
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationSecure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks
Journal of Computer Science 7 (12): 1813-1818, 2011 ISSN 1549-3636 2011 Science Publications Secure Enhanced Authenticated Routing Protocol for Mobile Ad Hoc Networks 1 M.Rajesh Babu and 2 S.Selvan 1 Department
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationArtificial Intelligence Application (Genetic Algorithm)
Babylon University College of Information Technology Software Department Artificial Intelligence Application (Genetic Algorithm) By Dr. Asaad Sabah Hadi 2014-2015 EVOLUTIONARY ALGORITHM The main idea about
More informationSuppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you?
Gurjit Randhawa Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you? This would be nice! Can it be done? A blind generate
More informationSelection of Optimal Path in Routing Using Genetic Algorithm
Selection of Optimal Path in Routing Using Genetic Algorithm Sachin Kumar Department of Computer Science and Applications CH. Devi Lal University, Sirsa, Haryana Avninder Singh Department of Computer Science
More informationGENETIC ALGORITHM-AIDED ROUTING ON 3D DYNAMIC NETWORKS
GENETIC ALGORITHM-AIDED ROUTING ON 3D DYNAMIC NETWORKS U. Atila a *, I. R. Karas b a Directorate of Computer Center, Gazi University, Teknikokullar, Besevler, 06500, Ankara, Turkey - umitatila@gmail.com
More informationQoS Constraints Multicast Routing for Residual Bandwidth Optimization using Evolutionary Algorithm
QoS Constraints Multicast Routing for Residual Bandwidth Optimization using Evolutionary Algorithm Sushma Jain* and J.D. Sharma Abstract For the real time multimedia applications, the routing algorithms
More informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree Rahul Mathur M.Tech (Purs.) BU, AJMER IMRAN KHAN Assistant Professor AIT, Ajmer VIKAS CHOUDHARY Assistant Professor AIT, Ajmer ABSTRACT:-Many
More informationPERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS
PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS AMANDEEP University College of Engineering, Punjabi University Patiala, Punjab, India amandeep8848@gmail.com GURMEET KAUR University College of Engineering,
More informationIJMT Volume 2, Issue 3 ISSN:
QoS Routing Protocol Using GAs Ali.A.Sakr* Mai.R.Ibraheem** Abstract: Routing protocols in most networks use the length of paths or the minimum-hops can be achieved, as the routing metric and the QoS requirements.
More informationAn Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid
An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid Demin Wang 2, Hong Zhu 1, and Xin Liu 2 1 College of Computer Science and Technology, Jilin University, Changchun
More informationUsing Genetic Algorithms in Integer Programming for Decision Support
Doi:10.5901/ajis.2014.v3n6p11 Abstract Using Genetic Algorithms in Integer Programming for Decision Support Dr. Youcef Souar Omar Mouffok Taher Moulay University Saida, Algeria Email:Syoucef12@yahoo.fr
More informationGENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL
3 rd Research/Expert Conference with International Participations QUALITY 2003, Zenica, B&H, 13 and 14 November, 2003 GENETIC ALGORITHM METHOD FOR COMPUTER AIDED QUALITY CONTROL Miha Kovacic, Miran Brezocnik
More informationRevision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems
4 The Open Cybernetics and Systemics Journal, 008,, 4-9 Revision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems K. Kato *, M. Sakawa and H. Katagiri Department of Artificial
More informationA NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES
A NOVEL APPROACH FOR PRIORTIZATION OF OPTIMIZED TEST CASES Abhishek Singhal Amity School of Engineering and Technology Amity University Noida, India asinghal1@amity.edu Swati Chandna Amity School of Engineering
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationUsing Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationEffects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks
Effects of Sensor Nodes Mobility on Routing Energy Consumption Level and Performance of Wireless Sensor Networks Mina Malekzadeh Golestan University Zohre Fereidooni Golestan University M.H. Shahrokh Abadi
More informationKhushboo Arora, Samiksha Agarwal, Rohit Tanwar
International Journal of Scientific & Engineering Research, Volume 7, Issue 1, January-2016 1014 Solving TSP using Genetic Algorithm and Nearest Neighbour Algorithm and their Comparison Khushboo Arora,
More informationEPARGA: A Resourceful Power Aware Routing Protocol for MANETs
EPARGA: A Resourceful Power Aware Routing Protocol for MANETs Shipra Suman, Er. Aditi Agrawal, Prof. A.K. Jaiswal Abstract A Mobile Ad-hoc Network (MANET) is a collection of wireless mobile hosts which
More informationA New Selection Operator - CSM in Genetic Algorithms for Solving the TSP
A New Selection Operator - CSM in Genetic Algorithms for Solving the TSP Wael Raef Alkhayri Fahed Al duwairi High School Aljabereyah, Kuwait Suhail Sami Owais Applied Science Private University Amman,
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationA Hybrid Approach for Misbehavior Detection in Wireless Ad-Hoc Networks
A Hybrid Approach for Misbehavior Detection in Wireless Ad-Hoc Networks S. Balachandran, D. Dasgupta, L. Wang Intelligent Security Systems Research Lab Department of Computer Science The University of
More informationA Review on Quality-of-Service Multicast Routing Techniques Based on Genetic Algorithm in Manet
A Review on Quality-of-Service Multicast Routing Techniques Based on Genetic Algorithm in Manet Sukhvinder Singh Department of Computer Science and Engineering Guru Jambheshwar University of Science and
More informationComparative Study on VQ with Simple GA and Ordain GA
Proceedings of the 9th WSEAS International Conference on Automatic Control, Modeling & Simulation, Istanbul, Turkey, May 27-29, 2007 204 Comparative Study on VQ with Simple GA and Ordain GA SADAF SAJJAD
More informationAnil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput.
Volume 6, Issue 7, July 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Analysis
More informationCHAPTER 4 GENETIC ALGORITHM
69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is
More informationARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS
ARTIFICIAL INTELLIGENCE (CSCU9YE ) LECTURE 5: EVOLUTIONARY ALGORITHMS Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Optimisation problems Optimisation & search Two Examples The knapsack problem
More informationA GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS
A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS BERNA DENGIZ AND FULYA ALTIPARMAK Department of Industrial Engineering Gazi University, Ankara, TURKEY 06570 ALICE E.
More informationGenetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem
etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA
More informationA COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET
ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer
More informationCalc Redirection : A Structure for Direction Finding Aided Traffic Monitoring
Calc Redirection : A Structure for Direction Finding Aided Traffic Monitoring Paparao Sanapathi MVGR College of engineering vizianagaram, AP P. Satheesh, M. Tech,Ph. D MVGR College of engineering vizianagaram,
More informationIntroduction to Genetic Algorithms
Advanced Topics in Image Analysis and Machine Learning Introduction to Genetic Algorithms Week 3 Faculty of Information Science and Engineering Ritsumeikan University Today s class outline Genetic Algorithms
More informationMarch 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland March 19, 2014
More informationEvolutionary Computation Algorithms for Cryptanalysis: A Study
Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis
More informationMINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 5 th, 2006 MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS Richard
More informationPath Planning Optimization Using Genetic Algorithm A Literature Review
International Journal of Computational Engineering Research Vol, 03 Issue, 4 Path Planning Optimization Using Genetic Algorithm A Literature Review 1, Er. Waghoo Parvez, 2, Er. Sonal Dhar 1, (Department
More informationIntroduction to Genetic Algorithms. Genetic Algorithms
Introduction to Genetic Algorithms Genetic Algorithms We ve covered enough material that we can write programs that use genetic algorithms! More advanced example of using arrays Could be better written
More informationISSN: [Keswani* et al., 7(1): January, 2018] Impact Factor: 4.116
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY AUTOMATIC TEST CASE GENERATION FOR PERFORMANCE ENHANCEMENT OF SOFTWARE THROUGH GENETIC ALGORITHM AND RANDOM TESTING Bright Keswani,
More informationA GENETIC ALGORITHM SOLUTION TO SOLVE THE SHORTEST PATH PROBLEM IN OSPF AND MPLS
Malaysian Journal of Computer Science, Vol. 16 No. 1, June 2003, pp. 58-67 A GENETIC ALGORITHM SOLUTION TO SOLVE THE SHORTEST PATH PROBLEM IN OSPF AND MPLS N. Selvanathan and Wee Jing Tee Faculty of Computer
More informationA Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen 2, b
International Conference on Information Technology and Management Innovation (ICITMI 2015) A Hybrid Genetic Algorithm for the Distributed Permutation Flowshop Scheduling Problem Yan Li 1, a*, Zhigang Chen
More informationRegression Test Case Prioritization using Genetic Algorithm
9International Journal of Current Trends in Engineering & Research (IJCTER) e-issn 2455 1392 Volume 2 Issue 8, August 2016 pp. 9 16 Scientific Journal Impact Factor : 3.468 http://www.ijcter.com Regression
More informationImprovement of Web Search Results using Genetic Algorithm on Word Sense Disambiguation
Volume 3, No.5, May 24 International Journal of Advances in Computer Science and Technology Pooja Bassin et al., International Journal of Advances in Computer Science and Technology, 3(5), May 24, 33-336
More informationCONCEPT FORMATION AND DECISION TREE INDUCTION USING THE GENETIC PROGRAMMING PARADIGM
1 CONCEPT FORMATION AND DECISION TREE INDUCTION USING THE GENETIC PROGRAMMING PARADIGM John R. Koza Computer Science Department Stanford University Stanford, California 94305 USA E-MAIL: Koza@Sunburn.Stanford.Edu
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
More informationGenetic Algorithm for Network Design Problem-An Empirical Study of Crossover Operator with Generation and Population Variation
International Journal of Information Technology and Knowledge Management July-December 2010, Volume 2, No. 2, pp. 605-611 Genetic Algorithm for Network Design Problem-An Empirical Study of Crossover Operator
More informationGA is the most popular population based heuristic algorithm since it was developed by Holland in 1975 [1]. This algorithm runs faster and requires les
Chaotic Crossover Operator on Genetic Algorithm Hüseyin Demirci Computer Engineering, Sakarya University, Sakarya, 54187, Turkey Ahmet Turan Özcerit Computer Engineering, Sakarya University, Sakarya, 54187,
More informationGENETIC ALGORITHM with Hands-On exercise
GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic
More informationStudy and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs
Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate
More informationAn Idea for Finding the Shortest Driving Time Using Genetic Algorithm Based Routing Approach on Mobile Devices
An Idea for Finding the Shortest Driving Time Using Genetic Algorithm Based Routing Approach on Mobile Devices Umit Atila, Ismail Rakip Karas, Cevdet Gologlu, Beyza Yaman, and Ilhami Muharrem Orak Abstract
More informationEvolutionary Computation Part 2
Evolutionary Computation Part 2 CS454, Autumn 2017 Shin Yoo (with some slides borrowed from Seongmin Lee @ COINSE) Crossover Operators Offsprings inherit genes from their parents, but not in identical
More informationPerformance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s
Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations
More informationGenetic Algorithms For Vertex. Splitting in DAGs 1
Genetic Algorithms For Vertex Splitting in DAGs 1 Matthias Mayer 2 and Fikret Ercal 3 CSC-93-02 Fri Jan 29 1993 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401, U.S.A. (314)
More informationShortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks
Shortcut Tree Routing using Neighbor Table in ZigBee Wireless Networks Salmu K.P 1, Chinchu James 2 1,2 Department of Computer Science, IIET, Nellikuzhi Abstract- ZigBee is a worldwide standard for wireless
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationA Taguchi Approach to Parameter Setting in a Genetic Algorithm for General Job Shop Scheduling Problem
IEMS Vol. 6, No., pp. 9-4, December 007. A Taguchi Approach to Parameter Setting in a Genetic Algorithm for General Job Shop Scheduling Problem Ji Ung Sun School of Industrial & Managment Engineering Hankuk
More information[Premalatha, 4(5): May, 2015] ISSN: (I2OR), Publication Impact Factor: (ISRA), Journal Impact Factor: 2.114
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY GENETIC ALGORITHM FOR OPTIMIZATION PROBLEMS C. Premalatha Assistant Professor, Department of Information Technology Sri Ramakrishna
More informationScheduling in Multiprocessor System Using Genetic Algorithms
Scheduling in Multiprocessor System Using Genetic Algorithms Keshav Dahal 1, Alamgir Hossain 1, Benzy Varghese 1, Ajith Abraham 2, Fatos Xhafa 3, Atanasi Daradoumis 4 1 University of Bradford, UK, {k.p.dahal;
More informationPERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK UTILISATION BY SIMULATION WITH DROP-TAIL
I.J.E.M.S., VOL.2 (4) 2011: 221-228 ISSN 2229-600X PERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK UTILISATION BY SIMULATION WITH DROP-TAIL Jai Kumar, Jaiswal Umesh Chandra Department of Computer Science
More informationArun Biradar et al, Int.J.Computer Technology & Applications,Vol 5 (1),25-30
Intelligent Unipath Routing for MANET Using Genetic Algorithm Arun Biradar 1 and Dr. Ravindra C. Thool 2 1 East West Institute of Technology, Bangalore 2 SGGS Institute of Engineering & Technology, Nanded
More informationA Modified Genetic Algorithm for Process Scheduling in Distributed System
A Modified Genetic Algorithm for Process Scheduling in Distributed System Vinay Harsora B.V.M. Engineering College Charatar Vidya Mandal Vallabh Vidyanagar, India Dr.Apurva Shah G.H.Patel College of Engineering
More informationAdaptive Crossover in Genetic Algorithms Using Statistics Mechanism
in Artificial Life VIII, Standish, Abbass, Bedau (eds)(mit Press) 2002. pp 182 185 1 Adaptive Crossover in Genetic Algorithms Using Statistics Mechanism Shengxiang Yang Department of Mathematics and Computer
More informationMultiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover
Multiobjective Job-Shop Scheduling With Genetic Algorithms Using a New Representation and Standard Uniform Crossover J. Garen 1 1. Department of Economics, University of Osnabrück, Katharinenstraße 3,
More informationPerformance of Ad-Hoc Network Routing Protocols in Different Network Sizes
Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes Sudheer Kumar 1, Akhilesh Yadav 2 Department of Computer Science and Engineering Kanpur Institute of Technology, Kanpur sudheerkr21@gmail.co
More informationSolving A Nonlinear Side Constrained Transportation Problem. by Using Spanning Tree-based Genetic Algorithm. with Fuzzy Logic Controller
Solving A Nonlinear Side Constrained Transportation Problem by Using Spanning Tree-based Genetic Algorithm with Fuzzy Logic Controller Yasuhiro Tsujimura *, Mitsuo Gen ** and Admi Syarif **,*** * Department
More informationAODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
More informationIntroduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell
Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas
More informationV.Petridis, S. Kazarlis and A. Papaikonomou
Proceedings of IJCNN 93, p.p. 276-279, Oct. 993, Nagoya, Japan. A GENETIC ALGORITHM FOR TRAINING RECURRENT NEURAL NETWORKS V.Petridis, S. Kazarlis and A. Papaikonomou Dept. of Electrical Eng. Faculty of
More informationTask Graph Scheduling on Multiprocessor System using Genetic Algorithm
Task Graph Scheduling on Multiprocessor System using Genetic Algorithm Amit Bansal M.Tech student DCSE, G.N.D.U. Amritsar, India Ravreet Kaur Asst. Professor DCSE, G.N.D.U. Amritsar, India Abstract Task
More informationRouting Protocols in MANETs
Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an
More informationOptimization Technique using Clustering to Prolong the Lifetime of Wireless Sensor Networks: A Review
INTERNATIONAL JOURNAL OF R&D IN ENGINEERING, SCIENCE AND MANAGEMENT Vol.4, Issue 2, June 2016, p.p.248-255, ISSN 2393-865X Optimization Technique using Clustering to Prolong the Lifetime of Wireless Sensor
More informationC 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem
C 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem Bethany Elvira 1, Yudi Satria 2, dan Rahmi Rusin 3 1 Student in Department of Mathematics, University of Indonesia,
More informationMobile Robots Path Planning using Genetic Algorithms
Mobile Robots Path Planning using Genetic Algorithms Nouara Achour LRPE Laboratory, Department of Automation University of USTHB Algiers, Algeria nachour@usthb.dz Mohamed Chaalal LRPE Laboratory, Department
More informationEfficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks
Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,
More informationPerformance Evaluation of DSDV, DSR AND ZRP Protocol in MANET
Performance Evaluation of, AND Protocol in MANET Zaiba Ishrat IIMT Engg college,meerut Meerut, India Pankaj singh Sidhi vinayak Group of College,Alwar Alwar,Rajasthan Rehan Ahmad IIMT Engg college,meerut
More informationPATH PLANNING OF ROBOT IN STATIC ENVIRONMENT USING GENETIC ALGORITHM (GA) TECHNIQUE
PATH PLANNING OF ROBOT IN STATIC ENVIRONMENT USING GENETIC ALGORITHM (GA) TECHNIQUE Waghoo Parvez 1, Sonal Dhar 2 1 Department of Mechanical Engg, Mumbai University, MHSSCOE, Mumbai, India 2 Department
More informationConsiderable Detection of Black Hole Attack and Analyzing its Performance on AODV Routing Protocol in MANET (Mobile Ad Hoc Network)
Editorial imedpub Journals http://www.imedpub.com/ American Journal of Computer Science and Information Technology DOI: 10.21767/2349-3917.100025 Considerable Detection of Black Hole Attack and Analyzing
More informationSolving Sudoku Puzzles with Node Based Coincidence Algorithm
Solving Sudoku Puzzles with Node Based Coincidence Algorithm Kiatsopon Waiyapara Department of Compute Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand kiatsopon.w@gmail.com
More informationGenetic algorithms for job shop scheduling problems with alternative routings
Downloaded By: [Pusan National University Library] At: 07:0 8 March 008 International Journal of Production Research, Vol., No. 0, May 008, 9 70 Genetic algorithms for job shop scheduling problems with
More informationImplementation of ODMRP Based QoS Multicast Routing in MANET
Implementation of ODMRP Based QoS Multicast Routing in MANET B.Savisooriyaja 1, P.Josephin 2, D.Narmatha 3 1AsstProf.-Department of Electronics and Communication Engineering, Einstein College of Engineering,
More informationGenetic Algorithms Variations and Implementation Issues
Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary
More information