Beruflich Dokumente
Kultur Dokumente
1
M. E Final Year, Dr. Paul’s Engineering College, Pondicherry,
Anna University, Chennai, Tamilnadu, India
sarahnixon@rediffmail.com
2
Assistant Professor, Department of Computer Science and Engineering,
Dr. Paul’s Engineering College, Pondicherry,
Anna University, Chennai, Tamilnadu, India
kumaran.periyasamy@yahoo.co.in
3
Professor & Head, Department of Computer Science and Information Technology,
Kuppam Engineering College, Kuppam, Andhra Pradesh, India
aarul72@hotmail.com
Abstract: Energy efficiency operations are essential in During data collection, two mechanisms are used to
extending Wireless Sensor Networks lifetime. Among the energy
reduce energy consumption: message aggregation and
saving- based solutions, clustering sensor nodes is an interesting
filtering of redundant data. These mechanisms generally use
technique for achieving these goals. . In this work, we propose a
new energy-efficient approach for clustering nodes in adhoc clustering methods in order to coordinate aggregation and
sensor networks. The main challenge in wireless sensor network filtering.
deployment pertains to optimizing energy consumption when
collecting data from sensor nodes. Compared to other methods Hierarchical (clustering) techniques can aid in reducing
(CPLEX-based method, distributed method, simulated useful energy consumption. Clustering is particularly useful
annealing-based method), the results show that our approach for applications that require scalability to hundreds or
returns high-quality solutions in terms of cluster cost and thousands of nodes. Scalability in this context implies the
execution time. As a result, this approach is suitable for need for load balancing and efficient resource utilization.
handling network extensibility in a satisfactory manner
Keywords: wireless sensor networks, clustering, energy- Applications requiring efficient data aggregation (e.g.,
efficient, distributed. computing the maximum detected radiation around an
object) are natural candidates for clustering. Routing
1. Introduction protocols can also employ clustering. Clustering was
proposed as a useful tool for efficiently pinpointing object
Sensor networks have recently emerged as an important locations.
computing platform. Sensor nodes are typically less mobile
and more densely deployed than mobile ad-hoc networks Clustering can be extremely effective in one-to-
(MANETs). Sensor nodes must be left unattended e.g., in many, many - to- one, one-to-any, or one-to-all (broadcast)
hostile environments, which makes it difficult or impossible communication. For example, in many-to-one
to re-charge or replace their batteries (solar energy is not communication, clustering can support data fusion and
always an option). This necessitates devising novel energy- reduce communication interference. The essential operation
efficient solutions to some of the conventional wireless in sensor node clustering is to select a set of cluster heads
networking problems, such as medium access control, among the nodes in the network, and cluster the rest of the
routing, self-organization, bandwidth sharing, and security. nodes with these heads. Cluster heads are responsible for
Exploiting the tradeoffs among energy, accuracy, and coordination among the nodes within their clusters (intra-
latency, and using hierarchical (tiered) architectures are cluster coordination), and communication with each other
important techniques for prolonging network lifetime and/or with external observers on behalf of their clusters
(inter-cluster communication).
This necessity implies the emergence of new kinds of
networks, which are typically composed of low-capacity Energy efficiency operations are essential in
devices. Such devices, called sensors, make it possible to extending Wireless Sensor Networks lifetime. Among the
capture and measure specific elements from the physical energy saving- based solutions, clustering sensor nodes is an
world (e.g., temperature, pressure, humidity). Moreover, interesting alternative that features a reduction in energy
they run on small batteries with low energetic capacities. consumption through: (i) aggregating data; (ii) controlling
Consequently, their power consumption must be optimized transmission power levels (iii) balancing load; (iv) putting
in order to ensure increased lifetime for those devices. redundant sens or nodes to sleep.
184 (IJCNS) International Journal of Computer and Network Security,
Vol. 2, No. 5, May 2010
first phase, the applications specify their QoS requirements that fulfill the cluster building constraints. Nodes that
regarding the data required by the applications. They send satisfy Constraint, i.e., ensure zone cover-age, are called
their requests to a particular node S, called the collector active nodes. The vertices of Gr represent the network
node, which receives the application query and obtains nodes. An edge is defined in graph Gr between nodes i and j
results from other nodes before returning them to the if they satisfy Constraints. Consequently, it is clear that a
applications. The collector node builds the clusters, clique in Gr embodies a feasible cluster. A clique consists of
optimally using the QoS requirements and the energy map a set of nodes that are adjacent to one another.
information. During the second phase, the cluster heads
must provide the collector node with combined Five steps should be conducted in order to adapt tabu
measurements for each period. The cluster head is in charge search heuristics to solve a particular problem:
of various activities: coordinating the data collection within
its cluster, filtering redundant measurements, computing 1. design an algorithm that returns an initial solution,
aggregate functions, and sending results to a node collector. 2. define moves that determine the neighbourhood N
of a solution s,
3. Problem Formulation 3. determine the content and size of tabu lists,
4. define the aspiration criteria,
The considered network contains a set V of m 5. design intensification and diversification
mechanisms.
stationary
nodes whose localizations are known. The communication The algorithm ends when one of the following three
model can be described as multihop, which means that
certain nodes cannot send measurements directly to the conditions occurs:
collector node: they must rely on their neighbors’ service. 1. All possible moves are prohibited by the tabu lists;
2. The maximal number of iterations allowed has been
An application can specify the following QoS requirements: reached;
1. Data collection frequency, fq. The network provides 3. The maximal number of iterations, where the best
results to the application every time the duration fq solution is not enhanced successively, has been
expires. reached.
2. A measurement uncertainty threshold, mut. If the Analysis of the Impact of Tabu Search Parameters
difference between two simultaneous measurements
from two different nodes in the same zone (fourth
requirement) is inferior to mut, then one of them is
considered redundant. The size of the tabu list has a direct impact on the
quality of the solution. Hence, it is important to analyze its
3. A query duration, T . The network required for the impact, in order to adjust its value accordingly. Results
query run a total time whose value is equal to T . reported in [5] show that determining the tabu list size
dynamically is more efficient than fixing its value during
4. A zone size step. The step value determines the zone the iterations. This experiment involves a sensor network
length. Within a single zone, measurements are composed of 100 nodes. A square topology is used, i.e.,
considered redundant. If an application requires nodes arise on the summits of squares that cover the entire
more precision, it could decrease the step value or network area. To facilitate the analysis, it is assumed that all
even ignore the transfer of such value. nodes are active.
5. Conclusions