Millán Gordillo, María , CEBALLOS GONZÁLEZ, MANUEL, ORIHUELA ESPINA, DIEGO LUIS
No
Afinidad
Article
Científica
4
4
28/04/2026
2-s2.0-105038611187
This paper integrates graph-theoretic methods and computational geometry to model sensor deployments as weighted Delaunay graphs, capturing spatial proximity and communication costs. Several strategies are proposed to address different and common problems related to the management of sensor networks, including battery management, reconfiguration of network communication topologies, efficient data collection, etc. In particular, six algorithmic methods are presented, combining minimum spanning trees (MST), shortest-path computations, edge contraction, graph labeling, Voronoi diagram segmentation, and Delaunay triangulation. These methods are theoretically supported by some novel results on the hamiltonicity and chromatic properties of Delaunay graphs, ensuring complete traversal routes. The performance and scalability of the framework are shown with a real deployment of a sensor network for the monitoring of a suger cane field, where the performance and computational requirements of the proposed methods are assessed. © 2026 Asociacion de Quimicos del Instituto Quimico de Sarria. All rights reserved.
Algorithm; Delaunay Graph; Sensor network; Voronoi diagram; Weighted Graph