TY - GEN
T1 - A balanced parallel clustering protocol for wireless sensor networks using K-means techniques
AU - Tan, Liansheng
AU - Gong, Yanlin
AU - Chen, Gong
PY - 2008
Y1 - 2008
N2 - For wireless sensor networks (WSNs), It Is a challenging task how to schedule the energy resource to extend the network lifetime due to the fact that WSNs are usually powered by limited and non-rechargeable battery. A clustering scheme is helpful In reducing the energy consumption by aggregating data at intermediate sensor nodes. In this paper, we propose a balanced parallel K-means based clustering protocol; we term it BPK-means protocol. In this new protocol, we use K-means algorithm to cluster the sensor nodes, the cluster-heads are then selected in terms of two factors, they are a) the distance from node to cluster-center, and b) the residual energy. BPK-means only requires local communications: each tentative cluster-head only communicates with their topologically neighboring nodes and other tentative cluster-heads when achieving a distributed clustering scheme. The algorithm thus has the attractive feature of parallel computations. Moreover, BPK-means further balances the clusters to improve intra-cluster communication consumptions. We present the algorithm of this new protocol, analyze its computing properties, and validate the algorithm by simulations. Both theoretical analyses and simulation results demonstrate that BPK-means can achieve better load-balance and less energy consumptions when compared with LEACH. In addition, the BPK-means protocol is able to distribute energy dissipation evenly among the sensor nodes, which then prolong the system lifetime for the networks significantly.
AB - For wireless sensor networks (WSNs), It Is a challenging task how to schedule the energy resource to extend the network lifetime due to the fact that WSNs are usually powered by limited and non-rechargeable battery. A clustering scheme is helpful In reducing the energy consumption by aggregating data at intermediate sensor nodes. In this paper, we propose a balanced parallel K-means based clustering protocol; we term it BPK-means protocol. In this new protocol, we use K-means algorithm to cluster the sensor nodes, the cluster-heads are then selected in terms of two factors, they are a) the distance from node to cluster-center, and b) the residual energy. BPK-means only requires local communications: each tentative cluster-head only communicates with their topologically neighboring nodes and other tentative cluster-heads when achieving a distributed clustering scheme. The algorithm thus has the attractive feature of parallel computations. Moreover, BPK-means further balances the clusters to improve intra-cluster communication consumptions. We present the algorithm of this new protocol, analyze its computing properties, and validate the algorithm by simulations. Both theoretical analyses and simulation results demonstrate that BPK-means can achieve better load-balance and less energy consumptions when compared with LEACH. In addition, the BPK-means protocol is able to distribute energy dissipation evenly among the sensor nodes, which then prolong the system lifetime for the networks significantly.
KW - Clustering algorithm
KW - K-means
KW - Network lifetime
KW - Throughput
KW - Wireless sensor network
UR - http://www.scopus.com/inward/record.url?scp=55849147668&partnerID=8YFLogxK
U2 - 10.1109/SENSORCOMM.2008.45
DO - 10.1109/SENSORCOMM.2008.45
M3 - Conference contribution
SN - 9780769533308
T3 - Proceedings - 2nd Int. Conf. Sensor Technol. Appl., SENSORCOMM 2008, Includes: MESH 2008 Conf. Mesh Networks; ENOPT 2008 Energy Optim. Wireless Sensors Networks, UNWAT 2008 Under Water Sensors Systems
SP - 300
EP - 305
BT - Proceedings - 2nd Int. Conf. Sensor Technol. Appl., SENSORCOMM 2008, Includes
T2 - 2nd International Conference on Sensor Technologies and Applications, SENSORCOMM 2008
Y2 - 25 August 2008 through 31 August 2008
ER -