You are on page 1of 4

Introduction to WSN

A wireless sensor network (WSN) consists of spatially distributed


autonomous sensors to cooperatively monitor physical or environmental conditions, such as
temperature, sound, vibration, pressure, motion or pollutants. Sensors are built by recent
advances in micro electro mechanical systems (MEMS) technology. WSN's consists of many
sub nodes for data dissemination and data gathering on information. Sensory data comes
from multiple sensors of different modalities in distributed locations. Wireless Sensor
Networks, which are responsible for sensing as well as for the first stages of the processing
hierarchy.

The development of wireless sensor networks was motivated by military applications


such as battlefield surveillance and is now used in many industrial and civilian application
areas, including industrial process monitoring and control, machine health monitoring,
environment and habitat monitoring, healthcare applications, home automation, and traffic
control.

Each node in a sensor network is typically equipped with a radio transceiver or


other wireless communications device, a small microcontroller, and an energy source,
usually a battery. A sensor network normally constitutes a wireless ad-hoc network, meaning
that each sensor supports a multi-hop routing algorithm where nodes function as forwarders,
relaying data packets to a base station. A simple wireless sensor network node is as shown
below

Clustering is a process of grouping nodes using a specific topology to perform certain tasks
as per the requirements efficiently.
The major issues that affect the design and performance of a wireless sensor
networks are hardware and operating system for WSN, wireless radio communication
characteristics, medium access schemes , deployment, localization, synchronisation,
Clustering, calibration, data aggregation and dissemination, database centric and querying,
architecture, programming models for sensor networks, quality of service and security.

Cluster properties: Often clustering schemes strive to achieve some characteristics for the
generated clusters. Such characteristics can be related to the internal structure of the cluster
or how it relates to others. The following are the relevant attributes:
• Cluster count: In some published approaches the set of CHs are predetermined and
thus the number of clusters are preset. Randomly picking CHs from the deployed sensors
usually yields variable number of clusters.
• Stability: When the clusters count varies and the node’s membership evolves overtime,
the clustering scheme is said to be adaptive. Otherwise, it is considered fixed since sensors
do not switch among clusters and the number of clusters stays the same throughout the
network lifespan.
• Intra-cluster topology: Some clustering schemes are based on direct communication
between a sensor and its designated CH. However, multi-hop sensor-to-CH connectivity is
sometimes required; especially when the sensor’s communication range is limited and/or the
CH count is bounded.
• Inter-CH connectivity: When the CH does not have long haul communication
capabilities, CHs connectivity to the base-station has to be provisioned. In that case, the
clustering scheme has to ensure the feasibility of establishing an inter-CH route from every
CH to the base-station. Some of the published work assumes that CH would be able to
directly reach the base-station.

Literature survey
Clustering algorithms in the literature varies in their objectives. Often the clustering
objective is set in order to facilitate meeting the applications requirements. For example if the
application is sensitive to data latency, intra and inter-cluster connectivity and the length of
the data routing paths are usually considered as criteria for CH selection and node grouping.
Even distribution of sensors among the clusters is usually an objective for setups where CHs
perform data processing or significant intra-cluster management duties

LEACH (Low Energy Adaptive Clustering Hierarchy) ALGORITHM:

CHs in leach algorithm are determined by calculating the probability of the node in
the range of 0 and 1. If the number is less than threshold value T(n), then node becomes a
cluster head for the current round. After selecting the CH then put T(n) to 0, so it will not be
used as CH in next round. As the number of elected CH’s increases the threshold value T(n)
is even greater for the remaining nodes.

CABCF (Clustering Algorithm Based On Communication Facility) ALGORITHM:

CABCF selects the node with highest CF as CHs on the processing of clustering
information, CABCF selects the node with highest CF or CH on the processing of cluster
formation. Intra cluster communicates multi-hop way according to the processing of cluster
information and in cluster information is from lower CF node to higher CF nodes. In this
algorithm each node calculates the communication facility in WSN. Each node searches for
the node nearest to itself to compound a combinative node in their respective scope of the
communication, repeat the node searching until each combinative nodes in a certain si

DEEP (Decentralised Energy Efficient Cluster Propagation) ALGORITHM:

DEEP establishes cluster with uniformly distributed cluster heads, this protocol
balances the load among all the cluster heads by keeping the clusters radii fairly equal. This
protocol completely decentralised and there is no need for any location finder device or
hardware e.g: GPS. Firstly, initial cluster head finds cluster members by sending cluster
declaration, initial cluster head finds cluster head candidates by sending cluster head
exploration signal. Cluster head candidates that are placed on the (dr1 , dr2) ring find cluster
members. Nodes that receive more than one cluster head declaration choose the closest
cluster head based on the received signal energy. Confirmed cluster heads send cluster
head exploration signals to find new cluster head candidates and again a closest cluster
head is selected based on the received signal energy. If the number of members in a cluster
is less than Mn, all the members find the new clusters by sending the membership search
signal. At the end, a node that has not received any control signals sends the membership
search signal.

A number of papers propose solutions to one or more of the above problems.


Our survey focuses on the suggested solutions in the following areas:
Energy Efficiency: Energy efficiency is a dominant consideration no matter what the
problem is. This is because sensor nodes only have a small and finite source of energy.
Many solutions, both hardware and software related, have been proposed to optimize
energy usage.
Localization: In most of the cases, sensor nodes are deployed in an ad hoc manner. It is up
to the nodes to identify themselves in some spatial co-ordinate system. This problem is
referred to as localization.
Routing: Communication costs play a great role in deciding the routing technique to be
used. Traditional routing schemes are no longer useful since energy considerations demand
that only essential minimal routing be done. Besides the above topics, we will also look at
some proposed sensor network systems.

Scope for future work


All the algorithms stated above proposes good methods considering the energy efficiency,
localization, load balancing and routing of data. As the number of nodes increases the
chances for the number of clusters in the network may increase. Clustering properties
defines that the number of clusters should be as minimal as possible. Hence a new method
is proposed.

Our methodology mainly focuses on minimizing the number of left out nodes from a cluster
that as to be formed also it considers the Node’s distance from the base station that as to
become the Cluster Head because it is also an important characteristic that should be taken
into account, apart from these two parameters it considers the amount of battery content of
the node which is the source for transmission between inter-cluster and intra-cluster
communication due to the difference of distance to the base station. In other words, the
basic idea is that the minimum the number of left out nodes, the closer to the base station
and higher the battery content results in a larger cluster area. Therefore, each sensor node
has the probability of becoming a cluster head which is determined by the number of left out
nodes, distance to the base station and its residual energy.

P(i) = c * (N – Ni) * d(Si , BS)


where c is a constant coefficient between 0 and 1, N is the total number of nodes deployed,
Ni is the number of nodes that are in coverage area by the node i and d(Si, BS) represents
the distance between sensor node i and the base station. Here we can see that the P(i)
value decrease as the node is nearer to the base station and covers the maximum number
of nodes in its coverage boundary and hence its chances to become a Cluster Head
increases.
This P(i) value is calculated for all the nodes present and is compared with a
predetermined value K where K is a constant. All the nodes which have their P(i) values less
then K can become the CH’s but we now take into account the residual energy of these
nodes to select the CH. So the node with highest residual energy which as its P(i) value less
than K can become the CH.
So by this model we can reduce number of clusters formed by forming cluster of
larger size and the distance between the CH and Base Station is also minimized, hence the
energy consumed for transmitting the information gathered by the CH to the Base Station is
minimise

You might also like