检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机学报》2013年第3期485-493,共9页Chinese Journal of Computers
基 金:国家自然科学基金(61071073);教育部高等学校博士学科点专项科研基金(20090061110043)资助~~
摘 要:针对ZigBee路由协议没有很好结合AODVjr(Ad hoc On-Demand Distance Vector Routing Junior)和Cluster-Tree算法的问题,从网络能量优化的角度出发,文中设计了一种基于分簇机制的ZigBee混合路由算法———CLZBR算法,簇间采用AODVjr算法,簇内采用Cluster-Tree算法,并通过计算目的节点的父节点地址等方法,减少网络中冗余的RREQ(Route Request)分组,降低能量消耗;同时为了避免簇首由于能量过度消耗而成为失效节点,该算法提出备用节点的概念,当簇首能量过低时代替簇首以保证网络的稳定性.仿真结果表明,CLZBR算法相对ZigBee混合路由算法在包投递率、路由开销百分比和网络剩余能量百分比方面都有明显改善.Taking it into consideration that ZigBee technology fails to well combine and balance AODVjr (Ad hoc On-Demand Distance Vector Routing Junior) and Cluster-Tree routing algo- rithms, this paper proposes an improved, cluster-based algorithm named CLZBR. The proposed scheme focuses on network energy optimization of ZigBee routing. CLZBR algorithm employs AODVjr and Cluster-Tree routing algorithms respectively between clusters and within clusters to reduce redundancy of RREQ (Route Request) packets and energy consumption of network. CLZBR algorithm also calculates the address of destination nodes' parents to decrease energy consumption better. Besides, excessive energy consumption always causes the cluster heads to be ineffective. CLZBR algorithm uses alternate nodes to replace the cluster heads to guarantee net- work stability when the cluster heads' energy are abnormally low. The simulation result demon- strates that CLZBR algorithm performs significantly better than ZigBee routing algorithm in packet delivery ratio, routing overhead ratio as well as remaining energy ratio.
关 键 词:ZIGBEE 分簇 AODVJR Cluster—Tree 物联网
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222