Sei sulla pagina 1di 3

ENERGY-EFFICIENT DATA COLLECTION

IN WIRELESS SENSOR NETWORK


USING CLUSTERING AND PREDICTION
Aparyay Kumar1, Dr. J Amutharaj2
1

P.G Student, M.E CSE, Alpha College of Engg, Chennai, T.N, India.

Reasearch Dean,HOD- M.E CSE, Alpha College of Engg, Chennai, T.N, India.

AbstractOne of the most prominent and


comprehensive ways of data collection in sensor networks is
to periodically extract raw sensor readings. This way of data
collection enables complex analysis of data, which may not be
possible with in-network aggregation or query processing. For
many applications in wireless sensor networks (WSNs), users
may want to continuously extract data from the networks for
analysis. However, accurate data extraction is difficultit is
often too costly to obtain all sensor readings, as well as not
necessary in the sense that the readings themselves only
represent samples of the true state of the world. Clustering and
prediction techniques, which exploit spatial and temporal
correlation among the sensor data provide opportunities for
reducing the energy consumption of continuous sensor data
collection. Integrating clustering and prediction techniques
makes it essential to design a new data collection scheme, so
as to achieve network energy efficiency and stability.
An energy-efficient framework for clustering-based
data collection in wireless sensor networks by integrating
adaptively enabling/disabling prediction scheme is proposed.
A cluster head represents all sensor nodes in the
cluster and collects data values from them. To realize
prediction techniques efficiently in WSNs, adaptive scheme is
introduced to control prediction used in this framework, and
design algorithms are used to exploit the benefit of adaptive
scheme to enable/disable prediction operations. This
framework is general enough to incorporate many advanced
features and how sleep/awake scheduling can be applied is
shown, which takes this framework approach to designing a
practical algorithm for data aggregation. It avoids the need for
rampant node-to-node propagation of aggregates, but rather it
uses faster and more efficient cluster-to-cluster propagation.
KeywordsWSN, Prediction Technique, Sleep/Awake
I. INTRODUCTION
Wireless Sensor Networks (WSN) open up new
opportunities to observe and interact with the physical world
around us. They enable us to gather data that was until now
difficult, expensive, or even impossible to collect. Wireless
sensor networks consist of sensor nodes with sensing and
communication capabilities. Area monitoring is a common
application of WSNs.

Sensor nodes usually consist of a processing unit


with limited computational power and limited memory,
sensors, a communication device (usually radio
transceivers) and a power source usually in the form of a
battery. The base stations are one or more distinguished
components of the WSN with much more computational,
energy and communication resources. They act as a
gateway between sensor nodes and the end user. The
interconnection of wireless sensor network grows stronger
as nodes are added.
LEACH protocol is used to implement the clustering
based Wireless Sensor Network. LEACH is a clusteringbased routing protocol that minimizes global energy usage
by distributing the load to all the nodes at different points
in time. LEACH out performs static clustering algorithms
by having nodes who volunteer to be high-energy clusterheads. LEACH is adapted to the corresponding clusters
based on the nodes that are chosen as cluster-heads at a
given time. At different times, each node has the burden of
acquiring data from the nodes in the cluster, fusing the data
to obtain an aggregate signal, and transmitting this
aggregate signal to the base station. LEACH is completely
distributed and requires no control information from the
base station.
In sensor networks, accurate data extraction is
difficultit is often too costly to obtain all sensor
readings, as well as not necessary in the sense that the
readings themselves only represent samples of the true
state of the world. It is challenging to extract this data
from a sensor network because of the limited battery
resources on each sensor device. In practice, sensor
network deployments make sense only if they can run
unattended for many months or even years.
As such, one technique so-called prediction emerges
to exploit the temporal correlation of sensor data.
Technology trends in recent years have resulted in sensors
increasing processing power and capacity. Implementing
more sophisticated distributed algorithms in a sensor
network becomes possible. One important class of such
algorithms is predictors, which use past input values from
the sensors to perform prediction operations. The existence
of such prediction capability implies that the sensors do
not need to transmit the data values if they differ from a

predicted value by less than a certain prespecified


threshold, or error bound.
II.

RELATED WORK AND EXISITNG MODEL


David Chu et al. [1] attack the SELECT problem
for sensor networks. They propose a robust approximate
technique called Ken that uses replicated dynamic
probabilistic models to minimize communication from sensor
nodes to the networks base station. In addition to data
collection, his team show that ken is well suited to anomaly
and event-detection applications.
ASAP an adaptive sampling approach to energy
efficient periodic data collection in sensor networks was
proposed by Bugra Gedik, Ling Liu, Philip S. Yu [2]. The
main idea behind ASAP is to use a dynamically changing
subset of the nodes as samplers such that the sensor readings
of the sampler nodes are directly collected, whereas the
values of the non-sampler nodes are predicted through the
use of probabilistic models that are locally and periodically
constructed. ASAP can be effectively used to increase the
network lifetime while keeping the quality of the collected
data high, in scenarios where either the spatial density of the
network deployment is superfluous relative to the required
spatial resolution for data analysis or certain amount of data
quality can be traded off in order to decrease the power
consumption of the network.
Data collection is a fundamental function provided
by wireless sensor networks. How to efficiently collect
sensing data from all sensor nodes is critical to the
performance of sensor networks. In this paper, Syuan Chen
et al.[3] proposed to understand the theoretical limits of data
collection in a TDMA-based sensor network in terms of
possible and achievable maximum capacity.
Wendi Rabiner Heinzelman et al.[4] look at communication
protocols, which can have significant impact on the overall
energy dissipation of these networks. The conventional
protocols of direct transmission, minimum-transmissionenergy, multihop routing, and static clustering may not be
optimal for sensor networks, they propose LEACH (LowEnergy Adaptive Clustering Hierarchy), a clustering-based
protocol that utilizes randomized rotation of local cluster
base stations(cluster-heads) to evenly distribute the energy
load among the sensors in the network.
Yingqi Xu and Wang-Chien Lee[5] exploit the
localized prediction paradigm for power-efficient object
tracking sensor network. Localized prediction consists of a
localized network architecture and a prediction mechanism
called dual prediction, which achieve power savings by
allowing most of the sensor nodes stay in sleep mode and by
reducing the amount of long-range transmissions.
Performance evaluation, based on mathematical analysis,
shows that localized prediction can significantly reduce the
power consumption in object tracking sensor networks.
Ossama Younis and Sonia Fahmy[6] presented a distributed,
energy-efficient clustering approach for ad hoc sensor
networks. Its approach is hybrid: Cluster heads are

probabilistically selected based on their residual energy, and


nodes join clusters such that communication cost is
minimized. Here assume quasi-stationary networks where
nodes are location-unaware and have equal significance. A
key feature of this approach is that it exploits the availability
of multiple transmission power levels at sensor nodes. Based
on this approach, introduced the HEED protocol, which
terminates in a constant number of iterations, independent of
network diameter.
III. MODULES AND DESCRIPTIONS
1. Set Up the Wireless Sensor Network Using LEACH
Protocol
In LEACH, the nodes organize themselves into local
clusters, with one node acting as the cluster head. All noncluster head nodes transmit their data to the cluster head,
while the cluster head node receives data from all the cluster
members, performs signal processing functions on the data
(e.g., data aggregation),and transmits data to the remote BS.
Therefore, being a cluster head node is much more energy
intensive than being a noncluster head node. If the cluster
heads were chosen a priori and fixed throughout the system
lifetime, these nodes would quickly use up their limited
energy. Once the cluster head runs out of energy, it is no
longer operational, and all the nodes that belong to the cluster
lose communication ability. Thus, LEACH incorporates
randomized rotation of the high-energy cluster head position
among the sensors to avoid draining the battery of any one
sensor in the network. In this way, the energy load of being a
cluster head is evenly distributed among the nodes.
The operation of LEACH is divided into rounds. Each round
begins with a set-up phase when the clusters are organized,
followed by a steady-state phase when data are transfered
from the nodes to the cluster head and on to the BS.
Set -Up Phase
During the set-up phase, each sensor node chooses a
random number between 0 and 1.If this is lower than the
threshold for node n, T(n), the sensor node becomes a clusterhead.
Steady Phase
The steady phase is of longer duration in order to
minimize the overhead of cluster formation. During the steady
phase, data transmission takes place based on the TDMA
schedule,
and
the
cluster-heads
perform
data
aggregation/fussion through local computation. The BS
receives only aggregated data from cluster heads, leading to
energy conservation. After a certain period of time in the
steady phase, cluster-heads are selected again through the setup phase. Two characteristics of LEACH.
a. Enable/Disable Capability of Nodes:
Whenever node is idle it will change the state from active
mode to inactive mode. During inactive mode nodes will
consume less energy comparison to active mode. Due to this

functionality of node, it can save energy and make a help to


long life of network.
b. Existence of Alive Nodes:
After Complete the simulation, function will
calculate the alive node in WSN, in this way it will show the
fault tolerance of leach protocol
2. Enable/Disable Prediction Operations.
Consider a cluster of sensor nodes, which can be
awake or sleeping. If the sensor nodes are sleeping, the
prediction problem is reduced to estimating data distribution
parameters using history data. In this case, it could well be the
case that the estimates are already available. This case is
neglect here.
If the sensor nodes are awake, they continuously
monitor an attribute x and generate a data value xt at every
time instance t. Without local prediction capability at the
cluster head, a sensor node has to send all data values to the
cluster head that estimates data distribution accordingly. With
local prediction, however, a sensor node can selectively send
its data values to the cluster head. One model for selective
sending is -loss approximation: Given an error bound > 0,
a sensor node sends its value xt to the cluster head if |xt - ^xt|
> , where ^xt is a predicted representative data value to
approximate the true data. The intuition of this choice is that if
a value is close to the predicted value there is not much
benefit by reporting it. If the value is much different from the
predicted value, it is important to consider it for computing
the data distribution.

IV. CONCLUSION
LEACH protocol is used to implement the clustering
based Wireless Sensor Network. LEACH is a clustering-

based routing protocol that minimizes global energy usage


by distributing the load to all the nodes at different points
in time.
Energy efficient periodic data collection in WSN
increases network life time and keeps a collection of high
quality data. For this reason, LEACH protocol is used as a
prediction based protocol with collection of data in WSN.
Data processing and intra-cluster prediction will be
introduced in WSN model. Also enable/disable capability
will be incorpoting in prediction operation. This is required
to achieve energy efficiency, Also update the cluster to
split/merge dynamically will be implemented.
References
[1] D. Chu, A. Deshpande, J.M. Hellerstein, and W. Hong,
Approximate Data Collection in
Sensor Networks
Using Probabilistic Models, Proc. IEEE Intl Conf. Data
Eng. (ICDE), 2006.
[2] B. Gedik, L. Liu, and P.S. Yu, ASAP: An Adaptive
Sampling Approach to Data Collection in Sensor
Networks, IEEE Trans. Parallel and Distributed
Computing, vol. 18, no. 12, pp. 1766-1783, Dec. 2007.
[3] Siyuan Chen, Minsu Huang, Shaojie Tang, and Yu
Wang, Senior Capacity of Data Collection in Arbitrary
Wireless Sensor Networks IEEE TRANSACTIONS ON
PARALLEL AND DISTRIBUTED SYSTEMS.
[4] W.R.Heinzelman, A. Chandrakasan, and H.
Balakrishnan, Energy-Efficient Communication Protocol
for Wireless Microsensor Networks, Proc. Hawaii Intl
Conf. System Sciences, 2000.
[5] Yingqi Xu Wang-Chien Lee On Localized Prediction
for Power Efficient Object Tracking in
Sensor Networks, Pennsylvania State University.
[6] O. Younis and S. Fahmy, HEED: A Hybrid EnergyEfficient Distributed Clustering for Adhoc Sensor
Networks, Proc. IEEE INFOCOM, 2004.
[7] S. Goel and T. Imielinski, Prediction-Based
Monitoring in Sensor Networks: Taking Lessons from
MPEG, ACM SIGCOMM Computer Comm. Rev., vol.
31, no. 5, pp. 82-98, 2001.
[8] S.M. McConnell and D.B. Skillicorn, A Distributed
Approach for Prediction in Sensor Networks, Proc. SIAM
Intl Conf. Data Mining Workshop Sensor Networks,
2005.
[9] A. Silberstein, R. Braynard, G. Filpus, G. Puggioni, A.
Gelfand, K. Munagala, and J. Yang, Data-Driven
Processing in Sensor Networks, Proc. Conf. Innovative
Data Systems Research (CIDR), 2007.
[10] S. Hussain and A.W. Matin, Hierarchical ClusterBased Routing in Wireless Sensor Networks, Proc. Intl
Conf. Information Processing in Sensor Networks (IPSN),
2006.
___________________________________________________

Potrebbero piacerti anche