计算机工程与设计
計算機工程與設計
계산궤공정여설계
COMPUTER ENGINEERING AND DESIGN
2015年
5期
1156-1160
,共5页
ZigBee网络%地址分配%邻居表%树路由%链路质量指标
ZigBee網絡%地阯分配%鄰居錶%樹路由%鏈路質量指標
ZigBee망락%지지분배%린거표%수로유%련로질량지표
ZigBee networks%address assignment%neighbor table%tree routing%link quality indicator
针对ZigBee网络树路由算法路由跳数多、数据传输延时长等问题,提出一种基于邻居表的ZigBee网络树路由改进算法。借助一跳邻居节点地址信息,建立邻居节点选择策略,在节点的一跳邻居节点中,选择到达目的节点树路由跳数最少的邻居节点作为下一跳转发节点。在树路由跳数相同时,选取LQI值大的节点为下一跳转发节点。理论分析结果表明,该算法路由路径优于树路由算法和ITRA算法路由路径;实验结果表明,该算法能很好地减少转发节点个数,提高了网络数据传输的可靠性,达到网络性能提高的目的。
針對ZigBee網絡樹路由算法路由跳數多、數據傳輸延時長等問題,提齣一種基于鄰居錶的ZigBee網絡樹路由改進算法。藉助一跳鄰居節點地阯信息,建立鄰居節點選擇策略,在節點的一跳鄰居節點中,選擇到達目的節點樹路由跳數最少的鄰居節點作為下一跳轉髮節點。在樹路由跳數相同時,選取LQI值大的節點為下一跳轉髮節點。理論分析結果錶明,該算法路由路徑優于樹路由算法和ITRA算法路由路徑;實驗結果錶明,該算法能很好地減少轉髮節點箇數,提高瞭網絡數據傳輸的可靠性,達到網絡性能提高的目的。
침대ZigBee망락수로유산법로유도수다、수거전수연시장등문제,제출일충기우린거표적ZigBee망락수로유개진산법。차조일도린거절점지지신식,건립린거절점선택책략,재절점적일도린거절점중,선택도체목적절점수로유도수최소적린거절점작위하일도전발절점。재수로유도수상동시,선취LQI치대적절점위하일도전발절점。이론분석결과표명,해산법로유로경우우수로유산법화ITRA산법로유로경;실험결과표명,해산법능흔호지감소전발절점개수,제고료망락수거전수적가고성,체도망락성능제고적목적。
Aiming at the problems of ZigBee tree routing algorithm that the algorithm has many hop counts and so on,a tree rou-ting improvement algorithm based on the neighbor table in ZigBee networks was proposed.With the aid of 1-hop neighbor nodes address information,the strategy of neighbor nodes selection was established in the proposed algorithm,the neighbor node which has the minimum tree hop counts was selected as the next hop forwarding node.When hop counts were the same,the node with high LQI value was selected as the next hop forwarding node in this algorithm.Theoretic analysis proves that routing path of this algorithm is superior to that of the tree routing algorithm and ITRA algorithm.The simulation results show that the improved algorithm can reduce the number of forwarding nodes efficiently,improve the reliability of the network data transmission and achieve the purpose of improving the network performance.