loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Michel Toulouse and Bùi Quang Minh

Affiliation: Vietnamese-German University, Vietnam

Keyword(s): Consensus Algorithms, Observability Theory, Attack Mitigation, Edge Computing.

Abstract: Consensus algorithms have a set of network nodes converge asymptotically to a same state which depends on some function of their initial states. At the core of these algorithms is a linear iterative scheme where each node updates its current state based on its previous state and the state of its neighbors in the network. In this paper we review a proposal from control theory which uses linear iterative schemes of asymptotic consensus and observability theory to compute consensus states in a finite number of iterations. This proposal has low communication requirements which makes it attractive to address consensus problems in a limited resource environment such as edge computing. However it assumes static networks contrary to wireless edge computing networks which are often dynamic and prone to attacks. The main purpose of this paper is to assess the network conditions and attack scenarios where this algorithm can still be considered useful in practice to address consensus problems in IoT applications. We introduce some new lower and exact bounds which further improve the communication performance of the algorithm. We also have some technical contributions on how to speed up mitigation of malicious activities and handling network instabilities. Numerical results confirm the communication performance of the algorithm and the existence of scenarios where the system can be considered cost effective resilient to errors injected intentionally or unintentionally. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.238.161.165

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Toulouse, M. and Quang Minh, B. (2018). Applicability and Resilience of a Linear Encoding Scheme for Computing Consensus. In Proceedings of the 3rd International Conference on Internet of Things, Big Data and Security - IoTBDS; ISBN 978-989-758-296-7; ISSN 2184-4976, SciTePress, pages 173-184. DOI: 10.5220/0006806001730184

@conference{iotbds18,
author={Michel Toulouse. and Bùi {Quang Minh}.},
title={Applicability and Resilience of a Linear Encoding Scheme for Computing Consensus},
booktitle={Proceedings of the 3rd International Conference on Internet of Things, Big Data and Security - IoTBDS},
year={2018},
pages={173-184},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006806001730184},
isbn={978-989-758-296-7},
issn={2184-4976},
}

TY - CONF

JO - Proceedings of the 3rd International Conference on Internet of Things, Big Data and Security - IoTBDS
TI - Applicability and Resilience of a Linear Encoding Scheme for Computing Consensus
SN - 978-989-758-296-7
IS - 2184-4976
AU - Toulouse, M.
AU - Quang Minh, B.
PY - 2018
SP - 173
EP - 184
DO - 10.5220/0006806001730184
PB - SciTePress