activity
20172021
collaborators

6 papers

cs.DC2021

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…

cs.CR2021

Model-based Joint Analysis of Safety and Security: Survey and Identification of Gaps

Stefano M. Nicoletti, Marijn Peppelman, Christina Kolb +1

We survey the state-of-the-art on model-based formalisms for safety and security joint analysis, where safety refers to the absence of unintended failures, and security to absence…

cs.DC2018

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…

cs.DC2018

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…

cs.DC2017

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…

cs.DC2017

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…