4.7 Article

HACH: Heuristic Algorithm for Clustering Hierarchy protocol in wireless sensor networks

Journal

APPLIED SOFT COMPUTING
Volume 55, Issue -, Pages 452-461

Publisher

ELSEVIER
DOI: 10.1016/j.asoc.2017.02.016

Keywords

Wireless sensor networks; Sleep scheduling; Clustering; Heuristic crossover; Coverage; Energy heterogeneity

Funding

  1. UK Innovate/EPSRC grant [EP/M506734/1]
  2. Engineering and Physical Sciences Research Council [EP/M506734/1] Funding Source: researchfish
  3. EPSRC [EP/M506734/1] Funding Source: UKRI

Ask authors/readers for more resources

Wireless sensor networks (WSNs) require energy management protocols to efficiently use the energy supply constraints of battery-powered sensors to prolong its network lifetime. This paper proposes a novel Heuristic Algorithm for Clustering Hierarchy (HACH), which sequentially performs selection of inactive nodes and cluster head nodes at every round. Inactive node selection employs a stochastic sleep scheduling mechanism to determine the selection of nodes that can be put into sleep mode without adversely affecting network coverage. Also, the clustering algorithm uses a novel heuristic crossover operator to combine two different solutions to achieve an improved solution that enhances the distribution of cluster head nodes and coordinates energy consumption in WSNs. The proposed algorithm is evaluated via simulation experiments and compared with some existing algorithms. Our protocol shows improved performance in terms of extended lifetime and maintains favourable performances even under different energy heterogeneity settings. (C) 2017 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available