A Clustering Algorithm Based on MEXCLP for Wireless Sensor Network

Aiming at the bad distribution uniformity of traditional clustering algorithm (LEACH algorithm) in wireless sensor networks, the cluster head node within the cluster is the provider of services, and the algorithm does not consider the process of service failure (link failure, and so on), according to the greatest expectations of coverage principle, we put forward the MEXCLP algorithm for clustering, in the assumption of probability p of the services failure, a reasonable choice through the head cluster node, enables network nodes which can be served with the largest request number. Finally the imitation results indicate that the MEXCLP algorithm is more uniformity in finding head cluster, and under the same failure rate circumstances, MEXCLP algorithm may provide more efficient service and consume less energy than the LEACH algorithm. This indicates that MEXCL algorithm, proposed in this paper, is better than the LEACH algorithm.