Clustering the sensor networks based on energy-aware affinity propagation

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 p...

Full description

Saved in:
Bibliographic Details
Published inComputer networks (Amsterdam, Netherlands : 1999) Vol. 207; p. 108853
Main Authors Zhang, Ke, Zhang, Guang, Yu, Xiuwu, Hu, Shaohua, Li, Moxiao
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 22.04.2022
Elsevier Sequoia S.A
Subjects
Online AccessGet full text
ISSN1389-1286
1872-7069
DOI10.1016/j.comnet.2022.108853

Cover

More Information
Summary: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, LEACHC, 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, LEACHC, 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, LEACHC, and KCE, respectively.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1389-1286
1872-7069
DOI:10.1016/j.comnet.2022.108853