Optimal resilient distributed data collection in mobile edge environments. (December 2021)

• Record Type: Journal Article
• Authors: Audrito, Giorgio; Casadei, Roberto; Damiani, Ferruccio; Pianini, Danilo; Viroli, Mirko
• Is Part Of: Computers & electrical engineering. Volume 96:Part B(2021)
• Publication Date: 2021-12
• Subjects: Data aggregation -- Adaptive algorithm -- Aggregate programming -- Computational field; Computer engineering -- Periodicals; Electrical engineering -- Periodicals; Electrical engineering -- Data processing -- Periodicals; Ordinateurs -- Conception et construction -- Périodiques; Électrotechnique -- Périodiques; Électrotechnique -- Informatique -- Périodiques; Computer engineering; Electrical engineering; Electrical engineering -- Data processing; Periodicals; Electronic journals; 621.302854
• DOI: 10.1016/j.compeleceng.2021.107580
• Languages: English
• ISSNs: 0045-7906

Abstract

Abstract: A key goal of edge computing is to achieve "distributed sensing" out of data continuously generated from a multitude of interconnected physical devices. The traditional approach is to gather information into sparse collector devices by relying on hop-by-hop accumulation, but issues of reactivity and fragility naturally arise in scenarios with high mobility. We propose novel algorithms for dynamic data summarisation across space, supporting high reactivity and resilience by specific techniques maximising the speed at which information propagates towards collectors. Such algorithms support idempotent and arithmetic aggregation operators and, under reasonable network assumptions, are proved to achieve optimal reactivity. We provide evaluation via simulation: first in multiple scenarios showing improvement over the state of art, and then by a case study in edge data mining, which conveys the practical impact in higher-level distributed sensing patterns. Graphical abstract: Highlights: Data collection supports cooperative sensing and summarisation in distributed systems. Collection performance under network mobility is limited in the state of the art. We introduce experimentally verified algorithms for distributed data collection. We prove their optimality under reasonable network assumptions.