基于最小生成树的非均匀分簇路由协议
发布时间：2019-05-13 07:41
【摘要】：针对无线传感器网络中利用分簇技术,簇首到Sink节点通信采用多跳路由方式容易引起"能量空洞"的问题,提出了基于最小生成树的非均匀分簇路由协议。该协议在簇首选举阶段,以节点剩余能量、节点度、节点能量消耗速度为权重计算簇首竞争等待时间,选用簇首竞争等待时间小的节点为簇首,以均衡能量;簇形成后,以剩余能量、簇间的距离和能量消耗为参数构建基于最小生成树的最优传输路径通过多跳方式将数据发送到Sink节点。仿真结果表明,该路由协议能有效均衡能耗,延长网络生命周期,延缓"能量空洞"的形成。
[Abstract]:In order to solve the problem that multi-hop routing is easy to cause "energy hole" in wireless sensor networks using clustering technology and multi-hop routing from cluster head to Sink node, a non-uniform clustering routing protocol based on minimum spanning tree is proposed. In the stage of cluster head election, the node residual energy, node degree and node energy consumption speed are used as the weight to calculate the cluster head competition waiting time, and the node with small cluster head competition waiting time is selected as the cluster head to balance the energy. After cluster formation, the optimal transmission path based on the minimum spanning tree is constructed by taking the residual energy, the distance between clusters and the energy consumption as parameters to send the data to the Sink node by multi-hop mode. The simulation results show that the routing protocol can effectively balance energy consumption, prolong the network life cycle and delay the formation of "energy hole".
【作者单位】： 广东农工商职业技术学院计算机系;广东农工商职业技术学院机电系;
【基金】：科技部国家星火计划项目(2013GA780003)
【分类号】：TN929.5;TP212.9
本文编号：2475711
[Abstract]:In order to solve the problem that multi-hop routing is easy to cause "energy hole" in wireless sensor networks using clustering technology and multi-hop routing from cluster head to Sink node, a non-uniform clustering routing protocol based on minimum spanning tree is proposed. In the stage of cluster head election, the node residual energy, node degree and node energy consumption speed are used as the weight to calculate the cluster head competition waiting time, and the node with small cluster head competition waiting time is selected as the cluster head to balance the energy. After cluster formation, the optimal transmission path based on the minimum spanning tree is constructed by taking the residual energy, the distance between clusters and the energy consumption as parameters to send the data to the Sink node by multi-hop mode. The simulation results show that the routing protocol can effectively balance energy consumption, prolong the network life cycle and delay the formation of "energy hole".
【作者单位】： 广东农工商职业技术学院计算机系;广东农工商职业技术学院机电系;
【基金】：科技部国家星火计划项目(2013GA780003)
【分类号】：TN929.5;TP212.9
【相似文献】
相关期刊论文 前9条
1 袁翊;最小生成树的一个算法程序[J];电信工程技术与标准化;1991年01期
2 杨磊;赵拥军;王志刚;;最小生成树相位解缠中冗余去除算法[J];遥感学报;2006年06期
3 曲文武;;无线移动网络分布式最小生成树的声明实现[J];小型微型计算机系统;2011年01期
4 胡光岷,李乐民,安红岩;动态多播最小生成树算法[J];电子与信息学报;2003年01期
5 云日升,彭海良;基于局部最小生成树的干涉SAR二维相位展开[J];电子与信息学报;2004年02期
6 张明才;薛安荣;王伟;;基于最小生成树的非均匀分簇路由算法[J];计算机应用;2012年03期
7 陆晶;马悦;吴晓军;;一种基于最小生成树的非均匀分簇路由算法[J];小型微型计算机系统;2012年10期
8 郭中华;史浩山;;基于欧氏最小生成树的无线Ad Hoc网络容量研究[J];传感技术学报;2008年10期
9 龙元香,廖建新,陈俊亮;动态启发式最小生成树多播路由算法[J];北京邮电大学学报;1999年03期
相关会议论文 前1条
1 张萌萌;;一种基于最小生成树的负载均衡算法[A];2007通信理论与技术新发展——第十二届全国青年通信学术会议论文集（上册）[C];2007年
相关博士学位论文 前1条
1 陈波;基于图理论的穿墙雷达建筑物布局重构技术研究[D];国防科学技术大学;2014年
，本文编号：2475711
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2475711.html
