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

Optimal and distributed energy management in interconnected energy hubs

APPLIED ENERGY 2024年 365卷

作者： Azimi, Maryam Salami, Abolfazl Javadi, Mohammad S. Catalao, Joao P. S. Arak Univ Technol Dept Elect Engn Arak Iran Technol & Sci INESC TEC Inst Syst & Comp Engn Porto Portugal Univ Porto Fac Engn Res Ctr Syst & Technol SYSTEC Adv Prod & Intelligent Syst Associate Lab ARISE P-4200465 Porto Portugal

Recently, multi-carrier energy systems (MCESs) have been rapidly developed as flexible multi-generation systems aiming to satisfy load demands by purchasing, converting, and storing different energy carriers. This study specifically focuses on the optimal and robust large-scale coordination of interconnected energy hubs (IEHs) in an iterative consensus-based procedure considering distribution network losses. Furthermore, a new robustbased hybrid IGDT/consensus algorithm is introduced to achieve risk-averse optimal energy management in IEHs under uncertainty. The fast convergence, needless to collect the total information from all hubs, minimal computational burden, and more robust communication system are the most important features of the proposed distributed consensus algorithm in this study. The effectiveness of the proposed consensus algorithm is verified by simulation results considering various energy trading structures in IEHs at different scales. The obtained results highlight the scalability capability of the proposed method. Regarding an IEHS of 30 energy hubs, the computation burden is lightened by 0.53 (s) and 0.1917 (s), respectively with and without uncertainty. Considering distribution network losses, the total purchasing costs can be increased by 8%. The simulation results also reveal an increase of 11% in the total power trading under the uncertainty.

关键词： consensus algorithm Multi-carrier energy systems Interconnected energy hubs Uncertainty

来源：评论

学校读者我要写书评

暂无评论

k-Dimensional Agreement in Multiagent Systems

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2024年第12期69卷 8978-8985页

作者： Bianchin, Gianluca Vaquero, Miguel Cortes, Jorge Dall'Anese, Emiliano Univ Louvain ICTEAM Inst B-1348 Ottignies Louvain La Neuv Belgium Univ Louvain Dept Math Engn B-1348 Ottignies Louvain La Neuv Belgium IE Univ Sch Sci & Technol Segovia 40003 Spain Univ Calif San Diego Dept Mech & Aerosp Engn La Jolla CA 92093 USA Boston Univ Dept Elect & Comp Engn Boston MA 02215 USA

Given a network of agents, we study the problem of designing a distributed algorithm that computes k independent weighted means of the network's initial conditions (namely, the agents agree on a k-dimensional space). Akin to average consensus, this problem finds applications in distributed computing and sensing, where agents seek to simultaneously evaluate k independent functions at a common point by running a single coordination algorithm. We show that linear algorithms can agree on quantities that are oblique projections of the vector of initial conditions, and we provide techniques to design protocols that are compatible with a pre-specified communication graph. More broadly, our results show that a single agreement algorithm can solve k consensus problems simultaneously at a fraction of the complexity of classical approaches but, in general, it requires higher network connectivity.

关键词： Protocols Vectors Sensors Robot sensing systems consensus algorithm Computational modeling Multi-agent systems consensus algorithms decentralized control graph theory linear time-invariant (LTI) systems multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-Based Trust-Value Management Approach for Secure Information Sharing in Internet of Vehicles

引用

IEEE INTERNET OF THINGS JOURNAL 2024年第1期11卷 333-344页

作者： Du, Gangxin Cao, Yangjie Li, Jie Zhuang, Yan Chen, Xianfu Li, Yibing Chen, Jianhuan Zhengzhou Univ Sch Cyber Sci & Engn Zhengzhou 450003 Peoples R China Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai Peoples R China VTT Tech Res Ctr Finland Oulu 90570 Finland Zhengzhou Univ Sch Comp & Artificial Intelligence Zhengzhou 450001 Peoples R China

Information sharing among vehicles plays a critical role in improving driving safety and traffic loads in Internet of Vehicles (IoV). However, due to the existence of malicious vehicles, information sharing among vehicles lacks a trustworthy environment. It is challenging for a vehicle to assess the credibility of the received information. Blockchain has attracted extensive attention because of the decentralization and tamper-proof characteristics. Nevertheless, the high mobility of vehicles leads to rapid network topology changes, which makes it difficult to reach a consensus. In this article, we propose a consortium blockchain-based trust-value management approach to build a trustworthy environment for information sharing among vehicles. A new incentive mechanism is designed to encourage vehicles to actively participate in blockchain maintenance. Furthermore, an Enhanced Proof of Work (EPoW) consensus algorithm is designed to reduce the amount of information that needs to be transmitted over the network to reach consensus quickly. Comprehensive analysis and simulation results verify that the proposed trust-value management approach and EPoW consensus algorithm realize secure and efficient information sharing in IoV.

关键词： Blockchains Information sharing Security Reliability consensus algorithm Trust management Base stations Blockchain information sharing Internet of Vehicles (IoV) trust-value management

来源：评论

学校读者我要写书评

暂无评论

Distributed Cooperative Control Strategy for Stable Voltage Restoration and Optimal Power Sharing in Islanded DC Microgrids

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2024年第2期39卷 3431-3443页

作者： Zeng, Yuji Zhang, Qinjin Liu, Yancheng Guo, Haohao Zhang, Fengkui Dalian Maritime Univ Coll Marine Engn Dalian 116026 Peoples R China

Conventionally, voltage regulation and economic dispatch in DC microgrid are performed at different time scales, which cannot keep the distributed generators (DGs) at the optimal operating point in real time. In this article, a novel distributed cooperative control strategy is proposed to synchronously achieve stable bus voltage restoration and optimal power sharing in islanded DC microgrids. The proposed strategy breaks the constraints of hierarchical control strategies, and incorporates the objectives of voltage regulation and economic dispatch into a distributed cooperative control framework to eliminate average bus voltage deviation and minimize total power generation costs in real time. The stability of the proposed strategy is verified by eigenvalue analysis and steady-state analysis. Furthermore, the concept of "incremental cost (IC) margin" is introduced in cooperative control considering capacity constraints to avoid the converter output power violation and performance degradation. Finally, the MATLAB/Simulink simulation and StarSim HIL experimental results verify the effectiveness and robustness of the proposed strategy in an islanded DC microgrid under various testing scenarios.

关键词： Bus voltage restoration consensus algorithm DC microgrid distributed cooperative control economic dispatch

来源：评论

学校读者我要写书评

暂无评论

A high-capacity slicing PBFT protocol based on reputation evaluation model

引用

WIRELESS NETWORKS 2024年第9期30卷 7469-7482页

作者： Chen, Pengyu Chen, Yuling Wang, Xuewei Yuan, Linlin Tan, Chaoyue Yang, Yuxiang Guizhou Univ State Key Lab Publ Big Data Huaxi St Guiyang 550025 Peoples R China Guizhou Univ Coll Comp Sci & Technol Huaxi St Guiyang 550025 Peoples R China Weifang Univ Sci & Technol Comp Coll Jinguang St Weifang 261000 Peoples R China GuiZhou Vocat Technol Inst Yuntum St Guiyang 550023 Peoples R China

Consortium blockchains, characterized by regulated blockchain technologies with limited authorization management, have gained popularity in various domains, including supply chain, Internet of Things (IoT), justice, and education, and have now become an integral part of production life. Ensuring information consistency in blockchains, the practical byzantine fault tolerance (PBFT) consensus algorithm is deemed more suitable for application in partially decentralized systems. However, existing consensus algorithms for consortium blockchains exhibit limited effectiveness. Particularly, with the number of nodes increasing, the performance of PBFT for consortium blockchains declines significantly, hindering the development of large-scale consortium blockchains. In this paper, we propose a novel consensus algorithm called reputation slice practical byzantine fault tolerance (RSPBFT) based on the reputation evaluation model. The RSPBFT adopts a slicing approach, achieving broad consensus through orchestrated micro-consensuses. Moreover, the reputation evaluation model assigns distinct reputation evaluation scores to nodes, with high-scoring nodes being preferred as leaders. A concept of "Gray-Area" is introduced to enhance the stability of the consensus model by distinguishing different node types. Simulation experiments demonstrate that in large-scale node deployment scenarios, RSPBFT outperforms other consensus algorithms. Furthermore, in consortium blockchain environments with an equal number of nodes as other consensus models, RSPBFT exhibits superior consensus stability.

关键词： Byzantine fault tolerance Blockchain PBFT consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Balanced scheduling method of ideological and political teaching resources based on cluster analysis algorithm

引用

International Journal of Reasoning-based Intelligent Systems 2025年第1期17卷 1-8页

作者： Liu, Wenbin Department of Management Hunan City University Yiyang Hunan413000 China

In order to overcome the problems of poor scheduling accuracy, low recall rate and long scheduling time in the traditional scheduling method of ideological and political resources, the paper proposes a balanced scheduling method of resources based on clustering analysis algorithm. First, the load time series of the teaching resource server is determined and pre-processed. Secondly, cluster analysis is used to classify the data. Finally, according to the classification results, the balanced scheduling function of resources is constructed, and the particle swarm optimisation algorithm is used to solve the scheduling function to obtain the final scheduling strategy. The results show that the scheduling accuracy of the proposed method is 99.12%, the recall rate is up to 95%, the scheduling time is controlled within 7 s, and the resource balance scheduling effect is good. Copyright © 2025 Inderscience Enterprises Ltd.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Tree Proof-of-Position algorithms

引用

IEEE Internet of Things Journal 2025年第11期12卷 16393-16409页

作者： Manzano Kharman, Aida Ferraro, Pietro Hamedmoghadam, Homayoun Shorten, Robert Imperial College London Dyson School of Design Engineering LondonSW7 2DB United Kingdom

A growing issue across multiple fields involves verifying that an individual or object is truly in the location it claims to be and, despite the significance of this problem, the scientific community has not extensively explored how to provide proof for such claims. Accordingly, this article presents a novel class of proof-of-position algorithms: tree-proof-of-position (T-PoP). These algorithms are decentralized, collaborative and can be computed in a privacy preserving manner, such that agents do not need to reveal their position publicly. We make no assumptions of honest behavior in the system, and consider varying ways in which agents may misbehave. T-PoP is therefore resilient to adversarial scenarios, which makes it suitable for a wide class of applications, namely those where trust in a centralized infrastructure may not be assumed, or high security risk scenarios. Our algorithm has a worst case quadratic runtime, making it suitable for hardware constrained IoT applications. We also provide a mathematical model that summarizes T-PoP’s performance for varying operating conditions. Using a large number of agent-based simulations, we verify the agreement between TPoP’s performance and our mathematical predictions. T-PoP can achieve high levels of reliability and security by tuning its operating conditions, both in high and low density environments. Finally, we also present a mathematical model to probabilistically detect platooning attacks. © 2014 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Lightweight privacy preservation blockchain framework for healthcare applications using GM-SSO

引用

RESULTS IN ENGINEERING 2025年 25卷

作者： Padma, Adla Ramaiah, Mangayarkarasi Vellore Inst Technol Sch Comp Sci Engn & Informat Syst Vellore 632014 Tamil Nadu India

Data security and privacy are crucial for the Internet of Medical Things (IoMT) and the digitization of healthcare systems. IoMT offers a revolutionary approach to healthcare monitoring, enabling remote patient interaction, sensor data collection, and even in-body implants. However, its wireless nature creates significant security vulnerabilities, and robust security mechanisms are essential to ensure patient trust. Hence, a lightweight privacy preservation mechanism based on blockchain and consensus is developed with minimal computational overhead. Initially, the reputation score is computed for every registered node using the confidence threshold value and transaction to verify the trustworthiness of the IoMT nodes. Tiny Feistel Cipher Encryption technique (TFCEA), a lightweight cryptographic technique, has been proposed to encrypt IoMT data. Based on the computed trust score, an Adaptive Proof of Work (APoW) consensus algorithm has been used to regulate block creation. APoW implements the Genetically Modified Salp Swarm Optimization (GM-SSO) algorithm for the node selection. To make it lightweight, the experimentation used the lightweight cryptographic algorithm and fine-tuned consensus APOW to facilitate the addition of new blocks according to their trust score. In terms of performance analysis, the presented experiments are benchmarked with the well-established works in the candidate domain. Tested results reveal its economic affordability by attaining 243.513 ms for 500 records as an execution time. An informal security analysis has been carried out to justify the robustness of the presented framework against various attacks. To increase resilience against cyber-attacks and ensure reliability in healthcare data security, Modified Principal Component Analysis (MPCA) enabled anomaly detection models were built using the BoT-IoT dataset. Tested models achieve 99.99% and 98.75% accuracy, indicating that the developed model is more suitable to prevent the possible

关键词： Privacy preservation Trustworthiness Lightweight encryption Blockchain consensus algorithm Attack mitigation Modified principal component analysis

来源：评论

学校读者我要写书评

暂无评论

A two-population artificial tree algorithm based on adaptive updating strategy for dominant populations

引用

Soft Computing 2025年第4期29卷 2075-2106页

作者： Xiao, Yaping Niu, Linfeng Li, Qiqi School of Economics Central South University of Forestry and Technology Hunan Province Changsha City410004 China College of Mechanical and Vehicle Engineering Changsha University of Science & Technology Hunan Province Changsha City410114 China

An artificial tree (AT) algorithm has been proposed recently, and the performance of AT has been enhanced because of the introduction of improved AT algorithm with two-population (IATTP). However, the branch update operators of IATTP cannot effectively balance exploration and exploitation, which limits the optimization accuracy and efficiency of IATTP. To further improve the performance of IATTP, this work proposes a two-population artificial tree algorithm based on adaptive updating strategy for dominant populations (TATAD). In TATAD, six operators named self-evolution operator 2, crossover operator 2, improved self-evolution operator, gradient descent update operator, Gauss and Cauchy variational operator, and random traceless Sigma variational operator are applied to form an operator library. A dominant operator dynamic following mechanism is proposed to assign these six operators to the two populations in an optimal pairing scheme. Both populations and operators compete with each other, and the advantages of all operators are fully utilized. Moreover, the combination of diverse operators and dominant operator dynamic following mechanism can effectively balance the exploration and exploitation of TATAD. The performance of TATAD is compared with four AT algorithms and six efficient algorithms through typical test functions, and their results are bested by Wilcoxon rank sum test (WRST) and Friedman ranking test. It is found that TATAD is the most competitive algorithm among these algorithms for solving these optimization problems. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

consensus of Multi-Agent Systems Under Binary-Valued Measurements and Recursive Projection algorithm

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2020年第6期65卷 2678-2685页

作者： Wang, Ting Zhang, Hang Zhao, Yanlong Chinese Acad Sci Acad Math & Syst Sci Inst Syst Sci Key Lab Syst & Control Beijing 100190 Peoples R China

This paper studies consensus problems of multi-agent systems with binary-valued communications. Different from most existing works, the agents considered in this paper can only get binary-valued observations of its neighbors' states with random noises. A consensus algorithm is proposed: first, each agent estimates its neighbors' states by the recursive projection algorithm;then, each agent designs the control timely based on the estimates. It is proved that the estimates of the states can converge to the true states with a faster convergence rate than that in the parameter estimation. Moreover, the states of the agents can achieve mean-square consensus, and the corresponding consensus speed can achieve O(1/t) under certain conditions. Finally, simulations are given to demonstrate the theoretical results.

关键词： Convergence consensus algorithm Projection algorithms Noise measurement Estimation Multi-agent systems Approximation algorithms Binary-valued communications convergence convergence rate consensus control estimate multi-agent systems recursive projection algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：