17-03-2014, 10:16 PM
Abstract—Wireless sensor networks are simple, high speed and
inexpensive networks that include large number of sensors.
These networks are able to monitor a parameter where the
coverage is impossible via wired networks. Since clustering
improves energy consumption, clustering algorithms aim at
this improvement. In this paper, an energy efficient algorithm
entitled EECDP (Energy Efficient Clustering with Direct
Paths) is presented for wireless sensor networks. EECDP
employs the wireless sensor network's characteristics.
Simulation results illustrate that network's lifetime has been
optimized to 18.5% in clustered sensor networks.
Keywords- Cluster Head; energy efficiency; network lifetime;
wireless sensor network;
I. INTRODUCTION
Energy consumption is a major factor in wireless sensor
networks that affects the network's lifetime directly. Due to
the energy constraints of the sensor's battery, the purpose is
to employ methods which cause reduction in energy
consumption of such networks. Sensor networks have many
data for the end-user in order to process. Therefore,
automatic methods are required for data aggregation and
changing into a small series of meaningful information. Data
aggregation can fuse several unreliable measured data to
produce a more accurate signal [1].
Different clustering algorithms have been proposed to
group a number of sensors, usually in the same geographical
neighboring, to form a cluster [2-7]. By using clustering
approach, sensors can be coordinated by a CH (Cluster
Head) locally. CH is elected to manage the cluster and is
responsible for the communications between the cluster and
the BS (Base Station). Clustering provides a simple
framework for resource management. In addition, it can
support many important characteristics of the network inside
a cluster. These characteristics can include channel access
for the cluster members, energy control, routing and code
division for avoiding inter-cluster collision.
Clustering schemes can be useful in decreasing energy
consumption. Proposed algorithms have different features
such as cluster organizing optimization [8], balancing energy
consumption [3-5] and active/inactive clusters scheduling [9,
10].
There are some significant challenges regarding clustered
sensor networks such as cluster formation, security, mobility,
self-configuration and reconfiguration, energy efficiency and
protocol evaluation [11].
In this paper, section II investigates related researches.
The EECDP algorithm is described in section III. Section IV
discusses the simulation results and performance evaluation
by Matlab simulator. Finally in section V, we conclude the
paper.
inexpensive networks that include large number of sensors.
These networks are able to monitor a parameter where the
coverage is impossible via wired networks. Since clustering
improves energy consumption, clustering algorithms aim at
this improvement. In this paper, an energy efficient algorithm
entitled EECDP (Energy Efficient Clustering with Direct
Paths) is presented for wireless sensor networks. EECDP
employs the wireless sensor network's characteristics.
Simulation results illustrate that network's lifetime has been
optimized to 18.5% in clustered sensor networks.
Keywords- Cluster Head; energy efficiency; network lifetime;
wireless sensor network;
I. INTRODUCTION
Energy consumption is a major factor in wireless sensor
networks that affects the network's lifetime directly. Due to
the energy constraints of the sensor's battery, the purpose is
to employ methods which cause reduction in energy
consumption of such networks. Sensor networks have many
data for the end-user in order to process. Therefore,
automatic methods are required for data aggregation and
changing into a small series of meaningful information. Data
aggregation can fuse several unreliable measured data to
produce a more accurate signal [1].
Different clustering algorithms have been proposed to
group a number of sensors, usually in the same geographical
neighboring, to form a cluster [2-7]. By using clustering
approach, sensors can be coordinated by a CH (Cluster
Head) locally. CH is elected to manage the cluster and is
responsible for the communications between the cluster and
the BS (Base Station). Clustering provides a simple
framework for resource management. In addition, it can
support many important characteristics of the network inside
a cluster. These characteristics can include channel access
for the cluster members, energy control, routing and code
division for avoiding inter-cluster collision.
Clustering schemes can be useful in decreasing energy
consumption. Proposed algorithms have different features
such as cluster organizing optimization [8], balancing energy
consumption [3-5] and active/inactive clusters scheduling [9,
10].
There are some significant challenges regarding clustered
sensor networks such as cluster formation, security, mobility,
self-configuration and reconfiguration, energy efficiency and
protocol evaluation [11].
In this paper, section II investigates related researches.
The EECDP algorithm is described in section III. Section IV
discusses the simulation results and performance evaluation
by Matlab simulator. Finally in section V, we conclude the
paper.