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

distributed Adaptive Droop Control for Optimal Power Dispatch in DC Microgrid

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2018年第1期65卷 778-789页

作者： Hu, Jian Duan, Jie Ma, Hao Chow, Mo-Yuen Zhejiang Univ Coll Elect Engn Hangzhou 310027 Zhejiang Peoples R China Noth Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA

In this paper, a coordinated adaptive droop control is addressed for DC microgrid to optimize its power distribution. The optimal solution for economical dispatch problem (EDP) of the microgrid is found through a fully distributed hierarchical control. The consensus-based economical regulator calculating the optimal solution for the generator is fully distributed. Thus, it eliminates the requirement of centralized coordinator. The droop controller receives the reference from the economical regulator and ensures the output power converging to the reference while maintaining the power balance of the system. Moreover, the economical regulator can estimate the load information of the system based on the characteristics of droop control. Thus, the information from load or renewable energy source is no longer required to solve the EDP that consequently decreases the number of communication nodes. This will reduce infrastructure cost, enhance the reliability, and fasten the converging speed of algorithm. The dynamic model is established and parameter selection guideline are given in this paper. A low-voltage dc-microgrid prototype platform is utilized to validate the effectiveness of the proposed control.

关键词： DC microgrid distributed algorithms economical dispatch optimization

来源：评论

学校读者我要写书评

暂无评论

Consumer-Aware distributed Demand-Side Contingency Service in the Power Grid

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2018年第4期5卷 1987-1997页

作者： Brooks, Jonathan Barooah, Prabir Univ Florida Dept Mech & Aerosp Engn Gainesville FL 32611 USA

We consider the problem of flexible loads providing contingency reserves to the electric grid. We provide a distributed gradient projection (DGP) algorithm to minimize loads' disutility while providing contingency services. Loads use locally obtained grid-frequency measurements and inter-load communication to coordinate their actions. Privacy is preserved: disutility or consumption information is not exchanged. We provide a proof of convergence of the algorithm and compare its performance through simulations to that of a "dual algorithm" previously proposed in the literature that solved the dual problem. The DGP algorithm solves the primal problem. Its main advantage over the dual algorithm is that it is applicable to convex-but not necessarily strictly convex-consumer disutility functions, whereas the dual algorithm is not. A disutility function that is not strictly convex can better model consumer behavior than one that is strictly convex, since it is insensitive to small changes in consumption. Simulations show that the DGP algorithm is effective in arresting grid-frequency deviations, and performs better or similarly to the dual algorithm in cases where the two can be compared.

关键词： distributed algorithms load management optimization smart grids

来源：评论

学校读者我要写书评

暂无评论

UAV-aided Weak-Barrier Coverage with Adaptive Sensor Rotation 13

UAV-aided Weak-Barrier Coverage with Adaptive Sensor Rotatio...

引用

13th Annual IEEE International Systems Conference (SysCon)

作者： Aranzazu-Suescun, Catalina Cardei, Mihaela Florida Atlantic Univ Dept Comp & Elect Engn Boca Raton FL 33431 USA

ISBN: (纸本)9781538683965

Unmanned Aerial Vehicles (UAVs) is an emerging technology with many applications in surveillance, remote sensing, transportation, scientific research, search and rescue, and many more. In wireless sensor networks, UAVs have been used as mobile sinks and as relay nodes when the network is partitioned. When deploying sensors to monitor large boundaries or borders, sensors are usually dispersed from an aircraft following a predetermined path. In such scenarios sensing gaps are typically unavoidable. In this paper, we consider a wireless network consisting of randomly deployed sensor nodes, directional border nodes, and an UAV. We address the topic of weak-barrier coverage, which detects intruders (or events) moving north-south. We propose a distributed algorithm for weak-barrier coverage, that allows border nodes to dynamically compute their orientation based on notifications from sensor nodes. The UAV is used to monitor barrier gaps and increase the number of intruders detected when crossing the border. We use simulations using MatLab to analyze the performance of our algorithm, and to illustrate the impact of using an UAV in monitoring, when we vary various parameters such as the number of nodes, the view angle of the border nodes, and the event speed.

关键词： Adaptive Rotation distributed algorithms Unmanned Aerial Vehicle Weak-barrier Coverage Wireless Sensor Network

来源：评论

学校读者我要写书评

暂无评论

distributed STOCHASTIC APPROXIMATION WITH LOCAL PROJECTIONS

引用

SIAM JOURNAL ON OPTIMIZATION 2018年第4期28卷 3375-3401页

作者： Shah, Suhail Mohmad Borkar, Vivek S. Indian Inst Technol Dept Elect Engn Bombay 400076 Maharashtra India

We propose a distributed version of a stochastic approximation scheme constrained to remain in the intersection of a finite family of convex sets. The projection to the intersection of these sets is also computed in a distributed manner and a "nonlinear gossip" mechanism is employed to blend the projection iterations with the stochastic approximation using multiple time scales.

关键词： distributed algorithms stochastic approximation projection differential inclusions multiple time scales

来源：评论

学校读者我要写书评

暂无评论

Topology Distribution for Video-Conferencing Applications 10

Topology Distribution for Video-Conferencing Applications

引用

10th IEEE International Conference on Networks of the Future (NoF)

作者： Altamirano Silva, Mauricio Bertone, Raul Schaefer, Joerg Frankfurt Univ Appl Sci Fac Comp Sci & Engn Nibelungenpl 1 D-60318 Frankfurt Germany

ISBN: (纸本)9781728144450

We describe an architecture and an implementation to support arbitrary real-time video and audio conferences (or any other streaming applications) based on WebRTC. Our solution makes use of a hybrid approach where the media streams are distributed over a peer-to-peer (P2P) architecture and the control data is coordinated using a centralized service. It is based on a topology-distance algorithm developed by one of the authors to optimize latency and other QoS metrics. It also makes use of an open source protocol developed by the authors - the Adaptive Topology Orchestration Protocol (ATOP), which is described in a forthcoming publication. Our architecture comprises a modular design to support a flexible approach addressing the different requirements of several use cases such as broadcast, many-to-many and one-to-one or a mixture between any of these. We compare our architecture and its performance to existing alternative approaches to support our design choices. The performance figures presented deliver also important information about the scalability of our approach.

关键词： distributed algorithms peer-to-peer geolocation WebRTC WebSocket overlay multicast tree videoconference

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning for the Coexistence of LAA-LTE and WiFi Systems

Deep Reinforcement Learning for the Coexistence of LAA-LTE a...

引用

IEEE International Conference on Communications (IEEE ICC)

作者： Tan, Junjie Zhang, Lin Liang, Ying-Chang Niyato, Dusit UESTC Chengdu Sichuan Peoples R China Nanyang Technol Univ Singapore Singapore

ISBN: (纸本)9781538680889

As a promising technique to handle the conflict between the explosive mobile traffic and scare spectrum resource, license-assisted access (LAA) has been proposed to operate the LTE network on the unlicensed band. This paper considers the LAA-LTE system coexisting with an unsaturated WiFi system. Specifically, deep reinforcement learning (DRL) is adopted to enable the LAA-LTE system to learn the traffic pattern of the WiFi system and adaptively optimize its transmission time in each frame. Different from conventional coexistence schemes, which require massive signaling exchanges between the two systems to achieve fairness, the proposed DIM-based algorithm can maximize the spectrum usage while protecting the WiFi system without such signaling requirements. Simulation results demonstrate that the proposed scheme can achieve almost the same LAA-LTE throughput and protection to the WiFi system of the genie-aided exhaustive search algorithm, which has high complexity and requires to know the WiFi information perfectly.

关键词： Optimization Heuristic algorithms Convergence Resource management Standards distributed algorithms Transient analysis"

来源：评论

学校读者我要写书评

暂无评论

DECK: A distributed, asynchronous and exact k-connectivity detection algorithm for Wireless Sensor Networks

引用

COMPUTER COMMUNICATIONS 2018年 116卷 9-20页

作者： Akram, Vahid Khalilpour Dagdeviren, Orhan Ege Univ Int Comp Inst Izmir Turkey

Wireless Sensor Networks (WSNs) are one of the widespread platforms for communications and remote sensing. A robust WSN should tolerate the failures of nodes without losing the connection to active nodes. A network is k-connected if all active nodes remain connected after failures in k-1 arbitrary nodes. Finding (detecting) the k value in a WSN is a significant operation to estimate the connectivity robustness, reliability and load balancing level of the network. Also, the detection of k values provides useful information for connectivity restoration, lower bound of node degree, critical nodes and possible cycles. In this paper, we propose an asynchronous distributed algorithm (DECK) for k-connectivity detection in WSNs. In the proposed algorithm, each node estimates a local k using its 2-hop neighborhood information and then a distributed linked list of minimum estimations is created between the nodes. Finally, the sink node validates the correctness of detected values by finding the number of node-disjoint paths to the node having the minimum estimation. We analyze our algorithm in detail, provide theoretical analysis, testbed experiments on the IRIS nodes and simulation results in the TOSSIM simulator by comparing with the other algorithms. The comprehensive testbed and simulation results show that the proposed algorithm always finds exact k values with reasonable energy consumption while the correct detection ratios of existing distributed algorithms on similar networks are usually less than 40%.

关键词： Wireless Sensor Networks Fault tolerance k-connectivity detection distributed algorithms Asynchronous algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Coordination of DERs With Storage for Dynamic Economic Dispatch

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2018年第3期63卷 835-842页

作者： Cherukuri, Ashish Cortes, Jorge Univ Calif San Diego Dept Mech & Aerosp Engn La Jolla CA 92093 USA

This paper considers the dynamic economic dispatch problem for a group of distributed energy resources (DERs) with storage that communicate over a weight-balanced strongly connected digraph. The objective is to collectively meet a certain load profile over a finite time horizon while minimizing the aggregate cost. At each time slot, each DER decides on the amount of generated power, the amount sent to/drawn from the storage unit, and the amount injected into the grid to satisfy the load. Additional constraints include bounds on the amount of generated power, ramp constraints on the difference in generation across successive time slots, and bounds on the amount of power in storage. We synthesize a provably correct distributed algorithm that solves the resulting finite-horizon optimization problem starting from any initial condition. Our design consists of two interconnected systems, one estimating the mismatch between the injection and the total load at each time slot, and another using this estimate to reduce the mismatch and optimize the total cost of generation while meeting the constraints.

关键词： distributed algorithms optimization methods power generation dispatch smart grids

来源：评论

学校读者我要写书评

暂无评论

Generalized Coverage Control for Time-Varying Density Functions 18

Generalized Coverage Control for Time-Varying Density Functi...

引用

18th European Control Conference (ECC)

作者： Kennedy, James Chapman, Airlie Dower, Peter M. Univ Melbourne Dept Mech Engn Melbourne Vic Australia Univ Melbourne Dept Elect & Elect Engn Melbourne Vic Australia

ISBN: (纸本)9783907144008

The coverage control problem for robotic networks focuses on distributively coordinating the positioning of multiple dynamic agents to provide sensor coverage across a bounded region in two dimensional space. The associated optimal coverage problem seeks to position these agents so as to minimize an associated coverage cost. This coverage cost is typically defined with respect to a density function that is used to bias the network towards desired configurations. Previous approaches to this optimal coverage problem have addressed both static and dynamic environments through the choice of density function;however, stability guarantees for time-varying densities are restricted by significant technical assumptions that simplify the underlying proofs at the expense of limited applicability. In this paper, a generalized algorithm is presented that guarantees practical stability under relaxed technical assumptions. The algorithm, and its convergence, is illustrated via simulation examples.

关键词： distributed algorithms Mobile sensing networks Multi-agent coverage

来源：评论

学校读者我要写书评

暂无评论

Mechanism Design for Network Utility Maximization with Private Constraint Information

Mechanism Design for Network Utility Maximization with Priva...

引用

IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Zhang, Meng Huang, Jianwei Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China Chinese Univ Hong Kong Sch Engn & Sci Shenzhen Peoples R China

ISBN: (纸本)9781728105154

Network utility maximization (NUM) is a general framework 14 optimally allocating constrained resources in many networked applications. When agents have asynunetric and private information, a fundamental economic challenge is how to solve the NUM Problem considering the self-interests of strategic agents. Many previous related works have proposed economic mechanisms that can cope with agents' private utilities. However, the related literature largely neglected the issue of information asymmetries regarding constraints, and limited closely related studies provided solutions only applicable to specific application scenarios. To tackle this issue, we propose the DeNUM Mechanism, the first mechanism for solving a general class of decomposable NUM Problems considering both private utility and constraint information. The key idea is to decentralize the decision process to agents, who will make resource allocation decisions without the need of revealing private information to others. We further show that the DeNUM mechanism yields the network-utility maximizing solution at an equilibrium, and achieves other desirable economic properties (such as individual rationality and budget balance). However, the corresponding equilibrium solution concept, the generalized Nash equilibrium (GNE), makes it difficult to achieve through a distributed algorithm. To address this issue, we further establish the connection between the structure of GNE and that of the primal-dual solution to a reformulated NUM problem, based on which we present the convergent DeNUM Algorithm that is provably convergent. Finally, as a case study, we apply the DeNUM Mechanism to solving the NUM problem 14 a user-provided network, and show that the DeNUM algorithm improves the network utility by 17% compared to a non-cooperation benchmark.

关键词： Resource management distributed algorithms Optimization Economics Throughput Nash equilibrium Bandwidth

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：