Self-Recovering Sensor-Actor Networks
Maryam Kamali (IT-Department, Abo Akademi University), Linas Laibinis, (IT-Department, Abo Akademi University), Luigia Petre (IT-Department, Abo, Akademi University), Kaisa Sere (IT-Department, Abo Akademi University)

TL;DR
This paper formalizes a distributed, self-recovering algorithm for wireless sensor-actor networks, ensuring reliable communication through various link types, with proofs of termination and layered coordination strategies.
Contribution
It introduces a formal, verified recovery algorithm for sensor-actor networks that operates at multiple levels and types of links, enhancing network robustness.
Findings
Recovery terminates in finite steps
Recovery is distributed and self-performed
Supports layered coordination strategies
Abstract
Wireless sensor-actor networks are a recent development of wireless networks where both ordinary sensor nodes and more sophisticated and powerful nodes, called actors, are present. In this paper we formalize a recently introduced algorithm that recovers failed actor communication links via the existing sensor infrastructure. We prove via refinement that the recovery is terminating in a finite number of steps and is distributed, thus self-performed by the actors. Most importantly, we prove that the recovery can be done at different levels, via different types of links, such as direct actor links or indirect links between the actors, in the latter case reusing the wireless infrastructure of sensors. This leads to identifying coordination classes, e.g., for delegating the most security sensitive coordination to the direct actor-actor coordination links, the least real-time constrained…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
