ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

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:

Authors : ;

Page : 66-73

Keywords : Dynamic Optimization Problem (DOP); Shortest Path Routing Problem (SPRP); ArtificialBee Colony; Foraging Behavior.;

Source : Downloadexternal Find it from : Google Scholarexternal

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

Last modified: 2021-07-07 22:30:47