Routing method for overcoming congestion of tree type Zigbee network

Abstract

The invention discloses a routing method for overcoming congestion of the tree type Zigbee network. The method comprises the following steps that a coordinator node establishes the Zigbee network, and other nodes establish neighbor tables thereof when accessing the Zigbee network; the tree type network is maintained; target address of a data frame is detected, and data is forwarded according to different target addresses; if a link to a father node is in the busy state always, information of the neighbor table is obtained, the neighbor table is inquired, a data request is sent to a neighbor node, the level of the neighbor node is higher than or equivalent to that of the present node, and the relation between the neighbor node and the present node is not a father-son relation; self information is added to a response frame again, and the node updates the neighbor table according to the response information; the neighbor node of the lowest load is selected for horizontal communication; and after the neighbor node receives the data frame, the data frame is forwarded continuously until that the data reaches the target node. When congestion occurs in the trunk, congestion can be effectively alleviated, time delay of the network is reduced, and the total energy consumption of the network is reduced.

Description

technical field [0001] The invention belongs to a Zigbee tree network, in particular to a routing method for solving the Zigbee tree network congestion problem. Background technique [0002] Zigbee technology is a short-range wireless communication technology with low cost, low power consumption and low data transmission rate. Zigbee networks can support star, tree and grid topologies. Common network layer routing algorithms include tree routing and AODVjr routing. The former is mainly used for tree-structured networks, and the latter is mainly used for grid-shaped networks. [0003] In the tree-type routing algorithm of the Zigbee network, nodes do not need to perform route discovery, but only need to forward data according to the parent-child relationship, which can avoid network loops and control routing overhead. However, there are also disadvantages. Nodes can only communicate along the tree structure. When a trunk is congested, it can only wait or give up transmission...

AI Technical Summary

Problems solved by technology

[0026] Congestion caused by the unbalanced trunk load distribution that may occur in the original tree-type routing algorithm in the Zigbee network, thereby bringing the problem of data transmission delay or packet loss, the purpose of the invention is to: provide a method for solving Zigbee tree-type network congestion. The routing method of the problem, this method is based on the original tree routing algorithm by establishing a horizontal communication path, so that when the trunk is congested, the node can use the neighbor node with a lighter load to forward data, which can effectively reduce the data transmission. Delay, solve the phenomenon of unbalanced network energy distribution, thereby prolonging the network life cycle

Images