检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《华南理工大学学报(自然科学版)》2008年第5期13-18,共6页Journal of South China University of Technology(Natural Science Edition)
基 金:国家自然科学基金资助项目(60132030);国家"863"计划项目(2004AA639690);高等学校博士学科点专项科研基金资助项目(20040486049)
摘 要:基于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.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.121