Comparison of Residual Energy-Based Clustering Algorithms for Wireless Sensor Network

Table 2

Algorithm	Pros	Cons
	(i) Balanced clusters.
	(ii) Low message overhead.	(i) Repeated iterations complexes algorithm.; (ii) Decrease of residual energy forces to iterate the  algorithm.; (iii) Nodes with high residual energy one region of a  network.
HEED	(iii) Uniform and nonuniform node distribution.
	(iv) Intercluster communication explained.
	(v) Out performs generic clustering protocols on various  factors.
DWEHC	(i) Hierarchical clusters.	(i) Calculating weight is difficult.; (ii) Number of iteration the algorithm uses.; (iii) Algorithm is implemented by each node.
	(ii) Balanced cluster size.
	(iii) Intercluster communication using TDMA.
	(i) Clustering is not performed in each round.	(i) Continuous evaluation on CH’s energy level.; (ii) Reclustering starts at the beginning of the next round.
HCA	(ii) Requires a higher amount of memory to store the  energy level.
	(iii) Intercluster communication using TDMA.
	(iv) Lifetime is extended.
	(v) Cluster formation is on demand.
EEHCS	(i) Use of three types of nodes.	(i) Calculation of weight is difficult.; (ii) Finding the spatial density.
	(ii) Extends lifetime because of advanced nodes.
	(iii) CHs selected in a hierarchical mode.
DECP	(i) CH is elected based on residual energy and  communication cost.	(i) More use of computational power to calculate the  communication cost.; (ii) Repeated iterations complexes the  algorithm.
	(ii) Load balanced compared to other algorithms.
	(iii) Does not require global energy knowledge.
EDFCM	(i) Provides longer lifetime.	(i) Uses energy consumption statistics of the previous  round.; (ii) Requires more memory to store the previous data.
	(ii) CHs per round is optimum.
	(iii) Stability increased by balancing energy consumption  round by round.
EEUC	(i) Removes the hotspot problem.	(i) Location of the CH is precomputed.; (ii) Each node calculates their distance from the BS.
	(ii) CH chooses a relay node from its adjacent nodes.
	(iii) Uses distributed CHs.
	(iv) Increases network lifetime.
DEEC	(i) Role of CH is rotated among the nodes.	(i) Repeated iterations complexes algorithm.; (ii) Deciding the election threshold is very difficult.
	(ii) All nodes have the idea of total energy and lifetime of  the network.
	(iii) BS is located at the center of the field.
EECS	(i) CH is elected based on local radio communication.	(i) Distance from BS is calculated at each node.; (ii) Always checks for another node having more residual  energy.
	(ii) It uses single hop communication between CH and  BS.
	(iii) CHs distributed uniformly.
	(i) Sensing holes are avoided.
MRPUC	(ii) BS is located at the center to balance energy  consumption.	(i) Calculating the distance based on received signal  strength.; (ii) More memory required to store the table containing  the distance values of each node.
	(iii) Intercluster tree is formed for intercluster   communication.
	(iv) Nodes uses sleep mode to save energy.
	(v) Uses TDMA for intercluster communication.