摘要
ZigBee树路由被广泛应用于多种领域,其特点是源节点向目的节点发送数据包时不需要路由表从而减少系统开销。树路由必须沿着树型拓扑发送数据,数据发送的路径往往不是最优的,这就造成了一定的局限性。提出一种基于邻居表的树路由算法,节点发送数据时通过查询邻居节点信息来计算下一跳地址。实验结果表明,改进算法在一定程度上解决原有树路由算法不灵活的缺点,提高了路由效率。
The ZigBee tree routing is widely used in many fields, it features that a source node could send a packet to the destination without any routing table to reduce overhead. A packet follows the tree topology which path is not optimal in the ZigBee tree routing, that is a limitation. A tree routing algorithm is proposed based on neighbor table, node sends packets by querying the information of its neighbor nodes to calculate the next hop. Experimental results show that the improved algorithm enables the original tree routing algorithm more flexible and improves routing efficiency.
出处
《计算机工程与应用》
CSCD
北大核心
2016年第5期114-118,共5页
Computer Engineering and Applications
基金
国家科技支撑计划重点项目(No.2008BAH37B05)
