Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tobias Kuonen

dblp:346/2422 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0002-2464-0355ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet of things and sensor networks · 50% Network management and operations · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network management and operations › network robustness › fault tolerance
fault-tolerant networks
0.712023
Hydra: Concurrent Coordination for Fault-tolerant Networking · IPSN 2023
Internet of things and sensor networks
wireless sensor network
0.712023
Hydra: Concurrent Coordination for Fault-tolerant Networking · IPSN 2023
Distributed systems
consensus
0.712023
Hydra: Concurrent Coordination for Fault-tolerant Networking · IPSN 2023

Methods — techniques the papers use, named apart from their topics

synchronization · 1.3scheduling · 1.3distributed consensus algorithm · 1.3
YearPublicationVenuePosition
2023 Hydra: Concurrent Coordination for Fault-tolerant Networking
abstract
Low-power wireless networks have the potential to enable applications that are of great importance to industry and society. However, existing network protocols do not meet the dependability requirements of many scenarios as the failure of a single node or link can completely disrupt communication and take significant time and energy to recover. This paper presents Hydra, a low-power wireless protocol that guarantees robust communication despite arbitrary node and link failures. Unlike most existing deterministic protocols, Hydra steers clear of centralized coordination to avoid a single point of failure. Instead, all nodes are equivalent in terms of protocol logic and configuration, performing coordination tasks such as synchronization and scheduling concurrently. This concept of concurrent coordination relies on a novel distributed consensus algorithm that yields provably unique decisions with low delay and energy overhead. In addition to a theoretical analysis, we evaluate Hydra in a multi-hop network of 23 nodes. Our experiments demonstrate that Hydra withstands random node failures without increasing coordination overhead and that it re-establishes efficient and reliable data exchange within seconds after a major disruption.
Andreas Biri, Reto Da Forno, Tobias Kuonen, Fabian Mager, Marco Zimmerling, Lothar Thiele
IPSN3