Professional Documents
Culture Documents
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
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 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 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.
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.