The Use of Computational Geometry Techniques to Resolve the Issues of Coverage and Connectivity in Wireless Sensor Networks
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F22%3A10250377" target="_blank" >RIV/61989100:27240/22:10250377 - isvavai.cz</a>
Výsledek na webu
<a href="https://www.mdpi.com/1424-8220/22/18/7009/htm" target="_blank" >https://www.mdpi.com/1424-8220/22/18/7009/htm</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.3390/s22187009" target="_blank" >10.3390/s22187009</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
The Use of Computational Geometry Techniques to Resolve the Issues of Coverage and Connectivity in Wireless Sensor Networks
Popis výsledku v původním jazyce
Wireless Sensor Networks (WSNs) enhance the ability to sense and control the physical environment in various applications. The functionality of WSNs depends on various aspects like the localization of nodes, the strategies of node deployment, and a lifetime of nodes and routing techniques, etc. Coverage is an essential part of WSNs wherein the targeted area is covered by at least one node. Computational Geometry (CG) -based techniques significantly improve the coverage and connectivity of WSNs. This paper is a step towards employing some of the popular techniques in WSNs in a productive manner. Furthermore, this paper attempts to survey the existing research conducted using Computational Geometry-based methods in WSNs. In order to address coverage and connectivity issues in WSNs, the use of the Voronoi Diagram, Delaunay Triangulation, Voronoi Tessellation, and the Convex Hull have played a prominent role. Finally, the paper concludes by discussing various research challenges and proposed solutions using Computational Geometry-based techniques.
Název v anglickém jazyce
The Use of Computational Geometry Techniques to Resolve the Issues of Coverage and Connectivity in Wireless Sensor Networks
Popis výsledku anglicky
Wireless Sensor Networks (WSNs) enhance the ability to sense and control the physical environment in various applications. The functionality of WSNs depends on various aspects like the localization of nodes, the strategies of node deployment, and a lifetime of nodes and routing techniques, etc. Coverage is an essential part of WSNs wherein the targeted area is covered by at least one node. Computational Geometry (CG) -based techniques significantly improve the coverage and connectivity of WSNs. This paper is a step towards employing some of the popular techniques in WSNs in a productive manner. Furthermore, this paper attempts to survey the existing research conducted using Computational Geometry-based methods in WSNs. In order to address coverage and connectivity issues in WSNs, the use of the Voronoi Diagram, Delaunay Triangulation, Voronoi Tessellation, and the Convex Hull have played a prominent role. Finally, the paper concludes by discussing various research challenges and proposed solutions using Computational Geometry-based techniques.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
20200 - Electrical engineering, Electronic engineering, Information engineering
Návaznosti výsledku
Projekt
<a href="/cs/project/EF17_049%2F0008425" target="_blank" >EF17_049/0008425: Platforma pro výzkum orientovaný na Průmysl 4.0 a robotiku v ostravské aglomeraci</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Ostatní
Rok uplatnění
2022
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Sensors
ISSN
1424-3210
e-ISSN
1424-8220
Svazek periodika
22
Číslo periodika v rámci svazku
18
Stát vydavatele periodika
CH - Švýcarská konfederace
Počet stran výsledku
32
Strana od-do
1-32
Kód UT WoS článku
000858853000001
EID výsledku v databázi Scopus
—