Cluster head selection based on Minimum Connected Dominating Set and Bi-Partite inspired methodology for energy conservation in WSNs

Abstract

In a Wireless Sensor Network (WSN), one of the most important issue is to minimize the energy consumption without losing accuracy during faster data transmission. During information broadcast, message communication is to be sent in an optimized way to increase energy efficiency in the networks. By applying various techniques and methodology in cluster WSN the network lifetime is increased and delay is minimized with the load balanced network. To accomplish load balance, Adelson-Velskii and Landis (AVL) tree rotation clustering algorithm is simulated considering the cluster sensor node. A single large area network is divided into multiple clusters using modified K-means clustering algorithm. Computational complexity is reduced through the construction of Minimum Connected Dominating Set with Multi-hop Information (MCDS-MI) and Bi-Partite Graph (BG) technique. Cluster Head (CH) assortment mechanism is implemented to find maximum cover set count of the sensor nodes. In addition, the enactment of the anticipated design is established through simulations during scalable data transmission in a WSN. Hypothetical investigation and experimental simulations are studied by measuring various performance evaluation metrics namely Virtual Dominators, Size Reduction, Network Lifetime and Residual Energy. The results shows that the proposed MSDS-MI system has maximum reduction in network size of 50%, maximum increase in network lifetime of 60% and saved maximum residual energy consumption of 47.76%. The results are encouraging and our proposed method is found to be more efficient than Connected Dominating Sets (CDS), Pseudo Dominating Sets (PDS), Dynamic Cluster Head Genetic Algorithm (DCH-GA) and Distributed Self-Healing Approach (DSHA).