Performance Improvement of Flooding Algorithm in Highly Mobile Networks

In this paper we propose a modified flooding algorithm for highly mobile networks. This scheme minimizes the call set-up time and does not have to maintain routing tables. Because of its significant drawbacks with respect to the network efficiency, it has not found widespread applications. Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of a circuit-switched grid network without increasing the call set-up time and processor loading of the algorithm.