Author name cluster

Thim Strothmann

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers

1 author row

I&C Journal 2017 Journal Article

Towards a universal approach for the finite departure problem in overlay networks

Andreas Koutsopoulos
Christian Scheideler
Thim Strothmann

A fundamental problem for overlay networks is to safely exclude leaving nodes, i. e. , nodes requesting to leave the network are excluded without affecting connectivity. There are numerous studies for safe node exclusion if the overlay is in a well-defined state, but almost no formal results for the self-stabilizing case. We study this problem in two variants: the Finite Departure Problem ( FDP ) and the Finite Sleep Problem ( FSP ). In the FDP leaving nodes have to irrevocably decide when it is safe to leave the network, whereas in the FSP, this leaving decision does not have to be final: the nodes may resume computation when woken up by an incoming message. We present self-stabilizing protocols for both problems that can be combined with a large class of overlay networks in order to guarantee safe exclusion for leaving nodes from any initial state while operating normal for staying nodes. 1

Details DOI

TCS Journal 2017 Journal Article

Universal coating for programmable matter

Zahra Derakhshandeh
Robert Gmyr
Andréa W. Richa
Christian Scheideler
Thim Strothmann

The idea behind universal coating is to have a thin layer of a specific substance covering an object of any shape so that one can measure a certain condition (like temperature or cracks) at any spot on the surface of the object without requiring direct access to that spot. We study the universal coating problem in the context of self-organizing programmable matter consisting of simple computational elements, called particles, that can establish and release bonds and can actively move in a self-organized way. Based on that matter, we present a worst-case work-optimal universal coating algorithm that uniformly coats any object of arbitrary shape and size that allows a uniform coating. Our particles are anonymous, do not have any global information, have constant-size memory, and utilize only local interactions.

Details DOI