Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-07-29
EPTCS 30, 2010, pp. 47-61
Computer Science
Distributed, Parallel, and Cluster Computing
In Proceedings FOCLASA 2010, arXiv:1007.4993
Scientific paper
10.4204/EPTCS.30.4
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 coordination to indirect links, and the safety critical coordination to both direct actor links and indirect sensor paths between actors. Our formalization is done using the theorem prover in the RODIN platform.
Kamali Maryam
Laibinis Linas
Petre Luigia
Sere Kaisa
No associations
LandOfFree
Self-Recovering Sensor-Actor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Self-Recovering Sensor-Actor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Recovering Sensor-Actor Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-450526