A Novel Self-Configuring and Routing Algorithm for Mobile Ad Hoc Networks

A novel network self-configuring and routing algorithm, KTRA (kernel tree routing algorithm) is proposed for mobile ad hoc networks. It converts the actual network topology into a logic tree topology, thus only partial routing information is needed to maintain for networking and routing, and the update requirement is restricted in the area of branch. Moreover, KTRA is characterized by low delay and high flexibility comparable to that of proactive and reactive routing algorithm. The empirical and simulation results demonstrate that KTRA is convergent and outperforms the traditional networking and routing algorithms