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

Operationally-Safe Peer-to-Peer Energy Trading in Distribution Grids: A Game-Theoretic Market-Clearing Mechanism

IEEE TRANSACTIONS ON SMART GRID 2022年第4期13卷 2897-2907页

作者： Belgioioso, Giuseppe Ananduta, Wicak Grammatico, Sergio Ocampo-Martinez, Carlos Swiss Fed Inst Technol Automat Control Lab CH-8092 Zurich Switzerland Delft Univ Technol Delft Ctr Syst & Control NL-2628 CD Delft Netherlands Univ Politecn Cataluna Automat Control Dept Barcelona 08028 Spain

In future distribution grids, prosumers (i.e., energy consumers with storage and/or production capabilities) will trade energy with each other and with the main grid. To ensure an efficient and safe operation of energy trading, in this paper, we formulate a peer-to-peer energy market of prosumers as a generalized aggregative game, in which a network operator is responsible to enforce the operational constraints of the system. We design a distributed market-clearing mechanism with convergence guarantee to an economically-efficient, strategically-stable, and operationally-safe configuration (i.e., a variational generalized Nash equilibrium). Numerical studies on the IEEE 37-bus testcase show the scalability of the proposed approach and suggest that active participation in the market is beneficial for both prosumers and the network operator.

关键词： Costs Reliability Peer-to-peer computing Couplings Automatic voltage control Distribution networks Production Prosumers energy management distributed algorithm generalized Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Online Multicell Coordinated MIMO Wireless Network Virtualization With Imperfect CSI

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2022年第12期21卷 10455-10471页

作者： Wang, Juncheng Liang, Ben Dong, Min Boudreau, Gary Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 1A1 Canada Ontario Tech Univ Dept Elect Comp & Software Engn Oshawa ON L1G 0C5 Canada Ericsson Canada Ottawa ON K2K 2V6 Canada

We consider online coordinated precoding design for downlink wireless network virtualization (WNV) in a multi-cell multiple-input multiple-output (MIMO) network with imperfect channel state information (CSI). In our WNV framework, an infrastructure provider (InP) owns each base station that is shared by several service providers (SPs) oblivious of each other. The SPs design their precoders as virtualization demands for user services, while the InP designs the actual precoding solution to meet the service demands from the SPs. Our aim is to minimize the long-term time-averaged expected precoding deviation over MIMO fading channels, subject to both per-cell long-term and short-term transmit power limits. We propose an online coordinated precoding algorithm for virtualization, which provides a fully distributed semi-closed-form precoding solution at each cell, based only on the current imperfect CSI without any CSI exchange across cells. Taking into account the two-fold impact of imperfect CSI on both the InP and the SPs, we show that our proposed algorithm is within an $O(\delta)$ gap from the optimum over any time horizon, where $\delta $ is a CSI inaccuracy indicator. Simulation results validate the performance of our proposed algorithm under two commonly used precoding techniques in a typical urban micro-cell network environment.

关键词： Precoding Virtualization MIMO communication Indium phosphide III-V semiconductor materials Optimization Downlink Wireless network virtualization massive MIMO imperfect CSI coordinated precoding Lyapunov optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Grid exploration by a swarm of autonomous robots with minimum repetitions

引用

THEORETICAL COMPUTER SCIENCE 2022年 933卷 67-87页

作者： Sardar, Madhumita Das, Deepanwita Mukhopadhyaya, Srabani Haji Md Serafat Mondal Govt Polytech Comp Sci & Technol Birbhum 731202 W Bengal India Natl Inst Technol Comp Sci & Engn Mahatma Gandhi Ave Durgapur 713209 W Bengal India Birla Inst Technol Lalpur Extens Ctr Comp Sci & Engn Ranchi 834001 Bihar India

We address the terminating exploration problem where a team of k autonomous robots explores a grid such that each node of the grid is visited at least once and all robots stop moving when the task is completed. Robots considered for the task are anonymous, asynchronous, oblivious and non-communicating that have unlimited visibility and a pebble each. Visiting a node more than once by the robots during exploration is a waste of energy due to energy constraints. In this work we aim at minimizing the total number of wasteful repeated visits of the nodes that occur during exploration. Our proposed algorithm explores a grid with minimum repeated visits of nodes. (c) 2022 Elsevier B.V. All rights reserved.

关键词： distributed algorithm Swarm Exploration Discrete domain

来源：评论

学校读者我要写书评

暂无评论

distributed optimal resource allocation over strongly connected digraphs: A surplus-based approach

引用

AUTOMATICA 2021年 125卷 109459-109459页

作者： Chen, Gang Li, Zhiyong Chongqing Univ Coll Automat Chongqing 400044 Peoples R China

In this brief, a surplus-based approach is proposed to solve the distributed optimal resource allocation problem over directed graphs. Two features distinguish our method from the existing distributed resource allocation schemes. The first one is that the proposed method can be implemented on general strongly connected graph and overcomes the asymmetry caused by the digraphs. The second one is that the proposed method enjoys the privacy-preserving property and avoids the privacy information leakage in the process of information exchange. The distributed algorithm is designed and analyzed by virtue of primal-dual methods, projected gradient, and eigenvalue perturbation theory. Furthermore, distributed economic dispatch in power system, as a simulation example, is used to illustrate the effectiveness of the presented distributed algorithm. (C) 2021 Elsevier Ltd. All rights reserved.

关键词： Resource allocation distributed algorithm Directed network Primal-dual dynamics

来源：评论

学校读者我要写书评

暂无评论

distributed Successive Convex Approximation for Nonconvex Economic Dispatch in Smart Grid

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2021年第12期17卷 8288-8298页

作者： Xu, Bowen Guo, Fanghong Zhang, Wen-An Wang, Wei Wen, Changyun Li, Zhengguo Zhejiang Univ Technol Dept Automat Hangzhou 310023 Peoples R China Beihang Univ Sch Automat Sci & Elect Engn Beijing 100191 Peoples R China Beihang Univ Beijing Adv Innovat Ctr Big Data & Brain Comp Beijing 100191 Peoples R China Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Agcy Sci Technol & Res SRO Dept Inst Infocomm Res Singapore 138632 Singapore

This article presents a distributed consensus-based successive convex approximation (DSCA) algorithm to solve nonconvex nondifferentiable economic dispatch (ED) problems. The ED model formulated incorporates generation constraints, valve-point effects, and multiple fuel types. A perturbation technique enables the proposed DSCA to tackle such a nondifferentiable and nonconvex optimization, which paves the way to solving more complicated optimization problems that occur in practical applications. The local generation constraint is taken care by a local surrogate convex optimization directly. The global equality constraint is handled based on a consensus protocol, where the local generation-demand mismatch among all dispatchable generators (DGs) is shared in a distributed manner. As a result, the power distribution of DGs is updated, and the generation cost is minimized. Several case studies show that the proposed DSCA algorithm can achieve superior ED solutions and computational efficiency over existing nonconvex optimization algorithms.

关键词： Approximation algorithms Smart grids Perturbation methods Heuristic algorithms Fuels Informatics Generators distributed algorithm economic dispatch (ED) nonconvex optimization smart grid successive convex approximation (SCA)

来源：评论

学校读者我要写书评

暂无评论

Energy Block-Based Peer-to-Peer Contract Trading With Secure Multi-Party Computation in Nanogrid

引用

IEEE TRANSACTIONS ON SMART GRID 2022年第6期13卷 4759-4772页

作者： Mu, Chenggang Ding, Tao Sun, Yuge Huang, Yuhan Li, Fangxing Siano, Pierluigi Xi An Jiao Tong Univ Sch Elect Engn Xian 710049 Shaanxi Peoples R China Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA Univ Salerno Dept Management & Innovat Syst I-84084 Fisciano Italy

The emergence of nanogrid has led to active local energy markets. Renewable energy sources and flexible energy storages in nanogrids provide favorable conditions for establishing a sustainable bilateral trading market. However, due to the diversity of energy sources in nanogrids, it is difficult to establish a uniform scheduling scheme. To this end, this paper first establishes an effective peer-to-peer energy block contract market to provide a scheme for users to exchange energy at any time interval. The goal is to maximize contract volume while ensuring the economic profitability of all users. Beyond that, a garbled circuit-based price comparison mechanism is proposed based on a secure multi-party computation to achieve price comparison without revealing any individual user's data to other users for privacy preserving. Finally, a fully distributed algorithm is designed by constructing a local tracker to track the inequality amount in iteration. The algorithm also subtly parses the input data, which weakens the intertwined relationship in peer-to-peer transactions and improves computation efficiency. Case studies verify the privacy of the described method and the effectiveness of the energy block contract market.

关键词： Contracts Peer-to-peer computing distributed algorithms Privacy Real-time systems Renewable energy sources Power system stability Energy block peer-to-peer secure multi-party computation distributed algorithm privacy preserving

来源：评论

学校读者我要写书评

暂无评论

Size-Based Congestion Control Using Network Utility Maximization

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2022年第2期9卷 550-561页

作者： Wang, Cao Andrew, Lachlan L. H. Mendivez Vasquez, Bruno L. Vu, Hai L. Monash Univ Melbourne Vic 3800 Australia Univ Wollongong Wollongong NSW 2522 Australia Univ Melbourne Melbourne Vic 3010 Australia

This article presents a method for allocating transmission rates in a communication network that uses the knowledge of the size of the file to be transmitted to seek to obtain the benefits of shortest remaining processing time (SRPT) scheduling. It provides fairness among file transmissions, taking into account their sizes and the congestion on the links they use. The proposed approach is based on network utility maximization (NUM), but with utility functions that vary in time depending on the remaining file size. A parameterized family of utility functions is proposed. For each value of the parameter, there is a threshold load such that an arbitrary network will be stable, provided that no link load exceeds that threshold. This is in contrast with SRPT, for which any nonzero load becomes unstable for topologies with sufficiently long paths. The method can be implemented by a distributed algorithm analogous to that of traditional NUM.

关键词： Congestion control context awareness distributed algorithm network utility maximization (NUM) resource allocation stability

来源：评论

学校读者我要写书评

暂无评论

Linear quadratic optimal consensus of discrete-time multi-agent systems with optimal steady state: A distributed model predictive control approach

引用

AUTOMATICA 2021年 127卷 109505-109505页

作者： Wang, Qishao Duan, Zhisheng Lv, Yuezu Wang, Qingyun Chen, Guanrong Beihang Univ Dept Dynam & Control Beijing Peoples R China Peking Univ Coll Engn Beijing Peoples R China Southeast Univ Sch Math Nanjing Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China

This paper develops a distributed model predictive control algorithm for linear quadratic optimal consensus of discrete-time multi-agent systems. The consensus state and control sequence are both optimized at every predictive step on a finite horizon and then implemented in the real system. The stability of the closed-loop system is analyzed, establishing a distributed consensus condition depending only on individual agent's local parameters. The consensus condition is then relaxed for controllable systems, making it easy to choose the weighted matrices and control period for each agent. The proposed algorithm is applied to the formation control of multi-vehicle systems verified by numerical simulations. (C) 2021 Elsevier Ltd. All rights reserved.

关键词： Model predictive control distributed algorithm Optimal consensus Formation control Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

A Time-Free Assumption for Solving Signature-Free Asynchronous Multivalued Byzantine Consensus

引用

INTERNATIONAL JOURNAL OF NETWORKED AND distributed COMPUTING 2023年第2期11卷 49-59页

作者： Nezzar, Abderafik Moumen, Hamouma Arar, Chafik Univ Batna 2 Dept Comp Sci LAMIE Batna 05078 Algeria

This paper tackles the asynchronous signature-free Byzantine consensus. One way to circumvent the FLP impossibility result consists in adding a Time-free assumption. This assumption is based on the pattern of messages that are exchanged. In the context of authenticated asynchronous Byzantine systems where at most t processes may exhibit a Byzantine behavior, Moumen and Mostefaoui provide the main result. They assume at least one correct process p(i), called lozenge(t + 1)-winning, and a set Q of t correct processes such that, eventually, for each query issued by p(i), any process p(j) of Q receives a response from p(i) among the (n - t) first responses to that query. The main contribution of this paper is to show that a deterministic solution for the Signature-free Byzantine consensus problem is possible if the system model satisfies an additional assumption that relies on the pattern of exchanged messages. To solve the Consensus problem, we assume a correct process p(i), called lozenge(2t + 1-winning, and a set Q of (2t + 1) correct processes (including p(i) itself) such that, eventually, for each query issued by p(i), any process p(j) of Q receives a response from p(i) among the (n - t) first responses to that query. The processes of the set Q may change over time. Based on this assumption, a Signature-free Multivalued Byzantine consensus protocol is proposed. Whereas many time-free protocols have been designed for the consensus problem in the crash model and in the Byzantine Authenticated model, this is, to our knowledge, the first time-free deterministic solution to the Signature-free Byzantine consensus Problem.

关键词： Asynchronous distributed system Byzantine process Consensus Signature-free Eventually winning link Fault tolerance distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Self-stabilizing spanner topology control solutions in wireless ad hoc networks

引用

THEORETICAL COMPUTER SCIENCE 2022年 922卷 395-409页

作者： Zhang, Xiujuan Wang, Yongcai Li, Deying Chen, Wenping Ding, Xingjian Renmin Univ China Sch Informat Beijing 100872 Peoples R China Qufu Normal Univ Sch Comp Sci Rizhao 276826 Peoples R China Beijing Univ Technol Sch Software Engn Beijing 100124 Peoples R China

Large-scale, self-organizing wireless ad hoc network deployments are being driven by recent developments of the Internet of Things (IoT) to collect information from a vast area or harsh environment efficiently. How to ensure fast routing in sparse topology and after node failure how to ensure that the network keeps topology properties are challenging problems. In this paper, we propose a Self-stabilizing dIrected t-Spanner for Autonomous nodes problem (SISA) and give intuitive solutions in both 2D and 3D space. In the topology construction phase, sparse directed t-spanner topologies, without substantially degrading the path connecting any pair of nodes in the original network, are constructed with a minimum number of messages. In the topology maintenance phase, the self-stabilizing algorithms run in the background to update locally for keeping t-spanner property when some nodes fail. In particular, our solutions have not any central daemon and are completely distributed. Our experimental results demonstrate the effectiveness and efficiency of our proposed solutions. (C) 2022 Elsevier B.V. All rights reserved.

关键词： Ad hoc network Spanner distributed algorithm Self-stabilizing 3D

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：