An efficient table driven routing algorithm for wireless ad hoc networks

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.