针对 ZigBee 树路由算法路径成本大、频繁利用网络中重要节点导致过早耗尽节点能量的问题，提出一种基于邻居表的能量均衡 ZigBee 树路由改进算法。借助一跳邻居表，选取剩余能量充足且到达目的节点树路由跳数最少的节点作为下一跳转发节点，避免利用剩余能量低的节点转发数据。理论分析结果表明，该算法具有较低时间复杂度，可以找到一条初级通路；仿真结果表明，该算法能有效减少网络死亡节点个数，延长 ZigBee 网络使用寿命，达到网络性能提高的目的。%For the problem that ZigBee tree routing algorithm has large path cost and uses important nodes frequently in net-work,which causes early energy exhaustion,the improvement algorithm of energy balance ZigBee tree routing based on the neighbor table was proposed.1-hop neighbor table was used,and the neighbor node having abundant energy and the smallest tree routing hops to the destination was selected as the next forwarding node,and using the node of low residual energy as the forwarding node was avoided.Theoretical analysis shows the algorithm has low time complexity and can find a primary pathway. The simulation results show the algorithm can reduce effectively the number of death node,extend the service life of the ZigBee network and improve the performance of network.
展开▼
