K Medoids Based Clustering Algorithm with Minimum Spanning Tree in Wireless Sensor Network

Many Wireless Sensor Network named as (WSN) have the resource constrained sensor nodes, that are predictable to work autonomously for long-time, such as months/years.Because of there stricted accessibility of the power supply, the main worry in the WSN is energy preservation. Throughout previous phases of the development of WSN, the nodes were static & communication between any of 2 hubs was completed through utilizing the multi-hop pathway. Usually, the Minimum Spanning Tree named as (MST) utilized the optimum data aggregation tree for an energy-efficient routing. Earlier the consumption of energy condensed through the hop basis data transmission include the help of the Prim's Algorithm. In this article, K-Medoids clustering based algorithm utilized to create clusters & then tree creation to enhance the effectiveness of network. Simulation has been done on the tool of MATLAB & outcome display that the proposed work has better first dead node time.