TY - GEN
T1 - K Medoids Based Clustering Algorithm with Minimum Spanning Tree in Wireless Sensor Network
AU - Jain, Shaffali
AU - Bharot, Nitesh
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/7
Y1 - 2019/7
N2 - 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.
AB - 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.
KW - Energy
KW - MST
KW - Optimal Route
KW - Prim's Algorithm
KW - Wireless Sensor Network
UR - http://www.scopus.com/inward/record.url?scp=85081162923&partnerID=8YFLogxK
U2 - 10.1109/ICCES45898.2019.9002548
DO - 10.1109/ICCES45898.2019.9002548
M3 - Conference Publication
AN - SCOPUS:85081162923
T3 - Proceedings of the 4th International Conference on Communication and Electronics Systems, ICCES 2019
SP - 1771
EP - 1776
BT - Proceedings of the 4th International Conference on Communication and Electronics Systems, ICCES 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 4th International Conference on Communication and Electronics Systems, ICCES 2019
Y2 - 17 July 2019 through 19 July 2019
ER -