返回
A Clustering WSN Routing Protocol Based on k-d Tree Algorithm
DOI:10.3390/s18092899.png)
摘要
En 中文
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.
Keyword:
k-d tree algorithm
hierarchical protocol
quality of service
routing protocol
WSN
clustering
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
Lung cancer clinicians’ preferences for adjuvant chemotherapy in non-small-cell lung cancer: What makes it worthwhile?
Lung Cancer
IF0
Platform for controlling and getting data from network connected drones in indoor environments用于在室内环境中控制和从网络连接的无人机获取数据的平台

