
Optimal Number of Cluster Heads for Selection Cooperation in Clustering Wireless Sensor Networks
Author(s) -
Min Li,
Heng Gu,
Qing Li
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1754/1/012220
Subject(s) - energy consumption , wireless sensor network , cluster analysis , computer science , cluster (spacecraft) , node (physics) , transmission (telecommunications) , computer network , energy (signal processing) , selection (genetic algorithm) , reliability (semiconductor) , real time computing , engineering , telecommunications , mathematics , statistics , artificial intelligence , electrical engineering , power (physics) , physics , structural engineering , quantum mechanics
In clustering wireless sensor networks, the number of cluster heads has great impact on energy consumption and transmission reliability of the system. With the increase of the number of transmission rounds, the area where the survival nodes are located gradually shrinks. In order to reduce the energy consumption of sensor nodes and improve the network lifetime, this paper proposes a dynamic cluster head (CH) number optimization scheme for selection cooperation. In order to reflect the area where the survival node is located, the network area as a variable is introduced into the energy consumption model. According to the behavioural characteristics of various nodes in the two-stage selection cooperation, the energy consumption model for each round is established. By solving the energy consumption model, the optimal number of cluster head in each round can be obtained. In this way, each round of transmission is carried out according to the minimum energy consumption. The simulation results show that the proposed scheme can reduce the energy consumption of the network, avoid energy waste caused by improper selection of cluster heads and extend the network lifetime.