Coverage and Energy Based Clustering Techniques to Increase The Lifetime Of Network

Main Article Content

Akhil Jajulwar, Pravin Kulurkar

Abstract

A varied wireless sensor network consists of many types of nodes in sequence. Some of the nodes have high probability processing and large energy. The high energy nodes are called the manager nodes. Except the high energy nodes the other nodes are used for monitoring the data. These nodes sense the data from the environment and also act as a path to manager node, these are the normal nodes. In this paper, an energy-aware algorithm K- medoid is presented for the optimum selection of cluster heads and sensor groups that are used for monitoring and sending messages from nodes in point coverage, using the energy comparison between the nodes. This algorithm used is useful in reducing the energy consumption of the network and increase its life-time. Also we concentrate on a maximum lifetime coverage scheduling of target nodes and collect data for a WSN, even though if all the sensors have the identical sensing radius and the same transmission data. Finally, the practical efficiency of our algorithms is presented and analysed through simulation. These extensive simulation results show better performances of our algorithms.

Article Details

How to Cite
, A. J. P. K. (2016). Coverage and Energy Based Clustering Techniques to Increase The Lifetime Of Network. International Journal on Recent and Innovation Trends in Computing and Communication, 4(5), 396–400. https://doi.org/10.17762/ijritcc.v4i5.2197
Section
Articles