摘要
针对基于LEACH(Low-Energy Adaptive Clustering Hieravchy Protocol)协议中簇头随机选取造成网络能耗过快的问题,提出了LEACH-E(LEACH based on Energy)算法。该算法在簇头选取时引入了节点的剩余能量以及网络的平均能量,使剩余能量比网络平均能量高的节点优先充当簇头;在普通节点的入簇包内携带节点能量信息。通过簇头计算簇平均能量,并转发给BS(Base Station)以计算获取网络平均能量;BS可充当簇头降低网络能耗速度。实验验证结果显示,该算法提高了网络的寿命、吞吐量,能量效率也有一定的优势。
Random cluster head selection results in energy consuming too fast in LEACH(Low-Energy Adaptive Clustering Hieravchy Protocd),an improved algorithm which can solve this problem named LEACH-E(LEACH based on Energy) is proposed. It selects the cluster head considering the residual energy of every node and the network,makes them a priority to be cluster head for those nodes whose residual energy are higher than the average energy of the network. When normal nodes join the cluster,the join packet contains the energy information,cluster head calculates the cluster average energy and sends it to BS(Base Station) to calculate the network average energy. It is possible to choose BS as cluster head so as to reducing the speed of energy consumption,It proves that network lifetime and throughput have obvious growth,it also has an advantage over the energy efficiency.
出处
《吉林大学学报(信息科学版)》
CAS
2017年第1期26-31,共6页
Journal of Jilin University(Information Science Edition)
基金
吉林省科技厅基础基金资助项目(201205093)
关键词
低能耗自适应分簇分层路由协议
剩余能量
平均能量
网络寿命
low-energy adaptive clustering hieravchy protocd(LEACH)
residual energy
average energy
network lifetime