Multi-Factor Cost Function-Based Interference-Aware Clustering with Voronoi Cell Partitioning for Dense WSNs

Efficient clustering and cluster head (CH) selection are the critical parameters of wireless sensor networks (WSNs) for their prolonged network lifetime. However, the performances of the traditional clustering algorithms like LEACH and HEED are not satisfactory when they are implemented on a dense WSN due to their unbalanced load distribution and high contention nature. In the traditional methods, the cluster heads are selected with respect to the residual energy criteria, and often create a circular cluster shape boundary with a uniform node distribution. This causes the cluster heads to become overloaded in the high-density regions and the unutilized cluster heads gather in the sparse regions. Therefore, frequent cluster head changes occur, which is not suitable for a real-time dynamic environment. In order to avoid these issues, this proposed work develops a density-aware adaptive clustering (DAAC) protocol for optimizing the CH selection and cluster formation in a dense wireless sensor network. The residual energy information, together with the local node density and link quality, is utilized as a single cluster head detection metric in this work. The local node density information assists the proposed work to estimate the sparse and dense area in the network that results in frequent cluster head congestion. DAAC is also included with a minimum inter-CH distance constraint for CH crowding, and a multi-factor cost function is used for making the clusters by inviting the nodes by their distance and an expected transmission energy. DAAC triggers re-clustering in a dynamic manner when it finds a response in the CH energy depletion or a significant change in the load density. Unlike the traditional circular cluster boundaries, DAAC utilizes dynamic Voronoi cells (VCs) for making an interference-aware coverage in the network. This makes dense WSNs operate efficiently, by providing a hierarchical extension, on making secondary CHs in an extremely dense scenario. The proposed model is implemented in MATLAB simulation, to determine and compare its efficiency over the traditional algorithms such as LEACH and HEED, which shows a satisfactory network lifetime improvement of 20.53% and 32.51%, an average increase in packet delivery ratio by 8.14% and 25.68%, and an enhancement in total throughput packet by 140.15% and 883.51%, respectively.