Reto Da Forno

Reto Da Forno

Auto-generated profile, based on publicly available information

Reto Da Forno

ETH Zurich, Switzerland

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 April 2023 in ACM Transactions on Internet of Things
Verified
Journal Article
Open access
RTRoman Trüb
Roman Trüb
RFReto Da Forno
Reto Da Forno
ABAndreas Biri
Andreas Biri
JBJan Beutel
Jan Beutel
Lothar ThieleLothar Thiele
Lothar Thiele
In many real-world wireless IoT networks, the application dictates the location of the nodes and therefore the link characteristics are inhomogeneous. Furthermore, nodes may in many scenarios only communicate with the Internet-attached gateway via multiple hops. If an energy-efficient short-range modulation scheme is used, nodes that are reachable only via high-path-loss links cannot communicate. Using a more energy-demanding long-range modulation allows connecting more nodes but would be inefficient for nodes that are easily reachable via low-path-loss links. Combining multiple modulations is challenging, as low-power radios usually only support the use of a single modulation at a time. In this article, we present the Long-Short-Range (LSR) protocol which supports low-power multi-hop communication using multiple modulations and is suited for networks with inhomogeneous link characteristics. To reduce the inherent redundancy of long-range modulations, we present a method to determine the connectivity graph of the network during regular data communication without adding significant overhead. In simulations, we show that LSR allows for reducing power consumption significantly for many scenarios when compared to a state-of-the-art multi-hop communication protocol using a single long-range modulation. We demonstrate the applicability of LSR with an implementation on real hardware and a testbed with long-range links.

27 October 2021 in ACM Transactions on Internet of Things
Verified
Journal Article
Open access
RTRoman Trüb
Roman Trüb
RFReto Da Forno
Reto Da Forno
LDLukas Daschinger
Lukas Daschinger
ABAndreas Biri
Andreas Biri
JBJan Beutel
Jan Beutel
Lothar ThieleLothar Thiele
Lothar Thiele
Testbeds for wireless IoT devices facilitate testing and validation of distributed target nodes. A testbed usually provides methods to control, observe, and log the execution of the software. However, most of the methods used for tracing the execution require code instrumentation and change essential properties of the observed system. Methods that are non-intrusive are typically not applicable in a distributed fashion due to a lack of time synchronization or necessary hardware/software support. In this article, we present a tracing system for validating time-critical software running on multiple distributed wireless devices that does not require code instrumentation, is non-intrusive and is designed to trace the distributed state of an entire network. For this purpose, we make use of the on-chip debug and trace hardware that is part of most modern microcontrollers. We introduce a testbed architecture as well as models and methods that accurately synchronize the timestamps of observations collected by distributed observers. In a case study, we demonstrate how the tracing system can be applied to observe the distributed state of a flooding-based low-power communication protocol for wireless sensor networks. The presented non-intrusive tracing system is implemented as a service of the publicly accessible open source FlockLab 2 testbed.

9 May 2023
Verified
Conference Paper
Open access
ABAndreas Biri
Andreas Biri
RFReto Da Forno
Reto Da Forno
TKTobias Kuonen
Tobias Kuonen
FMFabian Mager
Fabian Mager
MZMarco Zimmerling
Marco Zimmerling
Lothar ThieleLothar Thiele
Lothar Thiele
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.