(etra), Enhanced Tree Routing Based On Ktrp Routing Protocol Agreement

With growing demand for mobile communications, people's knowledge of Ad-Hoc network gradually deepened.Ad-Hoc network is one of the wireless networks which is independent of the fixed fundamental facilities and has self-organizing multi-hop and peer to peer structure.Kernel Tree Routing Protocol is put forward by the university of electronic science and technology which is a kind of new wireless self-organization network routing protocol.A wireless network has been structured into a tree structure, and has completed routing and communication process. The protocol has chosen the characteristics of proactive routing protocol and reactive routing protocol, and has converged quickly with no loop.Mobile Ad Hoc network nodes use Independent batteries. A huge amount of storage and computation leads to accelerate loss of energy, coupled with single connection, The nodes are easy to bring down from the network.In this paper, we improve three of the original Kernel Tree Routing Protocol into Enhanced Tree Routing Algorithm. In the generation of the tree structure algorithm, we adopt multicast, self-repression of each node and Suppress the redundant information in the network. It causes organizing the shape of the tree rapidly. Adopting both the proactive routing protocol and the reactive routing protocol, it leads to reduce the reserves, the routing computation load and the energy loss of the node in the routing algorithm of the tree. Simultaneously we uses the strategy of the classification to complete highly effective routing process. For accelerating the convergence of the routing process, we adopt the ways of broken branch overall accessing network topology to perform network repair. In case of occuring the routing broken.In this paper, we analyze the characteristics of the existing mobile Ad Hoc network and the routing protocol, introduce the Kernel Tree Routing Protocol and emphatically analyze the problem of the Kernel Tree Routing Protocol to Put forward the reasonable improved scheme. Finally we simulate the optimized agreement and give the analysis of the results.The results show that the improved routing protocol is better than the Kernel Tree Routing Protocol in routing process and the consumption of the routing.