说明：  LEACH(Low Energy Adaptive Clustering Hierarchy算法是一种自应分簇拓扑算法，它的执行过程是周期性的，每轮循环分为簇的建立阶段和稳定的数据通信阶段。在簇的建立阶段，相邻节点动态地形成簇，随机产生簇头;:在数据通信阶段，簇内节点把数据发送给簇头，簇头进行数据融合并把结果发送给汇聚节点。由于簇头需要完成数据融合、与汇聚节点通信等工作，所以能量消耗大。LEACH 算法能够保证各节点等概率地担任簇头，使得网络中的节点相对均衡地消耗能量。
(LEACH (Low Energy Adaptive Clustering Hierarchy algorithm is a self-splitting clustering topology algorithm, its execution process is periodic, each round of cycle is divided into cluster establishment phase and stable data communication phase. In the cluster establishment phase, phase The neighbor nodes dynamically form clusters and randomly generate cluster heads: in the data communication phase, the nodes in the cluster send data to the cluster head, the cluster head performs data fusion and sends the result to the sink node. Since the cluster head needs to complete data fusion, The aggregation node communicates and so on, so the energy consumption is large. The LEACH algorithm can ensure that each node acts as a cluster head with equal probability, so that the nodes in the network consume energy relatively evenly.)