z-logo
open-access-imgOpen Access
Wireless Sensor Network Node Deployment Based On Regular Tetrahedron
Author(s) -
Yunfei Zhang,
Zhaogong Zhang
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1453/1/012113
Subject(s) - computer science , wireless sensor network , software deployment , node (physics) , energy consumption , cluster analysis , tetrahedron , point (geometry) , cluster (spacecraft) , focus (optics) , key distribution in wireless sensor networks , energy (signal processing) , wireless , real time computing , distributed computing , computer network , wireless network , mathematics , engineering , artificial intelligence , telecommunications , geometry , electrical engineering , structural engineering , operating system , statistics , physics , optics
The deployment of nodes in 3D wireless sensor networks has always been the focus of research. In this paper, two algorithms for achieving full coverage are proposed, which are applicable to the even distribution and the uneven distribution of target points. Among them, the characteristics of the spherical and regular tetrahedrons are rationally utilized to achieve the purpose of covering more space with the same nodes. For the three-dimensional space with uneven target distribution, it is proposed to use the DBSCAN clustering method for target point processing, and then perform the same processing in each cluster to avoid wasting more sensor nodes and increasing energy consumption. Finally, considering the problem of energy saving, some nodes are put to sleep and waiting for the next call to reduce energy consumption and extend the working time of the network. Simulation experiments show that the algorithm has improved the number of nodes used and energy consumption.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here