A survey of routing algorithms for MANET

A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. As the nodes are mobile, it is very difficult to find the path between two end points. This paper presents a survey of routing algorithms for finding path between nodes in mobile ad hoc network. . In recent years,several routing algorithms have been proposed for mobile ad hoc networks and prominent among them are ant-colony, bee-colony, termite, distance vector routing and novel. The functions and features involved in implementation of different routing algorithms for MANET are discussed in detail giving comparative study of various routing algorithms.