作者:
Xiao, FengWang, LongPeking Univ
Coll Engn Ctr Syst & Control Intelligent Control LabState Key Lab Turbulence Beijing 100871 Peoples R China Beijing Inst Technol
Sch Informat Sci & Technol Beijing 100081 Peoples R China
This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repea...
详细信息
This paper addresses consensus problems for discrete-time multi-agent systems with time-varying delays and switching interaction topologies and provides a class of effective consensus protocols that are built on repeatedly using the same state information at two time-steps. We show that those protocols can solve consensus problems under milder conditions than the popular consensus algorithm proposed by Jadbabaie et al., specifically, the presented protocols allow for the case that agents can only use delayed information of themselves, whereas the Popular one is invalid. It is proved that if the union of the interaction topologies across the time interval with some given length always has a spanning tree, then in the presence of bounded time-varying delays, those protocols solve consensus problems. (C) 2008 Elsevier Ltd. All rights reserved.
This paper analyzes two classes of consensus algorithms in the presence of bounded measurement errors. The considered protocols adopt an updating rule based either on constant or vanishing weights. Under the assumptio...
详细信息
This paper analyzes two classes of consensus algorithms in the presence of bounded measurement errors. The considered protocols adopt an updating rule based either on constant or vanishing weights. Under the assumption of bounded error, the consensus problem is cast in a set-membership framework, and the agreement of the team is studied by analyzing the evolution of the feasible state set. Bounds on the asymptotic difference between the states of the agents are explicitly derived, in terms of the bounds on the measurement noise and the values of the weight matrix. (C) 2010 Elsevier B.V. All rights reserved.
The rapid evolution of blockchain technology has brought together stakeholders from fundamentally different backgrounds. The result is a diverse ecosystem, as exemplified by the development of a wide range of differen...
详细信息
The rapid evolution of blockchain technology has brought together stakeholders from fundamentally different backgrounds. The result is a diverse ecosystem, as exemplified by the development of a wide range of different blockchain protocols. This raises questions for decision and policy makers: How do different protocols compare? What are their tradeoffs? Existing efforts to survey the area reveal a fragmented terminology and the lack of a unified framework to reason about the properties of blockchain protocols. In this article, we work toward bridging this gap. We present a five-dimensional design space with a modular structure in which protocols can be compared and understood. Based on these five axes-optimality, stability, efficiency, robustness, and persistence-we organize the properties of existing protocols in subcategories of increasing granularity. The result is a dynamic scheme-termed the PREStO framework-which aids the interaction between stakeholders of different backgrounds, including managers and investors, and which enables systematic reasoning about blockchain protocols. We illustrate its value by comparing existing protocols and identifying research challenges, hence making a first step toward understanding the blockchain ecosystem through a more comprehensive lens.
This paper is on consensus protocols for asynchronous distributed systems prone to process crashes, but equipped with Chandra-Toueg's unreliable failure detectors. It presents a unifying approach based on two orth...
详细信息
This paper is on consensus protocols for asynchronous distributed systems prone to process crashes, but equipped with Chandra-Toueg's unreliable failure detectors. It presents a unifying approach based on two orthogonal versatility dimensions. The first concerns the class of the underlying failure detector. An instantiation can consider any failure detector of the class S (provided that at least one process does not crash), or oS (provided that a majority of processes do not crash). The second versatility dimension concerns the message exchange pattern used during each round of the protocol. This pattern (and, consequently, the round message cost) can be defined for each round separately, varying from O(n) (centralized pattern) to O(n(2)) (fully distributed pattern), n being the number of processes. The resulting versatile protocol has nice features and actually gives rise to a large and well-identified family of failure detector-based consensus protocols. Interestingly, this family includes at once new protocols and some well-known protocols (e.g., Chandra-Toueg's oS-based protocol). The approach is also interesting from a methodological point of view. It provides a precise characterization of the two sets of processes that, during a round, have to receive messages for a decision to be taken (liveness) and for a single value to be decided (safety), respectively. Interestingly, the versatility of the protocol is not restricted to failure detectors: a simple timer-based instance provides a consensus protocol suited to partially synchronous systems.
Blockchain technology can be used in the IoT to ensure the data privacy collected by sensors. In blockchain systems, consensus mechanisms are a key technology for maintaining data consistency and correctness. Among th...
详细信息
Blockchain technology can be used in the IoT to ensure the data privacy collected by sensors. In blockchain systems, consensus mechanisms are a key technology for maintaining data consistency and correctness. Among the various consensus protocols, asynchronous Byzantine consensus protocols offer strong robustness as they do not rely on any network timing assumptions during design. As a result, these protocols have become a research hotspot in the field of blockchain. Based on different structural design approaches, asynchronous Byzantine consensus protocols can be divided into two categories: protocols based on the DAG structure and protocols based on the ACS structure. The paper describes their principles and summarizes the related research works. The advantages and disadvantages of the protocols are also compared and analyzed. At the end of the paper, future research directions are identified.
In this work we study the weight optimization problem for average consensus protocols by reformulating it as a Schatten norm minimization with parameter p. We show that as p approaches infinity, the optimal solution o...
详细信息
In this work we study the weight optimization problem for average consensus protocols by reformulating it as a Schatten norm minimization with parameter p. We show that as p approaches infinity, the optimal solution of the Schatten norm induced problem recovers the optimal solution of the original problem. Moreover, by tuning the parameter p in our proposed minimization, we can simply trade-off the quality of the solution (i.e., the speed of convergence) for communication/computation requirements (in terms of number of messages exchanged and volume of data processed). We then propose a distributed algorithm to solve the Schatten norm minimization and we show that it outperforms the other distributed weight selection methods.
This paper investigates several voting consensus protocols with low computational complexity in noisy Byzantine *** computer simulations,we show that explicit randomization of the consensus protocol can significantly ...
详细信息
This paper investigates several voting consensus protocols with low computational complexity in noisy Byzantine *** computer simulations,we show that explicit randomization of the consensus protocol can significantly increase the robustness towards faulty and malicious *** identify the optimal amount of randomness for various Byzantine attack strategies on different kinds of network topologies.
Blockchain is the core technology of many cryptocurrencies. Blockchain as a distributed ledger technology has received extensive research attention. In addition to cryptography and P2P (peer-to-peer) technology, conse...
详细信息
Blockchain is the core technology of many cryptocurrencies. Blockchain as a distributed ledger technology has received extensive research attention. In addition to cryptography and P2P (peer-to-peer) technology, consensus protocols are also a fundamental part of the blockchain technology. A good consensus protocol can guarantee the fault tolerance and security of the blockchain systems. The consensus protocols currently used in most blockchain systems can be broadly divided into two categories: the probabilistic-finality consensus protocols and the absolute-finality consensus protocols. This paper introduces some of the main consensus protocols of these two categories, and analyzes their strengths and weaknesses as well as the applicable blockchain types. (C) 2020 The Korean Institute of Communications and Information Sciences (KICS). Publishing services by Elsevier B.V.
The consensus problem appears frequently in coordination of multi-agent systems in aerospace science and engineering, and involves the agreement of networked agents upon certain quantities of interest. In this paper, ...
详细信息
The consensus problem appears frequently in coordination of multi-agent systems in aerospace science and engineering, and involves the agreement of networked agents upon certain quantities of interest. In this paper, we focus on a new consensus protocol for networked multi-agent systems using a resetting control architecture. Specifically, the control protocol consists of a delayed feedback, quasi-resetting control law such that controller resettings occur when the relative state measurements (i.e., distance) between an agent and its neighbouring agents approach zero. In contrast to standard impulsive resetting controllers, the proposed resetting is uniformly continuous, and hence, our approach does not require any well-posedness assumptions imposed by impulsive resetting controllers. In addition, using a Lyapunov-Krasovskii functional, it is shown that the multi-agent system reaches asymptotic state equipartitioning, where the system steady state is uniformly distributed over the system initial conditions. Finally, we develop transient performance guarantees while accounting for system overshoot and excessive control effort.
In a few short years the Internet of Things has become an intrinsic part of everyday life, with connected devices included in products created for homes, cars and even medical equipment. But its rapid growth has creat...
详细信息
ISBN:
(纸本)9781538691311
In a few short years the Internet of Things has become an intrinsic part of everyday life, with connected devices included in products created for homes, cars and even medical equipment. But its rapid growth has created several security problems, with respect to the transmission and storage of vast amounts of customers data, across an insecure heterogeneous collection of networks. The Internet of Things is therefore creating a unique set of risk and problems that will affect most households. From breaches in confidentiality, which could allow users to be snooped on, through to failures in integrity, which could lead to consumer data being compromised;devices are presenting many security challenges to which consumers are ill equipped to protect themselves from. Moreover, when this is coupled with the heterogeneous nature of the industry, and the interoperable and scalability problems it becomes apparent that the Internet of Things has created an increased attack surface from which security vulnerabilities may be easily exploited. However, it has been conjectured that blockchain may provide a solution to the Internet of Things security and scalability problems. Because of blockchain's immutability, integrity and scalability, it is possible that its architecture could be used for the storage and transfer of Internet of Things data. Within this paper a cross section of blockchain consensus protocols have been assessed against a requirement framework, to establish each consensus protocols strengths and weaknesses with respect to their potential implementation in an Internet of Things blockchain environment.
暂无评论