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

Optimal deterministic distributed algorithms for maximal independent set in geometric graphs

JOURNAL OF PARALLEL AND distributed COMPUTING 2019年 132卷 36-47页

作者： Molla, Anisur Rahaman Pandit, Supantha Roy, Sasanka Indian Stat Inst Comp & Commun Sci Div 203 BT Rd Kolkata 700108 India Dhirubhai Ambani Inst Informat & Commun Technol Gandhinagar 382007 Gujrat India Indian Stat Inst Adv Comp & Microelect Unit 203 BT Rd Kolkata 700108 India Indian Stat Inst Kolkata India

Finding a maximal independent set (MIS) in a graph is one of the fundamental problems in distributed computing. Researchers in this community are trying to close the time complexity gap of computing a MIS in a graph, way back from Luby's [STOC'85] O(logn) time (randomized) algorithm and Linial's [SICOMP'92] Omega(log* n) lower bound result (n is the number of nodes of the graph). Since then, an extensive research has been done on this problem, however, most of the results are randomized and we are lack of efficient deterministic solution. In fact, no polylogarithmic (in n) time deterministic algorithm is known so far in general graphs an open question raised by Linial in 1993 [Comb. Probab. Comput.'93]. In this paper, we study the MIS problem in geometric graphs, a class of graphs which has both theoretical and practical importance. We present O(1)-time deterministic algorithms (hence, optimal) for computing MIS in unit interval graphs, unit square graphs and unit disk graphs. The same idea applies to develop optimal MIS algorithm for higher dimensional unit balls and unit hypercubes. We further extend the MIS algorithms to compute approximate maximum independent set (MaxIS) in the above geometric graph classes. The theoretical results are corroborated through extensive experiments to show the effectiveness and efficiency of our algorithms. Our algorithms are fully decentralized, scalable, and robust. In general, nodes exchange only O(log n) bits message through an edge per communication. Moreover, being local, our algorithms are also suitable in failure model, self-stabilizing and appropriate for dynamic environment. (C) 2019 Elsevier Inc. All rights reserved.

关键词： distributed algorithm Maximal and maximum independent set Local algorithm Unit interval graphs Geometric graphs

来源：评论

学校读者我要写书评

暂无评论

A cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluations

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2021年第12期33卷 e5647-e5647页

作者： Nakamura, Junya Kim, Yonghwan Katayama, Yoshiaki Masuzawa, Toshimitsu Toyohashi Univ Technol Informat & Media Ctr Toyohashi Aichi Japan Nagoya Inst Technol Dept Comp Sci Nagoya Aichi Japan Osaka Univ Grad Sch Informat Sci & Technol Osaka Japan

A distributed system consisting of a huge number of computational entities is prone to faults because faults in a few nodes cause the entire system to fail. Consequently, fault tolerance of distributed systems is a critical issue. Checkpoint-rollback recovery is a universal and representative technique for fault tolerance;it periodically records the entire system state (configuration) to non-volatile storage, and the system restores itself using the recorded configuration when the system fails. To record a configuration of a distributed system, a specific algorithm known as a snapshot algorithm is required. However, many snapshot algorithms require coordination among all nodes in the system;thus, frequent executions of snapshot algorithms require unacceptable communication cost, especially if the systems are large. As a sophisticated snapshot algorithm, a partial snapshot algorithm has been introduced that takes a partial snapshot (instead of a global snapshot). However, if two or more partial snapshot algorithms are concurrently executed, and their snapshot domains overlap, they should coordinate, so that the partial snapshots (taken by the algorithms) are consistent. In this paper, we propose a new efficient partial snapshot algorithm with the aim of reducing communication for the coordination. In a simulation, we show that the proposed algorithm drastically outperforms the existing partial snapshot algorithm, in terms of message and time complexity.

关键词： checkpoint-rollback distributed algorithm fault-tolerance snapshot

来源：评论

学校读者我要写书评

暂无评论

distributed Localization in Wireless Sensor Networks Under Denial-of-Service Attacks

引用

IEEE CONTROL SYSTEMS LETTERS 2021年第2期5卷 493-498页

作者： Shi, Lei Liu, Qingchen Shao, Jinliang Cheng, Yuhua Univ Elect Sci & Technol China Sch Automat Engn Chengdu 611731 Peoples R China Tech Univ Munich Chair Informat Oriented Control D-80869 Munich Germany

In this letter, we study the problem of localizing the sensors' positions in presence of denial-of-service (DoS) attacks. We consider a general attack model, in which the attacker action is only constrained through the frequency and duration of DoS attacks. We propose a distributed iterative localization algorithm with an abandonment strategy based on the barycentric coordinate of a sensor with respect to its neighbors, which is computed through relative distance measurements. In particular, if a sensor's communication links for receiving its neighbors' information lose packets due to DoS attacks, then the sensor abandons the location estimation. When the attacker launches DoS attacks, the AS-DILOC algorithm is proved theoretically to be able to accurately locate the sensors regardless of the attack strategy at each time. The effectiveness of the proposed algorithm is demonstrated through simulation examples.

关键词： Localization sensor networks denial-of-service attacks distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Non-cooperative Game Theory-Based Optimization Strategy of P2P Power Usage Quotas Transaction in Communities

Non-cooperative Game Theory-Based Optimization Strategy of P...

引用

IEEE/IAS Industrial and Commercial Power System Asia (IEEE I and CPS Asia)

作者： Zhang, Shuai Ma, Tengfei Pei, Wei Cheng, Xueting Bao, Yueshuang Univ Chinese Acad Sci Inst Elect Engn Chinese Acad Sci Beijing Peoples R China State Grid Shanxi Elect Power Res Inst Taiyuan Shanxi Peoples R China

ISBN: (纸本)9798350339345

With the promotion of electricity market reform and the rapid growth of demand-side load, the community power energy management is facing great pressure of power dispatching. In order to better meet the demand of community electricity, this paper proposed an optimization strategy of community Peer-to-Peer (P2P) power usage quotas (PUQs) based on non-cooperative game, combining with the sharing economy mechanism. Firstly, a P2P transaction model of community PUQs is established with the goal of minimizing the cost. Secondly, the dynamic price mechanism of PUQs is established through the initial PUQs and load demand of the community. Thirdly the non-cooperative game model of community transaction is constructed based on the dynamic price mechanism. Then the existence and uniqueness of Nash equilibrium of the no-cooperative game model is proved. Finally, in order to protect the privacy of the community, the distributed algorithm is used to optimize the solution. Simulation results show that the proposed method can not only improve the community load curve, but also decrease the cost of the community.

关键词： power usage quotas P2P non-cooperative game Nash equilibrium distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed AGC power sharing strategy considering BESS participation factors

引用

ELECTRIC POWER SYSTEMS RESEARCH 2023年第1期217卷

作者： Zhang, Shengqi Yu, Qicheng Liu, Heyu Mishra, Yateendra Wang, Fei Shanghai Univ Dept Mechatron Engn & Automat Shanghai 200444 Peoples R China Queensland Univ Technol Brisbane Qld 4000 Australia

Battery energy storage systems (BESSs) in power system automatic generation control (AGC) are regarded as an effective way to improve the frequency stability when the system has a high penetration level of renewable energy. Compared with conventional generators, BESSs have different characteristics and operation constraints, which bring challenges to AGC power sharing in an accurate and effective way. Therefore, a participation factor (PF)-based AGC power sharing strategy (APSS) is proposed in this paper, aiming at managing a large quantity of BESSs with various frequency regulation (FR) characteristics. Specifically, the concept of the BESS PF is intro-duced in its AGC cost function, and the PF value of each BESS is dynamically determined on the real-time AGC power and state of charge (SoC). The numerical simulation results demonstrate that the PF-based APSS is able to make the exact match between the characteristic components of AGC power and the corresponding BESSs under the condition of SoC balancing. Meanwhile, the computational burden of the control center is effectively relieved by the distributed algorithm (DA) regardless of the BESS quantity, and BESS plug-and-play is also realized.

关键词： Automatic generation control Battery energy storage system distributed algorithm Fuzzy-logic theory

来源：评论

学校读者我要写书评

暂无评论

distributed real-time economic dispatch for islanded microgrids with dynamic power demand

引用

APPLIED ENERGY 2023年第1期342卷

作者： Huang, Lei Sun, Wei Li, Qiyue Li, Weitao Heifei Univ Technol Tunxi Rd 193 Hefei 230009 Peoples R China

The plugging and unplugging of high-power loads result in dynamically changing power demands for islanded microgrids. However, the existing distributed real-time dispatch assumes the power demand to be static. If the power demand changes during the distributed iterative solution process, existing dispatching algorithms would yield a mismatched solution. To address this problem, a distributed real-time dispatching algorithm is proposed to adapt to the dynamic power demand. First, the role of real-time dispatch in the hierarchical control of microgrids is analyzed. Then, the real-time dispatch is modeled as an optimization problem with a dynamic equality constraint. Combining the alternating direction method of multipliers (ADMM) and the distributed resource allocation (DRA) algorithms, the distributed iterative algorithms for solving the established optimization problem with static and dynamic constraints are deduced. Lastly, the effectiveness of the proposed algorithm is verified through case studies. Compared with the existing real-time dispatching algorithm, the proposed algorithm improves the economic efficiency of islanded microgrids with time-varying power demand.

关键词： Microgrid Economic dispatch distributed algorithm Optimization problem Hierarchical control

来源：评论

学校读者我要写书评

暂无评论

Towards Resilient Design of Leader-following Consensus with Attack Identification and Privacy Preservation Capabilities

Towards Resilient Design of Leader-following Consensus with ...

引用

European Control Conference (ECC)

作者： Gusrialdi, Azwirman Iqbal, Muhammad Qu, Zhihua Tampere Univ Fac Engn & Nat Sci Tampere 33014 Finland Univ Cent Florida Dept Elect & Comp Engn Orlando FL 32816 USA

ISBN: (纸本)9783907144084

This paper considers a leader-following consensus in the presence of unknown but bounded cyber-attacks. Specifically, we consider the following cyber-attack scenarios: (i) an attacker aims to destabilize the consensus dynamics by injecting exogenous signals to both the actuators of the followers and/or the communication network, (ii) an eavesdropper adversary aims to obtain information on the physical state of the agents. To this end, a novel resilient leader-following consensus algorithm based on a competitive interaction method is proposed. In addition, it is demonstrated that by appropriately choosing the information exchanged between the agents, the proposed control framework also enables the cooperative system to either distributively identify the compromised communication links in real-time or to protect the privacy of the physical state of the agents from the eavesdropper. A numerical example is provided to illustrate the proposed resilient control algorithms.

关键词： Resilient control attack identification leader-following consensus distributed algorithm privacy

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Dispersion of Mobile Robots 9th

Fault-Tolerant Dispersion of Mobile Robots

引用

9th International Conference on algorithms and Discrete Applied Mathematics (CALDAM)

作者： Chand, Prabhat Kumar Kumar, Manish Molla, Anisur Rahaman Sivasubramaniam, Sumathi Indian Stat Inst Kolkata India

ISBN: (纸本)9783031252105;9783031252112

We consider the mobile robot dispersion problem in the presence of faulty robots (crash-fault). Mobile robot dispersion consists of k <= n robots in an n-node anonymous graph. The goal is to ensure that regardless of the initial placement of the robots over the nodes, the final configuration consists of having at most one robot at each node. In a crash-fault setting, up to f <= k robots may fail by crashing arbitrarily and subsequently lose all the information stored at the robots, rendering them unable to communicate. In this paper, we solve the dispersion problem in a crash-fault setting by considering two different initial configurations: i) the rooted configuration, and ii) the arbitrary configuration. In the rooted case, all robots are placed together at a single node at the start. The arbitrary configuration is a general configuration (a.k.a. arbitrary configuration in the literature) where the robots are placed in some l < k clusters arbitrarily across the graph. For the first case, we develop an algorithm solving dispersion in the presence of faulty robots in O(k(2)) rounds, which improves over the previous O(f center dot min(m, k Delta))-round result by [23]. For the arbitrary configuration, we present an algorithm solving dispersion in O((f + l) center dot min(m, k Delta, k(2))) rounds, when the number of edges m and the maximum degree. of the graph is known to the robots.

关键词： distributed algorithm Mobile robot Dispersion Fault-tolerant algorithm Crash-fault Round complexity Memory complexity

来源：评论

学校读者我要写书评

暂无评论

distributed Age-of-Information optimization in edge computing for Internet of Vehicles

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2023年 144卷

作者： Yang, Li Zou, Yifei Yu, Dongxiao Yu, Jiguo Shandong Univ Inst Intelligent Comp Sch Comp Sci & Technol Qingdao 266237 Peoples R China Qilu Univ Technol Big Data Inst Shandong Acad Sci Jinan 250353 Peoples R China Shandong Lab Comp Networks Jinan 250014 Peoples R China

As an important concept to depict the freshness of an information when it arrives at the destination, the Age of-Information (AoI) and its relative scheduling works can be a very useful tool to aggregate the information from the end devices to the edge servers in Internet of Vehicles, which can strongly support those time-sensitive services in intelligent transportation system. However, most of the previous works about the AoI scheduling on edge computing are the centralized ones, rely on the reliable communications, and ignore the mobility of vehicles, which may not suit the dynamic environment in Internet of Vehicles. In this paper, we consider the AoI optimization problem in a more comprehensive vehicle model, and present a distributed AoI optimization algorithm based on a single hop end-to-edge wireless network. With an arbitrary power control technique, our algorithm reaches an asymptotically optimal performance on minimizing the expectation of AoI. Both of theoretical analysis and extensive simulations are conducted to verify the correctness and efficiency of our proposed algorithm.

关键词： Age-of-Information Edge computing Internet of Vehicles distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Conditional-Distributionally robust coordination for an electrical power and flexibility-enhanced district heating system

引用

APPLIED ENERGY 2023年第1期347卷

作者： Yang, Chang Li, Zhengshuo Shandong Univ Sch Elect Engn Jinan 250061 Peoples R China

In an integrated electricity and heating system (IEHS), building flexibility-enhanced district heating systems (DHSs) that use advanced flexibility-enhanced technologies are effective for promoting renewable energy accommodation. However, it is challenging to comprehensively utilize these flexibility-enhanced technologies in IEHS dispatch. This paper proposes a distributed conditional-distributionally robust coordination method for an electrical power and flexibility-enhanced DHS. The DHS is retrofitted with bypass compensation technology and uses a variable mass flow operation strategy to enhance its flexibility and promote renewable energy accommodation. Moreover, conditional-distributionally robust optimization is used to consider the inherent dependency between the forecasting error of a wind farm and the forecast output information, which goes beyond the state-of-the-art models. Additionally, a novel reformulation method is adopted to transform the problem with random variables and bilinear constraints into a more tractable programming problem, yielding a conservative approximative model of the original model that guarantees feasibility. Finally, to protect the privacy of electrical power system and DHS operators, this paper proposes a double-layer distributed algorithm to solve the problem in a distributed fashion while guaranteeing feasibility. Case studies demonstrate that the proposed model with flexibility-enhanced DHSs significantly promotes renewable energy accommodation and reduces dispatch costs, and the proposed double-layer distributed algorithm effectively solves the dispatch problem in a distributed fashion and guarantees the feasibility of dispatch results.

关键词： Integrated electricity and heating system Variable mass flow operation strategy Bypass compensation technology Distributionally robust optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：