Data Mining in WSN: A Survey

International Journal of Advanced Engineering Research and Technology (IJAERT)
Volume 2 Issue 2, May 2014, ISSN No.: 2348 8190

45
www.ijaert.org
Data Mining In WSN: A Survey
Robins Royal
Department of Computer Science and Applications, Kurukshetra University, Kurukshetra
ABSTRACT
Data clustering has been applied in various fields
like machine learning, data processing, wireless
sensor network and pattern recognition.
Association rule in data mining technique
frequently plays a necessary role. Data mining has
types of application areas like clustering in WSN,
medical speciality and biological sequences. The
disadvantages and advantages of K-means and
PSO technique have been discussed and in the
projected model, K- means algorithm and Particle
Swarm optimisation (PSO) will be hybridized to
produce efficient results. For each application,
technical details that are required for applying
PSO, such as its type, particle formulation and
fitness function is discussed.
Keywords: k-means, Clustering, Particle Swarm
optimisation, WSN, PSO
1. INTRODUCTION
Data cluster has infinite applications in knowledge
categorization, knowledge compression, data
processing, pattern recognition and compacting
and image segmentation. Data processing in
databases is the outstanding automatic extraction
of fascinating patterns from massive set of
knowledge collections. It mentioned the extraction
or mining of huge quantity of information from
data sources. The information sources embody
databases, knowledge warehouse etc. [7]. In data
processing, association rule learning is that the
most well-liked and extensively used methodology
to spot the interesting relations between the
information keeps in giant database.
1.1 Introduction to WSN
Wireless sensor network (WSNs) may be a network
composed of distributed autonomous devices that may
sense or monitor physical or environmental conditions
cooperatively. WSNs are employed in totally different
applications like environmental observation,
surroundings monitoring, prediction and detection of
natural calamities, medical observation and structural
health observation [2]. WSNs contain sizable amount
of tiny, cheap, disposable and autonomous sensing
element nodes that would be simply deployed in an ad
hoc manner in large geographical areas for remote
operations [8]. Sensors produce ad-hoc networks that
may send the detected event in a very multi-hop mode
of transmission to the sink [2]. During this mode of
transmission, WSNs generates an oversized quantity of
knowledge within the sort of streams. As a result, real
time knowledge streams and therefore the distributed
nature of sensing element networks give new
challenges for the info mining techniques [1].
1.2 Clustering in WSN
An arrangement of sensor nodes into totally different
virtual teams is named clustering.
Figure 1: shows the clustering in wsn [2]. Each cluster
includes of CH and its members. A CH typically
serves sort of a leader for its cluster, performing intra
cluster transmission arrangement, information sending,
and so on. [2] The cluster heads will summarize the
information and send it to the information centre or bs
as one packet, therefore reducing the overhead from
packet headers. In every round of the cluster formation
section, the network has to be compelled to choose
cluster heads and transfers the aggregative information
to bs. For choosing a cluster head, the subsequent
queries are to be considered.
Who can initialize the cluster head selection?
What are the parameters necessary for deciding the
role of a sensor node?
Which sensing element nodes are going to be
nominated as cluster heads?
will it require re-initiation of cluster formation
process?
Whether or not the chosen cluster heads are equally
distributed?
Whether or not it assures load reconciliation of
clusters?
Which information transmission is suitable for big
network, Single-hop or Multi-hop?
45
www.ijaert.org
Robins Royal
ABSTRACT
1. INTRODUCTION
process?
distributed?
clusters?
45
www.ijaert.org
Robins Royal
ABSTRACT
1. INTRODUCTION
process?
distributed?
clusters?
46
www.ijaert.org
clustering is extremely a lot of essential for WSNs
for the subsequent reasons.
Reduces energy consumption by up bandwidth
utilization.
Load reconciliation for even distribution of sensors
Re-clustering once fault tolerance occur CH transmits
solely aggregative information to the information sink
node
Reducing range of nodes collaborating in
transmission to bs by choosing CH.
Scalability for big number of nodes
Reduces information delay by regulating the amount
of hops
Economical utilization of resources
1.2 Introduction to Data mining
Data mining in WSN is the method of extracting
application directed patterns with the accuracy to
simply accept from endless and fast flow of knowledge
streams from detector networks. During this case the
entire knowledge can't be hold on and should be
processed forthwith [9]. Data mining algorithmic
program are sufficiently quick to process high-speed
incoming knowledge. The traditional data processing
algorithms were meant to handle the static knowledge
and use the multistep and multi scan mining algorithms
to analyse static data-sets [12]. Therefore typical data
processing techniques aren't compatible for handling
the big amount, high spatial property, and distributed
nature of the info created by the WSNs. cluster is a
very important mechanism in wireless sensing element
networks for measurability and achieving higher
performance [1]. Cluster heads were created supported
world and native parameter sets to realize improved
network performance. Cluster primarily based
algorithmic program imply gradable routing and
knowledge gathering protocols [8].
Generalized Algorithm
1. Initialize the overall particle population using PSO.
2. Every particle contains K clusters centres that were
displaced in problem area by activity PSO algorithmic
program.
3. PSO continues to perform till the particle population
converge.
4. When convergence global best position was
encountered together with the simplest cluster centre
that was found by particles.
5. This global best position from the network is
considered as input to K-means. This algorithmic
program can start operating till it converged.
6. The global best position is termed as cluster centres.
7. The initial cluster centres of the network are
optimised using k-means algorithmic program
therefore remove take away sensitivity of weakness.
8. The K-means algorithmic program relies on native
search optimisation. Due to its low process complexity
large quantity of computations for native search are
prevented.
9. If the end result of K-means is best than global best
solution then global best solution is replaced by
outcome of K-means [9].
2. LITERATURE REVIEW
Md. Mamunur Rashidet. al [1] projected associated-
correlated device patterns that may be a new form of
sensor behavioural pattern. The projected behavioural
patterns not solely capture association-like co-
occurrences however they additionally capture the
substantial temporal correlations silent by such co-
occurrences within the sensing element information.
This study additionally showed that the planned
approach was time and memory economical to find
associated-correlated patterns than the present most
effective algorithms. S.Nithyakalyaniet. al [2]
projected two typical data processing processes like
clustering and knowledge report that were needed to
cut back the energy consumption of WSNs. The first
goal of Node cluster in WSN was network pre-
processing that aimed to gather qualified data and to
limit the energy consumed. The algorithms beneath
study were Fuzzy C- means that cluster algorithms,
knowledge relay K-means cluster algorithmic program.
During this paper a comparative study from totally
completely different analysis proposals was created
that instructed different cluster head choice approaches
for knowledge aggregation.
Sridhar Mandapatiet. al [3] mentioned that there's a
desire to confirm bar of disclosures of confidential
personal data that is context sensitive. Literature is
abundant with progressive strategies for privacy
conserving biological process algorithms (EAs) that
offer solutions to real-world optimisation issues.
Existing EA solutions are specific to value perform
analysis in privacy-preserving domains. This work
proposes implementation of Particle Swarm
optimisation (PSO) to find an optimum generalized
feature set. DivyaBansalet. al [4] detailed that the
utilization of association rule mining in extracting
patterns that occur often within a knowledgeset and
showcases the implementation of the Apriori
algorithmic program in mining association rules from a
dataset containing crimes data regarding girls. For this
one knowledgeset is taken from UCI repository and
different knowledge is collected manually from the
session court of sirsa to gather data on heart melting
crimes against ladies. the most motive to use UCI is to
1st check the right operating of dataset so apply
Apriori on real dataset against crimes on ladies that
extracts hidden data that what cohort is chargeable for
this and to seek out wherever the real offender is
47
www.ijaert.org
concealing. SagarTiwaret. al [5] represented that the
foremost renowned cluster approaches was K-means
that effectively were employed in several cluster
issues, however this algorithmic program had some
downside like native optimum convergence and
sensitivity to preliminary points. During this study a
cooperative algorithmic program based on PSO and k-
means is given. The proposed algorithmic program
utilizes each global search ability of PSO and native
search ability of k-means. The projected algorithmic
program and PSO with Contraction issue (CF-PSO), k-
means algorithmic programs and KPSO hybrid
algorithm are used for clustering six datasets and their
efficiencies were compared with one another. Anjan
Das et. al [6] given a comparative study between
distributed extraction algorithmic program (DEM) and
a unique association rule mining mechanism (NARM)
for wireless sensing element networks. The author
instructed that the advances of wireless sensing
element network and their ability to get an oversized
quantity of knowledge, data processing techniques,
notably association rule mining technique, for
extracting helpful information concerning the
underlying network had received a good deal of
attention. Mehdi Neshatet. al [7] projected Associate
in Nursing algorithmic program that utilizes each
world search ability of PSO and native search ability
of k-means. Knowledge cluster was applied in multiple
fields like machine learning, data processing, wireless
sensing element networks and pattern recognition. The
planned algorithmic program and PSO with
Contraction issue (CF-PSO), k-means algorithmic
programs and KPSO hybrid algorithm were used for
cluster six datasets and their efficiencies were
compared with one another. Wen-Hwa Liaoet. al [8]
projected an object chase theme for OTSNs
mistreatment data processing approach. The author had
improved the Apriori algorithmic program for mining
association rules and created it applicable to the
OTSNs. The data mining algorithmic program was
applied to the past movement information of the article
and helpful association rules are excavated, that were
then accustomed predict ensuing location of the article.
The authors theme foreseen ensuing location of the
article additional accurately and will increase the
network lifespan. The author showed that the theme
outperforms the present schemes in terms of energy
potency and accuracy of chase. S.Z. Erdoganet. al [9]
projected a method to avoid the necessity of full time
care giving service, the particular trend was to
encourage older to remain living autonomously in their
homes as long as potential. This study given an
algorithmic program of fall detection, that observes fall
events by mistreatment data-mining approach. The
authors projected methodology performed detection in
2 steps. First, it collected the wireless sensing element
network (WSN) knowledge in stream format from
sensing element devices. Second, it used k-nearest
neighbour algorithmic program well-known lazy
learning algorithmic program to observe fall
occurrences. It detected falls by distinctive the autumn
patterns within the knowledge stream. Enrique
Garcaet. al [10] detailed that the appliance of
association rule mining in e-learning systems and
particularly, learning management systems. The author
describe the precise information discovery method its
mains drawbacks and a few potential solutions to
resolve them.Teresa M.A. Basileet. al [11] descried
that wireless sensing element networks (WSNs)
represent a typical domain wherever there are
advanced temporal sequences of events. During this
paper the authorpropose a relative framework to model
and analyse the info ascertained by sensing element
nodes of a wireless sensing element network.
Particularly the author extend a general purpose
relative sequence mining algorithmic program to tackle
under consideration temporal interval-based relations.
Real-valued statistic are discretized into similar
subsequences and represented by employing a relative
language. Preliminary experimental results prove the
pertinence of the relative learning framework to
advanced globe temporal knowledge. Gianluca
Bontempiet. al [12] proposed a two layered modular
architecture to perform data mining on large sensor
networks.The main extract of theapproach is that a
modular aggregation of sensor data gives dual
benefit.The first benefit is the clustering of sensors and
then reducing the communicationeort.Secondly, the
reduction in dimensionality of the datamining task and
improving the accuracy of the sensingtask. Dian
PalupiRiniet. al [13] projected that PSO may be a
biologically galvanized process search and
optimisation methodology. Modification PSO is
developed for finding the essential PSO downside. The
essential PSO is additional applicable to method static,
easy optimisation downside. [14]Andrea Kulakovet.
alsuggested that some of the algorithms developed
within the artificialneural-networks tradition can be
easily adopted to wirelesssensor network platforms and
will meet several aspects ofthe constraints for data
mining in sensor networks like:limited communication
bandwidth, limited computingresources, limited power
supply, and the need or faulttolerance.[15]Ian
Davidson et. al developeda non-parametricversion of
EM specifically for sensor networks. They
formallyshowed that the E-step can be solved in
polynomialtime. [16]Denis Krivitskiet. Aldemon
strated that in some cases hill climbing in wsn can be
solved usinga local algorithm. Local algorithms are
importantfor sensor networks because they have
superb messagepruning capabilities and because they
perform theirentire computation in-network. A sensor
48
www.ijaert.org
taking partof a local algorithm computes an exact
result using,in many cases, data it gathers from just its
nearestneighbourhood.
3. FINDINGS
As discussed and studied in the survey shown just
above we come to conclude that we can get important
information and limit energy consumed by efficient
clustering technique. Apart from that it helps in load
balancing, fault tolerance and coverage. We can
assume that the sensor nodes are randomly distributed
and not mobile. The coordinates of base station and
sensors and other dimensions of sensors are also
presumed. The following parameters of a network are
given some appropriate value.
Number of Nodes
Network size
Initial node energy
Minimum energy
Network threshold
Data transfer rate
Location of base station
Sensor nodes locations
The techniques studied are discussed below-:
K-means:- K-means algorithmic program starts
with k random cluster centre and divides a group
of objects into k subsets [2]. This methodology is
that the most well-liked and most used cluster
techniques because it is well graspable and will be
performed and had linear time quality. This
algorithmic program was initialized by choosing k
points in a very d- dimensional vector D = one. . .
N}, because the initial k clusters representatives or
centroids. The cluster condition method results in a
two-level hierarchy wherever the N nodes kind the
upper level and therefore the cluster-member
nodes form the lower level. The sensing element
nodes intermittently transmit their knowledge to
the corresponding N nodes [6]. The N nodes then
mixture the info and transmit them to the bottom
station (BS) either directly or through the
intermediate communication with different N
nodes. The k-mean algorithmic program takes the
input parameter, k, and partitions a collection of
objects into k clusters so the ensuing intra-cluster
similarity is high however the inter-cluster
similarity is low [9]. This algorithmic program has
following advantages-:
o K suggests that provides quicker results
most of the days as compared to gradable
cluster with giant no. of variables provided
the worth of K is tiny.
o K-Means produces tighter clusters than
gradable cluster, particularly if the clusters
are circular.
The following disadvantages of K-means
suggest that render it imperfect for our mining
task.
o Difficult to predict K price.
o It doesnt work well with world cluster.
o Different initial partitions may result in
numerous final clusters.
o It isn't good for clusters of various sizes and
density.
Particle Swarm optimisation (PSO): - PSO may
be a population based mostly search algorithmic
program that relies on the simulation of the social
behaviour of birds or bees. Every individual
particle among the swarm is described by a vector
in four-dimensional search area. This vector is
additionally allotted a vector that verifies ensuing
movement of the particle that is understood as rate
vector. The PSO verify the way to update the
speed of a particle. Every particle update its rate
supported current rate and the additionally the best
position it's traversed to this point and also
supported the worldwide best position explored by
swarm. [13]Thistechnique has the subsequent
advantages-:
o The technique is applicable in each research
project and engineering use.
o It doesnt have any overlapping or mutation
calculation.
o During the process of many generations, the
foremost person particle solely will transmit
data onto the opposite particles, and
therefore the speed of the researching is
incredibly quick[13].
The disadvantages are as listed as follows-:
o The methodology is susceptible to partial
optimism that causes the less precise at the
regulation of its speed and therefore the
direction.
o The methodology cannot estimate the issues
of non-coordinate system, like the answer to
the energy field and therefore the moving
rules of the particles within the energy field.
4. PROPOSED WORK
4.1 Proposed Model
In the projected model a replacement cluster approach
is employed to beat to the disadvantages of PSO and
K-Means algorithmic program. This model may be a
hybrid of K- suggests that algorithmic program and
Particle Swarm optimisation (PSO) [1]. In projected
algorithmic program at initial step the nodes of WSN
are initialized mistreatment PSO algorithmic program.
49
www.ijaert.org
Every particle contains M cluster centres which is able
to be displaced in downside area by activity PSO
algorithmic program which is able to continue till
convergence. When convergence, the simplest answer
are thought of as input of k- suggests that algorithmic
program. The k- suggests that algorithmic program can
begin operating and whereas it's not converged it
continue its operating. When convergence of PSOs
particles, PSOs output would have an applicable
initial cluster centres for k-means. When obtaining
output from PSO, k-means algorithmic program can
search regionally for best answer thanks to its high
convergence rate. When convergence of PSOs
particles, PSOs output would have an initial cluster
centres for k-means. The nodes of WSN network are
collected and referred as particle population. The
bottom of cluster algorithmic program is measurement
the similarity between knowledge and it is determined
what quantity similar these 2 knowledge vectors are
performed.
5. CONCLUSION
In the projected model, particle structure was designed
for cluster in PSO and k-means was used as behaviour
in PSO that's performed on some swarm on every
iteration. The optimizing fitness perform associated
with intra-cluster distance can show that the projected
algorithmic program can cross well with high rate from
native optimums and converge toward world optimums
and obtained results that are comparatively stable in
numerous performance.
References
1. Md. Mamunur Rashid, IqbalGondal,
loarderKamruzzaman ACSP-Tree: A Tree
Structure for Mining Behavioural Patterns From
Wireless Sensor Networks IEEE Conference on
Local Computer Networks, 2013
2. S. Nithyakalyani and Dr. S. Suresh Kumar Data
Aggregation In Wireless Sensor Network Using
Node Clustering Algorithms - A Comparative
Study Proceedings Of IEEE Conference On
Information And Communication Technologies,
2013
3. Sridhar Mandapati1, Dr
RaveendraBabuBhogapathi and Dr
M.V.P.Chandra SekharaRao Swarm Optimization
Algorithm for Privacy Preserving in Data Mining
IJCSI International Journal of Computer Science
Issues, Vol. 10, Issue 2, No 3, March 2013
4. DivyaBansal andLekhaBhambhu Execution of
APRIORI Algorithm of Data Mining Directed
Towards Tumultuous Crimes Concerning
WomenInternational Journal of Advanced
Research inComputer Science and Software
Engineering Volume 3, Issue 9, September 2013
5. SagarTiwari, SamtaGajbhiye Algorithm of
Swarm Intelligence Using Data Clustering
International Journal of Computer Science and
Information Technologies, Vol. 4 (4) , 2013
6. Anjan Das and Ganapati Das Distributed
Extraction and A Novel Association Rule Mining
Mechanism for WSN: An Empirical Analysis
IEEE, 2013
7. Mehdi Neshat and ShimaFarshchianYazdi A New
Cooperative Algorithm Based on PSO and K-
Means for Data Clustering Journal of Computer
Science 8 (2): 188-194, 2012
8. Wen-Hwa Liao and Kuo-Chiang Chang An
Object Tracking Scheme for Wireless Sensor
Networks Using Data Mining Mechanism IEEE,
2012
9. S.Z. Erdoganand T.T. Bilgin A data mining
approach for fall detection by using k-nearest
neighbour algorithm on wireless sensor network
data Published in IET Communications, Received
on 28th March 2011
10. Enrique Garca, CristbalRomer, Sebastin
Ventura, ToonCalders Drawbacks and solutions
of applying association rule mining in learning
management systems Proceedings of the
International Workshop on Applying Data Mining
in e-Learning 2007
11. Teresa M.A. Basile, Nicola Di Mauro, Stefano
Ferilli, and Floriana Esposito Relational
Temporal Data Mining for Wireless Sensor
Networks
12. GianlucaBontempi and Yann-Al Le Borgne An
Adaptive Modular Approach to the Mining of
Sensor Network Data
13. Dian PalupiRini, Siti Mariam Shamsuddin and
SitiSophiyatiYuhaniz PSO technique, system and
challenges
14. Andrea Kulakov and DancoDevcevData mining
in wireless sensor networks based on artificial
neural-networks Algorithms
15. Ian Davidson and SS Ravi Distributed Pre-
Processing of Data on Networks of Berkeley
Motes Using Non-Parametric EM
16. DeniKrivitski,AssafSchustery, and Ran Wolff
Local Hill Climbing in Sensor Networks

Data Mining in WSN: A Survey

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Data Mining in WSN: A Survey

Uploaded by

Copyright:

Available Formats

International Journal of Advanced Engineering Research and Technology (IJAERT)

Volume 2 Issue 2, May 2014, ISSN No.: 2348 8190

You might also like