ArticlePDF Available

IP2P K-means: an efficient method for data clustering on sensor networks

March 2013
Management Science Letters 3(3):967-972

DOI:10.5267/j.msl.2013.01.021

License
CC BY 4.0

Authors:

Many wireless sensor network applications require data gathering as the most important parts of their operations. There are increasing demands for innovative methods to improve energy efficiency and to prolong the network lifetime. Clustering is considered as an efficient topology control methods in wireless sensor networks, which can increase network scalability and lifetime. This paper presents a method, IP2P K-means – Improved P2P K-means, which uses efficient leveling in clustering approach, reduces false labeling and restricts the necessary communication among various sensors, which obviously saves more energy. The proposed method is examined in Network Simulator Ver.2 (NS2) and the preliminary results show that the algorithm works effectively and relatively more precisely.

Simulation environment in Network Simulator ver. 2

…

The changes of ILR in accordance with γ

…

Clustering obtained from central K-means algorithm (Modha & Spangler 2003)

…

Figures - available via license: Creative Commons Attribution 4.0 International

Content may be subject to copyright.

Available via license: CC BY 4.0

Content may be subject to copyright.



*Corresponding author.

E-mail addresses: peyman.mirhadi@gmail.com (P. Mirhadi)

doi: 10.5267/j.msl.2013.01.021



Management Science Letters 3 (2013) 967–972

Contents lists available at GrowingScience

Management Science Letters

homepage: www.GrowingScience.com/msl

IP2P K-means: an efficient method for data clustering on sensor networks

Peyman Mirhadi

, Sajjad Zandinia

, Azadeh Goodarzipour

, Siamak Salimi

and Hossein

Goodarzipour

Farnas Aria Co., Zafar St., Tehran, Iran

Qazvin Islamic Azad University, Qazvin, Iran

C H R O N I C L E A B S T R A C T

Article history:

Received October 21, 2012

Received in revised format

5 January 2013

Accepted 18 January 2013

Available online

January 20 2013

Many wireless sensor network applications require data gathering as the most important parts of

their operations. There are increasing demands for innovative methods to improve energy

efficiency and to prolong the network lifetime. Clustering is considered as an efficient topology

control methods in wireless sensor networks, which can increase network scalability and

lifetime. This paper presents a method, IP2P K-means – Improved P2P K-means, which uses

efficient leveling in clustering approach, reduces false labeling and restricts the necessary

communication among various sensors, which obviously saves more energy. The proposed

method is examined in Network Simulator Ver.2 (NS2) and the preliminary results show that

the algorithm works effectively and relatively more precisely.

Science Ltd. All ri

hts reserved.

Keywords:

Clustering algorithm

Wireless sensor network

Data stream

Network Simulator

Data aggregation

1. Introduction

During the past few years, there has been growing popularity among world’s nation to use wireless

communication devices, which has also created more interests in communication infrastructure

caused emergence of wireless sensor networks (WSN) (ChitraDevia et al. 2012). These networks

normally include intelligent sensors, which are equipped with some other advanced microsensors to

detect their environment, a small processor or even a low range wireless communication device.

In such networks, sensors with communication together, make a global framework from the

environment. In many sensor network usages, real time data processing and global meaningful

techniques for intelligent and rapid decision makings are unavoidable (Khalil & Attea 2011; Schaffer

et al. 2012). To take advantage of these models we need data mining on some information and the



968

primary concern is on how to cluster the data through an appropriate data mining technique to process

a group of similar objects with common attributes. With sensor’s data clustering, it is possible to get

an overall wisdom to the manner of data distribution and clustering is the first step for processing the

data (Aioffi, Valle et al. 2011). Clustering is also considered as one of the effective solutions to

enhance energy efficiency and scalability of large-scale wireless sensor networks. The primary

objective of clustering is to identify a subset of nodes in a wireless sensor network where all other

nodes communicate with the network sink via these selected nodes (Bhardwaj, SoniDinesh et al.

2012). However, many existing clustering algorithms are tightly coupled with exact sensor locations

derived through either triangulation techniques or extra hardware such as GPS equipment. However,

in practice, it is difficult to detect sensor location coordinates precisely because there are different

influencing factors such as random deployment, low-power and low-cost sensing devices (Ribas,

Colonna et al. 2012; Silva, Chiky et al. 2012; Wei, Chen et al. 2012).

Since the nature of distributed and restricted network and communication resources is somehow

unknown, it is necessary to make use of distributed algorithms. In this paper, we present a new

distributed data clustering for sensor networks in terms of bandwidth, energy and memory restrictions

(Liu & Li, 2012).

1.2. Sensor networks

Sensor networks are always dealt with a variety of challenges including energy, data processing,

communication and routing restrictions. Design of protocols and routing algorithms in sensor

networks to minimize the energy consumption is an area of open research. Routing protocols must

include three main capabilities in networks: identification of topology changes, communication

establishment in networks and detecting appropriate routes. In case of sleep state, existence of middle

nodes increases packet transmission delay (Akkaya & Senel, 2009; Bajaber & Awan 2011).

2. Material and methods

In this paper, we present a clustering algorithm where the primary part of it is associated with data

streaming processing and the other part is responsible of final data clustering. Because data stream is

a continuous flow, data stream processing section of the algorithm is always on running stage.

Therefore, it is impossible to store all data stream to main memory and so the proposed algorithm is

approximate algorithms. The method tries to propose a solution where the target function is a

constant approximate of efficient state of goal function.

The proposed algorithm uses location reduction for data stream process in restricted memory.

Location reduction is the transformation of m data point to l (l<m), so l points contain characteristics

of m points.

The proposed algorithm steps are:

1. Continue sampling as long as the majority of observed nodes, majority of gathered data by

sensor node, have not exceeded the memory constraint (m).

2. Using classical k-mean algorithm, calculate O(k) of center for m point and replace m points.

Use 2k central points, the location reduction process. The clustering is more precise if k is

higher but the consumption memory is also higher. Consider a weight for every center. This

weight is the points assigned to it.

3. Repeat step 1 and 2 until m

/2k point is read and m central point is obtained. These primer

centers are considered level-1 centers.

4. Use k-means algorithm to reduce m level-1 centers to 2k level-2 centers.

5. keep the most m i-level center in memory and produce 2k i+1_level center if majority of

i_level centers reaches m. Weight of new center is sum of weight of centers assigned to it.

P. Mirhadi / Management Science Letters 3 (2013)



969

6. If global clustering is obtained, apply k-means algorithm to all centers created to all levels,

otherwise go to the previous step.

3. Results

To evaluate the efficiency of the proposed algorithm, two indicators are used. To measure the precise

of proposed clustering, first indicator (LRI) shows percentage of errors on data points labeling. This

indicator demonstrates the proportion of data whose cluster labels in two executions are different

(distributed and non-distributed (central) algorithm), and is defined as follows,

LRI = ILC/n × 100%. (1)

ILC is sum of points whose cluster labels are different in distributed and central algorithm and n is

number of total points. Second indicator is the average distance between cluster centers in central and

distributed approaches. We show this indicator with DRC

DRC

(j) = 1/p [ ∑ || C

(j) - C

|| / || C

|| ] × 100% , (j = 1, … , k) (2)

where J is the number of cluster, p is the number of network nodes, C

(j) is center of j

cluster in i

node in distributed algorithm, C

is the center of j

cluster in k-means central algorithm and || || is

second order norm.

Xx x=++L

(3)

To evaluate the performance of the proposed algorithm, a 400 seconds scenario with 24 nodes is run

on NS2. To have different traffic, 8 UDP agents that have FTP application attached and 16 TCP

nodes, which have CBR on them are consisted. Data rate for CBR are 15 Mbit/s and 11 Mbit/s for

FTP. The proposed algorithm is run on every node Fig. 1. We have analyzed the results based on γ.

Fig. 1. Simulation environment in Network Simulator ver. 2

3.1. γ parameter

The proposed model of this paper uses γ parameter as defined by Bandyopadhyay and Giannella

(2006) where termination provision is based on γ. This parameter is a criterion on testing center

changes in two repetitions. It is obvious that lower value for γ means more clustering procession but



970

higher number of iterations will be required and it be more costly. Hence, it is important to select an

appropriate amount of this parameter, which requires a tradeoff between clustering precision and

communication cost. The changes of ILR in accordance with γ are shown on Fig. 2. As we can

observe, with an decrease in γ, partial communication cost will increase and false labeling will be

reduced.

Fig. 2. The changes of ILR in accordance with γ

In Fig. 3, clustering is obtained from central k-means method (Modha & Spangler 2003) is shown. In

Fig. 4 clustering obtained from proposed algorithm is shown. The similarity of these two figures

approves the high precision of the proposed algorithm.

Fig. 3. Clustering obtained from central K-means algorithm (Modha & Spangler 2003)

0.10.20.40.60.812345681530

ILR

P. Mirhadi / Management Science Letters 3 (2013)



971

Fig. 4. Clustering obtained from IP2P K-means algorithm

4. Conclusion

Recent advancement in wireless communications and electronics has enabled the development of

low-cost sensor networks. The sensor networks can be implemented in different applications and

there are various technical issues where researchers are currently doing research on. A high-density

wireless sensor network can be deployed for specific information-gathering. In such a network,

sensors need to route their sensed data to a base station, consuming highly-limited and

unreplenishable energy resource. Therefore, one of the most important issues in designing sensor data

gathering algorithms is to minimize the energy consumption for network longevity while meeting

certain requirements given, such as delay constraints, which may vary depending on specific

applications or environmental situations.

In this paper, a new distributed data clustering on sensor networks was proposed where

communication was the main reason of energy consumption in sensor networks. Therefore, the

proposed algorithm attempted to reduce the communication and message interchange by trying to

stop false labeling to save energy. The proposed algorithm was tested on a scenario with NS2

(Network Simulator ver.2) and the results showed efficient performance of the algorithm.

References

Aioffi, W.M., Valle, C.A., Mateus, G.R., & da Cunha, A. S. (2011). Balancing message delivery

latency and network lifetime through an integrated model for clustering and routing in Wireless

Sensor Networks. Computer Networks 55(13), 2803-2820.

Akkaya, K., Senel, F., & McLaughlan, B. (2009). Clustering of wireless sensor and actor networks

based on sensor distribution and connectivity. Journal of Parallel and Distributed Computing,

69(6), 573-587.

Bajaber, F., & Awan, I. (2011). Adaptive decentralized re-clustering protocol for wireless sensor

networks. Journal of Computer and System Sciences, 77(2), 282-292.

Bandyopadhyay, S., Giannella, C., Maulik, U., Kargupta, H., Liu, K., & Datta, S. (2006). Clustering

distributed data streams in peer-to-peer environments. Information Sciences, 176(14), 1952-1985.

Bhardwaj, M., Soni, S., & Kotary, D.K. (2012). Comparative Analysis of Energy Efficient Routing

Protocol for Wireless Sensor Network. International Journal of Computer Applications, 1, 65-59.

ChitraDevia, N., V. Palanisamy, et al. (2012). A Novel Distance for Clustering to Support Mixed

Data Attributes and Promote Data Reliability and Network Lifetime in Large Scale Wireless

Sensor Networks. International Conference on Communication Technology and System Design

2011 - Procedia Engineering.



972

Khalil, E. A., & Attea, B.A. (2011). Energy-aware evolutionary routing protocol for dynamic

clustering of wireless sensor networks. Swarm and Evolutionary Computation 1(4), 195-203.

Liu, T., & Li, Q. (2012). An energy-balancing clustering approach for gradient-based routing in

wireless sensor networks. Computer Communications, 35(17), 2150-2161.

Modha, D. S., & Spangler, W.S. (2003). Feature Weighting in k-Means Clustering. Machine

Learning 52(3), 217-237.

Ribas, A.D., Colonna, J.G., Figueiredo, C.M.S., & Nakamura, E.F. (2012). Similarity clustering for

data fusion in Wireless Sensor Networks using k-means. The 2012 International Joint Conference

on Neural Networks (IJCNN). Communication, Networking & Broadcasting ; Components,

Circuits, Devices & Systems ; Computing & Processing (Hardware/Software) ; Engineered

Materials, Dielectrics & Plasmas ; Fields, Waves & Electromagnetics ; Robotics & Control

Systems, 1-7, doi: 10.1109/IJCNN.2012.6252430

Schaffer, P., Farkas, K., Horváth, A., Holczer, T. & Buttyán, L. (2012). Secure and reliable

clustering in wireless sensor networks: A critical survey. Computer Networks, 56(11), 2726-2741.

Da Silva, A., Chiky, R., & Hébrail, G. (2012). A clustering approach for sampling data streams in

sensor networks. Knowledge and Information Systems 32(1), 1-23.

Wei, H., Chen, L., & Zhang, Y. (2012). Expected number of Cluster Members clustering algorithm in

wireless sensor networks. Systems and Informatics (ICSAI), 2012 International Conference on

Communication, Networking & Broadcasting ; Components, Circuits, Devices & Systems ;

Computing & Processing (Hardware/Software) ; Power, Energy, & Industry Applications, 1381 -

1384. DOI: 10.1109/ICSAI.2012.6223293

Energy Efficient Sensor Data Collection Approach for Industrial Process Monitoring

Article

Nov 2017

The use of wireless sensor network (WSN) for industrial applications has attracted much attention from both academic and industrial sectors. It enables a continuous monitoring, controlling, and analyzing of the industrial processes, and contributes significantly to finding the best performance of operations. Sensors are typically deployed to gather data from the industrial environment and to transmit it periodically to the end user. Since sensors are resource constrained, effective energy management should include new data collection techniques for an efficient utilization of the sensors. In this paper, we propose adaptive data collection mechanisms that allow each sensor node to adjust its sampling rate to the variation of its environment, while at the same time optimizing its energy consumption. We provide and compare three different data collection techniques. The first one uses the analysis of data variances via statistical tests to adapt the sampling rate, while the second one is based on the sets similarity functions, and the third one on the distance functions. Both simulation and real experimentations on telosB motes were performed in order to evaluate the performance of our techniques. The obtained results proved that our proposed adaptive data collection methods can reduce the number of acquired samples up to 80% with respect to a traditional fixedrate technique. Furthermore, our experimental results showed significant energy savings and high accurate data collection compared to existing approaches.

Energy efficient data handling and coverage for wireless sensor networks

Thesis

Full-text available

Jul 2016

Hassan Harb

In this thesis, we propose energy-efficient data management techniques dedicated to periodic sensor networks based on clustering architecture. First, we propose to adapt sensor sampling rate to the changing dynamics of the monitored condition using one-way ANOVA model and statistical tests (Fisher, Tukey and Bartlett), while taking into account the residual energy of sensor. The second objective is to eliminate redundant data generated in each cluster. At the sensor level, each sensor searches the similarity between readings collected at each period and among successive periods, based on the sets similarity functions. At the CH level, we use distance functions to allow CH to eliminate redundant data sets generated by neighboring nodes. Finally, we propose two sleep/active strategies for scheduling sensors in each cluster, after searching the spatio-temporal correlation between sensor nodes. The first strategy uses the set covering problem while the second one takes advantages from the correlation degree and the sensors residual energies for scheduling nodes in the cluster. To evaluate the performance of the proposed techniques, simulations on real sensor data have been conducted. We have analyzed their performances according to energy consumption, data latency and accuracy, and area coverage, and we show how our techniques can significantly improve the performance of sensor networks.

Adaptive Data Collection Approach based on Sets Similarity Function for Saving Energy in Periodic Sensor Networks

Article

Jan 2016

Disaster monitoring becomes a requirement for collecting and analysing data in order to offer a better disaster management situation. Periodic sensor networks (PSNs) are usually used in disaster monitoring and are characterised by the acquisition of sensor data from remote sensor nodes before being forwarded to the sink in a periodic basis. The major challenges in PSN are energy saving and collected data reduction in order to increase the sensor network lifetime and to ensure a long-Time monitoring for disasters. In this paper, we propose an adaptive sampling approach for energy-efficient periodic data collection in sensor networks. Our proposed approach provides each sensor node the ability to identify redundancy between collected data over time, by using similarity functions, and allowing for sampling adaptive rate. Experiments on real sensors data show that our approach can be effectively used to conserve energy in the sensor network and to increase its lifetime, while still keeping a high quality of the collected data.

Adaptive Data Collection Approach based on Sets Similarity Function for Saving Energy in Periodic Sensor Networks

Article

Jan 2016
Int J Inform Tech Manag

Disaster monitoring becomes a requirement for collecting and analysing data in order to offer a better disaster management situation. Periodic sensor networks (PSNs) are usually used in disaster monitoring and are characterised by the acquisition of sensor data from remote sensor nodes before being forwarded to the sink in a periodic basis. The major challenges in PSN are energy saving and collected data reduction in order to increase the sensor network lifetime and to ensure a long-time monitoring for disasters. In this paper, we propose an adaptive sampling approach for energy-efficient periodic data collection in sensor networks. Our proposed approach provides each sensor node the ability to identify redundancy between collected data over time, by using similarity functions, and allowing for sampling adaptive rate. Experiments on real sensors data show that our approach can be effectively used to conserve energy in the sensor network and to increase its lifetime, while still keeping a high quality of the collected data.

An Analysis of Variance-Based Methods for Data Aggregation in Periodic Sensor Networks

Article

Nov 2015
Lect Notes Comput Sci

Given the vast area to be covered and the random deployment of the sensors, wireless sensor networks (WSNs) require scalable architecture and management strategies. In addition, sensors are usually powered by small batteries which are not always practical to recharge or replace. Hence, designing an efficient architecture and data management strategy for the sensor network are important to extend its lifetime. In this paper, we propose energy efficient two-level data aggregation technique based on clustering architecture with which data is sent periodically from nodes to their appropriate Cluster-Heads (CHs). The first level of data aggregation is applied at the node itself to eliminate redundancy from the collected raw data while the CH searches, at the second level, nodes that generate redundant data sets based on the variance study with three different Anova tests. Our proposed approach is validated via experiments on real sensor data and comparison with other existing data aggregation techniques.

A Novel Distance for Clustering to Support Mixed Data Attributes and Promote Data Reliability and Network Lifetime in Large Scale Wireless Sensor Networks

Article

Full-text available

Dec 2012

Clustering based approaches in Wireless Sensor Networks helps in identifying the summarized data by exploiting the feature of data redundancy in sensor networks. Due to the inexpensive hardware used and unattended operation nature, nodes in the sensor networks are often prone to many failures malicious attacks and resource constraints and data collected in sensor networks are found to be unreliable. Moreover, the wide usages of sensor network in diverse application have put a constraint on sensor protocol to handle data of mixed types. To address the issues of energy minimization and data reliability, we propose a distributed agglomerative cluster based anomaly detection algorithm termed DACAD to detect the faulty readings based on kNN approach. Additionally, to support applications with mixed data attributes, we design a heterogeneous distance function, HOEM to handle both continuous and nominal attributes. In this paper we have evaluated the performance of proposed algorithm in terms of false alarm rate, false positive rate and detection rate. Our results demonstrate that the proposed distance achieves a comparable detection rate with low false alarm rate with a significant reduction in computation and communication over head and operates with both continuous and nominal data. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of ICCTSD 2011

Conference Paper

Full-text available

Jun 2012

Wireless Sensor Networks consist of a powerful technology for monitoring the physical world. Particularly, in-network data fusion techniques are very important to applications such as target classification and tracking to reduce the communication burden in these constrained networks. However, the efficiency of the solution can be affected by the data correlation among several sensor nodes. Thus, the application of value fusion (for clusters of nodes with correlated measurements) and decision fusion (combining the local decisions of the clusters) is a common strategy. In this work, we propose an algorithm for properly selecting the groups of nodes with correlated measurements. Experiments show that our algorithm is 30% better than a solution that considers only the spatial coherence regions.

Feature Weighting in k-Means Clustering

Article

Full-text available

Sep 2003

Data sets with multiple, heterogeneous feature spaces occur frequently. We present an abstract framework for integrating multiple feature spaces in the k-means clustering algorithm. Our main ideas are (i) to represent each data object as a tuple of multiple feature vectors, (ii) to assign a suitable (and possibly different) distortion measure to each feature space, (iii) to combine distortions on different feature spaces, in a convex fashion, by assigning (possibly) different relative weights to each, (iv) for a fixed weighting, to cluster using the proposed convex k-means algorithm, and (v) to determine the optimal feature weighting to be the one that yields the clustering that simultaneously minimizes the average within-cluster dispersion and maximizes the average between-cluster dispersion along all the feature spaces. Using precision/recall evaluations and known ground truth classifications, we empirically demonstrate the effectiveness of feature weighting in clustering on several different application domains.

A Comparative Study of Energy Efficient Routing Protocol for Wireless Sensor Network

Article

Puneet Kumar Bhardwaj

Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities. The routing is difficult in WSNs because nodes are dynamic. The main issues are power management and data dissemination because nodes have limited power and no fix infrastructure. Routing protocols in WSNs might differ depending on the application and network architecture. In this study we present a comparative analysis of routing techniques in WSNs. In this paper we also discuss on the design challenges for routing protocols in WSNs and which one is better for WSNs on the basis of these protocol operation parameters multipath-based, query-based, negotiation-based, QoS-based.

Expected number of Cluster Members clustering algorithm in wireless sensor networks

Conference Paper

May 2012

This paper proposes a protocol, ENCM (Expected Number of Cluster Members clustering algorithm), that's designed for single-hop wireless sensor networks in which plain sensor nodes communicate directly with the CHs (Cluster Heads). All nodes are commonly resource constrained and have limited amount of energy. In wireless sensor networks, BS (Base Station) is generally set up away from the target area. When CHs transmit data directly to the BS, the CHs further away from the BS consume more energy related to distance and tend to die faster, leaving areas of the network uncovered and resulting in shortening the lifetime of the network. Aiming to prolong the network lifetime, we use ENCM to group the cluster members of different CHs and push the energy consumption of every CH to achieve the average value which is calculated in this paper. Simulation results comparing with previous protocols prove that our new algorithm is able to extend the network lifetime observably and moderately reduces the variance of energy consumption by the CHs.

Secure and Reliable Clustering in Wireless Sensor Networks: A Critical Survey

Article

Jul 2012
COMPUT NETW

In the past few years, research interest has been increased towards wireless sensor networks (WSNs) and their application in both the military and civil domains. To support scalability in WSNs and increase network lifetime, nodes are often grouped into disjoint clusters. However, secure and reliable clustering, which is critical in WSNs deployed in hostile environments, has gained modest attention so far or has been limited only to fault tolerance. In this paper, we review the state-of-the-art of clustering protocols in WSNs with special emphasis on security and reliability issues. First, we define a taxonomy of security and reliability for cluster head election and clustering in WSNs. Then, we describe and analyze the most relevant secure and reliable clustering protocols. Finally, we propose countermeasures against typical attacks and show how they improve the discussed protocols.

An energy-balancing clustering approach for gradient-based routing in wireless sensor networks

Article

Oct 2012
COMPUT COMMUN

Clustering significantly reduces the energy consumption of each individual sensor in a wireless sensor network (WSN), and also increases the communication load on cluster heads. Because of the unbalanced energy consumption among cluster heads, the hot spots problem will arise when using the multihop forwarding model for the intercluster communication. Unequal clustering is an effective way to balance the energy consumption of cluster heads. In this paper, we present an Energy-Balancing unequal Clustering Approach for Gradient-based routing (EBCAG) in wireless sensor networks. It partitions the nodes into clusters of unequal size, and each sensor node maintains a gradient value, which is defined as its minimum hop count to the sink. The size of a cluster is decided by the gradient value of its cluster head, and the data gathered from the cluster members should follow the direction of descending gradient to reach the sink. Simulation results show that EBCAG balances the energy consumption among the cluster heads, and significantly improves the network lifetime.

Clustering distributed data streams in peer-to-peer environments

Article

Jul 2006
INFORM SCIENCES

This paper describes a technique for clustering homogeneously distributed data in a peer-to-peer environment like sensor networks. The proposed technique is based on the principles of the K-Means algorithm. It works in a localized asynchronous manner by communicating with the neighboring nodes. The paper offers extensive theoretical analysis of the algorithm that bounds the error in the distributed clustering process compared to the centralized approach that requires downloading all the observed data to a single site. Experimental results show that, in contrast to the case when all the data is transmitted to a central location for application of the conventional clustering algorithm, the communication cost (an important consideration in sensor networks which are typically equipped with limited battery power) of the proposed approach is significantly smaller. At the same time, the accuracy of the obtained centroids is high and the number of samples which are incorrectly labeled is also small.

Clustering of wireless sensor and actor networks based on sensor distribution and connectity

Article

Jun 2009

Wireless Sensor and Actor Networks (WSANs) employ significantly more capable actor nodes that can collect data from sensors and perform application specific actions. To take these actions collaboratively at any spot in the monitored regions, maximal actor coverage along with inter-actor connectivity is desirable. In this paper, we propose a distributed actor positioning and clustering algorithm which employs actors as cluster-heads and places them in such a way that the coverage of actors is maximized and the data gathering and acting times are minimized. Such placement of actors is done by determining the k-hop Independent Dominating Set (IDS) of the underlying sensor network. Basically, before the actors are placed, the sensors pick the cluster-heads based on IDS. The actors are then placed at the locations of such cluster-heads. We further derive conditions to guarantee inter-actor connectivity after the clustering is performed. If inter-connectivity does not exist, the actors coordinate through the underlying sensors in their clusters to adjust their locations so that connectivity can be established. The performances of the proposed approaches are validated through simulations.

CLUSMASTER: A clustering approach for sampling data streams in sensor networks

Conference Paper

Dec 2010

The growing usage of embedded devices and sensors in our daily lives has been profoundly reshaping the way we interact with our environment and our peers. As more and more sensors will pervade our future cities, increasingly efficient infrastructures to collect, process, and store massive amounts of data streams from a wide variety of sources will be required. Despite the different application-specific features and hardware platforms, sensor network applications share a common goal: periodically sample and store data collected from different sensors in a common persistent memory. In this article we present a clustering approach for rapidly and efficiently computing the best sampling rate which minimizes the SSE (Sum of Square Errors) for each particular sensor in a network. In order to evaluate the efficiency of the proposed approach, we carried out experiments on real electric power consumption data streams produced by a 1-thousand sensor network provided by the French energy group-EDF (Electricite de France).