摘要
针对典型分簇式路由LEACH协议随机选取簇头节点、分簇不合理等造成的网络节能不理想的情况,提出了一种基于能量和距离的分簇式路由协议EDCRP。通过把节点到基站的距离和其剩余能量作为基站选取簇头的参考因素,借鉴遗传算法中的轮盘赌思想选择簇头,并设置簇头之间的距离阈值,合理选取和分布簇头。通过在Matlab环境下仿真实验,比较了LEACH、DIRECT和EDCRP协议。实验表明,ED-CRP协议可改善负载均衡和有效地延长网络生存时间。
There exist random selection of cluster head and unreasonable clustering distribution in the typical clustering protocol LEACH(low energy adaptive clustering hierarchy),which made the network energy conservation unsatisfactory.To solve the problem a routing protocol was proposed named EDCRP(Energy-Distance based Cluster Routing Protocol) in Wireless Sensor Network,which considered the energy and distance factors and borrowed ideas from roulette wheel selection of Genetic Algorithm to make the cluster heads more reasonable.A distance threshold between the cluster heads was also set to get an even distribution of cluster heads and a better network hierarchy.By analyzing the simulation results of EDCRP carried out in Matlab,it is shown that compared with LEACH and DIRECT,EDCRP prolongs the network's lifetime effectively.
出处
《解放军理工大学学报(自然科学版)》
EI
北大核心
2012年第4期393-397,共5页
Journal of PLA University of Science and Technology(Natural Science Edition)
基金
浙江省重大科技专项和优先主题基金资助项目(2007C13064)
关键词
能量
距离
分簇式路由协议
无线传感器网络
网络生存时间
energy
distance
cluster routing protocol
WSN(wireless sensor network)
network survival time