Protocol to Mitigate Hot Spot Problem

Comparative analysis of related work protocols

Protocols Year Major contribution Advantages Drawbacks

LEACH 2000 CH selection and rotation Less communication Random selection of CH,
is distributed using a overheads, reduces position and number of
random number correlated data and each CHs are not optimum,
sensor node get equal single hop
chance to become the communication from
CH CH to the BS
LEACH-C 2002 centrally, the creates the Less overheads due to For location GPS requires
optimal number of centralized nature, which is costly and
clusters using a optimal numbers of consumes extra energy,
simulated annealing cluster and CHs created It is also less scalable
algorithm and optimal and minimum energy
number of CHs dissipation of individual
calculated based on the nodes
average energy of the
network
EEHC 2003 Multi-level clustering with Optimal number of CHs Hot spot problem near the
multihop communication are selected, suitable for BS, random selection of
by CHs large sensor network CHs
HEED 2004 A distributed energy Optimize resource usage, Hot spot problem for
efficient hybrid maximize network more than two-level of
clustering approach, lifetime hierarchy
where CHs are
probabilistically selected
based on their residual
energy and cluster
members are joins on the
basis of minimum
communication cost
EEMC 2008 Optimal number of CHs Achieve minimum energy Uniform distribution and
with multi-level dissipation and delay collision
clustering minimizes the with a efficient sleep
energy consumption and schedule
delay.
PRODUCE 2008 Distributed and unequal Reduces hot spot problem Scalability
clustering
MR- 2010 Entire sensing area is Multihop layerwise Hot spot is the main issue
LEACH divided into various communication and
layers and further highly scalability are the
divides in equal clusters main feature
LPGCRA 2010 Grid based fixed clustering Efficient load balance and Finding relay nodes creats
where CH are selected lesser hot spot. overheads
dynamically
MCDM 2012 Optimal CH selection Better in terms of network Scalability is the major
using fuzzy multiple lifetime problem
criteria decision making
and first declaration wins
rule
GR 2013 CH selected based on the Efficient routing path Hot spot problem
least transmission time
and highest residual
energy and data
transmitted to the BS via
a virtual chain formed by
other CHs
Table 1 continued
Protocols Year Major contribution
TTCDA 2014 Additive and divisible data
aggregation functions at
the CH.
GFTCRA 2015 A Distributed grid based
clustering and routing to
solve hot spot problem
MHCDA 2016 Data aggregation at a
predefined region in a
heterogeneous network
with a mobile sink
Advantages Drawbacks
Less energy consumption Hot spot problem
and better bandwidth
utilization
Energy efficient, low hot More delay and complex
spot and fault tolerance
Less communication and Hot spot problem is a
computation cost and major concern
better bandwidth
utilization