By Topic

A survey of routing algorithms for MANET

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
D. Sivakumar ; Arunai College of Engineering, India ; B. Suseela ; R. Varadharajan

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.

Published in:

Advances in Engineering, Science and Management (ICAESM), 2012 International Conference on

Date of Conference:

30-31 March 2012