Mostrar el registro sencillo del ítem

dc.contributor.authorAnzola, John
dc.contributor.authorPascual, Jordán
dc.contributor.authorTarazona, Giovanny
dc.contributor.authorGonzález-Crespo, Rubén (1)
dc.date2018-09
dc.date.accessioned2019-01-25T08:39:34Z
dc.date.available2019-01-25T08:39:34Z
dc.identifier.issn1424-8220
dc.identifier.urihttps://reunir.unir.net/handle/123456789/7695
dc.description.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.es_ES
dc.language.isoenges_ES
dc.publisherSensorses_ES
dc.relation.ispartofseries;vol. 18, nº 9
dc.relation.urihttps://www.mdpi.com/1424-8220/18/9/2899es_ES
dc.rightsopenAccesses_ES
dc.subjectk-d tree algorithmes_ES
dc.subjecthierarchical protocoles_ES
dc.subjectquality of servicees_ES
dc.subjectrouting protocoles_ES
dc.subjectWSNes_ES
dc.subjectclusteringes_ES
dc.subjectJCRes_ES
dc.subjectScopuses_ES
dc.titleA clustering WSN routing protocol based on k-d tree algorithmes_ES
dc.typeArticulo Revista Indexadaes_ES
reunir.tag~ARIes_ES
dc.identifier.doihttp://dx.doi.org/10.3390/s18092899


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem