计算机应用 ›› 2016, Vol. 36 ›› Issue (1): 81-86.DOI: 10.11772/j.issn.1001-9081.2016.01.0081

• 网络与通信 • 上一篇    下一篇

基于非均匀分簇机制的ZigBee混合路由算法

白乐强, 王玉涛   

  1. 沈阳建筑大学 信息与控制工程学院, 沈阳 110168
  • 收稿日期:2015-06-29 修回日期:2015-08-16 出版日期:2016-01-10 发布日期:2016-01-09
  • 通讯作者: 王玉涛(1990-),男,辽宁朝阳人,硕士研究生,CCF会员,主要研究方向:无线传感网络
  • 作者简介:白乐强(1962-),男,辽宁沈阳人,教授,博士,主要研究方向:无线传感网络、物联网。
  • 基金资助:
    国家自然科学基金资助项目(60973022/F020202)。

ZigBee hybrid routing algorithm based on uneven clustering mechanism

BAI Leqiang, WANG Yutao   

  1. College of Information and Control Engineering, Shenyang Jianzhu University, Shenyang Liaoning 110168, China
  • Received:2015-06-29 Revised:2015-08-16 Online:2016-01-10 Published:2016-01-09
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (60973022/F020202).

摘要: 针对现有ZigBee网络路由算法存在节点能量消耗不均衡问题,在树路由算法与无线自组网按需距离矢量路由改进(AODVjr)算法的基础上,提出一种基于非均匀分簇机制的ZigBee混合路由算法。该算法将网络分成若干个非均匀的逻辑簇,使距离协调器越近的簇规模越小,从而减少转发任务,使得能量消耗均衡。在分簇的基础上,将节点之间的传输分为簇内传输与簇间传输。簇内传输采用基于邻居表的树路由算法;簇间传输在基于树路由算法无效的情况下,采用AODVjr算法,找到两个簇首之间的较短路径;同时规定只有簇首节点和网关节点才能广播请求分组(RREQ),可以减少冗余的RREQ分组。仿真结果表明,该算法能有效推迟死亡节点出现的时间,延长网络的生存周期,达到提高网络性能的目的。

关键词: 分簇, ZigBee, 树路由, 按需距离矢量路由改进协议, 能量均衡

Abstract: The existing ZigBee network routing algorithm has unbalanced energy consumption. To solve the problem, based on the tree routing algorithm and Ad-Hoc On-demand Distance Vector junior (AODVjr) algorithm, the ZigBee hybrid routing algorithm based on uneven clustering mechanism was proposed. The algorithm divided the network into several uneven logical clusters, the scale of cluster close to the coordinator was smaller, so the forwarding task could be reduced, and the energy consumption was balanced. Based on the clustering, the transmission was divided into transmission within the clusters and between the clusters. Transmission within the clusters used tree routing algorithm based on the neighbor table. While the transmission between the clusters used the AODVjr algorithm, because the tree routing algorithm based on the neighbor table was invalid, which could find out shorter path between two cluster head nodes, in the same time, only the cluster head nodes and gateway nodes could broadcast Route Request (RREQ) packet, which helped to reduce the redundant RREQ packets. The simulation results show that the proposed algorithm can effectively delay the time of the death node and prolong the network lifetime, thus improving the network performance.

Key words: clustering, ZigBee, tree routing, Ad-Hoc On-demand Distance Vector junior (AODVjr), energy balance

中图分类号: