@article{5984,
author = {Scheideler, Christian},
journal = {Theor. Comput. Sci.},
pages = {1},
title = {{Preface}},
doi = {10.1016/j.tcs.2018.11.004},
volume = {751},
year = {2018},
}
@inproceedings{4563,
abstract = {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 message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.
In this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\mathcal{O}\left(\log ^2 n\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.
},
author = {Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik},
booktitle = {Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) },
keyword = {greedy routing, ad hoc networks, convex hulls, c-competitiveness},
location = {Helsinki},
publisher = {Springer},
title = {{Competitive Routing in Hybrid Communication Networks}},
year = {2018},
}
@inproceedings{105,
abstract = {We initiate the study of network monitoring algorithms in a class of hybrid networks in which the nodes are connected by an external network and an internal network (as a short form for externally and internally controlled network). While the external network lies outside of the control of the nodes (or in our case, the monitoring protocol running in them) and might be exposed to continuous changes, the internal network is fully under the control of the nodes. As an example, consider a group of users with mobile devices having access to the cell phone infrastructure. While the network formed by the WiFi connections of the devices is an external network (as its structure is not necessarily under the control of the monitoring protocol), the connections between the devices via the cell phone infrastructure represent an internal network (as it can be controlled by the monitoring protocol). Our goal is to continuously monitor properties of the external network with the help of the internal network. We present scalable distributed algorithms that efficiently monitor the number of edges, the average node degree, the clustering coefficient, the bipartiteness, and the weight of a minimum spanning tree. Their performance bounds demonstrate that monitoring the external network state with the help of an internal network can be done much more efficiently than just using the external network, as is usually done in the literature.},
author = {Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian},
booktitle = {Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP)},
pages = {137:1----137:15},
title = {{Distributed Monitoring of Network Properties: The Power of Hybrid Networks}},
doi = {10.4230/LIPIcs.ICALP.2017.137},
year = {2017},
}
@article{1813,
author = {P. Fekete, Sandor and W. Richa, Andrea and Römer, Kay and Scheideler, Christian},
journal = {SIGACT News},
number = {2},
pages = {87----94},
title = {{Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271}},
doi = {10.1145/3106700.3106713},
year = {2017},
}
@article{3872,
abstract = {This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. Our second contribution is a distributed MAC protocol called Sade which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.},
author = {Ogierman, Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin},
issn = {0178-2770},
journal = {Distributed Computing},
number = {3},
pages = {241--254},
publisher = {Springer Nature},
title = {{Sade: competitive MAC under adversarial SINR}},
doi = {10.1007/s00446-017-0307-1},
volume = {31},
year = {2017},
}
@inproceedings{125,
abstract = {Searching for other participants is one of the most important operations in a distributed system.We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination.Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\mathcal O(\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The protocol keeps the expected amount of edge redirections per node in $\mathcal O(\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The number of messages that are periodically sent out by nodes is constant.},
author = {Feldmann, Michael and Scheideler, Christian},
booktitle = {Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
isbn = {978-3-319-69083-4},
pages = {250--264 },
publisher = {Springer, Cham},
title = {{A Self-Stabilizing General De Bruijn Graph}},
doi = {10.1007/978-3-319-69084-1_17},
volume = {10616},
year = {2017},
}
@article{1814,
author = {Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik},
journal = {Theor. Comput. Sci.},
pages = {56----68},
title = {{Universal coating for programmable matter}},
doi = {10.1016/j.tcs.2016.02.039},
year = {2017},
}
@inproceedings{1815,
author = {J. Daymude, Joshua and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik},
booktitle = {Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers},
pages = {127----140},
title = {{Improved Leader Election for Self-organizing Programmable Matter}},
doi = {10.1007/978-3-319-72751-6_10},
year = {2017},
}
@article{1812,
author = {Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik},
journal = {Inf. Comput.},
pages = {408----424},
title = {{Towards a universal approach for the finite departure problem in overlay networks}},
doi = {10.1016/j.ic.2016.12.006},
year = {2017},
}
@inproceedings{155,
abstract = {We present a self-stabilizing algorithm for overlay networks that, for an arbitrary metric given by a distance oracle, constructs the graph representing that metric. The graph representing a metric is the unique minimal undirected graph such that for any pair of nodes the length of a shortest path between the nodes corresponds to the distance between the nodes according to the metric. The algorithm works under both an asynchronous and a synchronous daemon. In the synchronous case, the algorithm stablizes in time O(n) and it is almost silent in that after stabilization a node sends and receives a constant number of messages per round.},
author = {Gmyr, Robert and Lefèvre, Jonas and Scheideler, Christian},
booktitle = {Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
pages = {248----262},
title = {{Self-stabilizing Metric Graphs}},
doi = {10.1007/978-3-319-49259-9_20},
year = {2016},
}