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

2025 IEEE PES Grid Edge Technologies Conference and Exposition, Grid Edge 2025

作者： Anderson, Alexander Fisher, Andrew Poudel, Shiva Vasios, Orestis Black, Gary Reiman, Andrew Pacific Northwest National Laboratory RichlandWA United States

ISBN: (纸本)9798350352528

Ongoing distribution grid modernization efforts are introducing an increasing number of advanced applications granted control of field devices. An emerging challenge is the deconfliction problem of coordinating conflicting control commands issued by multiple applications to the same device. As an alternative to custom, centralized grid orchestration techniques, the concept of distributed deconfliction is introduced. Conflicts between centralized and distributed applications are decomposed based on definition of local distributed control areas based on the network topology. This work introduces a distributed deconfliction architecture derived from prior work in centralized deconfliction and distributed application architecture. Setpoint-informed optimization and objective-informed multi-criteria decision-making are compared as two possible numerical techniques for selection of final device setpoints. © 2025 IEEE.

关键词： common information model distributed algorithms distributed power generation edge computing power distribution control

来源：评论

学校读者我要写书评

暂无评论

Efficient bounded timestamping from standard synchronization primitives

引用

distributed COMPUTING 2025年 1-39页

作者： Bashari, Benyamin Jamadi, Ali Woelfel, Philipp Univ Calgary Comp Sci 2500 Univ Dr Calgary AB T2N 1N4 Canada

Bounded timestamping systems (Israeli and Li in Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp 371-382, 1987;Dolev and Shavit in SIAM J Comput 26 (2):418-455, 1997) allow a temporal ordering of events in executions of concurrent algorithms. They are a fundamental and well-studied building block used in many shared-memory algorithms (Haldar and Vit & aacute;nyi in J ACM, 49 (1):101-126, 2002;Afek et al. in ACM Trans Program Lang Syst 16:939-953, 1994;Abrahamson in Proceedings of the 7th ACM symposium on principles of distributed computing (PODC), pp 291-302, 1988;Bashari and Woelfel in Proceedings of the 40th ACM symposium on principles of distributed computing (PODC), pp 545-555, 2021). A concurrent bounded timestamping system keeps track of m timestamps, which is usually greater or equal to the number of processes in the system, n. A process may, at any point, obtain a new timestamp, and later determine a total order of all process's most recent timestamps. Known bounded timestamping algorithms (Dolev and Shavit in SIAM J Comput 26(2):418-455, 1997;Dwork and Waarts in J ACM 46(5):633-666, 1999;Dwork et al. in SIAM J Comput 28(5):1848-1874, 1999;Gawlick et al. in Theory of computing and systems (ISTCS), pp 171-183, 1992;Israeli and Pinhasov in distributed algorithms, pp 95-109, 1992;Haldar and Vit & aacute;nyi in J ACM 49(1):101-126, 2002) do not scale well in the number of processes as getting a new timestamp takes at least Omega(n)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Omega (n)$$\end{document} steps. Moreover, a lower bound by Israeli and Li (Proceedings of the 28th annual IEEE symposium on foundations of computer science (FOCS), pp 371-382, 1987) implies that timestamps need to be represented by Omega(m)\documentclass[12pt]{minim

关键词： Timestamping Shared memory Concurrency distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Near-optimal dispersion on arbitrary anonymous graphs

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2025年 152卷

作者： Kshemkalyani, Ajay D. Sharma, Gokarna Univ Illinois Dept Comp Sci Chicago IL USA Kent State Univ Dept Comp Sci Kent OH 44240 USA

Given an undirected, anonymous, port-labeled graph of n memory-less nodes, m edges, and degree Delta, we consider the problem of dispersing k <= n robots (or tokens) positioned initially arbitrarily on the nodes of the graph to exactly k different nodes, one on each node. The objective is to simultaneously minimize time and memory requirement at each robot. The best previously known algorithm solves this problem in O(min{m,k Delta}.log l) time storing O(log(k+Delta)) bits at each robot, where l <= k/2 is the number of nodes with multiple robots positioned on them in the initial configuration. In this paper, we present a novel multi-source DFS traversal algorithm solving this problem in O(min{m,k Delta}) time with O(log(k+Delta)) bits at each robot. The memory complexity of our algorithm is already asymptotically optimal and the time complexity is asymptotically optimal for the graphs of constant degree Delta=O(1). The result holds in both synchronous and asynchronous settings. (c) 2025 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC license (http://***/licenses/by-nc/4.0/).

关键词： distributed algorithms Multi-agent systems Mobile robots Local communication Dispersion Exploration Time and memory complexity

来源：评论

学校读者我要写书评

暂无评论

Adjacent Channel Interference and Congestion Control for Multi-Channel Operation in Vehicular Networks

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2025年第5期26卷 6661-6674页

作者： Egea-Lopez, Esteban Pavon-Marino, Pablo Univ Politcn Cartagena UPCT Dept Informat & Commun Technol Cartagena 30202 Spain

ETSI has considered a new set of services for the Release 2, which cannot be implemented using the single control channel. Therefore, it is necessary to regulate the operation of applications on multiple channels, what is called Multi-Channel Operation (MCO). In this case the interference from the first adjacent channel is not negligible and is recommended to manage it by congestion control mechanisms. We propose an elastic channel usage scheme for MCO, based on an optimal scheduler whose goal is to maximize the traffic on the channels while minimizing the adjacent channel interference generated by that load and controlling the congestion. We formulate the interference and congestion control as a constrained convex optimization problem and derive as solution a distributed algorithm called MINOS (MultI-chaNnel operation Optimal Scheduler). MINOS seamlessly work when vehicles have a different number of network interfaces available, and constraints and priorities can be set individually and dynamically, which provides flexibility to implement more sophisticated services on top of the framework. Our results show that MINOS effectively controls the congestion and reduces the interference, achieving an increased packet reception ratio across all channels and a higher allocated traffic, compared to other proposals.

关键词： Interference Proposals Radio access technologies Interchannel interference Optimal scheduling Network interfaces distributed algorithms Load modeling Intelligent transportation systems Filling Vehicular communications congestion control scheduling multi-channel operation MCO adjacent interference

来源：评论

学校读者我要写书评

暂无评论

Event-Based Hybrid Bi-Level Energy Management and Control Framework of Networked Microgrid

引用

IEEE TRANSACTIONS ON SMART GRID 2025年第2期16卷 1351-1365页

作者： Wu, Tao Wang, Jianhui Zhao, Tianqiao Zhou, Anping Chowdhury, Badrul Cox, Robert Southern Methodist Univ Dept Elect & Comp Engn Dallas TX 75275 USA Brookhaven Natl Lab Dept Elect Engn Upton NY 11973 USA Univ North Carolina Charlotte Dept Elect & Comp Engn Charlotte NC 28223 USA

Networked microgrids (NMGs) are favorable for enhancing the operating efficiency under normal operations and maintaining energy supply to critical facilities during abnormal conditions in the face of severe outages. This paper proposes an event-based hybrid bi-level energy management and control framework for NMGs. We first propose a hybrid bi-level energy management and control system, incorporating the energy management of NMGs at the upper-level and the control of distributed energy resources (DERs) at the lower-level. The upper-level aims to offer economic and resilient solutions by considering diverse operating conditions (e.g., normal and emergency). The lower-level DER control is proposed to ensure intra-hour operation in a fully distributed manner. An event-triggered module incorporating several predefined events is designed to switch the control model (i.e., operation targets and constraints) of the upper-level for different operation conditions and to reschedule DERs and breaker of NMGs. A consensus-based fully distributed control method for the lower-level is then developed considering the three-phase real power balance. Numerical simulations on the IEEE 123-bus system and a 900-bus utility-owned feeder are conducted to verify the effectiveness of the proposed framework.

关键词： Microgrids Energy management Event detection Decentralized control Switches Resilience distributed algorithms Couplings Costs Vectors Networked microgrids distributed energy resources event trigger distributed control

来源：评论

学校读者我要写书评

暂无评论

The min-move mutual visibility problem for disoriented asynchronous robots

引用

THEORETICAL COMPUTER SCIENCE 2025年 1035卷

作者： Bhagat, Subhash Mukhopadhyaya, Krishnendu Ray, Rajarshi Indian Inst Technol Jodhpur Dept Math Jheepasani India Indian Stat Inst Adv Comp & Microelect Unit Kolkata India Indian Assoc Cultivat Sci Sch Math & Computat Sci Kolkata India

We consider a distributed system of n >= 3 autonomous robots in the Euclidean plane under the obstructed visibility model. In the obstructed visibility model, robots are considered opaque, and if three robots lie on a straight line, the mid- dle robot blocks the vision of the two other robots. The mutual visibility problem requires the robots to coordinate their movements in such a way that all the robots in the system become mutually visible. This paper studies a constrained version of the mutual visibility problem, namely the min-move mutual visibility problem. The min-move mutual visibility problem asks to solve the mutual visibility problem by moving each robot at most once. One of the major implications of this constrained version of the mutual visibility problem is that it also addresses the issue of energy efficiency for the robots. We study the min-move mutual visibility problem for disoriented robots (i.e., robots not having any form of local axis agreement or common chirality). We study the problem under two of the strongest adversarial models, namely asynchronous scheduler and non- rigid movements. We first show that the min-move mutual visibility problem is not solvable for disoriented asynchronous robots with non-rigid movements in the absence of externally visible lights. Then, we analyze different characteristics of a min-move mutual visibility algorithm for disoriented robots with non-rigid movements. We use these properties to present a distributed algorithm that solves the problem for disoriented asynchronous robots with non-rigid movements and having externally visible lights (FALL light model). The algorithm uses only 7 colors for the lights. The proposed algorithm is collision-free and runs in O(n) epochs.

关键词： distributed algorithms Swarm of robots Mutual visibility Asynchronous Disoriented robots Non-rigid movement Persistent lights

来源：评论

学校读者我要写书评

暂无评论

A Collaborative Adaptive Cybersecurity Algorithm for Cognitive Cities

引用

JOURNAL OF COMPUTER INFORMATION SYSTEMS 2025年

作者： Abonamah, Abdullah Sibai, Fadi N. George Washington Univ Washington DC USA Gulf Univ Sci & Technol Mubarak Al Abdullah Kuwait

We propose a Collaborative Cybersecurity Algorithm with distributed Success Scores (CCAwDSS) as an adaptive cybersecurity defense system within cognitive city systems. In this system, nodes have responsibilities to detect and neutralize threats using AI-based adaptive cybersecurity algorithms. They are aware of the other nodes performance in dealing with cyber threats and can utilize other nodes' successful algorithms and defense controls in a sharing arrangement. The collaboration is achieved by requiring that each active node in the defense system to share its neutralization algorithms and defense responses and broadcasts its "success score" immediately after detecting and neutralizing a threat to the other nodes. This continuous broadcasting mechanism would ensure that each node is continuously updated on the performance capability of its peers in real time.

关键词： Cyber-security distributed algorithms IoT smart cities fog computing edge computing

来源：评论

学校读者我要写书评

暂无评论

The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2025年第1期24卷 150-164页

作者： Ganesan, Ashwin Atlas SkillTech Univ Mumbai 400070 Maharashtra India

An assumption that researchers have often used to model interference in a wireless network is the unit disk graph model. While many theoretical results and performance guarantees have been obtained under this model, an open research direction is to extend these results to hypergraph interference models. Motivated by recent results that the worst-case performance of the distributed maximal scheduling algorithm is characterized by the interference degree of the hypergraph, in the present work we investigate properties of the interference degree of the hypergraph and the structure of hypergraphs arising from physical constraints. We show that the problem of computing the interference degree of a hypergraph is NP-hard and we prove some properties and results concerning this hypergraph invariant. We investigate which hypergraphs are realizable, i.e. which hypergraphs arise in practice, based on physical constraints, as the interference model of a wireless network. In particular, a question that arises naturally is: what is the maximal value of r such that the hypergraph K-1,K-r is realizable? We determine this quantity for various integral and nonintegral values of the path loss exponent of signal propagation. We also investigate hypergraphs generated by line networks.

关键词： Interference Scheduling algorithms Stars Scheduling Signal to noise ratio Propagation losses Applications of hypergraph theory applied algorithms cellular systems distributed algorithms hypergraph models interference degree maximal scheduling unit disk graphs wireless networks wireless networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-view Radiance Caching for Heterogeneous Participating Media

引用

COMPUTER GRAPHICS FORUM 2025年

作者： Stadlbauer, P. Tatzgern, W. Mueller, J. H. Winter, M. Stojanovic, R. Weinrauch, A. Steinberger, M. Graz Univ Technol Inst Visual Comp Graz Austria Huawei Technol Vienna Austria

Achieving lifelike atmospheric effects, such as fog, is essential in creating immersive environments and poses a formidable challenge in real-time rendering. Highly realistic rendering of complex lighting interacting with dynamic fog can be very resource-intensive, due to light bouncing through a complex participating media multiple times. We propose an approach that uses a multi-layered spherical harmonics probe grid to share computations temporarily. In addition, this world-space storage enables the sharing of radiance data between multiple viewers. In the context of cloud rendering this means faster rendering and a significant enhancement in overall rendering quality with efficient resource utilization.

关键词： CCS Concepts distributed algorithms Parallel algorithms Rendering • Computing methodologies → Ray tracing

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant mutual visibility without any axis agreement in presence of mobility failure

引用

THEORETICAL COMPUTER SCIENCE 2025年 1025卷

作者： Pramanick, Subhajit Jana, Saswata Mandal, Partha Sarathi Indian Inst Technol Guwahati Dept Math Gauhati 781039 Assam India

We aim to solve the mutual visibility problem using N autonomous, indistinguishable, homogeneous, oblivious and opaque point robots in the presence of mobility failure. The faulty robot cannot move when it becomes faulty, but the light remains working. Initially, from any arbitrary configuration, the problem of mutual visibility using robots aims to reach a configuration where any two robots can see each other. The challenge is to reach to such a configuration in the presence of faulty robots along with obstructed visibility under which two robots see each other only if the line segment joining them does not have any robots. Every robot operates in the conventional Look-Compute-Move cycles. Robots neither have any agreement in their coordinate system nor have the knowledge of N. The problem is not solvable for a specific symmetric initial configuration of the robots. We propose an algorithm that tolerates f (<= N) number of faulty robots and uses a constant number of colors in the FSYNC setting. To be specific, the algorithm requires 21 colors and runs in O(N2) synchronous rounds. We present another algorithm much simpler than the prior one but can tolerate a single faulty robot. This algorithm needs only 2 colors in the SSYNC and 5 colors in the ASYNC setting.

关键词： distributed algorithms Mobile robots Mobility failure Luminous robots Mutual visibility

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：