TY  - JOUR
T1  - Shortest Path Routing in Mobile Ad-Hoc Networks Using Enhanced Artificial Bee Colony with Immigrants
AU - , Kannammal AU - Kumari, E. Hemalatha Jai 
JO  - Journal of Engineering and Applied Sciences
VL  - 9
IS  - 6
SP  - 237
EP  - 242
PY  - 2014
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2014.237.242
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2014.237.242
KW  - genetic algorithm
KW  -shortest path routing
KW  -mobile ad-hoc network
KW  -Artificial bee colony
KW  -stead fast
AB  - Mobile Ad-hoc Networks (MANETs) are predominantly useful for serious circumstances, including military, law enforcement, emergency rescue and disaster recovery. MANET is a collection of autonomous self-organized nodes. They use wireless medium for communication. About 2 nodes can communicate directly or within each other transmission radius in a multi-hop fashion. Many conventional routing algorithms have been proposed for MANETs in early years. And also many meta heuristic optimization techniques like swarm intelligence algorithms are addressing the static shortest path in the realm of wireless network routing. The motion of MANET is dynamic and hence, the shortest path routing problem in MANET manifests into a dynamic optimization problem. The nodes are instilled with an awareness of the environmental conditions by making them operational through intelligence routing becomes a key concern, as it has a significant impact towards network performance. The study proposed to solve shortest path problem in MANETs using enhanced artificial bee colony optimization algorithm. MANETs are kept and considered target systems because they do represent the next generation wireless network. The results of experiment explicate that enhanced artificial bee colony is steadfast to adapt to the gradations in the environment.
ER  -