Abstract

The progress of wireless communication and microelectronics create wireless sensor network, which is a very important field of research, The utilization of Wireless Sensor Network is growing and have a diversity applications like Military applications, Agriculture, Health care, Medical monitoring. The main issue of WSN is energy consumption, where prolonged network lifetime, is important necessity. From the solution proposed the Clustering with k-means is a successful technique for achieving these goals. This work is adaptation of one of the most famous protocol in WSN witch is Low Energy Adaptive Clustering Hierarchy (LEACH) in the clustering phase where the choice of number of clusters and their CHs.sing the k-means method and the distance between nodes and residual energy. Clustering k-means given a best partition with cluster separation. This chapter regulated as below, in section two we discussed related work used k-means to improved vitality of WSN. In the next section, we introduce the proposed adaptation protocol. The simulation resultsusing MATLAB have shown that the proposed protocol outperforms LEACH protocol and optimizes the nodes energy and thenetwork lifetime.

Highlights

  • Wireless Sensors Network (WSN) is composed of vast number of sensor nodes for sensing data

  • In this chapter we propose a new routing protocol based of K-Means mechanisms in phase of clustering and used the same transmission principe of Low Energy Adaptive Clustering Hierarchy (LEACH) protocol in each cluster

  • Our protocol is an adaptation of Low Energy Adaptive Clustering Hierarchy (LEACH) protocol that offers an improvement in the clustering procedure

Read more

Summary

Introduction

Wireless Sensors Network (WSN) is composed of vast number of sensor nodes for sensing data. Nodes are deployed densely either in (WSN) itself, or somewhere near to it [1]. The sensors nodes are low in cost, they have limited energy [2]. “Clustering” is technique very efficient to prolong lifetime of network, by reducing energy consumption. Clusters are easy to manage as compared to large whole network. In this chapter we propose a new routing protocol based of K-Means mechanisms in phase of clustering and used the same transmission principe of Low Energy Adaptive Clustering Hierarchy (LEACH) protocol in each cluster. Cluster Head (CH) is elected the node having the higher residual energy and minimum distances from k-means of each cluster

The routing protocol low energy adaptive clustering hierarchy (LEACH) Low Energy
Clustering with K-means We distinguish several types of clustering techniques
Proposed system
Sensor nodes deployment
Simulation results
Residual energy
Lifetime comparison
Comparison of CH numbers
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.