A Clustering WSN Routing Protocol Based on k-d Tree Algorithm
AbstractClustering 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. View Full-Text
Share & Cite This Article
Anzola, J.; Pascual, J.; Tarazona, G.; González Crespo, R. A Clustering WSN Routing Protocol Based on k-d Tree Algorithm. Sensors 2018, 18, 2899.
Anzola J, Pascual J, Tarazona G, González Crespo R. A Clustering WSN Routing Protocol Based on k-d Tree Algorithm. Sensors. 2018; 18(9):2899.Chicago/Turabian Style
Anzola, John; Pascual, Jordán; Tarazona, Giovanny; González Crespo, Rubén. 2018. "A Clustering WSN Routing Protocol Based on k-d Tree Algorithm." Sensors 18, no. 9: 2899.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.