High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Implication on k-Means Strategy in WSN

Author(s):

Ria Kumari , CTIEMT; Varsha, CTIEMT

Keywords:

NEAHC, Clustering, k-Means, Network Lifetime

Abstract

A Novel Energy Aware Hierarchical Cluster-Based (NEAHC) Routing Protocol with two goals: minimizing the total energy consumption and ensuring fairness of energy consumption between nodes. Relay node chooses problem as a nonlinear programming problem and use the property of convex function to find the optimal solution. NEAHC is used to extend network lifetime using a combination of a clustering approach and an optimal relay selection algorithm. For instance, first the cluster heads send the advertisement messages to all the nodes asking them to join their cluster. Then, each non-cluster head sends join message to the cluster head and again a third time cluster heads sends the message to the members informing which nodes must be out to the sleep node. So every time, the round changes this process gets repeated leading to so many messages being broadcasted thus leading to higher energy consumption. This method can be replaced by the K-means scheduling where the cluster heads for the subsequent rounds are decided in the initial phase itself. K-NEAHC determines an optimal routing path from the source to the destination by favoring the highest remaining battery power, high network lifetime in multi-hop path, and optimum fairness among sensor nodes.

Other Details

Paper ID: IJSRDV6I120042
Published in: Volume : 6, Issue : 12
Publication Date: 01/03/2019
Page(s): 122-125

Article Preview

Download Article