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

34th Chinese Control and Decision Conference (CCDC)

作者： Yang, Yu Nian, Xiaohong Niu, Fuxi Sch Automat Cent South Univ Changsha 410075 Peoples R China

ISBN: (纸本)9781665478960

This paper investigates the generalized Nash equilibrium (GNE) seeking problem of the noncooperative game. We consider the problem that the participants in the noncooperative game have two different dynamics (the second-order linear dynamics and Euler-Lagrange nonlinear dynamics), and the feasible decision set is subject to the coupling equality constraints, the participant only can access the necessary information of its neighbors. Based on the time base generator (TBG), we propose a distributed GNE seeking algorithms, it can converge to GNE with the predefined time, and the time can be designed in advance by the user without relying on the initial value and any design parameters. Finally, the effectiveness of the algorithm is verified by a practical example.

关键词： distributed algorithm non-cooperative games generalized Nash equilibrium predefined time convergence hybrid heterogeneous multi-agent system

来源：评论

学校读者我要写书评

暂无评论

distributed methodology for reactive power support of transmission system

引用

SUSTAINABLE ENERGY GRIDS & NETWORKS 2022年 31卷

作者： Kryonidis, Georgios C. Tsampouri, Maria E. Malamaki, Kyriaki-Nefeli D. Demoulias, Charis S. Aristotle Univ Thessaloniki Sch Elect & Comp Engn GR-54124 Thessaloniki Greece

This paper deals with the provision of reactive power support from distribution grids to the transmission system. To this end, a new distributed control scheme is proposed that coordinates the reactive power output of distributed generation (DG) units to meet a predefined reactive power set-point at the point of interconnection of the distribution grid with the transmission system. The coordination process is implemented in an optimal way minimizing the network losses, while also satisfying the technical limits of the distribution grid. Furthermore, the proposed distributed control scheme is supplemented with a new control algorithm for the on-load tap changer (OLTC) of the high-/medium voltage transformer to unlock additional reactive power flexibility in case the voltage limits at the distribution grid are reached. Time-series simulations on the IEEE 33-bus network are performed to evaluate the performance of the proposed method against existing solutions. (C) 2022 Elsevier Ltd. All rights reserved.

关键词： distributed algorithm distributed generation Loss reduction Reactive power support Voltage control

来源：评论

学校读者我要写书评

暂无评论

distributed Resource Allocation for Maximizing Energy Efficiency in D2D-U Enabled NR Network 94

Distributed Resource Allocation for Maximizing Energy Effici...

引用

94th IEEE Vehicular Technology Conference (VTC-Fall)

作者： Wu, Zheyi Yuan, Jiantao Yin, Rui Chen, Xianfu Wu, Celimuge Zhejiang Univ Sch Informat & Elect Engn Hangzhou 310027 Peoples R China KwaZulu Natal Univ Sch Elect Elect & Comp Engn ZA-4041 Durban South Africa VTT Tech Res Ctr Finland Oulu 90570 Finland Univ Electrocommun Grad Sch Informat & Engn Tokyo 1828585 Japan

ISBN: (纸本)9781665413688

In this paper, a distributed power and spectrum allocation scheme is proposed to maximize the system energy efficiency (EE) for unlicensed device-to-device (D2D-U) networks. A non-convex optimization problem is formulated while considering the co-channel interference on licensed bands as the global constraint. To deal with the non-convex situation, the object function is converted into an equivalent convex one. Then, a distributed algorithm is developed to solve the optimization problem in which each D2D-U pair can find the optimal allocation strategy independently. The signaling overheads are analyzed and numerical results are presented to show that the proposed scheme is capable of achieving the optimal EE while confining the co-channel interference and guaranteeing the fair coexistence.

关键词： D2D-U new radio radio resource management energy efficiency distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Resilient distributed Control Approach for Online Voltage Regulation in Distribution Networks under Adversaries 54

Resilient Distributed Control Approach for Online Voltage Re...

引用

54th Annual Hawaii International Conference on System Sciences

作者： Zhao, Tianqiao Wang, Jianhui Southern Methodist Univ Dept Elect & Comp Engn Dallas TX 75275 USA

ISBN: (纸本)9780998133140

This paper proposes a resilient distributed control approach for the voltage regulation problem in distribution networks with high penetration of photovoltaic systems. Aiming to reduce the network power loss and curtailment of photovoltaic active power generation, an objective function is formulated while subjecting to physical operation constraints. With feedback-based information, the proposed solution to optimal voltage regulation can be implemented in an online and distributed manner that ensures a real-time regulation response to fast voltage fluctuations. The proposed approach provides a cyber-secure solution that mitigates attack impacts on voltage control based on a weighted mean subsequence reduced technique. The proposed approach further addresses potential cyber-threats to the information and communication-based control of distributed PV inverters. Numerical studies on the IEEE 37-bus distribution system verify that the proposed approach achieves the optimal voltage regulation performance while ensuring the resilience.

关键词： Resilient control distributed algorithm voltage regulation mean subsequence reduced algorithm distribution systems

来源：评论

学校读者我要写书评

暂无评论

Radio Resource Management Approaches for Reliable Device-to-Device (D2D) Communication in Wireless Industrial Applications

引用

IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING 2021年第3期7卷 905-916页

作者： Sanusi, Idayat O. Nasr, Karim M. Moessner, Klaus Univ Greenwich Fac Sci & Engn Kent ME4 4TB England Univ Surrey Inst Commun Syst 5G IC Surrey GU2 7XH England

The manufacturing industry is regarded as one of the most demanding verticals with respect to URLLC requirements. A Device-to-Device (D2D) communication system is a key enabler that has been introduced to support URLLC. To enhance spectrum utilisation, D2D links can share access of radio spectrum resources occupied by cellular users. Spectrum reuse may result in performance degradation due to mutual co-channel interference of co-existing cellular and D2D users. Resource sharing in a D2D-based cellular network for wireless industrial applications is investigated in this article. The presented schemes aim to maximise the overall system throughput while maintaining the Quality of Service/Experience (QoS/QoE) requirements. Interference is managed by jointly considering admission and power control based on the relative distance between devices. A priced-Deferred Acceptance (p-DA) scheme with an incentive-based stability is developed to match D2D users to cellular resources. Numerical simulations show that the p-DA scheme is able to achieve better performance than the conventional DA algorithm and is close in performance to the presented centralised optimisation approach.

关键词： Device-to-device communication Interference Resource management Reliability Ultra reliable low latency communication Quality of service Signal to noise ratio URLLC distributed algorithm game theory radio spectrum management 5G and beyond

来源：评论

学校读者我要写书评

暂无评论

A distributed Double-Consensus algorithm for Residential We-Energy

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2019年第8期15卷 4830-4842页

作者： Sun, Qiuye Fan, Ruyi Li, Yushuai Huang, Bonan Ma, Dazhong Northeastern Univ Sch Informat Sci & Engn Shenyang 110819 Liaoning Peoples R China Univ Denver Dept Elect & Comp Engn Denver CO 80208 USA

This paper investigates the residential energy management problems in the power-heat-coupling system. For better solving this issue, based on the novel concept of We-Energy (WE) for energy Internet (EI), this paper proposes a residential WE (R-WE) framework faced by the terminal users who play an important role in renewable energy consumption. Inspired by the full-duplex feature of R-WE, the power and heat supply-demand balance constraints are fulfilled in a regional unit of EI, but it may be inequality constraints for corresponding consumer, producer, or WE operation modes in only one R-WE. The R-WE framework can be classified into four operation modes, which is island mode, consumer mode, producer mode, and WE mode. On this basis, the R-WE models cooperate to achieve the objective of minimizing the operation costs, smoothing out the loads' variations, and renewable resource fluctuations. Specifically, the R-WE framework with respect to the heat-power-coupling problem can be solved in the distributed double-consensus algorithm (DDCA), which is designed two sets of consensus algorithms by using four completely different consensus variables to calculate the power and heat multipliers, evaluate the power and heat generations and, thereby, further obtain the power mismatches of electricity and heat. Also, the Karush-Kuhn-Tucker (KKT) optimal conditions of the proposed DDCA is further proved. Meanwhile, a novel projection operation method for combined heat and power devices is designed to take the infeasible solutions mapped into the feasible region. Finally, the simulation results in different cases further demonstrate that the proposed R-WE frame can be an appropriate method to analyze the terminal consumers and harmonize multienergy producers in the process of constructing EI projects. And an R-WE framework of the campus has experimented with minority loads in island mode.

关键词： distributed algorithm renewable energy residential energy management We-Energy (WE)

来源：评论

学校读者我要写书评

暂无评论

Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency 22

Brief Announcement: Deterministic Consensus and Checkpointin...

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Chlebus, Bogdan S. Kowalski, Dariusz R. Olkowski, Jan Augusta Univ Sch Comp & Cyber Sci Augusta GA 30912 USA Univ Maryland Dept Comp Sci College Pk MD USA

ISBN: (纸本)9781450392624

We study consensus and checkpointing in synchronous distributed systems. There are n nodes that communicate by sending messages, and any two nodes can communicate directly. The nodes are prone to crashing, with an upper bound t on the number of crashes. algorithms use overlay networks of choice to save on the amount of communication. We explore using Ramanujan graphs as such overlay networks. We demonstrate that Ramanujan graphs have topological properties conducive to fault-tolerance and time/communication efficiency of distributed algorithms. Our consensus algorithm assumes binary input values, runs in O(t) time and sends O(n+t log t) bits. The algorithm sends the optimum number O(n) of bits for t = O(n/log n), thus for this range of t it improves on the algorithm by Galil, Mayer and Yung [FOCS 1995] that also sends O(n) bits but works in exponential time. The consensus algorithm can be implemented such that a node sends a message to at most one node at a round while maintaining the asymptotic time and communication performance bounds. Our checkpointing algorithm runs in linear time O(n) and with O(n log(7) n) messages. It improves on the most communication-efficient and time-optimal algorithm by Galil, Mayer and Yung [FOCS 1995], which may have O(n(1+epsilon)) messages sent, for any chosen constant epsilon > 0.

关键词： distributed algorithm message passing synchrony node crash consensus checkpointing Ramanujan graph runtime performance communication performance

来源：评论

学校读者我要写书评

暂无评论

distributed Resource Allocation for NOMA-Based Mobile Edge Computing with Content Caching

Distributed Resource Allocation for NOMA-Based Mobile Edge C...

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Zhang, Zhen Li, Qingqing Chen, Wuhui Hong, Zicong Sun Yatsen Univ Sch Data & Comp Sci Guangzhou Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China

ISBN: (纸本)9781728195070

Nonorthogonal multiple access (NOMA) and content caching have been introduced to effectively utilize and save bandwidth resources, thus relieving network transmission pressure. Therefore, we develop a computation offloading framework blending NOMA and content caching to further improve the computational performance. We formulate the joint computation offloading decision, resources allocation, and caching decision as an utility maximization problem under the constrains of bandwidth, computing and storage resources. We convert the original non-convex problem to a convex problem via variable relaxation and substitution. We then decompose it and introduce an alternative direction method of multipliers based distributed algorithm to solve it. Finally, simulation results show that our algorithm can quickly converge and reach up to 95% of the optimal value. It also performs well over various parameter settings.

关键词： Computation offloading NOMA content caching resources assignment distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

On temporal graph exploration

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2021年 119卷 1-18页

作者： Erlebach, Thomas Hoffmann, Michael Kammer, Frank Univ Leicester Sch Informat Leicester Leics England Univ Appl Sci Mittelhessen THM Wiesenstr 14 D-35390 Giessen Germany

The temporal graph exploration problem TEXP is the problem of computing a foremost exploration schedule for a temporal graph, i.e., a temporal walk that starts at a given start node, visits all nodes of the graph, and has the smallest arrival time. In the first and second part of the paper, we consider only undirected temporal graphs that are connected at each time step. For such temporal graphs with n nodes, we show that it is NP-hard to approximate TEXP with ratio O (n(1-epsilon)) for every epsilon > 0 and present several solutions for special graph classes. In the third part of the paper, we consider settings where the graphs in future time steps are not known. We show that m-edge temporal graphs with regularly present edges and with probabilistically present edges can be explored online in O (m) time steps and O (m log n) time steps with high probability, respectively. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Non-approximability Planar graphs Bounded treewidth Regularly present edges Random edges distributed algorithm Gossiping problem

来源：评论

学校读者我要写书评

暂无评论

Cost-effective live video streaming for internet of connected vehicles using heterogeneous networks

引用

AD HOC NETWORKS 2024年 153卷

作者： Chowdhury, Debanjan Roy Nandi, Sukumar Goswami, Diganta Indian Inst Technol Guwahati Dept Comp Sci & Engn Gauhati 781039 Assam India

Smart vehicles of Internet of Connected Vehicles (IoCV) create Ad-Hoc networks and are persistently connected to the Internet through different network access technologies like Wifi, cellular, and dedicated short range communication (DSRC). A vehicle may prefer one network access technology over another based on availability, coverage area, and network access cost. The choice also depends on application requirements, like delay -tolerant or delay-sensitive, and application objectives, like maximizing data rate, maximizing cellular traffic offloading, etc. Cellular traffic offloading using Wifi access points and vehicle-to-vehicle (V2V) collaborations are very challenging due to the intermittent short coverage areas of Wifi access points and highly dynamic connectivity of V2V Ad-Hoc network. Most existing works on traffic offloading have considered delay-tolerant or on-demand services, whereas delay-constrained live video streaming services are mostly ignored. This work is focused on live video streaming services over IoCVs, where the non-triviality of the network selection task is demonstrated by formulating the task as an integer linear programming problem (ILPP). Accordingly, a distributed algorithm is proposed, which greedily maximizes cellular traffic offloading while significantly reducing the control packet overheads. Compared to existing works, the proposed work provides the best service effectiveness with a balanced performance on traffic offloading, service efficiency, and user satisfaction.

关键词： Internet of connected vehicles Network access technology selection Collaborative live video streaming distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：