CAJ | 학술논문

传统的LEACH协议采用分布式算法，未考虑节点能量，改进的LEACH-C采用集中式的选簇算法，对于大规模的网络不适合。针对这些问题，提出一种基于位置和剩余能量的局部集中式分簇算法LEACH-LC。由簇头对簇成员的能量、位置进行评估，采用模拟退火算法确定局部较优的分簇。OMNet++仿真结果表明，改进算法在网络生存期和节点能耗上优于LEACH算法。
전통적LEACH협의채용분포식산법，미고필절점능량，개진적LEACH-C채용집중식적선족산법，대우대규모적망락불괄합。침대저사문제，제출일충기우위치화잉여능량적국부집중식분족산법LEACH-LC。유족두대족성원적능량、위치진행평고，채용모의퇴화산법학정국부교우적분족。OMNet++방진결과표명，개진산법재망락생존기화절점능모상우우LEACH산법。
The traditional LEACH routing protocol adopts a distributed algorithm,and does not take node energy into consideration. The improved LEACH-C algorithm is a centralized algorithm which does not meet for large networks. To solve these problems, a local centralized cluster head selection algorithm LEACH-LC is proposed. Cluster head evaluates the energy, location of the members, and then determines the local optimum clusters. The OMNet++simulation results show that improved algorithm extends network lifetime and reduces energy consumption of nodes in comparison with LEACH.