earticle

논문검색

Towards Energy Efficient k-MEANS Based Clustering Scheme for Wireless Sensor Networks

초록

영어

Clustering is one of the effective methods which are applied in the wireless sensor networks to preserve the precious battery power of sensor nodes. Various clustering approaches have been proposed in the literature and LEACH is one of clustering and routing schemes which can be used to manage the sensor network. In this paper, we present an improved version of LEACH protocol which uses Kmeans clustering algorithm for selecting better nodes for clusterhead role. Our proposed solution tries to create symmetric clusters and by reducing the average intra-cluster communications distance, improves the network lifetime. It also, considers the sink location when the sink node is positioned far away and selects nodes as clusterhead which will consume less energy for handling cluster members. Thus, because, sensed data are transmitted to the closer clusterheads, our proposed clustering solution can prolong the network lifetime.

목차

Abstract
 1. Introduction
 2. LEACH Protocol
 3. K-Means Clustering
 4. KM-LEACH
 5. Simulation Results
 6. Conclusion
 References

저자정보

  • Moazam Bidaki Department of Computer Engineering, Neyshabur Branch, Islamic Azad University, Neyshabur, Iran
  • Reza Ghaemi Department of Computer Engineering, Quchan Branch, Islamic Azad University, Quchan, Iran
  • Seyed Reza Kamel Tabbakh Department of Software Engineering, Mashhad Branch, Islamic Azad University, Mashhad, Iran

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.