Improving K-Means Algorithm by Grid-Density Clustering for Distributed WSN Data Stream
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 11
Abstract
At recent years, Wireless Sensor Networks (WSNs) had a widespread range of applications in many fields related to military surveillance, monitoring health, observing habitat and so on. WSNs contain individual nodes that interact with the environment by sensing and processing physical parameters. Sometimes, sensor nodes generate a big amount of sequential tuple-oriented and small data that is called Data Streams. Data streams usually are huge data that arrive online, flowing rapidly in a very high speed, unlimited and can’t be controlled orderly during arrival. Due to WSN limitations, some challenges are faced and need to be solved. Extending network lifetime and reducing energy consumption are main challenges that could be solved by Data Mining techniques. Clustering is a common data mining technique that effectively organizes WSNs structure. It has proven its efficiency on network performance by extending network lifetime and saving energy of sensor nodes. This paper develops a grid-density clustering algorithm that enhances clustering in WSNs by combining grid and density techniques. The algorithm helps to face limitations found in WSNs that carry data streams. Grid-density algorithm is proposed based on the well-Known K-Means clustering algorithm to enhance it. By using Matlab, the grid-density clustering algorithm is compared with K-Means algorithm. The simulation results prove that the grid-density algorithm outperforms K-Means by 15% in network lifetime and by 13% in energy consumption.
Authors and Affiliations
Yassmeen Alghamdi, Manal Abdullah
Keywords
Related Articles
- EP ID EP417752
- DOI 10.14569/IJACSA.2018.091181
- Views 118
- Downloads 0
Mobility for an Optimal Data Collection in Wireless Sensor Networks
Sensor nodes located in the vicinity of a static sink drain rapidly their batteries since they have to carry more traffic burden. This situation results in network partition, holes as well as data losses. To mitigate thi...
Evaluating Mobile Phones and Web Sites for Academic Information Needs
In the last decade, there has been an exponential growth in use of mobile phones among people. Smart phone invention has digitized life of a common man especially after introduction of 3G/4G technology. People are used t...
An Efficient Image Haze Removal Algorithm based on New Accurate Depth and Light Estimation Algorithm
Single image Dehazing has become a challenging task for a variety of image processing and computer applications. Many attempts have been devised to recover faded colors and improve image contrast. Such methods, however,...
DSP Real-Time Implementation of an Audio Compression Algorithm by using the Fast Hartley Transform
This paper presents a simulation and hardware implementation of a new audio compression scheme based on the fast Hartley transform in combination with a new modified run length encoding. The proposed algorithm consists o...
An Upper Ontology for Benefits Management of Cloud Computing
Benefits Management provides an established approach for decision making and value extraction for IT/IS investments and, can be used to examine cloud computing investments. The motivation for developing an upper ontology...