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

A Survey of Quality Prediction of Product Reviews

With the help of Web-2.0, the Internet offers a vast amount of reviews on many topics and in different domains. This has led to an explosive growth of product reviews and customer feedback, which presents the problem of...

LSB based Image Steganography by using the Fast Marching Method

This paper presents a novel approach for image steganography based on the Least Significant Bit (LSB) method. Most traditional LSB methods choose the initial embedding location of the cover image randomly, and the secret...

TOWARDS A SEAMLESS FUTURE GENERATION NETWORK FOR HIGH SPEED WIRELESS COMMUNICATIONS

The MIMO technology towards achieving future generation broadband networks design criteria is presented. Typical next generation scenarios are investigated. The MIMO technology is integrated with the OFDM technology for...

GPC Temperature Control of A Simulation Model Infant-Incubator and Practice with Arduino Board

The thermal environment surrounding preterm neonates in closed incubators is regulated via air temperature control mode. At present, these control modes do not take account of all the thermal parameters involved in a pat...

Open-Domain Neural Conversational Agents: The Step Towards Artificial General Intelligence

Development of conversational agents started half century ago and since then it has transformed into a technology that is accessible in various aspects in everyday life. This paper presents a survey current state-of-the-...

Download PDF file
  • EP ID EP417752
  • DOI 10.14569/IJACSA.2018.091181
  • Views 100
  • 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