The K-Means Clustering used in Wireless Sensor Network
Journal Title: International Journal on Computer Science and Engineering - Year 2016, Vol 8, Issue 4
Abstract
The past few years have witnessed increased interest in the potential use of wireless sensor networks in applications such as environment management and various surveillance. The Sensor nodes in these applications are expected to be remotely deployed in large numbers and to operate autonomously in unattended environments. As per scalability, the nodes are often grouped into disjoint and mostly nonoverlapping clusters. We propose K-mean clustering used wireless sensor network. The method can divide a sensor network into a few clusters.
Authors and Affiliations
Dr Gayatri Devi , Srutipragyan Swain , Mr Rajeeb Sankar Bal
Keywords
Related Articles
- EP ID EP159560
- DOI -
- Views 112
- Downloads 0
Great Circle Distance Methode for Improving Operational Control System Based on GPS Tracking System
Fleet monitoring conducted to determine the position of the movement of the fleet to a point of reference. There are three applications that are necessary for the implementation of the monitoring system. They are Global...
Location Management Techniques to Improve QoS in Mobile Networks Using Intelligent Agent
Location Management (LM) is one of the major issues of mobile networks that should be taken into account for providing Quality of Service (QoS) and to meet the subscribers demand (satisfaction). Location management techn...
Mathematical algorithms for determination of mixed layer height from laser radar signals
This paper describes different mathematical algorithms used in the determination of mixed layer height (MLH) from the laser radar (lidar) signals. These methods are successfully applied to the indigenously developed port...
An Empirical Study on XML Schema Idiosyncrasies in Big Data Processing
The design and maintenance of the XML schemas for the enterprise, if done incorrectly, can be difficult and frustrating experience. The applications that use XML data binding or participate in the processing of large and...
A Framework for Incremental Hidden Web Crawler
Hidden Web’s broad and relevant coverage of dynamic and igh quality contents coupled with the high change frequency f web pages poses a challenge for aintaining and fetching p-to-date information. For the purpose, it...