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

Distributed economic operation control in low-voltage resistive hybrid AC/ DC microgrid clusters with interlinking converters

引用

ELECTRIC POWER SYSTEMS RESEARCH 2025年 238卷

作者： Yang, Fan Yan, Yingzhe Cao, Jiuzhou Lin, Shunfu Li, Dongdong Shen, Yunwei Shanghai Univ Elect Power Coll Elect Engn Shanghai 200090 Peoples R China Three Gorges Vocat Coll Elect Power Yichang 443000 Peoples R China

Connecting adjacent and diverse microgrids to form hybrid microgrid clusters improve the economic viability and the reliability of each microgrid in islanded operations. To realize the global economic operation among low-voltage resistive microgrid clusters, a two-level control strategy for subgrid control and microgrid clusters control is proposed in this study. In the case of subgrids, where the line impedance of the low-voltage grid is primarily resistive, we design the AC voltage increment droop (V-ac-IC) and the DC voltage increment droop (V-dc-IC) to effectively distribute power. The V-ac-IC and V-dc-IC droop controls cannot achieve economic power distribution due to the mismatched line impedances. Therefore, a distributed economic operation control based on the consensus algorithm is proposed in this study to eliminate the influence of mismatched line impedances on economic power distribution. In the context of microgrid clusters, the deviation of increment costs serves as an event-driven signal designed for Interlinking Converters (ILCs), aiming to optimize power exchange between adjacent subgrids. The coordination between the subgrid control and microgrid clusters control achieves global economic operation. Finally, Matlab/Simulink simulation verifies that the islanded hybrid microgrid clusters with the proposed strategy realize the economic operation well.

关键词： consensus algorithm Economic droop control Hybrid microgrid clusters Voltage control

来源：评论

学校读者我要写书评

暂无评论

The Least Information Set Needed by Privacy Attackers

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第3期70卷 1652-1666页

作者： Xie, Antai Wang, Xiaofan Yang, Wen Cao, Ming Ren, Xiaoqiang Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200444 Peoples R China East China Univ Sci & Technol Key Lab Adv Control & Optimizat Chem Proc Shanghai 200237 Peoples R China Univ Groningen Fac Sci & Engn NL-9712 CP Groningen Netherlands Shanghai Univ Key Lab Marine Intelligent Unmanned Swarm Technol Minist Educ Shanghai 200444 Peoples R China

This article studies privacy-preserving problems focusing on the information that is available to the attacker. For a class of general linear average consensus algorithms, we identify the least information set required by an attacker to infer the initial value of the target node. We then propose a novel algorithm that protects the initial value effectively if the attacker fails to have this least information. Furthermore, we show that the initial value of nodes may be disclosed even if the attacker does not know any information exchanged between the target node and its neighbors. Finally, we propose a novel eavesdropping algorithm if the least information is available. Several numerical examples are given to verify the validity of our results.

关键词： consensus algorithm Directed graphs Noise Accuracy Vectors Convergence Matrix decomposition Differential privacy Heuristic algorithms Eavesdropping Average consensus information set privacy-preserving

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Distributed and Parallel Blockchain: Towards a Multi-Chain System With Enhanced Security

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2025年第1期22卷 723-739页

作者： Liu, Weikang Cao, Bin Peng, Mugen Li, Bo Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Kowloon Hong Kong Peoples R China

Isolatability and scalability are two critical issues faced by blockchain. Blockchain interoperability addresses isolatability between heterogeneous blockchains, while sharding-based blockchain achieves scalability by solving isolatability of homogeneous blockchains running in different shards. To ensure atomicity between different blockchains, they both need to overcome two significant problems: 1) how to handle cross-chain transactions without trusting any third parties;2) how to enhance the resistance to double-spending attacks of participating blockchains. To this end, this work presents a two-tier multi-zone architecture, Distributed and Parallel Blockchain (DP-Chain), where consensus Zone in tier-1 features blockchain interoperability and sharding-based blockchain by allowing homogeneous or heterogeneous blockchains run in different zones, while Coordination Layer in tier-2 allows them to interoperate as a Direct Acyclic Graph (DAG) without trusting any third parties. Meanwhile, the coordination scheme between the two tiers is designed to resist potential double-spending attacks. Then, stochastic models are used to capture DP-Chain consensus process and analyze the probability of successful double-spending attacks. These analyses can help understand DP-Chain easily and offer theoretical guidelines for further implementations. Finally, based on the proposed architecture, a practical system is realized with C++ and open in Github for testing. Extensive experiments show correctness and effectiveness of this design.

关键词： Blockchains consensus algorithm Interoperability Security Scalability Resists Resistance Blockchain direct acyclic graph sharding interoperability isolatability scalability

来源：评论

学校读者我要写书评

暂无评论

A map-reduce algorithm to find strongly connected components of directed graphs

引用

Soft Computing 2025年第4期29卷 1947-1966页

作者： Ji, Fujun Jin, Jidong Beijing100070 China

Online social networks have become ubiquitous platforms, comprising intricately linked structures that reflect complex user interactions. Analyzing the interconnected component structure of these large directed graphs is pivotal for critical applications like viral marketing and contagion prediction. This paper presents a parallel algorithm to efficiently discover strongly connected components in massive social graphs by distributing computation across clustered servers. Our proposed distributed approach conducts localized connected component extraction during the Map phase. The merged aggregation in the Reduce phase then uncovers global maximum interconnected sets spanning the fragmented structures. We employ mathematical induction across Map-Reduce stages to demonstrate the algorithm’s correctness for obtaining exhaustive component enumeration across servers. Implementation and complexity analysis on synthetic benchmark graphs highlight significant efficiency gains, with the algorithm demonstrating near-linear speedup for increasing data-set and cluster sizes. The proposed technique advances the state-of-the-art for extracting strongly connected structures from colossal real-world social networks, enabling actionable insights around influence cascades and contagion pathways underlying these intricate linkage patterns. © The Author(s) 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Exact and inexact search for 2d side-sharing tandems

引用

THEORETICAL COMPUTER SCIENCE 2025年 1026卷

作者： Marcus, Shoshana Sokol, Dina Zelikovitz, Sarah CUNY Kingsborough Community Coll Dept Math & Comp Sci Brooklyn NY 11201 USA CUNY Brooklyn Coll Dept Comp & Informat Sci Brooklyn NY USA CUNY Grad Ctr Brooklyn NY USA CUNY Coll Staten Isl Dept Comp Sci Staten Isl NY USA

A side-sharing tandem is a rectangular array that is composed of two adjacent non-overlapping occurrences of the same rectangular block. Furthering our understanding of side-sharing tandems can facilitate the development of more efficient 2d pattern matching techniques and may lead to improvements in multi-dimensional compression schemes. Existing algorithms for finding side-sharing tandems are far from optimal on 2d arrays that contain relatively few side-sharing tandems. In this paper, we introduce the idea of a run of side-sharing tandems, as a maximally extended chain of 2d tandems. We demonstrate tight upper bounds on the number of runs of side-sharing tandems that can occur in a rectangular array. We develop an algorithm that locates all i runs of side-sharing tandems in an n x n input array in O((n2 + i) log n/ log log n) time. We also introduce several versions of approximate side-sharing tandems with k mismatches along with efficient algorithms for locating them in a rectangular array.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Enhanced IoT Sensor Data Management for Engineering Monitoring

引用

IEEE SENSORS JOURNAL 2025年第4期25卷 7363-7375页

作者： Wang, Qian Wang, Zhuo China Mobile Grp Design Inst Co Ltd Hubei Branch Wuhan 430024 Peoples R China China Railway 11 Bur Grp Corp Ltd Survey & Design Inst Wuhan 430000 Peoples R China

In engineering monitoring and the Internet of Things (IoT) sensor networks, ensuring data security and real-time performance is a critical challenge. Traditional centralized data management faces issues such as high risks of data tampering, insufficient privacy protection, and inconsistent data sharing among multiple parties, making it difficult to handle high-frequency updates and complex collaboration. To address these issues, this article proposes a blockchain-based improved consensus algorithm, Reputation-based Practical Byzantine Fault Tolerance (RPBFT), to enhance the management efficiency and security of IoT sensor data. RPBFT enables secure data storage and sharing through smart contracts and introduces a node behavior incentive mechanism and a simplified consensus protocol to reduce communication overhead and consensus latency. Experimental results show that RPBFT reduces consensus latency by approximately 30%, increases throughput by 70%, significantly reduces energy consumption, and exhibits strong resistance to attacks. The study demonstrates that RPBFT is suitable for resource-constrained IoT sensor networks and can enhance performance and security in larger-scale and more complex network environments. Furthermore, the proposed algorithm provides practical implications for improving data reliability and system efficiency in real-world engineering monitoring scenarios, such as structural health monitoring and environmental safety supervision.

关键词： Monitoring Blockchains Sensors Internet of Things Data centers Smart contracts Intelligent sensors Memory Security Indexes Blockchain consensus algorithm data security engineering monitoring Internet of Things (IoT) sensor networks Reputation-based Practical Byzantine Fault Tolerance (RPBFT)

来源：评论

学校读者我要写书评

暂无评论

Prophet upper bounds for online matching and auctions

引用

OPERATIONS RESEARCH LETTERS 2025年 61卷

作者： Soto, Jose A. Verdugo, Victor Univ Chile Dept Math Engn Santiago Chile Univ Chile IRL CNRS 2807 Ctr Math Modeling Santiago Chile Pontificia Univ Catolica Chile Inst Math & Computat Engn Santiago Chile Pontificia Univ Catolica Chile Dept Ind & Syst Engn Santiago Chile

In the online 2-bounded auction problem, we have a collection of items represented as nodes in a graph and bundles of size two represented by edges. Agents are presented sequentially, each with a random weight function over the bundles. The goal of the decision-maker is to find an allocation of bundles to agents of maximum weight so that every item is assigned at most once, i.e., the solution is a matching in the graph. When the agents are single-minded (i.e., put all the weight in a single bundle), we recover the maximum weight prophet matching problem under edge arrivals (a.k.a. prophet matching). In this work, we provide new and improved upper bounds on the competitiveness achievable by an algorithm for the general online 2-bounded auction and the (single-minded) prophet matching problems. For the adversarial arrival order of the agents, we show that no algorithm for the online 2-bounded auction problem achieves a competitiveness larger than 4/11, while no algorithm for prophet matching achieves a competitiveness larger than approximate to 0.4189. Using a continuous-time analysis, we also improve the known bounds for online 2-bounded auctions for random order arrivals to approximate to 0.5968 in the general case, a bound of approximate to 0.6867 in the IID model, and approximate to 0.6714 in prophet-secretary model.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Solvers for Network Linear Equations With Scalarized Compression

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第4期70卷 2644-2651页

作者： Wang, Lei Ren, Zihao Yuan, Deming Shi, Guodong Zhejiang Univ Coll Control Sci & Engn Hangzhou 310027 Zhejiang Peoples R China Nanjing Univ Sci & Technol Sch Automat Nanjing 210094 Peoples R China Univ Sydney Australia Ctr Robot Sydney NSW 2006 Australia

Distributed computing is fundamental to multiagent systems, with solving distributed linear equations as a typical example. In this article, we study distributed solvers for network linear equations over a network with node-to-node communication messages compressed as scalar values. Our key idea lies in a dimension compression scheme that includes a dimension-compressing vector and a data unfolding step. The compression vector applies to individual node states as an inner product to generate a real-valued message for node communication. In the unfolding step, such scalar message is then plotted along the subspace generated by the compression vector for the local computations. We first present a compressed consensus flow that relies only on such scalarized communication, and show that linear convergence can be achieved with well excited signals for the compression vector. We then employ such a compressed consensus flow as a fundamental consensus subroutine to develop distributed continuous-time and discrete-time solvers for network linear equations, and prove their linear convergence properties under scalar node communications. With scalar communications, a direct benefit would be the reduced node-to-node communication channel burden for distributed computing. Numerical examples are presented to illustrate the effectiveness of the established theoretical results.

关键词： Vectors Convergence Signal processing algorithms Heuristic algorithms Electronic mail consensus algorithm Communication channels Distributed algorithms Computational efficiency Australia Compression consensus scalar communication network linear equation

来源：评论

学校读者我要写书评

暂无评论

Three-dimensional cooperative guidance strategy for heterogeneous vehicles without prior communication topology establishment

引用

AEROSPACE SCIENCE AND TECHNOLOGY 2025年 161卷

作者： Xiong, Yongcheng Li, Jianfeng Li, Changqing Hu c Tan, Liguo Harbin Inst Technol Dept Control Sci & Engn Harbin 150001 Peoples R China Harbin Inst Technol Ctr Control Theory & Guidance Technol Harbin 150001 Peoples R China Kazan Natl Res Tech Univ Inst Aviat Land Transportat & Power Engn Kazan 420111 Russia Harbin Inst Technol Frontiers Sci Ctr Matter Behave Space Environm Harbin 150001 Peoples R China

This study proposes a novel heterogeneous vehicle cooperative guidance law, named HKGG. This guidance law integrates the proportional navigation law (PNG) and the Hegselmann-Krause (HK) model, enabling multiple vehicles to self-organize and reach the target point in groups based on their own states. Firstly, a three-dimensional overload model for multiple flying-vehicles is established. Then, by deriving the combination form of the PNG term and the consensus algorithm through the vehicle-target model on a two-dimensional plane, normal and lateral guidance commands are derived based on the HK model and the estimation of the remaining flight time of the multi-vehicles. The proposed strategy does not require prior establishment of a communication topology, and the communication relationships between vehicles are time-varying. By employing the proposed strategy, the multi-vehicle system can significantly enhance its capability to strike high-defense/multi-interception facilities. Various simulation scenarios were considered to verify the effectiveness of the proposed control strategy.

关键词： Hegselmann-Krause model Impact time control guidance Proportional navigation guidance consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：