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

13th Latin-American Symposium on Dependable and Secure Computing

作者： de Morais, Anderson Melo Aires Lins, Fernando Antonio Rosa, Nelson Souto Univ Fed Pernambuco Recife PE Brazil

ISBN: (纸本)9798400717406

The Internet of Things (IoT) is transforming many sectors of society by enabling communication between smart devices, but it faces challenges in maintaining integrity in data recording. Traditional Blockchain technologies, such as those based on Proof of Work (PoW), are unsuitable for IoT due to their high demands on computational resources. There are proposals to use multiple consensus algorithms in the same blockchain solution to improve performance and integrity. However, choosing the best algorithms or combinations for each IoT scenario is an open challenge. This work presents a strategy to select consensus algorithms and optimize blockchain performance in IoT-based environments. The proposed strategy was simulated in a blockchain implemented atop a Directed Acyclic Graph (DAG) designed for IoT environments. This blockchain integrates multiple consensus algorithms - Proof of Authority (PoA), Proof of Stake (PoS), Proof of Work (PoW), Practical Byzantine Fault Tolerance (PBFT), and Raft - each selected for its performance and security advantages. A comparative evaluation of different combinations is presented. The results show the performance and adaptability of the proposed strategy in various scenarios.

关键词： Blockchain Internet of Things consensus algorithms Information Security

来源：评论

学校读者我要写书评

暂无评论

A Study on Distributed consensus Protocols and algorithms: The Backbone of Blockchain Networks

A Study on Distributed Consensus Protocols and Algorithms: T...

引用

11th International Conference of Computer Communication and Informatics (ICCCI)

作者： Jayabalan, Jayapriya Jeyanthi, N. VIT Sch Informat Technol & Engn Vellore Tamil Nadu India

ISBN: (纸本)9781728158754

In a Blockchain network multiple nodes across the network verify each transaction and preserve them without having a centralized authority. Verification and insertion of transactions are achieved through distributed cryptographic mechanism called consensus protocol. consensus protocol involves the application of reputable concepts like Distributed Computing (P2P Networks), Cryptography and consensus algorithms. Traditional motivation for application of consensus Protocols is to warrant reliability in the distributed systems. The basic assumption behind this protocol is, a 'value' must have been proposed by some truthful node in the distributed system. Distributed consensus is attained once all the nodes present in the system agrees and approves the same value. At any given time, all nodes have a sequence of block of transactions, they have already reached consensus on. Also each node has a set of outstanding transactions it has heard about from other nodes. This consensus is achieved via various algorithms which serve as the backbone for Blockchain architecture. Once the transactions are verified, they will be included in the existing chain. The main advantage of such systems is the fact that they are immutable, transparent and distributed. Though stated simple, reaching consensus may be difficult due to various reasons such as crash of active node, presence of malicious nodes, faults in the network, latency (no global time) and not all pairs may be connected. A consensus algorithm ensures that the one and only version of truth gets added into the network, in addition to keeping malevolent people from tampering the network. It also makes sure that the system is fully decentralized. If everyone in the network is strictly honest, there is no need of consensus, however the probability of such existence is very less. Hence, we are undeniably in need of virtuous consensus algorithms for a strong, immortal Blockchain network. The process of selection and enactment of the

关键词： consensus Protocol Distributed consensus consensus algorithms Byzantine Fault Tolerance Distributed Computing Peer-To-Peer Networking

来源：评论

学校读者我要写书评

暂无评论

SECURE MULTI-PARTY consensus GOSSIP algorithms

SECURE MULTI-PARTY CONSENSUS GOSSIP ALGORITHMS

引用

IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

作者： Lazzeretti, Riccardo Horn, Steven Braca, Paolo Willett, Peter Univ Siena I-53100 Siena Italy

ISBN: (纸本)9781479928934

Information fusion is the keystone of many surveillance systems, in which the security of the information is a crucial aspect. This paper proposes a method to fuse information exchanging only encrypted data, through a secure extension of the popular consensus gossip algorithm using secure multi-party computation methodology. Sensor entities exchange only encrypted information and never have direct access to the data while iteratively reaching consensus. The agents do not have access to the final value and can just retrieve partial information, for instance a binary decision. An innovative implementation of the consensus algorithm in the encrypted domain is proposed and analyzed.

关键词： consensus algorithms detection secure multi-party computation information fusion encryption

来源：评论

学校读者我要写书评

暂无评论

Sparse Spectrum Sensing in Infrastructure-less Cognitive Radio Networks via Binary consensus algorithms

Sparse Spectrum Sensing in Infrastructure-less Cognitive Rad...

引用

IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications

作者： Mohamed Seif Tamer ElBatt Karim G. Seddik Wireless Intelligent Networks Center (WINC) Nile University Egypt Dept. of EECE Faculty of Engineering Cairo University Giza Egypt Electronics and Communications Engineering Department American University in Cairo New Cairo 11835 Egypt

ISBN: (纸本)9781509032556

Compressive Sensing has been utilized in Cognitive Radio Networks (CRNs) to exploit the sparse nature of the occupation of the primary users. Also, distributed spectrum sensing has been proposed to tackle the wireless channel problems, like node or link failures, rather than the common "centralized approach" for spectrum sensing. In this paper, we propose a distributed spectrum sensing framework based on consensus algorithms where SU nodes exchange their binary decisions to take global decisions without a fusion center to coordinate the sensing process. Each SU will share its decision with its neighbors, and at every new iteration each SU will take a new decision based on its current decision and the decisions it receives from its neighbors;in the next iteration, each SU will share its new decision with its neighbors. We show via simulations that the detection performance can tend to the performance of majorityrule Fusion Center based CRNs.

关键词： Compressive Sensing consensus algorithms Cognitive Radio Network

来源：评论

学校读者我要写书评

暂无评论

Power-Delay Analysis of consensus algorithms on Wireless Networks with Interference

Power-Delay Analysis of Consensus Algorithms on Wireless Net...

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： S. Vanka V. Gupta M. Haenggi Department of Electrical Engineering University of Notre Dame

ISBN: (纸本)9781424429257

We study the convergence of the average consensus algorithm in wireless networks in the presence of interference. For regular lattices with periodic boundary conditions, we characterize the convergence properties of optimal MAC protocol that maximizes the speed of convergence on these networks. We provide analytical upper and lower bounds for the convergence rate. Our results show that the fastest converging interconnection topology for the consensus algorithm crucially depends on the geometry of node placement in an interference-limited scenario.

关键词： consensus algorithms Interference MAC protocol Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of Distributed consensus Gossip algorithms for Network Size Estimation in Multi-Agent Systems

引用

FUTURE INTERNET 2021年第5期13卷 134页

作者： Kenyeres, Martin Kenyeres, Jozef Slovak Acad Sci Inst Informat Dribravska Cesta 9 Bratislava 84507 Slovakia EBCONT Proconsult GmbH Millennium TowerHandelskai 94-96 A-1200 Vienna Austria

Determining the network size is a critical process in numerous areas (e.g., computer science, logistic, epidemiology, social networking services, mathematical modeling, demography, etc.). However, many modern real-world systems are so extensive that measuring their size poses a serious challenge. Therefore, the algorithms for determining/estimating this parameter in an effective manner have been gaining popularity over the past decades. In the paper, we analyze five frequently applied distributed consensus gossip-based algorithms for network size estimation in multi-agent systems (namely, the Randomized gossip algorithm, the Geographic gossip algorithm, the Broadcast gossip algorithm, the Push-Sum protocol, and the Push-Pull protocol). We examine the performance of the mentioned algorithms with bounded execution over random geometric graphs by applying two metrics: the number of sent messages required for consensus achievement and the estimation precision quantified as the median deviation from the real value of the network size. The experimental part consists of two scenarios-the consensus achievement is conditioned by either the values of the inner states or the network size estimates-and, in both scenarios, either the best-connected or the worst-connected agent is chosen as the leader. The goal of this paper is to identify whether all the examined algorithms are applicable to estimating the network size, which algorithm provides the best performance, how the leader selection can affect the performance of the algorithms, and how to most effectively configure the applied stopping criterion.

关键词： consensus algorithms count data aggregation distributed algorithms distributed computing gossip algorithms information fusion network size network size estimation sensor fusion

来源：评论

学校读者我要写书评

暂无评论

Research on consensus Algorithm for Intellectual Property Transactions Based on Practical Byzantine Fault Tolerant (PBFT) Algorithm

引用

ELECTRONICS 2025年第8期14卷 1665-1665页

作者： Du, Dan Feng, Wenlong Huang, Mengxing Feng, Siling Wang, Jing Hainan Univ Sch Informat & Commun Engn Haikou 570228 Peoples R China

Aiming at the problems of significant communication overheads, the low reliability of primary nodes, and the insufficient dynamic adaptability of traditional consensus algorithms in intellectual property transaction scenarios, an Improved Practical Byzantine Fault Tolerant (IPBFT) algorithm based on the Chord algorithm and entropy weight method is proposed. Firstly, the Chord algorithm is employed to map nodes onto a hash ring, enabling dynamic grouping. Secondly, an entropy-based dynamic reputation model is constructed, quantifying the evaluation of node behaviors and calculating the overall reputation value. A three-level reputation classification mechanism is used to dynamically select primary and supervisory nodes, thereby reducing the probability of Byzantine nodes being elected. Then, a three-phase monitoring strategy for supervisory nodes is developed, which includes collection, review, and blackout. This improves the Raft consensus process, enhancing the detection and fault tolerance against malicious leaders. Finally, a grouped dual-layer consensus architecture is proposed. The lower layer uses an improved Raft algorithm for efficient consensus within groups, while the upper layer uses the PBFT algorithm for cross-group global consistency verification. Experimental findings demonstrate that the IPBFT algorithm is able to balance security, scalability, and consensus efficiency in a dynamic network environment, providing a better consensus solution for intellectual property transactions.

关键词： blockchain consensus algorithms intellectual property transactions PBFT Raft Chord algorithm entropy weight method

来源：评论

学校读者我要写书评

暂无评论

The Evolution and Optimization Strategies of a PBFT consensus Algorithm for Consortium Blockchains

引用

INFORMATION 2025年第4期16卷 268-268页

作者： Yuan, Fujiang Huang, Xia Zheng, Long Wang, Lusheng Wang, Yuxin Yan, Xinming Gu, Shaojie Peng, Yanhong Chongqing Univ Technol Coll Mech Engn Chongqing 400054 Peoples R China Taiyuan Normal Univ Sch Comp Sci & Technol Taiyuan 030619 Peoples R China Jiangsu Univ Sci & Technol Sch Energy & Power Zhenjiang 212100 Peoples R China Nagoya Univ Grad Sch Engn Dept Micronanomech Sci & Engn Nagoya 4648601 Japan Kumamoto Univ Magnesium Res Ctr Kumamoto 8608555 Japan Chinese Acad Sci Chongqing Inst Green & Intelligent Technol Chongqing 400714 Peoples R China

With the rapid development of blockchain technology, consensus algorithms have become a significant research focus. Practical Byzantine Fault Tolerance (PBFT), as a widely used consensus mechanism in consortium blockchains, has undergone numerous enhancements in recent years. However, existing review studies primarily emphasize broad comparisons of different consensus algorithms and lack an in-depth exploration of PBFT optimization strategies. The lack of such a review makes it challenging for researchers and practitioners to identify the most effective optimizations for specific application scenarios. In this paper, we review the improvement schemes of PBFT from three key directions: communication complexity optimization, dynamic node management, and incentive mechanism integration. Specifically, we explore hierarchical networking, adaptive node selection, multi-leader view switching, and a hybrid consensus model incorporating staking and penalty mechanisms. Finally, this paper presents a comparative analysis of these optimization strategies, evaluates their applicability across various scenarios, and offers insights into future research directions for consensus algorithm design.

关键词： distributed systems consensus algorithms consortium blockchain PBFT

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Enhanced Attribute-Based Encryption Architecture With Feasibility Analysis

引用

IEEE ACCESS 2025年 13卷 57629-57638页

作者： Ferrer-Rojas, Agustin Maharaj, Bodhaswar T. Hlophe, Mduduzi C. Univ Pretoria Dept Elect Elect & Comp Engn ZA-0002 Pretoria South Africa

In today's digital landscape, data security is critical, particularly in the Internet of Things (IoT), where large volumes of sensitive data are exchanged. Traditional encryption methods like RSA and AES face challenges in balancing security and performance, exposing systems to advanced cyber threats. To address these issues, blockchain technology offers decentralized, tamper-resistant data protection that enhances trust and transparency. Attribute-Based Encryption (ABE) schemes have been developed, often combining asymmetric and symmetric encryption for efficiency and security. However, gaps remain in practical deployment due to underexplored network architectures and limited feasibility simulations. This study proposes an end-to-end security architecture integrating ABE with Linear Secret Sharing Scheme (LSSS) access policies and blockchain-based distributed key management. The system's feasibility was evaluated using Network Simulator 3 (NS3) within a simulated IoT network. Results demonstrate a lightweight and scalable solution suitable for constrained environments. Numerical simulations showed consensus times as low as 0.25 seconds for key agreement and 0.7 seconds for message consensus, even in resource-constrained settings. For large networks, consensus times reached as low as 0.75 seconds. The system also achieved an average throughput of 0.3 transactions per second in low-resource environments. These outcomes highlight the system's potential for secure, efficient data transmission in IoT and other distributed systems.

关键词： Internet of Things Security Encryption Blockchains Access control Computer architecture Scalability Elliptic curve cryptography Cryptography Network architecture consensus algorithms NS3 Paxos PBFT Raft

来源：评论

学校读者我要写书评

暂无评论

A consensus-Driven Distributed Moving Horizon Estimation Approach for Target Detection Within Unmanned Aerial Vehicle Formations in Rescue Operations

引用

DRONES 2025年第2期9卷 127-127页

作者： Bassolillo, Salvatore Rosario D'Amato, Egidio Notaro, Immacolata Univ Naples Parthenope Ctr Direzionale Isola C4 Dept Sci & Technol I-80143 Naples Italy Univ Campania L Vanvitelli Dept Engn Via Roma 29 I-81031 Aversa Italy

In the last decades, the increasing employment of unmanned aerial vehicles (UAVs) in civil applications has highlighted the potential of coordinated multi-aircraft missions. Such an approach offers advantages in terms of cost-effectiveness, operational flexibility, and mission success rates, particularly in complex scenarios such as search and rescue operations, environmental monitoring, and surveillance. However, achieving global situational awareness, although essential, represents a significant challenge, due to computational and communication constraints. This paper proposes a Distributed Moving Horizon Estimation (DMHE) technique that integrates consensus theory and Moving Horizon Estimation to optimize computational efficiency, minimize communication requirements, and enhance system robustness. The proposed DMHE framework is applied to a formation of UAVs performing target detection and tracking in challenging environments. It provides a fully distributed architecture that enables UAVs to estimate the position and velocity of other fleet members while simultaneously detecting static and dynamic targets. The effectiveness of the technique is proved by several numerical simulation, including an in-depth sensitivity analysis of key algorithm parameters, such as fleet network topology and consensus iterations and the evaluation of the robustness against node faults and information losses.

关键词： distributed state estimation Moving Horizon Estimation (MHE) consensus algorithms UAV formations rescue missions target detection target tracking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：