A Theory In Optimization Of Ad-Hoc Routing Algorithms
Mehdi Kargar, F.Fartash, T. Saderi, Mohammad Reza Ebrahimi Dishabi · Zenodo (CERN European Organization for Nuclear Research) · 2008
In this paper optimization of routing in ad-hoc networks is surveyed and a new method for reducing the complexity of routing algorithms is suggested. Using binary matrices for each node in the network and updating it once the routing is done, helps nodes to stop repeating the routing protocols in each data transfer. The algorithm suggested can reduce the complexity of routing to the least amount possible.