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

Distributed Secure Economic Dispatch Strategy Based on Robust Graph Theory and W-MSR algorithm

SENSORS 2025年第8期25卷 2551-2551页

作者： Le, Jian Wang, Jing Lang, Hongke Wang, Weihao Wuhan Univ Sch Elect Engn & Automat Wuhan 430072 Peoples R China Wuhan Univ Inst Next Generat Power Syst & Int Stand Wuhan 430072 Peoples R China

The traditional consensus-based distributed economic dispatch strategy may lose system convergency and cause imbalanced power when facing an information attack on the individual power generation unit;thus, it is unable to achieve the dispatching goal. Taking into consideration several kinds of attack behaviors that may exist in a distributed control system, this paper develops models of node attacks from the two aspects of action mode and deployment scope, and analyzes the influence of attack behaviors on the distributed economic dispatch system. Based on the idea of the W-MSR algorithm that deletes the information received from nodes that may be attacked, a distributed security consensus-based economic dispatch strategy is synthetized with the incremental cost of the power generation unit as the consensus variable. Based on the graph robustness index, this paper gives its conditions along with its proof that the communication network topology of the system should be satisfied when adopting the W-MSR algorithm. The simulation results of the IEEE-39 bus distribution network show that the strategy proposed in this paper can effectively counter various information attacks, enhancing both the security and economic efficiency of the distributed economic dispatch system. In addition, the (F + 1, F + 1)-robust graph is a necessary and sufficient condition to achieve the consensus of the dispatch strategy.

关键词： distributed economic dispatch robust networks W-MSR algorithm consensus algorithm information security

来源：评论

学校读者我要写书评

暂无评论

A NEW HYBRID HALPERN-BASED EXTRAGRADIENT algorithm FOR A PSEUDOMONOTONE EQUILIBRIUM PROBLEM AND A FIXED POINT PROBLEM OF NONEXPANSIVE MAPPINGS IN BANACH SPACES

Journal of Applied and Numerical Optimization

引用

Journal of Applied and Numerical Optimization 2024年第1期6卷 71-82页

作者： Shi, Yitong Zhu, Ziqi Department of Mathematics and Physics North China Electric Power University Baoding China

In this paper, we propose a hybrid Halpern-based extragradient algorithm for finding a common solution of a pseudomonotone equilibrium problem and a fixed point problem of a nonexpansive mapping. We prove the strong convergence of the proposed algorithm under some mixed conditions. Some numerical examples are provided to illustrate the effectiveness of the proposed algorithm. © 2024 Journal of Applied and Numerial Optimization.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

BDLS as a Blockchain Finality Gadget: Improving Byzantine Fault Tolerance in Hyperledger Fabric

引用

IEEE ACCESS 2024年 12卷 154600-154613页

作者： Salih, Ahmed Al Wang, Yongge Univ North Carolina Charlotte Dept Software & Informat Syst SIS Charlotte NC 28223 USA Coll Comp & Informat Charlotte NC 28223 USA

Decentralized systems are integral to various sectors, including public and private organizations. At the core of these systems is the dissemination protocol. Hyperledger Fabric, a prominent production-ready distribution network system, allows for a pluggable consensus protocol, though it has historically lacked detailed technical guidance for implementing such modules. Initially, Fabric employed Kafka and later switched to Raft, both of which are Crash Fault Tolerant (CFT) protocols and do not support Byzantine fault tolerance (BFT). Hyperledger Fabric recently introduced a new BFT solution called SmartBFT in its 3.0 release. However, SmartBFT, based on the Practical Byzantine Fault Tolerance (PBFT) protocol family, suffers from high message complexity, explicitly referring to the total number of messages exchanged during protocol execution, which scales poorly as the network grows. This complexity significantly affects network efficiency, particularly in large-scale implementations across industries such as healthcare, finance, and education. Communication overhead increases substantially, which encompasses the number of messages and the time and resources required for message transmission and processing. Our research shows that the message complexity of SmartBFT grows quadratically with the number of orderer nodes, leading to significant communication overhead. Conversely, our proposed implementation of our Byzantine Fault Tolerant (BFT) protocol is based on the original Dwork, Lynch, and Stockmeyer (DLS) protocol. Our adaptation is the Blockchain version of DLS (BDLS), which maintains linear message complexity, making it more scalable and efficient for large networks. This stark contrast highlights BDLS's superior scalability and efficiency. BDLS maintains a consistent performance advantage. BDLS throughput analysis of Fabric 3.0 shows a significant performance drop for SmartBFT, which achieves only 40 % and 20 % of Raft's TPS in LAN and WAN environments, respec

关键词： Fabrics Protocols Distributed ledger Fault tolerance consensus algorithm Complexity theory Throughput consensus protocol Blockchains Blockchain Byzantine fault tolerance (BFT) consensus distributed ledger technology

来源：评论

学校读者我要写书评

暂无评论

Enhancing Privacy in Microgrid Operations: A State Decomposition Approach for consensus-Based Distributed Economic Dispatch over Directed Networks

Enhancing Privacy in Microgrid Operations: A State Decomposi...

引用

2024 China Automation Congress, CAC 2024

作者： Xu, Keng Xiang, Hanbing Yan, Gangfeng Kuai, Jiating Zhejiang University Hangzhou China Zhejiang Institute of Communications Co. Ltd. Hangzhou China

ISBN: (纸本)9798350368604

The dual objectives of privacy protection and optimization scheduling are of paramount importance in economic dispatch for smart microgrids. This study presents a privacy-preserving consensus algorithm that employs state decomposition to tackle the privacy leakage challenges associated with distributed economic dispatch in smart microgrids. By decomposing state variables into internal and external sub-states, the algorithm selectively transmits partial data, effectively preventing information leakage. Compared with traditional methods such as noise injection and encryption, the proposed algorithm offers lower computational complexity while maintaining rapid convergence. Privacy analysis demonstrates the robustness of the algorithm against both internal and external eavesdroppers, ensuring the security of sensitive information. The results from numerical simulations affirm the algorithm’s efficacy. This approach is applicable to ED problems in smart microgrids with privacy protection requirements, providing a novel solution for secure and efficient microgrid operation. © 2024 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

DISTRIBUTED EXTENDED STOCHASTIC GRADIENT algorithm FOR JOINT IDENTIFICATION OF SYSTEM PARAMETERS AND NOISE MODEL PARAMETERS

引用

SIAM Journal on Control and Optimization 2025年第1期63卷 650-675页

作者： Gan, Die Yan, Ren Chen, Shuning Liu, Zhixin College of Artificial Intelligence Nankai University Tianjin China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100190 China

In this paper, we study the distributed identification problem of dynamic systems described by stochastic regression models with colored noise. To deal with challenges brought by the colored noise, we provide estimates for the unknown noise over a previous time period, and incorporate them with observed signals to construct extended regression vectors. Based on this, we develop a distributed extended stochastic gradient algorithm to estimate unknown parameter matrices by integrating the diffusion strategy of extended regression vectors with the consensus strategy of neighbors' estimates. We introduce cooperative nonpersistent excitation conditions to reflect the temporal and spatial union information condition, under which the almost sure convergence of the proposed distributed algorithm is established. Our results are obtained without assuming the independence, stationarity or persistent excitation conditions for the regressors and the Gaussian property for the system noises. Finally, numerical results are provided to verify the effectiveness of our proposed algorithm. © by SIAM.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Decision-making algorithm based on the energy of interval-valued hesitant fuzzy soft sets

引用

Neural Computing and Applications 2025年第16期37卷 9821-9841页

作者： Stojanović, Nenad Laković, Maja Djurović, Ljubica Faculty of Science University of Kragujevac 34000 Radoja Domanovića 12 Kragujevac Serbia

Interval-valued hesitant fuzzy soft sets, a powerful tool for data modeling, have been the focus of numerous studies. In addition to their various applications, examining the properties and characteristics of these structures from a theoretical mathematical perspective enables more efficient utilization in real-world problems. The primary objective of this research is to define a numerical characteristic of an interval-valued hesitant fuzzy soft set, analogous to the energy of a graph and the energy of a fuzzy soft set. The motivation for introducing this numerical characteristic lies in its potential to develop a decision-making algorithm that outperforms existing approaches addressing the same problem. The energy of a graph, as well as the energy of a fuzzy soft set, is defined as a norm function obtained by summing the singular values of the corresponding representation matrix. In optimization problems, this sum of singular values is known as the nuclear norm, which serves as the basis for introducing the notion of energy in interval-valued hesitant fuzzy soft sets. The results of the proposed algorithm are compared in this paper with those of various existing algorithms designed to solve the same problem. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Layered Secure Edge Content Delivery in UAV-Assisted Vehicular Networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2025年第5期74卷 7914-7927页

作者： Xu, Qichao Jin, Jie Su, Zhou Li, Ruidong Wang, Yuntao Fang, Dongfeng Wu, Yuan Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200444 Peoples R China Xi An Jiao Tong Univ Sch Cyber Sci & Engn Xian 710049 Peoples R China Kanazawa Univ Inst Sci & Engn Kanazawa 9201192 Japan Calif Polytech State Univ San Luis Obispo Dept Comp Sci San Luis Obispo CA 93407 USA Univ Macau Dept Comp & Informat Sci State Key Lab Internet Things Smart City Macau 999078 Peoples R China

Recently, edge content delivery has been promoted for video applications in unmanned aerial vehicle (UAV)-assisted vehicular networks (UVNs). UAVs could proactively cache (video) contents and transmit them to nearby vehicular users, thereby significantly mitigating delivery latency. However, since UAVs are typically deployed by untrusted third parties, the contents may be illicitly accessed by some curious and even malicious UAVs, compromising users' privacy. Besides, due to the limited resources, UAVs may be unwilling to deliver contents without adequate compensations. To address these issues, in this paper, we propose a novel secure edge content delivery scheme in UVNs. Specifically, we first devise a blockchain-based layered secure edge content delivery framework. With the scalable video coding (SVC) that encodes each content into a base layer and multiple enhancement layers, only the enhancement layers of the content are delivered by UAVs, ensuring that untrusted UAVs without the base layer cannot recover the content to access explicit information. Meanwhile, a lightweight consortium blockchain is utilized to supervise the enhancement layer delivery services of UAVs in a distributed fashion. The delegated proof of stake (DPoS)-based practical Byzantine fault tolerance (PBFT) consensus algorithm is designed to immutably and traceably record content delivery transactions between UAVs and vehicular users. Then, we formulate the content delivery incentive problem as a Stackelberg game, where UAVs act as game leaders to determine content delivery prices and vehicular users act as game followers to determine the number of required enhancement layers. Afterwards, through game analysis using the backward induction approach, the Stackelberg equilibrium is attained as the solution to the formulated problem, where the optimal strategies of both UAVs and vehicular users are derived by the Q-learning algorithm. Finally, extensive simulations are conducted to demonstrate that

关键词： Blockchains Games Static VAr compensators Security Base stations Quality of experience NOMA Heuristic algorithms Delays consensus algorithm Unmanned aerial vehicle (UAV)-assisted vehicular networks (UVNs) secure edge content delivery scalable video coding blockchain Stackelberg game

来源：评论

学校读者我要写书评

暂无评论

Memetic algorithm for Maximizing K-coverage and K-Connectivity in Wireless Sensor Network

Informatica (Slovenia)

引用

Informatica (Slovenia) 2025年第1期49卷 7-18页

作者： Thi, Hanh Nguyen Van Duc, Cuong Duc, Chinh Tran Minh, Hieu Ha Van, Son Nguyen Van, Quan La Faculty of Interdisciplinary Digital Technology PHENIKAA University Yen Nghia Ha Dong Hanoi12116 Viet Nam Hanoi University of Science and Technology Hanoi Viet Nam Faculty of Computer Science PHENIKAA University Yen Nghia Ha Dong Hanoi12116 Viet Nam

The rapid growth of IoT has enabled diverse applications using Wireless Sensor Networks across various fields. A significant challenge in Wireless Sensor Networks is the efficient deployment of sensors to ensure coverage and connectivity. Effective coverage allows continuous target tracking and data collection, while connectivity ensures data transmission to the base station. In this paper, we address the challenge of maximizing the number of targets satisfying K-coverage and K-connectivity, where each target is tracked by K sensors and has K transmission paths to the base station. We propose a two-phase methodology to tackle this challenge. The first phase enhances the Greedy algorithm to solve the K-coverage problem. The second phase addresses the K-connectivity problem using Memetic algorithms augmented by an efficient local search mechanism called PMA. We evaluate the algorithm on various datasets and compare it with baseline methods, including Greedy and Prim-based with the withdrawal strategy (PWS). Our results show that the proposed PMA with a robust local search outperforms alternative algorithms, with improvements exceeding 10% to 15% compared to the baseline methods. Additionally, we validate the performance of the proposed method using a real-world dataset and outline plans for further enhancements in the near future. © 2025 Slovene Society Informatika. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Practical Parallel algorithms for Non-Monotone Submodular Maximization

引用

Journal of Artificial Intelligence Research 2025年 82卷 39-75页

作者： Cui, Shuang Han, Kai Tang, Jing Li, Xueying Zhiyuli, Aakas Li, Hanxiao School of Computer Science and Technology Soochow University Jiangsu Suzhou China The Hong Kong University of Science and Technology China Alibaba Group Zhejiang Hangzhou China Qingdao University of Science and Technology Shandong Qingdao China

Submodular maximization has found extensive applications in various domains within the field of artificial intelligence, including but not limited to machine learning, computer vision, and natural language processing. With the increasing size of datasets in these domains, there is a pressing need to develop efficient and parallelizable algorithms for submodular maximization. One measure of the parallelizability of a submodular maximization algorithm is its adaptive complexity, which indicates the number of sequential rounds where a polynomial number of queries to the objective function can be executed in parallel. In this paper, we study the problem of non-monotone submodular maximization subject to a knapsack constraint, and propose a low-adaptivity algorithm achieving an (1/8 − ϵ)approximation with practical Õ(n) query complexity. Moreover, we also propose the first algorithm with both provable approximation ratio and sublinear adaptive complexity for the problem of non-monotone submodular maximization subject to a k-system constraint. As a by-product, we show that our two algorithms can also be applied to the special case of submodular maximization subject to a cardinality constraint, and achieve performance bounds comparable with those of state-of-the-art algorithms. Finally, the effectiveness of our algorithms is demonstrated by extensive experiments on real-world applications. ©2025 The Authors.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based User Authentication and Data-Sharing Framework for Healthcare Industries

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2024年第4期11卷 3623-3638页

作者： Soni, Preeti Islam, S. K. Hafizul Pal, Arup Kumar Mishra, Nimish Samanta, Debabrata Natl Inst Technol Hamirpur Dept Comp Sci & Engn Hamirpur 177005 India Indian Inst Informat Technol Kalyani Dept Comp Sci & Engn Kalyani 741235 West Bengal India Indian Inst Technol Dhanbad Indian Sch Mines Dept Comp Sci & Engn Jharkhand 826004 India Rochester Inst Technol Dept Comp & Informat Technol Prishtina 10000 Kosovo

In this paper, we developed a Blockchain-based User Authentication Data-Sharing (BC-UADS) framework. In BC-UADS, several hospital servers form a consortium blockchain network to maintain the transparency, immutability, and authenticity of the patient's Electronic Healthcare (Record EHR) medical data. The BC-UADS framework allows doctors to share or retrieve a patient's EHR metadata from the blockchain network. Since, the metadata is stored on a blockchain platform, it is more secure and trusted for real-time applications to utilize the medical data. The data-sharing protocol of the BC-UADS framework is implemented based on Proof-of-Reputation consensus algorithm in a blockchain network. The BC-UADS framework is analyzed in the AVISPA (Automated Validation of Internet Security Protocols and Applications) tool, demonstrating that it is secure against active and passive attacks. Besides, the BC-UADS framework is provably secure in the random oracle model based on the hardness assumption of Elliptic Curve-based Computational Diffie-Hellman (ECCDH) problem. The mutual authentication property of the BC-UADS framework is analyzed in the BAN (Burrows-Abadi-Needham) logic model. We have computed the communication, execution, and storage costs of the BC-UADS framework in different security levels: 80-bit, 112-bit, 128-bit, 192-bit, and 256-bit using PBC library. The proposed BC-UADS framework is compared with the state-of-the-art schemes.

关键词： Blockchains Hospitals Authentication Servers consensus algorithm Elliptic curves Costs blockchain healthcare provable security proof-of-reputation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：