Department of Electronic Engineering, Fundación Universitaria Los Libertadores, Cr. 16 # 63A-68 Bogotá, Colombia.
Department of Engineering, Distrital University Francisco José de Caldas, Cr. 7 # 40B-53 Bogotá, Colombia.
Sensors (Basel). 2018 Sep 1;18(9):2899. doi: 10.3390/s18092899.
Clustering in wireless sensor networks has been widely discussed in the literature as a strategy to reduce power consumption. However, aspects such as cluster formation and cluster head (CH) node assignment strategies have a significant impact on quality of service, as energy savings imply restrictions in application usage and data traffic within the network. Regarding the first aspect, this article proposes a hierarchical routing protocol based on the k-d tree algorithm, taking a partition data structure of the space to organize nodes into clusters. For the second aspect, we propose a reactive mechanism for the formation of CH nodes, with the purpose of improving delay, jitter, and throughput, in contrast with the low-energy adaptive clustering hierarchy/hierarchy-centralized protocol and validating the results through simulation.
无线传感器网络中的聚类在文献中被广泛讨论，作为一种降低功耗的策略。然而，聚类形成和簇头 (CH) 节点分配策略等方面对服务质量有重大影响，因为节能意味着对网络内应用程序使用和数据流量的限制。关于第一个方面，本文提出了一种基于 k-d 树算法的分层路由协议，采用分区数据结构对节点进行聚类。关于第二个方面，我们提出了一种用于形成 CH 节点的反应机制，目的是改善延迟、抖动和吞吐量，与低功耗自适应聚类层次结构/层次中心协议形成对比，并通过模拟验证结果。
