K medoid Clustering in Wireless Sensor Network using a Constant Threshold

  • Gupta* S
  • et al.
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

wireless sensor network (WSN) is system which comprises of countless little sensors called node which has low-control handset that utilized device for get-together information in an assortment of situations dependent on system arrangement. The correspondence or message transitory procedure intended to preserve restricted energy assets of sensors for information handling is fundamental undertaking of WSN. To achieve this assignment, we are presenting another idea for sparing energy& upgrading the system lifetime of the system. Clustering is inventive in a few territories which incorporates abstain from execution clustering in every round, presenting secure limit, utilizing various calculations to do Clustering & using multi-jump directing by thinking about reasonable center node to transfer information as of every cluster to base station (BS). Residual energy, no. of nodes & separation of every node are measured measures to choose cluster head (CH) utilizing consistent edge has been contrasted with different calculations as far as parameters, for example, organize era, dead nodes in each round, main node kick bucket, & half beyond words last amazing.

Cite

CITATION STYLE

APA

Gupta*, S., & Narwaria, R. P. (2019). K medoid Clustering in Wireless Sensor Network using a Constant Threshold. International Journal of Recent Technology and Engineering (IJRTE), 8(4), 3752–3758. https://doi.org/10.35940/ijrte.d8135.118419

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free