期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：3
出版社：S.S. Mishra
摘要：Routing algorithms are often difficult to be formalized into mathematics, they are instead tested using extensive simulation [1]. Early work on volatile network environments experienced in mobile ad hoc networks (MANETs) depends primarily on applying the traditional approaches of routing in wired network s, such as distance vector or link state algorithms. While many optimizations to these algorithms exist, each of them is primarily concerned with finding the minimum hop route from source to destination [2,3,4 ]. A large amount of work has also been done in the area of energy efficient routing. This approach attempts to maximize network lifetime by routing through paths, which use the least amount of energy relative to each node [5]. In this research paper we will study all ant based optimized routing algorithms to solve routing problems
