一种低功耗自适应集簇分层型协议的优化
Optimization of routing protocol for LEACH wireless sensor network

经典分簇路由协议LEACH存在簇首随机选举、簇头过于密集等问题，提出LEACH-P算法对这些问题进行优化. 优化后的算法不仅把节点剩余能量作为簇头选举的考量标准，而且节点在晋升为簇头时还对簇头之间的距离进行约束，避免造成簇头节点过于密集的问题. 此外，接近sink节点的普通节点直接把数据传输到sink节点. 通过仿真结果可以看出，优化后算法的网络生命有明显提高，数据传输能力也得到较好的改善.
The classical clustering routing protocol LEACH has many problems，such as cluster head random election and cluster head being too dense，so the LEACH-P algorithm proposed in this paper can optimize these issues. The improved algorithm take the residual energy of node as the cluster head election standards，and when a node is promoted to a cluster head，the distance between the cluster heads is constrained，so as not to cause the cluster head node is too dense，in addition，ordinary nodes close to the sink directly to transmit data to sink node. It can be seen from the simulation results that the life of the optimized algorithm is obviously improved，and the ability of data transmission is improved