Routing schemes for hybrid communication networks

We consider the problem of computing routing schemes in the HYBRID model of distributed computing where nodes have access to two fundamentally different communication modes. In this problem nodes have to compute small labels and routing tables that allow for efficient routing of messages in the local network, which typically offers the majority of the throughput. Recent work has shown that using the HYBRID model admits a significant speed-up compared to what would be possible if either communication mode were used in isolation. Nonetheless, if general graphs are used as the input graph the computation of routing schemes still takes polynomial rounds in the HYBRID model. We bypass this lower bound by restricting the local graph to unit-disc-graphs and solve the problem deterministically with running time O(|H|2+log⁡n), label size O(log⁡n), and size of routing tables O(|H|2⋅log⁡n) where |H| is the number of “radio holes” in the network. Our work builds on recent work by Coy et al., who obtain this result in the much simpler setting where the input graph has no radio holes. We develop new techniques to achieve this, including a decomposition of the local graph into path-convex regions, where each region contains a shortest path for any pair of nodes in it

Beep-And-Sleep:Message and Energy Efficient Set Cover

We observe message- and energy-efficient distributed algorithms for the SetCover Problem in the KT0 and Beeping model. Given a ground set U of n elements and m subsets of U, we aim to find the minimal number of these subsets that contain all elements. In the default distributed setup of this problem, each set has a bidirected communication link with each element it contains. Our first result is a O~ (log 2(Δ ) ) -time and O~(Δ)(n+m)) -message algorithm with expected approximation ratio of O(log (Δ ) ) in the KT0 model. The value Δ denotes the maximum of each subset’s cardinality and the number of sets an element is contained in. Our algorithm is almost optimal concerning time and message complexity. Further, we present the first SetCover algorithm for general instances in the Beeping model. It computes an O~(Δk) -approximation in time O(k3) for any parameter k&amp;gt; 3. Thus, it can trade runtime for approximation ratio similar to the celebrated algorithm by Kuhn and Wattenhofer [PODC’03].</p