Improving K-Means Algorithm by Grid-Density Clustering for Distributed WSN Data Stream

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

Recommender System for Journal Articles using Opinion Mining and Semantics

Till date, the dominant part of Recommender Systems (RS) work focusing on single domain, i.e. for films, books and shopping and so on. However, human inclinations may traverse over numerous areas. Thus, utilization pract...

Review of Information Security Policy based on Content Coverage and Online Presentation in Higher Education

Policies are high-level statements that are equal to organizational law and drive the decision-making process within the organization. Information security policy is not easy to develop unless organizations clearly ident...

Towards No-Reference of Peak Signal to Noise Ratio

The aim of this work is to define a no-referenced perceptual image quality estimator applying the perceptual concepts of the Chromatic Induction Model The approach consists in comparing the received image, presumably deg...

Experimentation for Modular Robot Simulation by Python Coding to Establish Multiple Configurations

Most of the Modular Self-reconfigurable (MSR) robots are being developed in order to have the capability of achieving different locomotion gaits. It is an approach of robotic system which involving a group of identical r...

Modeling and Simulation Multi Motors Web Winding System

Web winding systems allow the operations of unwinding and rewinding of various products including plastic films, sheets of paper, sheets, and fabrics. These operations are necessary for the development and the treatment...

Download PDF file
  • EP ID EP417752
  • DOI 10.14569/IJACSA.2018.091181
  • Views 95
  • Downloads 0

How To Cite

Yassmeen Alghamdi, Manal Abdullah (2018). Improving K-Means Algorithm by Grid-Density Clustering for Distributed WSN Data Stream. International Journal of Advanced Computer Science & Applications, 9(11), 583-588. https://europub.co.uk/articles/-A-417752