A key problem when coordinating the behaviour of devices in situated networks (e.g., pervasive computing, smart cities, Internet of Things, wireless sensor networks) is adaptation to changes impacting network topology, density, and heterogeneity. Computational goals for such systems are often expressed in terms of geometric properties of the continuous environment in which the devices are situated, and the results of resilient computations should depend primarily on that continuous environment, rather than the particulars of how devices happen to be distributed through it. In this paper, we identify a new property of distributed algorithms, eventual consistency, which guarantees that computation self-stabilizes to a final state that approximates a predictable limit as the density and speed of devices increases. We then identify a large class of programs that are eventually consistent, building on prior results on the field calculus computational model to identify a class of self-stabilizing programs. Finally, we confirm through simulation of pervasive network scenarios that eventually consistent programs from this class can provide resilient behavior where programs that are only self-stabilizing fail badly.

Self-Adaptation to Device Distribution Changes

DAMIANI, Ferruccio
2016-01-01

Abstract

A key problem when coordinating the behaviour of devices in situated networks (e.g., pervasive computing, smart cities, Internet of Things, wireless sensor networks) is adaptation to changes impacting network topology, density, and heterogeneity. Computational goals for such systems are often expressed in terms of geometric properties of the continuous environment in which the devices are situated, and the results of resilient computations should depend primarily on that continuous environment, rather than the particulars of how devices happen to be distributed through it. In this paper, we identify a new property of distributed algorithms, eventual consistency, which guarantees that computation self-stabilizes to a final state that approximates a predictable limit as the density and speed of devices increases. We then identify a large class of programs that are eventually consistent, building on prior results on the field calculus computational model to identify a class of self-stabilizing programs. Finally, we confirm through simulation of pervasive network scenarios that eventually consistent programs from this class can provide resilient behavior where programs that are only self-stabilizing fail badly.
2016
10th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2016
Germany
2016
Proceedings - IEEE 10th International Conference on Self-Adaptive and Self-Organizing Systems, SASO 2016
Institute of Electrical and Electronics Engineers Inc.
60
69
9781509035342
http://ieeexplore.ieee.org/document/7774387/
Artificial Intelligence; Computer Networks and Communications; Hardware and Architecture; Control and Optimization
Beal, Jacob; Viroli, Mirko; Pianini, Danilo; Damiani, Ferruccio
File in questo prodotto:
File Dimensione Formato  
IEEE-SASO-2016.pdf

Accesso riservato

Descrizione: Articolo principale (conferenza)
Tipo di file: PDF EDITORIALE
Dimensione 1.43 MB
Formato Adobe PDF
1.43 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
IIEEE-SASO-2016_Beal-et-al-OPEN.pdf

Accesso aperto

Descrizione: Articolo principale (conferenza)
Tipo di file: POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione 2.99 MB
Formato Adobe PDF
2.99 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/1633356
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 16
  • ???jsp.display-item.citation.isi??? 11
social impact