Fresh Algorithm for efficient route discovery in MANET

Fresh: fresher encounter search

Principle:

Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source node searches for any intermediate node that encountered the destinationMore recently than did the source node itself. The intermediate node then searches for a node that encountered the destination yet more recently, and the procedure iterates until the destination is reached.

The performance of such a scheme will depend on the nodes 'mobility processes.

Introduction:

On-demand routing overhead can be broken down into two components: route discovery and route maintenance

(The route discovery represents up to 90% of the total routing overhead of OSCAR ).

In this paper, the authors proposed an algorithm called fresh to improves the performance of the route discovery over omnidirectional approaches (by exploiting the history of last encounters between nodes ).

Motivation: The history of last encounters between nodes contains valuable, but noisy information about the current network topology.

Packets descend along the age gradient. (thus far, I'm still confused)

Fresher encounter search:

The encounter age of two nodes N and m is the time elapsed since the most recent encounter of N and M.

TLe (I,D) Denotes the age of the most recent encounter between nodesIAndD.

Algorithm formulation:

The pseudo code below runs at every node in the network.

 

Del. icio. us tags: dtn, contact, encounter