Ktrp Dynamic Routing Agreement Root Election Algorithm

Kernel Tree Routing Protocol (KTRP) is a new efficient routing protocol for ad hoc network. It reconstructs a tree-structured logic topology in the network, so that each node can easily route without knowing the routes to all other nodes. The update of the routing information is limited in the range of branches when topology changes. It has the characteristics of both proactive tech and reactive tech. However, this protocol is not very flexible in that the root must be designated by governor before the initialization of the network and the protocol can not recover the logic topology when root crashes.This paper presents a Root Election Algorithm to reinforce flexibility and robustness of KTRP. The main idea is that by communicating packets, nodes elect a new root before the network initializes or after the root crashesBased on the existing KTRP, the design and realization of this Root Election Algorithm takes some other election algorithms for reference. This paper describes the ideas and operations of this algorithm, including the formats of packets and the flows of operations. At last, we simulate the algorithm with OPNET, to prove its validity and analyze its capability.