Wireless Self-organizing Network Tree Topology Algorithm

With the development of the wireless transferring technology and the networks protocol, Ad hoc is becoming a new 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.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 solves the problem of loop-less routing by employing the logical tree topology of the Wireless Router. This solution decreased the cost of the routing algorithms and can be used to build even larger networks.In this paper, different types of Ad hoc protocols were analyzed and researched. Following this basic research, the authors of this dissertation firstly proposed a Broadcast Spanning Tree Routing Protocol (BSTRP), which employed the MPR mechanism for routing to effectively control the routing cost of flooding and accelerate the networks accessing time of multi-nodes joining the network simultaneously. Then the efficiency of the routing was enhanced and the tree topology generated by this algorithm provides a good solution to the problem of loop-less routing.In addition, for the problem of network cost in which the root node of the kernel tree topology generated by KTRP protocol is not optimal, the authors also presented an enhanced algorithm to optimize the kernel tree and improve the network efficiency by periodically calculating and updating the kernel tree.Then the corresponding simulation of the enhanced algorithm proposed in this paper was conducted and the simulation results were presented and analyzed.