OPTIMAL ROUTING BASED ON ARTIFICIAL BEE COLONY IN MOBILE ADHOC NETWORK
Journal: International Journal of Computer Engineering and Technology (IJCET) (Vol.10, No. 6)Publication Date: 2019-12-23
Authors : Sivakumar K;
Page : 66-73
Keywords : Dynamic Optimization Problem (DOP); Shortest Path Routing Problem (SPRP); ArtificialBee Colony; Foraging Behavior.;
Abstract
Artificial bee colony algorithms are considered as a search process used in computing to find exact or a approximate solution for dynamic optimization and search problems. There are also termed as global search heuristics. These techniques are dynamic optimization method for shortest path and other optimization problems which borrows ideas from biological bees behavior such as food source, employed foragers,unemployed foragers. These algorithms give a way programto instinctivelyimprove their parameters. Moreover, experimental results show that ABC algorithm finds the optimal routing than the other algorithms and enhances the performance in changing environments
Other Latest Articles
- Modernization of Industry through Import Substitution and Localization of Production in Mechanical Engineering
- OPTIMAL PLACEMENT OF GATEWAY BASED ON GREEDY TECHNIQUE IN MULTI-HOP VEHICLE INTERNET ACCESS
- MODEL DRIVEN SECURITY OF EXTENDING STATE CHART NOTATION
- Investigation of factors of EU port competitiveness
- IMPLEMENTATION OF NETWORK CORRELATION METHOD TO ACHIEVE PRIVACY IN SOCIAL MEDIA COMMUNICATIONS
Last modified: 2021-07-07 22:30:47