A Multi-hop Cluster Routing Algorithm Based on Max-min Distances Method ?

With the purpose of reflning cluster head election and node single-hop in LEACH protocol under the environment of wireless sensor network energy heterogeneous, we propose a new routing algorithm named LEACH-3M. This algorithm generates K cluster centers spending max-min distances method which creates K clusters based on the distance from node to cluster center, selects cluster head with the principle of maximum weight, forms new cluster according to node and cluster head distance and this cluster head will be chose as next communication cluster center automatically. Constructing a chain with the shortest communication path between cluster head and SINK adopts continuous Hopfleld neural network and optimizes it to make multi-hop tree clustering chain with SINK central. Through MATLAB simulation analysis, this new algorithm improves prolonging network’s stability and energy equilibrium obviously compared with LEACH algorithm.