Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909405307469824 |
|---|---|
| author | Brault, Gregory J. Augeri, Christopher James Mullins, Barry E. Baldwin, Rusty O. Mayer, Christopher B. |
| author_facet | Brault, Gregory J. Augeri, Christopher James Mullins, Barry E. Baldwin, Rusty O. Mayer, Christopher B. |
| contents | A skip graph is a resilient application-layer routing structure that supports range queries of distributed k-dimensional data. By sorting deterministic keys into groups based on locally computed random membership vectors, nodes in a standard skip graph can optimize range query performance in mobile networks such as unmanned aerial vehicle swarms. We propose a skip graph extension that inverts the key and membership vector roles and bases group membership on deterministic vectors derived from the z-ordering of k-dimensional data and sorting within groups is based on locally computed random keys. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_16990 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network Brault, Gregory J. Augeri, Christopher James Mullins, Barry E. Baldwin, Rusty O. Mayer, Christopher B. Information Theory Discrete Mathematics Data Structures and Algorithms Networking and Internet Architecture C.2.2; E.1; E.4 A skip graph is a resilient application-layer routing structure that supports range queries of distributed k-dimensional data. By sorting deterministic keys into groups based on locally computed random membership vectors, nodes in a standard skip graph can optimize range query performance in mobile networks such as unmanned aerial vehicle swarms. We propose a skip graph extension that inverts the key and membership vector roles and bases group membership on deterministic vectors derived from the z-ordering of k-dimensional data and sorting within groups is based on locally computed random keys. |
| title | Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network |
| topic | Information Theory Discrete Mathematics Data Structures and Algorithms Networking and Internet Architecture C.2.2; E.1; E.4 |
| url | https://arxiv.org/abs/2411.16990 |