Research Of Routing Algorithm Based On ZigBee Wireless Network

Zig Bee is a wireless communication technology which is faced to short distance, and it has the advantage of reliable transmission, low power, low cost, ad hoc networks, etc, so it is widely used in military, environmental monitoring, industrial medical and other fields. Now, with the rapid promotion and development of Things, smart city and so on, the study of Zig Bee technology is also deepening. However due to the complexity of hardware systems, which causes many researchers who work to improve network performance will focus on the core of the network layer routing technology. The improved routing algorithms research has become a hot topic in recent years.This paper mainly research and improve in ZBR(Zig Bee Routing) algorithm and Cluster-Tree algorithm which are two common routing protocols in cluster tree topology. Wherein, ZBR is a combination of Cluster-Tree and AODVjr, that can be dynamically routed and thus is more suit for a larger number of nodes and the more complex of network structure; The Cluster-Tree algorithm only rely on parent-child relationship communication, it don't need storage routing table, so it's response is more fast, and it suitables for the network which has a relatively small number of nodes and simple structure.First, ZBR algorithm RN + nodes routing discovery will bring a lot of useless control overhead, it will not only result in energy consumption, but increase the probability of packet collisions and node processing delay caused by other issues. Therefore, this paper combines the characteristics of cluster tree topology, firstly it proposes the depth value based on the deepest common parent node of the source node and the destination node, the maximum transmission hops of the packet RREQ is restricted. Secondly the use of parent-child relationship between the nodes limits the transmission direction of the RREQ packet, therefore the cost of network control purposes is reduced.Second, the transmission path of the nodes in Cluster-Tree algorithm is single, and the heavily loaded network link cannot pass information in time, resulting in network congestion, packet loss and low throughput and so on. The same single transmission path also tend to accelerate bear the consumption of common nodes of larger business volume, which easily lead s to network segmentation. Therefore, this paper proposes a Z-DMHCTR(Zig Bee-Disjoin Multi-path Cluster-Tree Routing) algorithm,it make the congestion nodes not only the original path of tree routing algorithm in accordance with, but also it can look for additional path which does not in tersect with the original path through the introduction neighbor list information, to transmit the information. Thereby reducing the likelihood of re-occurrence of congestion improves network bandwidth utilization, and achieve the purpose of improving network throughput.This paper uses the platform of Linux + ns-2.35 to do the simulation experiments and comparative analysis respectively with the improved before and rear ZBR algorithm and Cluster-Tree algorithm. The results show the efficiency of the improved algorithm, and achieve the purpose of the design.