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 112
- Downloads 0
HIDING AN IMAGE INSIDE ANOTHER IMAGE USING VARIABLE-RATE STEGANOGRAPHY
A new algorithm is presented for hiding a secret image in the least significant bits of a cover image. The images used may be color or grayscale images. The number of bits used for hiding changes according to pixel neigh...
IRPanet: Intelligent Routing Protocol in VANET for Dynamic Route Optimization
This paper presents novel routing protocol, IRPANET (Intelligent Routing Protocol in VANET) for Vehicular Adhoc Network (VANET). Vehicular Ad Hoc Networks are special class of Mobile Adhoc Network, created by road vehicl...
A Generic Model for Assessing Multilevel Security-Critical Object-Oriented Programs
The most promising approach for developing secure systems is the one which allows software developers to assess and compare the relative security of their programs based on their designs. Thereby, software metrics provid...
Design and Performance Analysis of Microstrip Array Antennas with Optimum Parameters for X-band Applications
Md. Tanvir Ishtaique-ul Huque, Md. Kamal Hosain, Md. Shihabul Islam, Md. Al-Amin Chowdhury Abstract - This paper demonstrates simple, low cost and high gain microstrip array antennas with suitable feeding techniqu...
Using Fuzzy Clustering Powered by Weighted Feature Matrix to Establish Hidden Semantics in Web Documents
Digital Data is growing exponentially exploding on the 'World Wide Web'. The orthodox clustering algorithms obligate various challenges to tackle, of which the most often faced challenge is the uncertainty. Web documents...