5 papers · 1 filter
Beep-And-Sleep: Message and Energy Efficient Set Cover
Thorsten Götte, Christina Kolb, Christian Scheideler +1
We observe message-efficient distributed algorithms for the Set Cover problem. Given a ground set of elements and subsets of , we aim to find the minimal number of t…
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
Jannik Castenow, Christina Kolb, Christian Scheideler
In this work, we present a new approach for competitive geometric routing in wireless ad hoc networks. In general, it is well-known that any online routing strategy performs very p…
Self-stabilizing Overlays for high-dimensional Monotonic Searchability
Michael Feldmann, Christina Kolb, Christian Scheideler
We extend the concept of monotonic searchability for self-stabilizing systems from one to multiple dimensions. A system is self-stabilizing if it can recover to a legitimate state…
Competitive Routing in Hybrid Communication Networks
Daniel Jung, Christina Kolb, Christian Scheideler +1
Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a mess…
Self-Stabilizing Supervised Publish-Subscribe Systems
Michael Feldmann, Christina Kolb, Christian Scheideler +1
In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip…