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

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

1
Department of Electronic Engineering, Fundación Universitaria Los Libertadores, Cr. 16 # 63A-68 Bogotá, Colombia
2
Department of Engineering, Distrital University Francisco José de Caldas, Cr. 7 # 40B-53 Bogotá, Colombia
3
Department of Computer Sciences, University of Oviedo, Street San Francisco, 33003 Oviedo, Spain
4
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.
Sensors 2018, 18(9), 2899; https://doi.org/10.3390/s18092899
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)
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
Show Figures

Figure 1

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. https://doi.org/10.3390/s18092899

AMA 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(9):2899. https://doi.org/10.3390/s18092899

Chicago/Turabian Style

Anzola, John, Jordán Pascual, Giovanny Tarazona, and Rubén González Crespo. 2018. "A Clustering WSN Routing Protocol Based on k-d Tree Algorithm" Sensors 18, no. 9: 2899. https://doi.org/10.3390/s18092899

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

Article Access Map by Country/Region

1
Back to TopTop