Abstract
With the wide application of wireless sensor networks (WSNs) in real space, there are numerous studies on 3D sensor deployments. In this paper, the k‐connectivity theoretical model of fixed and random nodes in regular lattice‐based deployment was proposed to study the coverage and connectivity of sensor networks with regular lattice in 3D space. The full connectivity range and cost of the deployment with sensor nodes fixed in the centers of four regular lattices were quantitatively analyzed. The optimal single lattice coverage model and the ratio of the communication range to the sensing range (rc/rs) were investigated when the deployment of random nodes satisfied the k‐connectivity requirements for full coverage. In addition, based on the actual sensing model, the coverage, communication link quality, and reliability of different lattice‐based deployment models were determined in this study.
Highlights
Wireless sensor networks (WSNs) are considered one of the important technologies in the 21st century [1]
There are two main approaches for 3D sensor deployment: one is to map the 3D model onto the 2D plane [8], but the original 3-D network topology cannot be destroyed and it is difficult to calculate the effective solution of 3D space; the other is to optimize the 3D space topology
The topology of lattice-based regular sensor networks with full spatial coverage was investigated in this study
Summary
Wireless sensor networks (WSNs) are considered one of the important technologies in the 21st century [1]. Taking signal attenuation and other stochastic factors into consideration in the deployment structure design, the experiments in this study were closer to the real-world scenarios in terms of coverage, communication quality, and the dependency of sensor networks. (3) The model of regular lattice-based deployment with random node was deduced, and its effectiveness was verified in an experiment to formulate the optimal deployment structure for different rc/rs and its actual connectivity in random case. This paper was organized as follows: Section 2, a review of related works on regular deployment; Section 3, definitions, premises, and probabilistic coverage models of 3D sensor network deployment structure; Section 4, a study of fixed and random deployment models of sensor nodes in a regular lattice; Section 5, an analysis of the performance of deployment structure; and Section 6, conclusions
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
