Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network

TL;DR

This paper extends skip graphs to efficiently process multi-dimensional range queries in mobile sensor networks by leveraging deterministic z-ordering and local randomization, improving routing resilience and query performance.

Contribution

It introduces a novel skip graph extension that inverts key roles and uses deterministic vectors for grouping, enhancing multi-dimensional query handling in mobile environments.

Findings

Improved range query efficiency in mobile sensor networks.

Enhanced resilience of routing structures in dynamic environments.

Effective handling of k-dimensional data with deterministic and random components.

Abstract

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.