.png){kind=icon}
.png){kind=icon}
Return
A Novel Cluster Head Selection Method based on K-Means Algorithm for Energy Efficient Wireless Sensor Network
.png){kind=icon}
PRE
AI
DOI：10.1109/WAINA.2013.123.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Wireless sensor network consists of hundreds to thousands of sensor nodes gathering various data including temperature, sound, location, etc. They have been applied to numerous fields such as healthcare, monitoring system, military, and so forth. It is usually difficult to recharge or replace the sensor nodes which have limited battery capacity. Energy efficiency is thus a primary issue in maintaining the network. In this paper we propose an efficient cluster head selection method using K-means algorithm to maximize the energy efficiency of wireless sensor network. It is based on the concept of finding the cluster head minimizing the sum of Euclidean distances between the head and member nodes. Computer simulation shows that the proposed approach allows better performance than the existing hierarchical routing protocols such as LEACH and HEED in terms of network lifetime.
Keywords:
Wireless sensor network
LEACH
HEED
Energy-efficiency
Cluster
K-means algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
0
Papers:
8
Citations:
0