A Balanced Parallel Clustering Protocol for Wireless Sensor Networks Using K-Means Techniques

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.

[1]  JAMAL N. AL-KARAKI,et al.  Routing techniques in wireless sensor networks: a survey , 2004, IEEE Wireless Communications.

[2]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[3]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[4]  Hillol Kargupta,et al.  K-Means Clustering Over a Large, Dynamic Network , 2006, SDM.

[5]  D.P. Agrawal,et al.  APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[6]  Qing Li,et al.  A Distributed Energy-Efficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks , 2006 .

[7]  Shi Ying-peng.  Energy and Distance Efficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks , 2007 .

[8]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[9]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[10]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[11]  Tang Yong,et al.  Overview of Routing Protocols in Wireless Sensor Networks , 2006 .

[12]  Hillol Kargupta,et al.  Approximate Distributed K-Means Clustering over a Peer-to-Peer Network , 2009, IEEE Transactions on Knowledge and Data Engineering.

[13]  Jian Pei,et al.  Data Mining: Concepts and Techniques, 3rd edition , 2006 .

[14]  D. Pham,et al.  An Incremental K-means algorithm , 2004 .

[15]  Majid Sarrafzadeh,et al.  Optimal Energy Aware Clustering in Sensor Networks , 2002 .

[16]  Alva L. Couch,et al.  Parallel K-means Clustering Algorithm on NOWs , 2003 .

[17]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[18]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.