An addition to the clustering algorithm of a wireless sensor network

The choice of a method for organizing information interaction is one of the urgent scientific tasks when deploying the Internet of things. In turn, the wireless sensor network, which is the physical basis of the Internet of things, has a serious limitation that is the requirement of low power consumption. The life of the network depends on energy consumption - the time during which the network performs its func-tions. The energy of sensory devices is spent on receiving and transmitting data, processing them, and calculating the route. New algorithms are required to reduce the number of data processing operations, route length, and more without losing network functionality. One mechanism that has proven to reduce power consumption is the clustering of a wireless sensor network due to the transfer of part of the functions to the head nodes of the clusters. The bee swarm algorithm proposed in the paper develops the idea of searching for the head nodes of wireless sensor network clusters. According to the proposed algorithm, at the beginning of the cycle, the head of the cluster of the current round and potential heads of clusters for the remaining rounds of the cycle are immediately determined. Thus, the phase of choosing the cluster head node, starting from the second round of the cycle, becomes redundant, and the sensor nodes get rid of some of the calculations associated with choosing the head of the cluster. The simulation results show the superiority of the bee swarm algorithm in comparison with the well-known LEACH low power adaptive clustering algorithm in terms of the duration of the wireless sensor network.