A Clustering WSN Routing Protocol Based on k-d Tree Algorithm.
John P AnzolaJordán PascualGiovanny TarazonaRubén González CrespoPublished in: Sensors (Basel, Switzerland) (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.
Keyphrases
- randomized controlled trial
- single cell
- machine learning
- rna seq
- electronic health record
- deep learning
- big data
- systematic review
- magnetic resonance
- mental health
- room temperature
- air pollution
- lymph node
- magnetic resonance imaging
- squamous cell carcinoma
- quality improvement
- artificial intelligence
- optic nerve
- neoadjuvant chemotherapy
- ionic liquid