A probability optimize clustering routing algorithm for WSNs

This paper puts forward LEACH-PO algorithm which is based on LEACH algorithm, LEACH-PO is a probability optimize clustering routing algorithm, it proposes two adjusting functions about the density of nodes and the energy of nodes, use the weighting algorithm to dynamically adjust the probability of the nodes to be selected as the cluster-heads. LEACH-PO defines an inequality about the critical distance ratio to determine the data communication mode between the cluster-head and base station. Simulation results show that LEACH-PO has better performance than LEACH, effectively prolongs the lifetime of WSNs and improves the scalability of the networks.

[1]  Julio Solano-González,et al.  Connectivity Based k-Hop Clustering in Wireless Networks , 2003, Telecommun. Syst..

[2]  Cao Xiang-yu.  Density-based Clustering Protocol for Wireless Sensor Networks , 2009 .

[3]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[4]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[5]  Dirk Timmermann,et al.  Low energy adaptive clustering hierarchy with deterministic cluster-head selection , 2002, 4th International Workshop on Mobile and Wireless Communications Network.