4.7 Article

Clustering the sensor networks based on energy-aware affinity propagation

Journal

COMPUTER NETWORKS
Volume 207, Issue -, Pages -

Publisher

ELSEVIER
DOI: 10.1016/j.comnet.2022.108853

Keywords

Wireless sensor networks; Cluster routing; Affinity propagation; Energy efficiency

Funding

  1. Key Research and Development Projects of Hunan Province [2018SK2055]
  2. Ministry of Emergency Management of the People's Republic of China Key Technologies for Safety Production and Major Accidents Prevention and Control [Hunan0001-2018AQ]
  3. Hunan Provincial Natural Science Foundation of China [2021JJ50093]

Ask authors/readers for more resources

This paper proposes a cluster routing protocol based on energy-aware affinity propagation (CAP), which improves the energy efficiency and prolongs the network lifetime of wireless sensor networks (WSNs). The CAP protocol enhances network performance through an energy-aware affinity propagation clustering algorithm, inter-cluster relay selection method, and energy threshold re-cluster scheme.
Due to the limited energy of wireless sensor networks (WSNs), improving energy efficiency and prolonging network lifetime are the key issues of WSNs application. In this paper, we proposed a cluster routing protocol based on energy-aware affinity propagation(CAP). The CAP protocol enhances network performance from three aspects. First, an energy-aware affinity propagation clustering algorithm is proposed, which finds the optimal network clustering topology taking into account the total network energy consumption and load balancing. Second, an inter-cluster relay selection method is proposed for CH relay selection in multi-hop routing. At last, the energy threshold re-cluster scheme is applied to avoid frequent re-clustering that consumes a large amount of energy. The simulation experiments are conducted in two sink node deployment scenarios: sink external(case 1) and central(case 2) deployment. The results indicate that our proposed CAP outperforms LEACH, LEACH-C, and KCE in terms of energy efficiency and network lifetime. In case 1, the first node death of the proposed CAP algorithm occurs in 1114 rounds, which is 61.4%, 64.5%, and 33.3% longer compared to LEACH, LEACH-C, and KCE, respectively. In case 2, the first node death of the CAP algorithm occurs in 1372 rounds, which is 68.8%, 31.9%, and 49.8% longer compared to LEACH, LEACH-C, and KCE, respectively.

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