Title: A sleep scheduling algorithm of redundant nodes in power communication sensor networks based on relative local density

Authors: Binyuan Yan

Addresses: Security Supervision Department, Information Center of Guizhou Power Grid Co., Ltd., Guiyang 550002, Guizhou, China

Abstract: In order to overcome the problems of low network coverage and short network node survival time in the traditional node sleep scheduling algorithm, a redundant node sleep scheduling algorithm based on relative local density is proposed in this paper. The composition of power communication sensor network is analysed, and the energy receiving model of redundant nodes in power communication sensor network is constructed. The sleep scheduling of network redundant nodes is realised according to the relative local density redundant node sleep algorithm. The results show that when the number of nodes is 120, the network performance of this method is 5.18 and the network coverage can reach 99.93%. At the same time, the survival time of sensor nodes under this method is longer, this method can prolong the network life cycle, and the sleep scheduling effect of redundant nodes is better.

Keywords: node sleep scheduling algorithm; energy consumption model; relative local density; network life cycle; relative local density.

DOI: 10.1504/IJRIS.2023.130208

International Journal of Reasoning-based Intelligent Systems, 2023 Vol.15 No.2, pp.141 - 147

Received: 20 May 2022
Accepted: 07 Jul 2022
Published online: 06 Apr 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article