A distance routing effect algorithm for mobility (DREAM)

In this paper we introduce a new routing protocol for ad hoc networks built around two novel observations. One, called the distance effect, uses the fact that the greater the distance separating two nodes, the slower they appear to be moving with respect to each other. Accordingly, the location information in routing tables can be updated as a function of the distance separating nodes without compromising the routing accuracy. The second idea is that of triggering the sending of location updates by the moving nodes autonomously, based only on a node's mobility rate. Intuitively, it is clear that in a directional routing algorithm, routing information about the slower moving nodes needs to be updated less frequently than that about highly mobile nodes. In this way each node can optimize the frequency at which it sends updates to the networks and correspondingly reduce the bandwidth and energy used, leading to a fully distributed and self-optimizing system. Based on these routing tables, the proposed directional algorithm sends messages in the "recorded direction"of the destination node, guaranteeing delivery by following the direction with a given probability. We show by detailed simulation that our protocol always delivers more than 80% of the data messages by following the direction computed, without using any recovery procedure. In addition, it minimizes the overhead used for maintaining routes using the two new principles of update message frequency and distance. Lastly, the algorithm is fully distributed, provides loop-free paths, and is robust, since it supplies multiple routes.