By Topic

LBSPR: Location based shortest path routing protocol in 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

4 Author(s)
Suparna DasGupta ; Dept of IT, JIS College of Engineering, Kalyani, West Bengal, India ; Soumyabrata Saha ; Deblina Bhowal ; Dipanwita Bhowmik

Mobile Ad hoc networks are self-organizing and self-configuring multi hop wireless networks where, the structure of the network changes dynamically. Since a destination node might be out of range of a source node, a routing procedure is always needed to find a path, so as to forward the packets appropriately between the source and the destination. This paper proposes a new approach to evolve a suitable algorithm along with a brief review of the state of the art scenario of routing topologies for mobile ad hoc networks. This paper suggests an approach to minimize the routing overhead and focuses to on finding the shortest route to deliver the packet from source to destination and also minimize the time delay for finding the route.

Published in:

Computational Intelligence and Computing Research (ICCIC), 2010 IEEE International Conference on

Date of Conference:

28-29 Dec. 2010