.png){kind=icon}
.png){kind=icon}
Return
A Clustering WSN Routing Protocol Based on k-d Tree Algorithm
.png){kind=icon}
OA
AI
DOI：10.3390/s18092899.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
k-d tree algorithm
hierarchical protocol
quality of service
routing protocol
WSN
clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.5
Papers:
7.1W
Citations:
20.9W
View more organizations