Zigbee network tree-shaped routing method for neighbor table mode interaction

Abstract

The invention discloses a Zigbee network tree-shaped routing method for neighbor table mode interaction. The method uses neighbor tables on the basis of an existing tree-shaped routing algorithm and interacts with neighbor nodes for neighbor table information. When a node performs routing, routing hops can be effectively reduced, the network delay is reduced, the total network energy consumption is reduced, and the forwarded data amount of nodes of different network depth can be balanced, so that the node energy consumption is balanced and the network life cycle is prolonged.

Description

technical field [0001] The invention relates to a Zigbee network tree routing method in an interactive neighbor list mode. Background technique [0002] Acronyms and key term definitions [0003] FFD Full Functional Device Full Functional Device [0004] RFD Reduced Functional Device Reduced Functional Device [0005] Second-level neighbor node: The neighbor node of the neighbor node of the current node is called the second-level neighbor node of the current node. [0006] Minimum hops: The number of times node A needs to pass through the router to reach node B according to the tree routing and add 1. The value is called the minimum hops from node A to node B. [0007] Node network depth: The minimum number of hops required for a node to transmit data to the coordinator according to the tree route, and the network depth of the coordinator node is defined as 0. [0008] Maximum depth common parent node: In the tree structure, the parent node (or ancestor node) with the la...

AI Technical Summary

Problems solved by technology

[0046] Purpose of the invention: In view of the problems that the original tree-type routing algorithm in the Zigbee network chooses a long path, the transmission data delay is large, and the energy consumption of nodes is unbalanced, which reduces the network life cycle and other problems, the present invention provides a Zigbee network with an interactive neighbor table mode Tree-type routing method, which uses the neighbor table on the basis of the original tree-type routing algorithm, and exchanges the neighbor table information with its own neighbor nodes, so that the node can effectively reduce the number of routing hops and reduce the network delay when routing. , to reduce the total energy consumption of the network, and at the same time, it can also balance the forwarding data volume of nodes with different network depths, so as to balance the energy consumption of nodes and prolong the network life cycle

Images