Improvement in K-Medoids using Shortest Path in Wireless Sensor Network
Garima Sharma1, Praveen Kumar2, Laxmi Shrivastava3
1Mamilla Naga Geetha, Assistant Professor, Department of ECE, CMR Institute of Technology, Kandlakoya, TS.
Manuscript received on 01 June 2019 | Revised Manuscript received on 07 June 2019 | Manuscript published on 30 June 2019 | PP: 2280-2286 | Volume-8 Issue-8, June 2019 | Retrieval Number: H7204068819/19©BEIESP
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 (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: A Wireless Sensor Network (WSN) is a collection of a large number of sensor nodes (SNs) & at the smallestsingle base station (BS). The SN is an independent tiny device that comprises of predominantly four units that are sensing, processing, communication & power supply. Clustering is a competent method for limiting node energy consumption and amplifying lifetime of the network. K-medoids algorithm is a kind of K-means algorithm, wherever the hubs are selected from the set of data facts. The node is closest to the nearest distance of the K-medoids in the node groups, finding the center of the same clusters as groups of the same cluster. Formerly created K-Medoids clusters are allergic to clusters and cluster heads, and then send data through cluster heads to reach up to BS. The BS is used to collect altogether nodes and detecting data finished cluster head bulges. They harvested the node coordinates and the rest of the energy, and then cluster number is detected. Central Circle-based points also reduce the time by calculating the remaining energy. But the nodes are randomly selected and the distance in the middle of the nodes as well as the base position is collective, which is collective time. Cluster heads connectstraight with the base position. So, the specific algorithm can override it. In this paper, Dijkstra Algorithm used for the transmission of data by generating the shortest path among the cluster heads. The tree has been formed to transmit the data from the source node to the BS through he intermediate cluster heads. The simulation takes place on the MATLAB device to show specific actions. In effect, indicates the effectiveness of the mission’s capabilities in operation and living capacity. Keywords: Wireless Sensor Network, Clustering, K-Means, K-Medoids, Dijkstra Algorithm.
Scope of the Article: Energy Harvesting and Transfer for Wireless Sensor Networks