欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
基于LEACH协议的结构和能量消耗模型,定义了由能耗预测指数和剩余能量比例系数动态确定的节点竞争簇首门限,提出了一种基于能耗预测的分布式单跳路由分簇算法（FED）.该算法的最大时间复杂度为O（1）.文中还对时间优先、能量优先和比例优先竞争策略的FED算法进行了仿真.结果表明：与LEACH和EECS算法相比,基于能量优先和比例优先的分簇算法较大地延长了网络寿命,提高了网络能量的利用性能.
英文摘要：
According to the architecture and energy dissipation model of the LEACH protocol,the threshold of a node being a cluster-head is defined,which is dynamically determined by the index of forecasted energy dissipation and the ratio of residual energy.Then,a novel forecasted energy dissipation-based distributed clustering algorithm with a maximum iteration complexity of O（1）,named as FED,is proposed for the single-hop routing protocol.Moreover,the FED algorithms with three different priority strategies in terms of the time,the residual energy and the ratio of residual energy are compared via simulations.The results indicate that,as compared with the LEACH and the EECS algorithms,the FED algorithms with the priorities of energy and ratio greatly prolong the network lifetime and obviously improve the network energy utilization.
同期刊论文项目
同项目期刊论文
期刊信息
位置：