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

Dynamic Vehicle Reputation consensus: Enhancing IoV Communication With a Blockchain algorithm

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2025年第3期74卷 4788-4806页

作者： Zhang, Linchao Hang, Lei Zu, Keke Wang, Yi Yang, Kun Univ Elect Sci & Technol China Yangtze Delta Reg Inst Quzhou Quzhou 324003 Peoples R China Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu 611731 Peoples R China Shanghai Normal Univ Tianhua Coll Dept Fintech Shanghai 201815 Peoples R China Univ Essex Sch Comp Sci & Elect Engn Essex CO4 3SQ England

As smart cities rapidly evolve, the Vehicle-to-Everything (V2X) network faces significant challenges in data security and communication efficiency. This paper introduces an innovative algorithm based on a reputation mechanism, named the Dynamic Vehicle Reputation consensus (DVRC), which focuses on improving the data security and communication efficiency of vehicular networks using blockchain technology. The DVRC algorithm comprehensively assesses vehicle behaviors and the consensus contribution within the blockchain network, utilizing a reputation scoring system to evaluate the reliability within the network. Furthermore, this study delves into multimodal communication strategies in vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) scenarios. Notably, when vehicles leave the range of basic infrastructure, those with high reputation scores (as determined by the DVRC's reputation values) relay the communication service. Additionally, the introduction of a reputation incentive mechanism and dynamic consensus threshold adjustments aim to improve consensus efficiency and encourage honest behavior. Experimental results demonstrate that the DVRC algorithm significantly improves communication efficiency in blockchain-based vehicular networks, such as increased throughput, reduced latency, and improved network scalability. These advances have substantial theoretical and practical significance for the development of vehicular networks in smart cities.

关键词： Smart cities Heuristic algorithms Data security Scalability Vehicle-to-infrastructure Vehicular ad hoc networks Throughput Robustness Blockchains Vehicle dynamics Blockchain communication strategy consensus algorithm reputation mechanism vehicle-to-everything (V2X) networking

来源：评论

学校读者我要写书评

暂无评论

A Survey on consensus algorithms for Distributed Wireless Networks

A Survey on Consensus Algorithms for Distributed Wireless Ne...

引用

2024 International Conference Optoelectronic Information and Optical Engineering, OIOE 2024

作者： Ji, Jun Cheng Lam, Chan Tong Ng, Benjamin Faculty of Applied Sciences Macao Polytechnic University China

ISBN: (数字)9781510688209

ISBN: (纸本)9781510688193

A distributed wireless communication system consists of multiple nodes. Due to the diversified resources and environmental conditions for each node, a consensus-based algorithm can be used to solve the conflicts in the wireless communication system so that each node can reach a consensus based on a consistent algorithm and a consistent result. In particular, the channel quality, signal strength, energy consumption, protocol delay, security, and reliability can be improved. consensus algorithms can also be applied for channel decision-making, authentication problems, message routing problems, and fault tolerance problems. consensus algorithms are becoming essential for safe and more reliable wireless communication systems. Focusing on consensus algorithms from the perspective of wireless communication applications, the survey compares current trends and emerging research opportunities in consensus algorithms. Finally, we provide future research directions for consensus algorithms for distributed wireless networks. © 2025 SPIE.

关键词： Block Chain consensus algorithm Distributed Computing Federated Learning Wireless Communication

来源：评论

学校读者我要写书评

暂无评论

Distributed Guaranteed-Performance consensus of Networked Systems Without Involving the Feasibility Condition: A Hierarchical algorithm

引用

IEEE Transactions on Network Science and Engineering 2025年

作者： Chen, Lei Liang, Hongjing Zhang, Xilin Li, Tieshan University of Electronic Science and Technology of China School of Automation Engineering Chengdu611731 China Luzhou Zhitong Automation Equipment Co. Ltd. Luzhou646000 China

This paper utilizes a hierarchical algorithm to focus on the distributed guaranteed-performance consensus problem of multiagent systems subjected to communication faults. With this algorithm, the consensus problem can be transformed into the tracking problem of agents in adjacent layers, and the constraint range for tracking errors does not depend on the Laplacian matrix of the communication topology. Compared to the existing hierarchical algorithm, a fault-tolerant compensation approach is designed to solve the communication fault between agents. Furthermore, the hierarchical rules are redefined according to the physical significance of topological weights, which enhances the rationality of the partition results. In addition, a shifting function is designed and incorporated into the conventional prescribed performance control approach to eliminate the existing feasibility condition. Based on Lyapunov theory, the sufficient conditions for the boundedness of all signals in the closed-loop system are derived. Finally, two simulation examples verify the efficacy of the scheme. © 2013 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Reputation consensus Model for VANET

引用

IEEE ACCESS 2025年 13卷 3521-3531页

作者： Chen, Ruilong Guan, Yepeng Shanghai Univ Sch Commun & Informat Engn Shanghai 200444 Peoples R China Minist Educ Key Lab Adv Display & Syst Applicat Shanghai 200072 Peoples R China

The vehicular ad hoc network (VANET) enables vehicles to disseminate messages to improve traffic safety and efficiency. However, the task of enabling consensus through synchronous communication among them remains a challenging problem due to the high mobility of vehicles. This prompts the need for a consensus model suitable for VANETs. Thus, A hierarchical reputation consensus model for VANET has been proposed. The model dynamically partitions consensus groups based on vehicles' global reputation, which restricts malicious nodes from participating in consensus to improve consensus efficiency. Secondly, an improved event reliability assessment mechanism is introduced into the reputation model to detect the authenticity of the events and mitigate the fabrication of false events. Finally, a hierarchical directed gossip consensus model based on directed acyclic graph (DAG) called as HDGgraph has been proposed. It is aimed at addressing the challenge of achieving consensus when vehicle communication synchronization cannot be guaranteed. In HDGgraph, vehicles can construct a DAG locally and implement virtual voting to achieve local consensus, which can reduce system communication overhead and significantly improve consensus efficiency. Experimental results demonstrate that our proposed approach outperforms some state-of-the-art methods in terms of performance.

关键词： Reliability consensus protocol Vehicular ad hoc networks Scalability Solid modeling consensus algorithm Vehicle dynamics Peer-to-peer computing Internet of Things Broadcasting DAG blockchain reputation model consensus model hierarchical structure VANET

来源：评论

学校读者我要写书评

暂无评论

Permissioned Blockchain-Based Trusted and Robust consensus Optimization Orienting Intelligent Transportation Systems

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2025年第2期26卷 2011-2026页

作者： Deng, Zhihong Tang, Chunming Li, Taotao He, Debiao Guangzhou Univ Sch Math & Informat Sci Guangzhou 510006 Peoples R China Guangzhou Univ Guangzhou Ctr Appl Math Guangzhou 510006 Peoples R China Guangzhou Univ Key Lab Informat Secur Technol Jointly Guangdong P Guangzhou 510006 Peoples R China Sun Yat Sen Univ Sch Software Engn Zhuhai 528478 Peoples R China Wuhan Univ Sch Cyber Sci & Engn Wuhan 430072 Peoples R China

Efficient and secure data sharing in the Internet of Vehicles (IoV) is critical for the advancement of intelligent transportation, particularly in the context of emerging 5G/6G networks and driverless technology. This has prompted researchers to explore Blockchain-based Internet of Vehicles (BIoV) solutions to address common issues in intelligent transportation systems (ITS). However, at the edge layer, existing reputation and consensus mechanisms in the BIoV model face challenges such as significant energy consumption, limited scalability, and pronounced centralization. To tackle these issues, we introduce TRCO, a Permissioned Blockchain-based Trusted and Robust consensus Optimization orienting ITS. TRCO is a three-layer BIoV architecture applicable to any BIoV scenario, offering robust scalability with the addition of new sub-regions. To improve the quality of data sharing for edge layer, we propose a decentralized reputation evaluation mechanism and integrate PoS and PBFT consensus algorithms to enhance performance by evaluating the communication behavior of edge servers. Security analysis and simulation experiments demonstrate that TRCO achieves high scalability and reliability, effectively filters Byzantine edge servers, and enhances the decentralization and consensus efficiency of the system.

关键词： Servers Trust management Security Scalability Reliability Optimization Transportation consensus algorithm Peer-to-peer computing Filters Permissioned blockchain consensus optimization ITS data sharing scalability

来源：评论

学校读者我要写书评

暂无评论

Random cluster parallel PBFT global consensus for consistent blockchain distributed ledger

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2025年第3期28卷 1-19页

作者： Abbessi, Wassim Ouni, Sofiane Othmen, Rabeb Ben Badreddine, Wafa Dequen, Gilles Univ Manouba Natl Comp Sci Sch ENSI CRISTAL Lab RAMSIS Team Campus Univ Manouba 2010 Tunisia Univ Picardie Jules Verne Lab Modelisat Informat Syst MIS F-80080 Amiens France

Blockchain is a distributed ledger that various applications can use to store data in a secure, decentralized, and immutable manner. The key piece in a blockchain is the consensus algorithm that different blockchain nodes run to obtain mutual agreement. While the Practical Byzantine Fault Tolerant (PBFT) is one of the most used algorithms and provides several advantages, it has a high communication cost, and it is executed in a sequential manner for consistency. To improve PBFT for blockchain consensus use, related works have added restrictive assumptions that can compromise security, consistency, and fault tolerance capabilities. This paper proposes a novel parallel PBFT-based consensus algorithm called Random-Cluster parallel PBFT. Our algorithm runs parallel consensus on random clusters in the blockchain network and then the resulting consensus is broadcasted to the blockchain network for a global consensus. Our proposal reduces the communication costs and improves the performance of the consensus which makes the blockchain more scalable. We provide formal proofs of the correctness of our algorithm. We have also proposed an algorithm to resolve the transaction order problem to address a consistent distributed ledger with concurrent consensus. The evaluation of throughput and communication complexity shows that Random-Cluster parallel PBFT provides better performance and more relevant results.

关键词： Lightweight blockchain Parallel PBFT Clustering consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved PBFT consensus Mechanism Based on Voting Sort Clustering Partition With Group Signature for IoT

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2025年第2期26卷 2239-2251页

作者： Dong, Shi Su, Huadong Hou, Ruizhe Shankar, Achyut Zhoukou Normal Univ Sch Comp Sci & Technol Zhoukou 466001 Peoples R China Wuhan Text Univ Sch Comp Sci & Artificial Intelligence Wuhan 430200 Peoples R China South China Univ Technol Sch Automat Sci & Engn Guangzhou 510641 Peoples R China Univ Warwick Dept Cyber Syst Engn WMG Coventry CV7 4AL England Graphic Era Deemed Univ Dept Comp Sci & Engn Dehra Dun 248002 India Chandigarh Univ Univ Ctr Res & Dev Mohali 140413 Punjab India Lovely Profess Univ Sch Comp Sci Engn Phagwara 144411 Punjab India Chitkara Univ Ctr Res Impact & Outcome Chandigarh 160002 Punjab India

The consensus mechanism is crucial to blockchain performance, making it essential to design a mechanism that aligns with the characteristics of the Internet of Things (IoT). This paper focuses on the application of PBFT consensus mechanism in the Internet of things. However, it is found that the current PBFT consensus mechanisms need to address some problems, such as communication overhead, bandwidth occupation and privacy protection. In this paper, we propose a voting sorting clustering mechanism based on group signatures to enhance the PBFT consensus mechanism (IPBFT), ensuring privacy protection between Internet of Things nodes. Finally, the communication efficiency is improved. The voting sorting clustering method reduces the communication probability with the nodes, and decreases the communication overhead and bandwidth occupation. Experimental results show that compared with other mechanisms, the proposed mechanism increases throughput, reduces communication overhead and bandwidth occupation, and alleviates privacy protection problems.

关键词： Internet of Things consensus protocol Throughput Fault tolerant systems Fault tolerance Delays consensus algorithm Scalability Protection Clustering algorithms consensus mechanism consortium blockchain PBFT IoT clustering mechanism group signature

来源：评论

学校读者我要写书评

暂无评论

A Distributed consensus Scenario Approach to Optimization and Control With Uncertainties

引用

IEEE ACCESS 2025年 13卷 5308-5320页

作者： Wang, Jing Drager, Steven Illinois State Univ Dept Elect Engn Normal IL 61761 USA Air Force Res Lab Rome NY 13441 USA

This paper addresses the problem of distributed optimization with uncertainties for multiagent systems. We propose a new distributed consensus scenario approach, handling uncertainties through a scenario program method. An approximate solution is developed, followed by a distributed estimation algorithm to manage large data volumes without a centralized approach. Our design inherently offers robustness against adversarial attacks and preserves data privacy. We provide rigorous convergence analysis and demonstrate the effectiveness of our approach through application examples in regression and robust internal model control. This work presents a significant step towards holistic solutions for optimization in safety-critical multiagent systems.

关键词： Uncertainty Optimization Cost function Multi-agent systems Measurement uncertainty Linear programming Noise Load modeling Eigenvalues and eigenfunctions Dynamical systems Optimization with uncertainties distributed algorithms scenario approach consensus algorithm multiagent distributed learning

来源：评论

学校读者我要写书评

暂无评论

Secure Task Offloading in Blockchain-Enabled MEC Networks With Improved PBFT consensus

引用

IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING 2025年第2期11卷 1225-1243页

作者： Du, Jianbo Yu, Zuting Sun, Aijing Jiang, Jing Zhao, Haitao Zhang, Ning Wu, Celimuge Yu, F. Richard Xian Univ Posts & Telecommun Sch Commun & Informat Engn Xian 710121 Peoples R China Nanjing Univ Posts & Telecommun Sch Commun & Informat Engn Nanjing 210003 Peoples R China Univ Windsor Dept Elect & Comp Engn Windsor ON N9B 3P4 Canada Univ Electrocommun Meta Networking Res Ctr Tokyo 1828585 Japan Carleton Univ Syst & Comp Engn Ottawa ON K1S 5B6 Canada

In this paper, we investigate the secure task offloading and computation resource allocation issues in a consortium blockchain-enabled multi-access edge computing (MEC) system. Specifically, edge servers and a cloud center provides user equipments (UEs) with augmented computing power for task processing, while consortium blockchain can provide trust and secure guarantee to UEs in task offloading. Within the MEC system, we intend to minimize the task processing cost of all UEs by jointly optimizing the binary task offloading decision and the computation resource block allocation. Meanwhile, in the blockchain system, we first enhance the consensus procedure by proposing an improved practical Byzantine fault tolerance (IPBFT) consensus algorithm, and then conduct consensus committee selection, thus to minimize consensus delay and fail ratio. The two systems are jointly optimized, subjecting to the computation power of edge nodes, the node number limitation of IPBFT, the task processing and blockchain consensus delay, etc. To address the problem effectively, we reform it into a Markov decision process (MDP) and use proximal policy optimization (PPO) to dynamically learn the optimal joint solution. Simulation results demonstrate that our proposed algorithm converges fast, and performs well in total reward maximization, and UEs' cost, consensus delay and fail ratio minimization.

关键词： Blockchains Resource management Servers Optimization Delays consensus algorithm Heuristic algorithms Computation offloading deep reinforcement learning proximal policy optimization (PPO) blockchain improved practical Byzantine fault tolerance (IPBFT)

来源：评论

学校读者我要写书评

暂无评论

Research on Relay-Based consensus algorithms for Multi-Microgrid Energy Trading

Research on Relay-Based Consensus Algorithms for Multi-Micro...

引用

Smart Grid and Artificial Intelligence (SGAI), International Conference on

作者： Zhisong Qin Chun Song Ke Lin Xiushun Zhu Jie Liu School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (数字)9798331518806

ISBN: (纸本)9798331518813

The rapid development of distributed energy systems and microgrid technologies has significantly increased the demand for energy trading among multiple microgrids. However, traditional energy trading models encounter performance bottlenecks, such as high response latency and low throughput, when managing large-scale cross-domain transactions, failing to meet real-time requirements. Existing blockchain solutions based on single-chain architectures, while utilized in energy trading, exhibit limitations in data isolation and system scalability. In cross-domain scenarios, in particular, inefficient consensus mechanisms impede support for high-frequency energy trading. To tackle these challenges, this paper proposes a relay chain-based cross-chain transaction mechanism for multi-microgrid systems. This mechanism employs a hierarchical architecture, segmenting the blockchain network into microgrid chain layers and a relay chain layer. Each microgrid operates an independent blockchain, ensuring transaction data isolation and privacy protection. The relay chain links the microgrid chains, coordinating the validation and execution of cross-chain transactions to improve system scalability and communication efficiency. Experimental results show that the proposed Relay-based Partitioned Multi-chain Architecture delivers security comparable to the traditional Global Single-chain consensus Architecture while substantially enhancing transaction efficiency. This approach offers an efficient, secure, and scalable solution for multi-microgrid energy trading.

关键词： Data privacy Scalability Microgrids consensus algorithm Throughput consensus protocol Smart grids Security Relays Protection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：