Congestion Control Clustering A Review Paper
Congestion Control Clustering A Review Paper
Abstract: Wireless Sensor Networks consists of sensor nodes which are scattered in the environment, gather data and transmit it to a
base station for processing. Energy conservation in the Wireless Sensor Networks (WSN) is a very important task because of their
limited battery power. The related works so far have been done have tried to solve the problem keeping in the mind the constraints of
WSNs. In this paper, a priority based application specific congestion control clustering (PASCCC) protocol has been studied, which
often integrates the range of motion and heterogeneity of the nodes to detect congestion in a very network. Moreover a comparison of
the various clustering techniques has been done. From the survey it has been found that none of the protocol is efficient for energy
conservation. Hence the paper ends with future scope to overcome these issues.
Keywords: clustering, PASCCC, Data Aggregation, Sensor Node, WSNs
1. INTRODUCTION
A WSN contains a wide array of nodes which can be tightly
or arbitrarily deployed in a location by which they have
interest. There is Base Stations (BS) situated to sensing area.
The bottom station having major function in WSN as sink
send queries to nodes while nodes sense the asked queries and
send the sensed information in a joint way reverse to Base
station. Base station also serves as an entrance for outer
surface system i.e. Internet. And so the number of information
and send only relevant data to customer via internet is
performed by Base station. Because it is known nodes have
little batteries which are hard to change or recharge. So to
check out such structural design to improve power saving.
Clustering techniques in wireless sensor networks aims at
gathering data among sets of nodes, which elect leaders
among themselves. The first choice or cluster-heads has got
the role of aggregating the data and reporting the data to the
BS. The advantages with this scheme is so it reduces energy
usage of each node and communication cost. The clustering
algorithms which can be made is founded on homogeneity
and heterogeneity of nodes. One of many earliest work
proposing this process in WSNs is LEACH (Low Energy
Adaptive Clustering Hierarchy). Recently, there has been
plenty of other clustering techniques which are mostly
variants of LEACH protocol with slight improvement and
different application scenarios. DEEC (Design of a
distributed energy-efficient clustering), EDACH (EnergyDriven Adaptive Clustering Hierarchy) and EEUC (An
Energy-Efficient Unequal Clustering Mechanism) are all
clustering techniques proposed with the objective of
minimizing energy usage, while extending network life time.
Clustered sensor network could be classified into two main
types: homogeneous and heterogeneous sensor network.
While energy efficiency in WSNs remains a function of
uniform distribution of energy among sensor nodes,
classifying clustering techniques is dependent upon the
objectives in mind. The Optimal clustering technique may be
the technique for the heterogeneity nodes.
2. Clustering Objectives
Various objectives have been pursued by different literatures
in designing clustering architecture for WSN. Most objectives
are set to meet the application form constraints.
www.ijcat.com
540
4. LITERATURE REVIEW
Ramli, Aizat, and David Grace [1] presented two novel
distributed clustering algorithms that exploit cognitive
radio based principles as they are able to learn from the
received signal strength indicator (RSSI) beacons, to form
clusters which reduce the average distance between nodes
and cluster head, and also reduce the level of overlap
between clusters. One proposed method is based on a new
multiple summation of RSSI values, while the other is based
on a multiple in the last sensed RSSI benefit. Nodes become
a cluster head, with the winning nodes which are located in an
area of locally high node density. It has been shown that the
two learning based approaches have same performance, that
are significantly better than LEACH and a no learning
algorithm. Gautam, Navin, and Jae-Young Pyun [2] proposed
a new hierarchical routing protocol, distance aware
intelligent clustering protocol (DAIC), with all the key
concept involving dividing the multilevel into tiers in addition
to selecting the substantial energy CHs in the nearest distance
through the BS. They have observed that a considerable
amount of energy can be conserved by selecting CHs at the
nearest distance from the BS. Likewise, the number of CHs
continues to be computed dynamically to avoid selecting
unnecessarily large number of CHs in your network. The
www.ijcat.com
541
www.ijcat.com
542
[4]
[9]
[5]
[6]
[7]
[8]
[10]
[11]
[12]
6. REFERENCES
[1]
[2]
[3]
www.ijcat.com
[13]
[14]
[15]
[16]
543