By Topic

Routing in mobile ad hoc networks with global knowledge

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
$31 $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

1 Author(s)
Platt, D. ; Univ. of Wollongong, NSW, Australia

This paper describes a method of routing in mobile ad hoc networks. The problem is exacerbated by the fact that the radio links between the nodes of the network are continually being made and broken. The method consists of using the known connections to construct a "map" of the network which is intended to reproduce the geographical layout of the network at any time. An algorithm is described which finds a route from one node to another by always attempting to move geographically closer to the destination at every hop. This produces nearly optimal performance with very short computation time. The signaling load on the system is quite low. The scaling properties of the system are investigated and it is found that the system is viable with nodes numbering in the hundreds.

Published in:

Communication Systems, 2002. ICCS 2002. The 8th International Conference on  (Volume:2 )

Date of Conference:

25-28 Nov. 2002