Title: Study on three-dimensional coverage method for wireless sensor networks based on greedy algorithm

Authors: Yong-Bo Liu; Yu-Cai Zhou

Addresses: College of Management, Hunan City University, Yiyang, Hunan, 413000, China ' School of Energy and Power, Changsha University of Science and Technology, Changsha 410076, China

Abstract: In order to reduce the problem of poor network coverage caused by unreasonable stage arrangement, a three-dimensional coverage method based on greedy algorithm for wireless sensor networks is proposed. The node perception model is established to determine the radiation range of a single node; By grid routing method, the target coverage area is divided into equidistant three-dimensional grid structure. The greedy algorithm is used to calculate the maximum distance and the minimum angle of the node location, then the rationality of the node is optimised, and finally the network coverage gap is repaired by edge coverage and node patch, so as to achieve three-dimensional full coverage of wireless sensor network. The experimental results show that the node survival rate of the proposed method is higher than 70%, and the maximum hop number of nodes is 8, and the network 3D coverage effect is better.

Keywords: greedy algorithm; wireless sensor network; three-dimensional coverage; node perception model; grid routing; overlay.

DOI: 10.1504/IJRIS.2023.130215

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

Received: 11 Aug 2021
Accepted: 21 Nov 2022
Published online: 06 Apr 2023 *

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