%0 Conference Proceedings
%T Resilient Distributed Collection Through Information Speed Thresholds
%+ Département d'Informatique [Université de Turin]
%+ Dipartimento di Informatica (ISLab)
%+ Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO)
%A Audrito, Giorgio
%A Bergamini, Sergio
%A Damiani, Ferruccio
%A Viroli, Mirko
%Z Part 6: Large-Scale Decentralised Systems
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 22th International Conference on Coordination Languages and Models (COORDINATION)
%C Valletta, Malta
%Y Simon Bliudze
%Y Laura Bocchi
%I Springer International Publishing
%3 Coordination Models and Languages
%V LNCS-12134
%P 211-229
%8 2020-06-15
%D 2020
%R 10.1007/978-3-030-50029-0_14
%K Data aggregation
%K Adaptive algorithm
%K Aggregate programming
%K Computational field
%K Gradient
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X One of the key coordination problems in physically-deployed distributed systems, such as mobile robots, wireless sensor networks, and IoT systems in general, is to provide notions of “distributed sensing” achieved by the strict, continuous cooperation and interaction among individual devices. An archetypal operation of distributed sensing is data summarisation over a region of space, by which several higher-level problems can be addressed: counting items, measuring space, averaging environmental values, and so on. A typical coordination strategy to perform data summarisation in a peer-to-peer scenario, where devices can communicate only with a neighbourhood, is to progressively accumulate information towards one or more collector devices, though this typically exhibits problems of reactivity and fragility, especially in scenarios featuring high mobility. In this paper, we propose coordination strategies for data summarisation involving both idempotent and arithmetic aggregation operators, with the idea of controlling the minimum information propagation speed, so as to improve the reactivity to input changes. Given suitable assumptions on the network model, and under the restriction of no data loss, these algorithms achieve optimal reactivity. By empirical evaluation via simulation, accounting for various sources of volatility, and comparing to other existing implementations of data summarisation algorithms, we show that our algorithms are able to retain adequate accuracy even in high-variability scenarios where all other algorithms are significantly diverging from correct estimations.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-03273987/document
%2 https://inria.hal.science/hal-03273987/file/495623_1_En_14_Chapter.pdf
%L hal-03273987
%U https://inria.hal.science/hal-03273987
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-COORDINATION
%~ IFIP-LNCS-12134