By Topic

An efficient table driven routing algorithm for wireless ad hoc networks

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

2 Author(s)
Woo-Jin Choi ; Center for Wireless Telecommun., New Jersey Inst. of Technol., Newark, NJ, USA ; Tekinay, S.

We propose a table driven routing algorithm for ad hoc networks using geolocation information of mobiles. Assuming that each mobile is aware of its mobility status (i.e., position, speed and direction of movement), mobiles may exchange this information for the purpose of routing. A high speed mobile on a highly directed path does not need to update its mobility status as long as it maintains its speed and direction. Each mobile can accurately estimate the geolocation of others using the speed and direction information. On the other hand, a slow-moving mobile doing random walk doesn't need to update its geolocation as long as it stays in a small local area. Based on this observation, we classify mobiles into local and global, and let the mobile choose the geolocation update scheme that minimizes the frequency of update for the corresponding mobility class. Each mobile may estimate the network topology using the geolocation information of other mobiles, but the geolocation information alone cannot provide an accurate view of the network because two adjacent mobiles may not be able to establish communication due to the radio communication impairment such as fading, jamming or interference from other radio sources. The proposed routing algorithm dynamically adapts to the physical layer impairment and provide loop-free minimum hop route

Published in:

Vehicular Technology Conference, 2001. VTC 2001 Fall. IEEE VTS 54th  (Volume:4 )

Date of Conference: