A Clustering WSN Routing Protocol Based on k-d Tree Algorithm.
Sensors (Basel)
; 18(9)2018 Sep 01.
Article
em En
| MEDLINE
| ID: mdl-30200484
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.
Texto completo:
1
Coleções:
01-internacional
Base de dados:
MEDLINE
Tipo de estudo:
Prognostic_studies
Idioma:
En
Revista:
Sensors (Basel)
Ano de publicação:
2018
Tipo de documento:
Article
País de afiliação:
Colômbia
País de publicação:
Suíça