Wireless Ad Hoc Networks Ktrp Core Tree Routing Protocol Optimization Study

With the development of the wireless transferring technology and the networks protocol, Ad hoc is becoming a hot research area and attracting more and more concern. Ad Hoc is one of the wireless networks which is independent of the fixed fundamental facilities and has the Ad characteristic. It has many advantages including easy and flexible, adaptable for the time and space, which can be used to meet the needs of real application, such as rescue, battlefield and exploration. Because of the limitied network source and the frequency changes of the topology, the traditional routing protocol would not adapt to the Ad Hoc network. That brings big chanllenges to the Ad Hoc routing protocol, and causes concerns at the same time.The 863 project"Research of Ad Hoc internet technology and its experiment system"proposed a multi-layered Ad algorithm called Kernel Tree Routing Protocol, which is a hybrid routing protocol. KTRP is a new kind routing protocol with advantages such as layers, self-organized, hybrid and loop-less. KTRP solves the problem of loop-less routing by employing the logical tree topology of the Wireless Router. This protocol solves the loop routing problem and can be used to build even larger networks. But the KTRP protocol rule and logical tree topology brings new problems, such as circuitous routing and the bottleleck of the root node, which cause the overload of the kernel tree.We put forward two solutions to the problem in this paper. At first, We collect the same-grade node directly, which expand the parent-child connectting to parent-child connecting and child-child connecting, that makes the routing has new choice beside the convergence node.This solution could decrease the routing cost of the kernel tree.At the same time,we put forward dynamic root node,and update the root node according root node auto-update principle. we add an important table: Network Topology Table (NTT), which is maintenanced by root node. The table includes all parent-child relations, and the whole tree topology could be calculated according this table. We design root node auto-update principle, which could help choose the smallest-hops root node. The two methods have been used in the optimized KTRP, and decrease the routing cost of the network totally.In this paper, we analyze the existing routing protocols of Ad Hoc Network and propose the KTRP. Then we analyze the problem of the KTRP and put forward schemes of improvement. Simulation have been run on optimized KTRP, and followed with data analysis.