检索结果-内蒙古大学图书馆

consensus algorithms on Appendable-Block Blockchains: Impact and Security Analysis

MOBILE NETWORKS & APPLICATIONS 2022年第4期27卷 1408-1420页

作者： Lunardi, Roben C. Michelin, Regio A. Nunes, Henry C. Neu, Charles V. Zorzo, Avelino F. Kanhere, Salil S. IFRS Porto Alegre RS Brazil Pontificia Univ Catolica Rio Grande do Sul Porto Alegre RS Brazil UNSW Sydney NSW Australia Newcastle Univ Newcastle Upon Tyne Tyne & Wear England

The Internet of Things (IoT) has been making people's lives more efficient and more comfortable in the past years, and it is expected to get even better. This improvement may benefit from the use of blockchain to enhance security, scalability, reliability and auditability. Recently, different blockchain architectures were proposed to provide a solution that is better suited for IoT scenarios. One of them, called appendable-block blockchains, proposed a data structure that allows to include transactions in blocks that were already inserted in the blockchain. This approach allows appendable-block blockchains to manage large amounts of data produced by IoT devices through decoupled and appendable data structures. Nevertheless, consensus algorithms can impact throughput and latency in scenarios with large amount of produced transactions, since IoT devices can produce data very quickly (milliseconds) while these data might take some time to be included in a block (seconds). Consequently, it is important to understand the behaviour of different consensus algorithms over appendabble-block blockchain in these type of scenarios. Therefore, we adapted the appendable-block blockchain to use and compare the impact of different consensus algorithms: Practical Byzantine Fault Tolerance (PBFT), witness-based, delegated Byzantine Fault Tolerance (dBFT) and Proof-of-Work (PoW). The results show that both dBFT and PBFT can achieve fast consensus (< 150ms) in the context of appendable-block blockchains. We also present a discussion regarding attacks in each consensus algorithm to help one to choose the best solution (considering performance and security issues) for each scenario.

关键词： Distributed ledgers Blockchain consensus algorithms Internet of Things IoT

来源：评论

学校读者我要写书评

暂无评论

consensus algorithms for Opt-in/Opt-out and proximity marketing context

Consensus algorithms for Opt-in/Opt-out and proximity market...

引用

International Conference on Computing, Networking and Communications (ICNC)

作者： Chahal, Fatima Fouchal, Hacene Gaiti, Dominique Univ Technol Troyes LIST3N Troyes France Univ Reims CReSTIC Reims France

ISBN: (纸本)9781665457194

Data security is today regarded as one of the most difficult duties that IT professionals must fight for. And today, consumers are more concerned about their data, and they begin to wonder why the rules that attempted to protect their data, particularly in the proximity marketing arena, have failed. Users' information is shared without their awareness among market participants. Many systems have emerged through regulation to safeguard users and the market, the most well-known of which is Opt-in/Opt-out, which asks users for permission to use and share personal information with a third party. In addition, they have the opportunity to revoke their permission at any moment. In practice, however, this approach is ineffectual because opting out does not prohibit corporations from exploiting the data. In this work, we propose a novel invention that combines Optin/Opt-out with consensus algorithms in a decentralized way to provide a more secure environment for the user, giving the user the primary control to grant the company access to his data or a real withdrawal consent at any time.

关键词： consensus algorithms Paxos Raft PBFT PoW PoS Opt-in Opt-out Proximity marketing

来源：评论

学校读者我要写书评

暂无评论

consensus algorithms for Distributed Spectrum Sensing Based on Goodness of Fit Test in Cognitive Radio Networks

Consensus Algorithms for Distributed Spectrum Sensing Based ...

引用

International Conference on Military Communications and Information Systems (ICMCIS)

作者： Teguig, Djamel Scheers, Bart Le Nir, Vincent Horlin, Franois Royal Mil Acad Dept CISS Brussels Belgium Univ Libre Bruxelles OPERA Wireless Commun Grp Brussels Belgium

ISBN: (纸本)9788393484850

In this paper, we study a consensus algorithm for distributed spectrum sensing (DSS) in cognitive radio networks (CRN) integrating a Goodness of Fit based spectrum sensing scheme. Existing work in this area often applies energy detector as a local spectrum sensing method for DSS, however in this case one needs to make the assumption that the noise level is the same at every node in the network, otherwise the threshold can not be set properly. In GoF based spectrum sensing, the threshold for the binary test depends only on the desired false alarm probability and not on the local noise powers. Motivated by this nice feature of GoF based spectrum sensing, we consider the goodness of fit (GoF) test statistic to be exchanged among cognitive radio (CR) users (consensus variable) instead of the energy. Moreover, a weighted consensus based DSS scheme is proposed and compared to the conventional consensus based on DSS. Simulations are conducted to show the effectiveness of the consensus algorithm based on GoF test.

关键词： Cognitive Radio Spectrum Sensing consensus algorithms Goodness of Fit test

来源：评论

学校读者我要写书评

暂无评论

Distributed Economic Dispatch Control via Saddle Point Dynamics and consensus algorithms

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2019年第2期27卷 898-905页

作者： Bai, Lu Ye, Maojiao Sun, Chao Hu, Guoqiang Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

In this brief, a distributed control algorithm is proposed to solve the economic dispatch problem. Without a central control unit, the generators work collaboratively to minimize the generation cost while balancing the supply and demand. The proposed method is based on consensus protocols and the saddle point dynamics. The consensus protocols are employed to estimate the global information in a distributed fashion, and the saddle point dynamics are leveraged to search for the optimal solution of the economic dispatch problem. By utilizing Lyapunov stability analysis, exponential stability of the optimal solution is derived if the capacity limits of the generators are not considered;with the capacity limits, practical stability of the optimal solution is obtained. No global information is needed in the proposed method, and the requirement on initial conditions of the state variables is mild. Several case studies on the IEEE 9-bus and IEEE 118-bus systems are presented to demonstrate the effectiveness of the proposed algorithms.

关键词： consensus algorithms distributed control economic dispatch saddle point dynamics

来源：评论

学校读者我要写书评

暂无评论

Fast Distributed Average consensus algorithms Based on Advection-Diffusion Processes

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2010年第2期58卷 826-842页

作者： Sardellitti, Stefania Giona, Massimiliano Barbarossa, Sergio Univ Roma La Sapienza INFOCOM Dept I-00184 Rome Italy Univ Roma La Sapienza Dept Chem Engn I-00184 Rome Italy

Distributed consensus algorithms have recently gained large interest in sensor networks as a way to achieve globally optimal decisions in a totally decentralized way, that is, without the need of sending all the data collected by the sensors to a fusion center. However, distributed algorithms are typically iterative and they suffer from convergence time and energy consumption. In this paper, we show that introducing appropriate asymmetric interaction mechanisms, with time-varying weights on each edge, it is possible to provide a substantial increase of convergence rate with respect to the symmetric time-invariant case. The basic idea underlying our approach comes from modeling the average consensus algorithm as an advection-diffusion process governing the homogenization of fluid mixtures. Exploiting such a conceptual link, we show how introducing interaction mechanisms among nearby nodes, mimicking suitable advection processes, yields a substantial increase of convergence rate. Moreover, we show that the homogenization enhancement induced by the advection term produces a qualitatively different scaling law of the convergence rate versus the network size with respect to the symmetric case.

关键词： Advection diffusion processes consensus algorithms convergence distributed algorithms sensor networks

来源：评论

学校读者我要写书评

暂无评论

Optimal consensus algorithms for cooperative team of agents subject to partial information

引用

AUTOMATICA 2008年第11期44卷 2766-2777页

作者： Semsar-Kazerooni, E. Khorasani, K. Concordia Univ Dept Elect & Comp Engn Montreal PQ H3G 1M8 Canada

The objectives of this work are the development and design of controllers for a team of agents that accomplish consensus for agents' output in both leaderless (ILL) and modified leader-follower (MLF) architectures. Towards this end, a semi-decentralized optimal control strategy is designed based on minimization of individual cost functions over a finite horizon using local information. Interactions among agents due to information flows are represented through the control channels in characterization of the dynamical model of each agent. It is shown that minimization of the proposed cost functions results in a modified consensus algorithm for LL and MLF architectures. In the latter case, the desired output is assumed to be available for only the leader while the followers should follow the leader using information exchanges existing among themselves and the leader through a predefined topology. Furthermore, the performance of the cooperative team under a member's fault is formally analyzed and investigated. The robustness of the team to uncertainties and faults in the leader or followers and adaptability of the team members to these unanticipated situations are also shown rigorously. Finally, simulation results are presented to demonstrate the effectiveness of our proposed methodologies in achieving prespecified requirements. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Optimal control Multi-agent networks consensus algorithms Cooperative control Decentralized control

来源：评论

学校读者我要写书评

暂无评论

Cluster-Based Classification of Blockchain consensus algorithms

引用

IEEE LATIN AMERICA TRANSACTIONS 2021年第4期19卷 688-696页

作者： Aponte, Fredy Gutierrez, Luz Pineda, Magda Merino, Ines Salazar, Augusto Wightman, Pedro Univ Santo Tomas Barranquilla Colombia Univ Norte Barranquilla Atlantico Colombia Univ Magdalena Santa Marta Colombia

In recent years, Blockchain has become a disruptivetechnology to protect the integrity of information, especially inopen and collaborative information systems. Its main advantageis the possibility to reach consensus on the new data blocks tobe added to the chain, even with anonymous actors. The mostcommon consensus mechanism is Proof of Work, but it has beenproven to be very inefficient in terms of energy spent by themembers of the blockchain. In the literature there are many othertechniques that pretend to become the new popular ***, the number of this techniques is growing too fast toreally be able to differentiate among all the options. In this work,a new characterization of consensus algorithm is proposed, thatcan be used to find families of mechanism using cluster-basedclassification. Using the Ward Method and Spearmans RankCorrelation analysis, new clusters of consensus mechanisms wereidentified. The results describe the behavioral patterns not seenbefore in the literature. In addition, some open problems ofcurrent consensus algorithms are discussed.

关键词： Blockchain Proof of Work Fault tolerant systems Fault tolerance Distributed ledger Scalability consensus algorithm Blockchain Cluster-based classification consensus algorithms Proof of Work Spearman Rank Correlation Ward Method

来源：评论

学校读者我要写书评

暂无评论

Randomized consensus algorithms over large scale networks

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2008年第4期26卷 634-649页

作者： Fagnani, Fabio Zampieri, Sandro Politecn Torino Dipartmento Matemat I-10129 Turin Italy Univ Padua Dept Informat Engn I-35131 Padua Italy

Various randomized consensus algorithms have been proposed in the literature. In some case randomness is due to the choice of a randomized network communication protocol. In other cases, randomness is simply caused by the potential unpredictability of the environment in which the distributed consensus algorithm is implemented. Conditions ensuring the convergence of these algorithms have already been proposed in the literature. As far as the rate of convergence of such algorithms, two approaches can be proposed. One is based on a mean square analysis, while a second is based on the concept of Lyapunov exponent. In this paper, by some concentration results, we prove that the mean square convergence analysis is the right approach when the number of agents is large. Differently from the existing literature, in this paper we do not stick to average preserving algorithms. Instead, we allow to reach consensus at a point which may differ from the average of the initial states. The advantage of such algorithms is that they do not require bidirectional communication among agents and thus they apply to more general contexts. Moreover, in many important contexts it is possible to prove that the displacement from the initial average tends to zero, when the number of agents goes to infinity.

关键词： consensus algorithms large-scale networks random algorithms concentration of performance mean square analysis

来源：评论

学校读者我要写书评

暂无评论

Robust consensus algorithms for Multiscale Coordination Control of Multivehicle Systems With Disturbances

引用

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2016年第2期63卷 1107-1119页

作者： Meng, Deyuan Jia, Yingmin Beihang Univ BUAA Div Res 7 Beijing 100191 Peoples R China Beihang Univ BUAA Sch Automat Sci & Elect Engn Beijing 100191 Peoples R China

This paper aims to address a new class of multiscale coordination control problems for multivehicle systems that are subject to external disturbances. Each vehicle is measured by an independent scale due to the constraints of physical environments. Based on the nearest neighbor-interaction rules, three algorithms of different convergence rates are presented such that the vehicles are guaranteed to achieve consensuson a common quantity for all but of their own scales. Simulation tests are performed to validate the effectiveness and robustness of these consensus algorithms. By introducing a Lyapunov potential function, the consensus analysis is further achieved for the three multiscale algorithms, regardless of them with an exponential, finite-time, or fixed-time convergence rate and in the presence of bounded disturbances.

关键词： consensus algorithms exponential convergence finite-time convergence fixed-time convergence multiscale coordination multivehicle systems

来源：评论

学校读者我要写书评

暂无评论

Optimal tradeoff between instantaneous and delayed neighbor information in consensus algorithms

引用

AUTOMATICA 2017年 83卷 116-123页

作者： Xia, Weiguo Meng, Ziyang Shi, Guodong Johansson, Karl Henrik Dalian Univ Technol Sch Control Sci & Engn Dalian Peoples R China Tsinghua Univ State Key Lab Precis Measurement Technol & Instru Dept Precis Instrument Beijing Peoples R China Australian Natl Univ Res Sch Engn Canberra ACT Australia Royal Inst Technol ACCESS Linnaeus Ctr Sch Elect Engn Melbourne Vic Australia

We consider a distributed consensus problem over a network, where at each time instant every node receives two pieces of information from disjoint neighboring sets: a weighted average of current states of neighbors from a primary network, and a weighted average of one-hop delayed states of neighbors from a secondary network. The proposed algorithm makes each node update its state to a weighted average of these individual averages. We show that convergence to consensus is guaranteed with non-trivial weights. We also present an explicit formula for the weights allocated to each piece of the information for the optimal rate of convergence, when the secondary network is the complement of the primary network. Finally numerical examples are given to explore the case when the neighbor sets of the agents do not cover the whole network. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： Delayed information Optimal tradeoff Convergence rate consensus algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：