1. The Use of Computational Geometry Techniques to Resolve the Issues of Coverage and Connectivity in Wireless Sensor Networks.
- Author
-
Devi, Sharmila, Sangwan, Anju, Sangwan, Anupma, Mohammed, Mazin Abed, Kumar, Krishna, Nedoma, Jan, Martinek, Radek, and Zmij, Petr
- Subjects
WIRELESS sensor networks ,COMPUTATIONAL geometry ,VORONOI polygons ,ROUTING algorithms - Abstract
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. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF