Study on three-dimensional coverage method for wireless sensor networks based on greedy algorithm Online publication date: Thu, 06-Apr-2023
by Yong-Bo Liu; Yu-Cai Zhou
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 15, No. 2, 2023
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook