Low-energy minimum mean-distance algorithm for wireless sensor networks

A novel cluster-head selection algorithm using the minimum mean distance between sensor nodes as a selection parameter for wireless sensor networks is presented. The proposed algorithm takes 1.65 times longer to reach the point where 50% sensor nodes remain alive, and achieves 1.33 times longer overall network lifetime than the low energy adaptive clustering hierarchy protocol (LEACH) while maintaining information throughput. Furthermore, the new algorithm takes 2.3 times longer than the LEACH protocol to reach the point where the number of cluster-heads and the throughput from the cluster-heads to the base station are reduced by 50%. The new algorithm ensures that there are always five cluster-heads during each round throughout the network lifetime until the round 2067, which is 2.8 times longer than the LEACH protocol and delivers 2.1 times more data to the base station compared to the LEACH protocol