基于LEACH协议的动态轮时间算法——LEACH-DRT  

LEACH-DRT: dynamic round-time algorithm based on low energy adaptive clustering hierarchy protocol

作　　者：钟一洋[1] 刘兴长[1] 

机构地区：[1]后勤工程学院后勤信息工程系,重庆401311

出　　处：《计算机应用》2013年第1期120-123,共4页journal of Computer Applications

摘　　要：为延长无线传感器网络(WSN)的生存时间,针对低功耗自适应集簇分层(LEACH)协议中分簇不均匀和轮时间固定的问题,提出了一种基于LEACH协议的动态轮时间(LEACH-DRT)算法。通过基站获取簇和簇内成员节点信息,根据簇内成员节点数和簇内剩余能量计算出各簇的轮时间,并由基站将时间信息发送至各簇,各簇按接收到的时间信息进行工作。同时,利用新的簇头选取机制,避免了因簇头节点能量不足导致的数据丢失和成员节点的无谓消耗。分析和仿真结果表明,改进后的算法比LEACH协议延长了约4倍的网络生存时间,数据丢失率降低了约18%,在均衡网络能量消耗和降低数据丢失率方面取得了较好的应用效果。Regarding the disadvantages of uneven clustering and fixed round time in Low Energy Adaptive Clustering Hierarchy （LEACH） protocol, the Dynamic Round-Time （DRT） algorithm based on LEACH （LEACH-DRT） was proposed to prolong network life time. The algorithm obtained clusters＇ and member nodes＇ information from base station, and then figured out clusters＇ round time according to the number of clusters＇ member nodes and clusters＇ remaining energy. The time information was sent to different clusters by base station. Clusters began to work according to the time information received. Meanwhile, by using the new cluster head election mechanism, it avoided the data loss and useless energy consumption caused by the cluster＇s insufficient energy. The analysis and simulation results show that the improved algorithm prolongs about four times network life time and reduces the probability of data loss by 18% than LEACH protocol. It also demonstrates that LEACH-DRT algorithm achieves a better application effect at balancing energy consumption and data loss rate.

关 键 词：网络生存时间 低功耗自适应集簇分层协议 不均匀分簇 轮时间 数据丢失率 

分 类 号：TP393.09[自动化与计算机技术—计算机应用技术]