An Efficient Variable Distance Measure K-Means [VDMKM] Algorithm for Cluster Head Selection in WSN
Ashutosh Kumar Dubey

Ashutosh Kumar Dubey, Chitkara University Institute of Engineering and Technology, Chitkara University, Punjab, India.

Manuscript received on October 11, 2019. | Revised Manuscript received on 23 October, 2019. | Manuscript published on November 10, 2019. | PP: 87-92 | Volume-9 Issue-1, November 2019. | Retrieval Number: A3925119119/2019©BEIESP | DOI: 10.35940/ijitee.A3925.119119
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Wireless sensor networks (WSNs) provide an empirical and explorative ways to handle and collection of the data in the centralized way. In this paper an efficient variable distance measure k-means [VDMKM] algorithm for cluster heads (CHs) selection in WSN has been presented and analyzed. This approach is divided into two phases. In the first phase data preprocessing has been performed. In this phase size-based weight and threshold assignment have been done on the scaling factor of 1-10. In the second phase VDMKM approach has been applied. The main benefit of this approach is the capability of smaller distance assignments automatically based on different distance measures. The distance measures used here are Euclidean, Pearson coefficient and Manhattan correlation. The complete cluster correlated delay has been calculated along with the packet delivery time. Our distance measure based automatic distance adjustment approach provides better suited distance-based packet delivery in less time. The results are more prominent in the case of Euclidean and Manhattan.
Keywords: WSN, VDMKM, Euclidean, Pearson Coefficient and Manhattan Correlation.
Scope of the Article: Algorithm Engineering