检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵立权[1] 陈楠[1] 王艳娇[1] ZHAO Liquan;CHEN Nan;WANG Yanjiao(College of Information Engineering, Northeast Dianli University, Jilin 132012, China)
机构地区:[1]东北电力大学信息工程学院,吉林省吉林市132012
出 处:《计算机工程与应用》2017年第14期99-104,共6页Computer Engineering and Applications
基 金:国家自然科学基金(No.61501107)
摘 要:稳定选举协议因没考虑节点的剩余能量,造成一些低能量节点当选为簇头而过早死亡,而且选出的簇头将数据直接发送给基站,导致部分距离基站较远的节点能量消耗过大而死亡。针对这两个问题,提出了一种适应于异构环境的改进的无线传感器网络路由算法。该算法在簇头选取过程中,加入节点的剩余能量和邻居节点数,使得具有较高的剩余能量且分布在密集区域中的节点当选为簇头的概率增大,并参考图论中的Dijkstra算法,实现簇头到基站低代价传输的多跳通信。仿真结果表明,与传统的稳定选举协议及其改进算法对比,该算法降低了网络的能量消耗,明显地延长了网络的稳定期和生命周期。In stable election protocol,the selection of cluster head node does not consider the residual energy of node.This causes that some nodes with lower energy are used as cluster head to make it die early.The selected cluster headdirectly sends data to base station in stable election protocol,so this causes the cluster head node that is far from the basestation to consume lot energy to die early.To solve this problem,an advanced multi-hop cluster routing protocol forheterogeneous wireless sensor networks is proposed.The algorithm combines the idea of clustering and multi-hop communicationtogether to introduce the residual energy and the density of the nodes as weights to select cluster head nodes.Thenew algorithm sets up a low cost routing mechanism between the cluster head and the base station with improved Dijkstraalgorithm to realize the multi-hop communication.The simulation results show that compared with SEP and enhancedSEP routing algorithm,the new algorithm reduces the energy consumption of the whole network and prolongs the stableperiod and lifetime of the network.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249