A cluster routing algorithm based on small-world model

A routing clustering algorithm based on the small world model is presented to overcome the problem of LEACH´s unreasonable cluster head selection and the uneven energy consumption. First of all, the method optimizes the topology optimization the wireless sensor network by clustering coefficient feature of small world. Secondly, it chooses cluster heads considering energy and degree of each node in the network. Simulation result shows that the method can optimize the network topology. Compared with LEACH algorithm and LEACH-improved algorithm which doesn´t considerate the degree of nodes, the proposed method also enhances the life time of nodes, reduces the overall energy consumption and improves load balance of the network.