检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东师范大学信息科学与工程学院,济南250014 [2]山东师范大学山东省分布式计算机软件新技术重点实验室,济南250014
出 处:《计算机应用研究》2014年第11期3434-3437,共4页Application Research of Computers
基 金:山东省自然科学基金资助项目(ZR2013FM008);山东省科技发展计划资助项目(2011GGH20123);济南市高校院所自主创新项目(2010040072)
摘 要:针对无线传感器网络中能量受限的问题,提出了节能的、负载均衡的分层路由算法EDUC(energy-based and distance-based unequal clustering algorithm)。EDUC用基于能量和距离的概率模型产生候选簇头;同时,EDUC利用定时器,使局部区域内剩余能量多的候选簇头成为簇头,并且根据能量和距离计算簇的半径。普通节点根据能量和距离计算候选节点的权值,加入权值最大的簇头。在构建多跳路由时,簇头根据候选节点的剩余能量、簇内和簇间通信代价选择最优的中继节点。在OMNet++平台上的仿真结果表明,与其他算法相比,EDUC能够有效地均衡能量消耗,降低节点死亡速度,从而延长网络生命周期。Aiming at the problem of energy limitation in wireless sensor networks (WSN),this paper presented an energy sa-ving and load balancing clustering routing (EDUC)algorithm.EDUC generated candidate cluster-heads by using energy-based and distance-based probability model.At the same time,EDUC utilized timer to make the candidate cluster-heads with high residual energy in local area become cluster-heads.In addition,EDUC calculated clusters’radius on the basis of energy and distance.Moreover,ordinary nodes calculated candidate nodes’weight on the basis of energy and distance,and then they joined the cluster-head with the biggest weight.Furthermore,at the phase of constructing multi-hop routing,cluster-heads considered tentative nodes’residual energy,costs of inter-cluster and intra-cluster communication to select an optimal relay node.Simulation results on OMNet++show that EDUC can efficiently balance energy consumption,reduce the speed of nodes dying and prolong the network lifetime compared with other algorithms.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.252.197