Next Article in Journal
Potentiality of Using Luojia 1-01 Nighttime Light Imagery to Investigate Artificial Light Pollution
Next Article in Special Issue
Sensoring a Generative System to Create User-Controlled Melodies
Previous Article in Journal
A Fluorescent Cy7-Mercaptopyridine for the Selective Detection of Glutathione over Homocysteine and Cysteine
Previous Article in Special Issue
Evolutionary Design of Convolutional Neural Networks for Human Activity Recognition in Sensor-Rich Environments
Article Menu
Issue 9 (September) cover image

Export Article

Open AccessArticle
Sensors 2018, 18(9), 2899;

A Clustering WSN Routing Protocol Based on k-d Tree Algorithm

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
Department of Computer Sciences, University of Oviedo, Street San Francisco, 33003 Oviedo, Spain
Technology and Engineering Department of UNIR, Universidad International de la Rioja (UNIR), C/Almansa 101, 28040 Madrid, Spain
Author to whom correspondence should be addressed.
Received: 17 July 2018 / Revised: 27 August 2018 / Accepted: 29 August 2018 / Published: 1 September 2018
(This article belongs to the Special Issue Wireless Sensors Networks in Activity Detection and Context Awareness)
Full-Text   |   PDF [1799 KB, uploaded 6 September 2018]   |  


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. View Full-Text
Keywords: k-d tree algorithm; hierarchical protocol; quality of service; routing protocol; WSN; clustering k-d tree algorithm; hierarchical protocol; quality of service; routing protocol; WSN; clustering

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

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.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top