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

13th International Conference on algorithms and Computation (WALCOM)

作者： Bose, Kaustav Adhikary, Ranendu Kundu, Manash Kumar Sau, Buddhadeb Jadavpur Univ Dept Math Kolkata India

ISBN: (纸本)9783030105648;9783030105631

The ARBITRARY PATTERN FORMATION problem asks to design a distributed algorithm that allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern given as input. The problem has been extensively studied in literature in continuous domains. This paper investigates a discrete version of the problem where the robots are operating on a two dimensional infinite grid. The robots are assumed to be autonomous, identical, anonymous and oblivious. They operate in Look-Compute-Move cycles under a fully asynchronous scheduler. The robots do not agree on any common global coordinate system or chirality. We have shown that a set of robots can form any arbitrary pattern, if their starting configuration is asymmetric.

关键词： distributed algorithm Autonomous robots Arbitrary Pattern Formation Grid Asynchronous Look-Compute-Move cycle

来源：评论

学校读者我要写书评

暂无评论

distributed solution to DC optimal power flow with congestion management

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2018年第Feb.期95卷 73-82页

作者： Xu, Yinliang Sun, Hongbin Liu, Houde Fu, Qing TBSI Shenzhen 518055 Guangdong Peoples R China Tsinghua Univ Dept Elect Engn State Key Lab Power Syst Beijing 100084 Peoples R China Tsinghua Univ Grad Sch Shenzhen Shenzhen 518055 Guangdong Peoples R China Sun Yat Sen Univ Guangdong Engn Res Ctr Green Power Convers & Inte Sch Phys Guangzhou 510275 Guangdong Peoples R China

distributed generations contribute to the supply diversity as well as competitiveness of the electric market. Electric power supplies and load users all seek to optimally allocate/utilize the energy to maximize their benefits. However, maximizing the social welfare should not be the sole objective since line congestion can lead to serious problems. This paper proposes a fully distributed solution to DC optimal power flow with congestion management. The objective is to maximize the social welfare, while maintaining the supply-demand balance and relieving transmission line congestion. The proposed algorithm only requires information exchange among neighboring participants which leads to simpler realization and less expenditure for communication network and powerful central controller comparing to traditional centralized algorithms. It is adaptive to topology changes and scalable to large systems. Simulation results of the 5-& IEEE 30-bus systems demonstrate the effectiveness of the proposed distributed algorithm and indicate its promising applications to the electric market. (C) 2017 Elsevier Ltd. All rights reserved.

关键词： distributed algorithm distributed generation Social welfare Congestion management DC optimal power flow

来源：评论

学校读者我要写书评

暂无评论

Proving distributed algorithms for Wireless Sensor Networks by Combining Refinement and Local Computations

Proving Distributed Algorithms for Wireless Sensor Networks ...

引用

IEEE International Conference on Enabling Technologies

作者： Emna Taktak Mohamed Mosbah Mohamed Tounsi Ahmed Hadj Kacem ReDCAD Laboratory University of Sfax Tunisia LaBRI CNRS France

Description of computations which can be easily specified with Event-B. We illustrate our approach by an example of distributed algorithm for WSN.

关键词： Wireless Sensor Network distributed algorithm Local computations Refinement Formal proofs

来源：评论

学校读者我要写书评

暂无评论

Demand-Response-Based distributed Preventive Control to Improve Short-Term Voltage Stability

引用

IEEE TRANSACTIONS ON SMART GRID 2018年第5期9卷 4785-4795页

作者： Dong, Yipeng Xie, Xiaorong Shi, Wenbo Zhou, Baorong Jiang, Qirong Tsinghua Univ Dept Elect Engn State Key Lab Power Syst Beijing 100084 Peoples R China Harvard Univ Harvard Ctr Green Bldg & Cities Cambridge MA 02138 USA Elect Power Res Inst China Southern Power Grid Guangzhou 510080 Guangdong Peoples R China

Short-term voltage stability (STNS) issues pose a significant threat to modern power systems. Based on extensive observations of STVS events, their primary predictors can he summarized as summer peak load levels with a high percentage of air conditioners, and occurrence of faults caused by thunderstorms or other emergencies. The predictors can he used as the triggering signals for preventive voltage control (PVC). Previous design of PVC dominantly focuses on the improvement of long-term voltage stability, and demand response (DR) resources are not fully utilized. In this paper, a DR-based PVC method is proposed to improve STVS if the day-ahead forecast indicates that the system will experience high STVS risk. We formulate PVC as an optimal power flow problem and solve it in a distributed manner, where the central controller (CC) and the local controllers jointly compute an optimal schedule. Thus, the computational burden of the CC is reduced compared with the existing centralized algorithms, and customer privacy is well protected. The simulation results not only verify the advantage of the improved index, but also demonstrate the fast convergence and effectiveness of the distributed PVC, which, therefore, offers an alternative approach to improve STVS.

关键词： Short-term voltage stability demand response preventive voltage control distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Transactive Energy Trading Framework in Distribution Networks

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2018年第6期33卷 7215-7227页

作者： Li, Jiayong Zhang, Chaorui Xu, Zhao Wang, Jianhui Zhao, Jian Zhang, Ying-Jun Angela Hong Kong Polytech Univ Dept Elect Engn Hong Kong Hong Kong Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China Southern Methodist Univ Dept Elect Engn Dallas TX 75205 USA Shanghai Univ Elect Power Dept Elect Power Engn Shanghai 200090 Peoples R China Hong Kong Polytech Univ Hong Kong Hong Kong Peoples R China

In this paper, we propose a novel transactive energy trading (TET) framework to deal with the economic issues in energy trading and the technical issues in distribution system operation in a holistic manner. In particular, we innovatively integrate a bilateral energy trading mechanism with the optimal power flow (OPF) technique to increase economic benefits to individual participants, and meanwhile ensure the reliability and security of the system operation. In order to resolve the inherent conflict of interests, Nash bargaining theory is used to model the TET problem, which is further decomposed into a multiperiod OPF problem and a payment bargaining problem. Moreover, we develop an efficient distributed algorithm for solving the TET problem base on alternating direction method of multipliers (ADMM). Instead of directly solving optimization subproblems like most ADMM-based distributed algorithms, we derive closed-form solutions to all subproblems to significantly improve the computational efficiency. Finally, numerical tests on the IEEE 37-bus and 123-bus distribution systems demonstrate the effectiveness of our proposed framework and the efficiency of our distributed algorithm.

关键词： Transactive energy bilateral energy trading distribution networks photovoltaic system Nash bargaining alternating direction method of multipliers distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Dispersion of Mobile Robots on Graphs 19

Efficient Dispersion of Mobile Robots on Graphs

引用

20th International Conference on distributed Computing and Networking (ICDCN)

作者： Kshemkalyani, Ajay D. Ali, Faizan Univ Illinois Chicago IL 60612 USA

ISBN: (纸本)9781450360944

The dispersion problem on graphs requires k robots placed arbitrarily at the n nodes of an anonymous graph, where k <= n, to coordinate with each other to reach a final configuration in which each robot is at a distinct node of the graph. The dispersion problem is important due to its relationship to graph exploration by mobile robots, scattering on a graph, and load balancing on a graph. In addition, an intrinsic application of dispersion has been shown to be the relocation of self-driven electric cars (robots) to recharge stations (nodes). We propose five algorithms to solve dispersion on graphs. The first three algorithms require O(k log Delta) bits at each robot andO(m) steps running time, wherem is the number of edges and Delta is the degree of the graph. The algorithms differ in whether they address the synchronous or the asynchronous system model, and in what, where, and how data structures are maintained. The fourth algorithm, for the asynchronous model, has a space usage of O(D log Delta) bits at each robot and uses O(Delta(D)) steps, where D is the graph diameter. The fifth algorithm, for the asynchronous model, has a space usage of O(max(log k, log Delta)) bits at each robot and uses O((m - n) k) steps.

关键词： distributed algorithm dispersion graph algorithm graph exploration mobile robot collective robot exploration

来源：评论

学校读者我要写书评

暂无评论

A Dual Decomposition Method for Hierarchical Traffic Control in Inter-DC WANs

A Dual Decomposition Method for Hierarchical Traffic Control...

引用

IEEE/CIC International Conference on Communications in China (ICCC)

作者： Gao, Qian Liu, Jiang Gao, Ningjie Huang, Tao Beijing Univ Posts & Telecommun Beijing Adv Innovat Ctr Future Internet Technol State Key Lab Networking & Switching Beijing Lab Adv Informat NetworksBeijing Key Lab Beijing Peoples R China

ISBN: (纸本)9781728107325

Resource utilization of inter-data center wide area networks (inter-DC WANs) has been increased by software-defined networking (SDN) technology significantly, such as Google's B4. However, the scalability of SDN network becomes more and more prominent with the increase of Cloud services. (;ogle has improved network scalability through hierarchical network topology in the follow-up work of B4. In this paper, we focus on how to design an appropriate distributed algorithm for hierarchical traffic control in inter-DC WANs based on SDN. Compared with 84, which focused on satisfying stringent availability targets in every service class, this paper focuses on improving the utility of inter-DC WAN which is of wide sense for general traffic control by scheduling network background traffic based on theoretical modeling. We establish a model for the inter-DC WAN by considering the traffic priorities and formulate an optimization problem to maximize the utility function of the network. We propose a two-layer traffic control structure and design a distributed multi-domain control (DMC) algorithm by using dual decomposition method for hierarchical traffic control in inter-DC WANs. This distributed algorithm is implemented by exchanging the information between the local domains and the super controller. Simulation results of the case study with maximizing network throughput optimization objective verify the proposed algorithm by comparing with the centralized algorithm.

关键词： Hierarchical Traffic Control Dual Decomposition distributed algorithm Inter-DC WANs SDN

来源：评论

学校读者我要写书评

暂无评论

Execution Latency and Energy Consumption Tradeoff in Mobile-Edge Computing Systems

Execution Latency and Energy Consumption Tradeoff in Mobile-...

引用

IEEE/CIC International Conference on Communications in China (ICCC)

作者： Lan, Xiaolong Cai, Lin Chen, Qingchun Univ Victoria Dept Elect & Comp Engn Victoria BC V8W 3P6 Canada Southwest Jiaotong Univ Chengdu 611756 Peoples R China Guangzhou Univ Guangzhou 510006 Peoples R China

ISBN: (纸本)9781728107325

In this paper, we consider a mobile-edge computing (MEC) system consisting of an MEC server and multiple mobile devices, in which each mobile device executes computation tasks with the help of the MEC server. We aim at minimizing the weighted sum of the execution latency and energy consumption by jointly allocating the CPU-cycles, the transmission power and bandwidth, as well as computation offloading decisions. To address this issue, we first decompose the original optimization problem into several subproblems by using Lagrange dual decomposition, which can be operated by mobile devices in a distributed manner. Although the MEC execution resource allocation subproblem is non-convex, we show that it can be decomposed into a two-stage optimization problem to derive the optimal solution by using Karush-Kuhn-Tucker conditions and exact line search algorithm. Moreover, it is shown that the internal problem can be equivalently transformed into a convex one, and the external problem is a single-variable optimization problem. Simulation results are presented to show that, there exists an inherent tradeoff between the execution latency and energy consumption of mobile devices, and the computation task can be processed with less energy consumption if certain execution latency is tolerable.

关键词： Mobile-edge computing computation offloading latency and energy tradeoff distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Connected Dominating Set Construction with Maximum Lifetime in the Cognitive Radio Networks 7

Efficient Connected Dominating Set Construction with Maximum...

引用

7th International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

作者： Liu, Manman Yu, Jiguo Yu, Dongxiao Cheng, Xiuzhen Qufu Normal Univ Sch Informat Sci & Engn Rizhao 276826 Peoples R China Shandong Univ Sch Comp Sci & Technol Qingdao 266510 Shandong Peoples R China George Washington Univ Dept Comp Sci Washington DC 20052 USA

Connected dominating set (CDS) is the most representative technology for constructing a virtual backbone in wireless networks and plays an important role in wireless applications including broadcasting, routing and so on. In a cognitive radio networks, the lifetime and efficiency are two important indices for measuring CDS algorithms due to the random activities of primary users (PUs). However, to the best of our knowledge, the existing algorithms for CDS construction in CRNs ignore the execution effectiveness instead of lifetime. In this paper, we propose a four-phase distributed algorithm to maximize the lifetime of CDS while guaranteeing the effectiveness of the algorithm. The proposed algorithm terminates in O(N-3 log N) timeslots, which is more effective than that of O(N-4). (C) 2019 The Authors. Published by Elsevier B.V.

关键词： the connected dominating set the cognitive radio networks the maximum lifetime distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed Dynamic Programming-Based Solution for Load Management in Smart Grids

引用

IEEE SYSTEMS JOURNAL 2018年第1期12卷 402-413页

作者： Zhang, Wei Xu, Yinliang Li, Sisi Zhou, MengChu Liu, Wenxin Xu, Ying Harbin Inst Technol Dept Elect Engn Harbin 150001 Heilongjiang Peoples R China Sun Yat Sen Univ Sun Yat Sen Univ Carnegie Mellon Univ Joint Inst Guangzhou 510275 Guangdong Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA King Abdulaziz Univ Dept Elect & Comp Engn Jeddah 21589 Saudi Arabia Lehigh Univ Dept Elect & Comp Engn Bethlehem PA 18015 USA State Grid Corp Power Dispatch & Control Ctr North China Branch Beijing 100053 Peoples R China

Load management (LM) is being recognized as an important option for active user participation in the energy market. Traditional LM methods usually require a centralized powerful control center and a two-way communication network between the system operators and energy end-users. The increasing user participation in smart grids may limit their applications. In this paper, a distributed solution for LM in emerging smart grids is proposed. The LM problem is formulated as a constrained optimization problem aiming at maximizing the overall utility of users while meeting the requirement for load reduction requested by the system operator, and is solved by using a distributed dynamic programming (DDP) algorithm. The algorithm is implemented via a distributed framework and thus can deliver a highly desired distributed solution. It avoids the required use of a centralized coordinator or control center, and can achieve satisfactory outcomes for LM. Simulation results with various test systems demonstrate its effectiveness.

关键词： distributed algorithm dynamic programming (DP) load management (LM) smart grids

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：