Improving the performance of hierarchical clustering protocols with network evolution model

Abstract

In distributed computing, clustering of the nodes is generally used to make the communication process energy-efficient. However, in the mechanics of clustering, the number of clusters increases as the energy of the nodes gets depleted. This dispersive nature of clustering probability leads to the quick death of the nodes. This chapter explains the usage of an optimization matrix from clustering probability as obtained from a network evolution model. The proposed framework of an optimization matrix shows considerable promise in boosting the efficiency of data delivery and network lifetime of the hierarchical clustering protocols in wireless sensor networks.