节点文献
ZigBee网络Cluster-Tree优化路由算法研究
Research on Cluster-Tree Optimization Routing Algorithm in ZigBee Network
【摘要】 通过分析ZigBee协议中Cluster-Tree和AODVjr算法的优缺点,提出一种基于Cluster-Tree+AODVjr的优化路由算法。该算法利用ZigBee协议中的邻居表,通过定义分区来确定目的节点的范围,从而控制广播RREQ分组的跳数,防止无效的RREQ泛洪。此优化算法能够有效地减小路由跳数,缩短传输时延,减少网络中死亡节点的数量,提高数据传送的成功率。
【Abstract】 By analyzing the advantages and disadvantages of Cluster-Tree and AODVjr algorithm in ZigBee protocol,a optimization routing algorithm based on Cluster-Tree+AODVjr is proposed.The algorithm uses the neighbor table of ZigBee protocol and confirms the scope of the destination node through defining partition,so as to control hop counts of the broadcast RREQ packets and prevent invalid RREQ flooding.The optimization algorithm can effectively reduce the routing hop counts,the transmission delay and the numbers of death nodes in network,and improve the success rate of data transmission.
【Key words】 ZigBee; routing algorithm; Cluster-Tree+AODVjr; neighbor table; partition;
- 【文献出处】 单片机与嵌入式系统应用 ,Microcontrollers & Embedded Systems , 编辑部邮箱 ,2012年10期
- 【分类号】TN929.5;TP212.9
- 【被引频次】16
- 【下载频次】235