A PCA Based K-Means Clustering Algorithm for Wireless Sensor Nodes
DOI:
https://doi.org/10.37591/jowet.v2i2.437Abstract
This paper presents a novel and improved approach for K-Means Clustering of wireless sensor networks, by using Principal Component Analysis for data reduction on the raw data. A wireless sensor network consisting of 100 nodes is classified into three different clusters using PCA based K-Means Algorithm. Davies-Bouldin Index is used as a parameter to check the effectiveness of the clustering algorithm. Experimental results demonstrate that the PCA based K-Means Algorithm increases the quality of clustering and assigns sensor nodes to their appropriate cluster more efficiently and hence provides a more robust and effective clustering of the wireless sensor network as compared to the conventional K-Means Algorithm.
Keywords: PCA, K-means, davies-bouldin index, wireless sensor networks
Cite this Article
Divleen Kaur, Ravi Kumar, A PCA Based K-Means Clustering Algorithm for Wireless Sensor Nodes. Journal of Web Engineering & Technology. 2015. 2(2): 6–10p.
References
Akyildiz IF, Weilian Su, Sankarasubramaniam Y, Cayirci E. A survey on sensor networks. IEEE Communications Magazine. 2002; 40(8): 102–114p.
Khemapech I, Duncan I, Miller A. A Survey of Wireless Sensor Networks Technology. Proceedings of the 6th Annual PostGraduate Symposium on the Convergence of Telecommunications, Networking & Broadcasting, Liverpool, UK, EPSRC. June 2005.
Honda Katsuhiro, Nonoguchi Ryoichi, Notsu Akira, Ichihashi Hidetomo. PCA-guided k-Means clustering with incomplete data. IEEE International Conference on Fuzzy Systems. 2011: 1710–1714p.
Filho Raimir Holanda, Maia José Everardo Bessa. Network Traffic Prediction using PCA and K-means. Network Operations and Management Symposium (NOMS) IEEE. 2010: 938–941p.
Kanungo Tapas, Mount David M, Netanyahu Nathan S et al. An Efficient k-Means Clustering Algorithm: Analysis and Implementation. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2002; 24(7): 881–892p.
Xie, Juanying, Jiang, Shuai. A simple and fast algorithm for global K-means clustering. Second International workshop on Education technology and Computer Science. 2010; 2: 36–40p.
Na Shi, Yong Guan, Xumin Liu. Research on K-means clustering algorithm: An improved K- means clustering. International Symposium on Intelligent Information Technology and Security Information. 2010: 63–67p.
Koonsanit Kitti, Jaruskulchai Chuleerat, Apisit. Parameter-Free K-means Clustering Algorithm for Satellite Imagery Application. Information Science and Applications (ICISA). 2012: 1–6p.
Davies DL, Bouldin DW. A cluster separation measure. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2009; PAMI-1(2): 224–227p.
Downloads
Published
Issue
Section
License
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
- I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
- I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
- I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
- I/We also agree to the authorship of the article in the following order:
Author’s name
1. ________________
2. ________________
3. ________________
4. ________________
We Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal. |