New refresh algorithm for highly adaptive networks in flavor of OLSR protocol

Abstract EN

Many routing algorithms had been developed for highly adaptive networks [1],[2],[3].

They implement refresh algorithms to disseminate the topological changes to all other partners in the network.

The process of refreshing need to be takes the bandwidth consuming into account.

This work considers refresh algorithm depend on OLSR (Optimized Link State Protocol , were it depends on some points in the network as disseminating points to reduce the traffic at all.

[4] proposed a highly adaptive routing algorithm, but with rout optimality drawbacks as the adaptation process proceeds.

We add a refresh algorithm to maintain the optimality and stability of route through topological changes, stability factors associated with each disseminating node as an electing factor of the node, then establishment of info-message for route advertisement.