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

Resilient and distributed Discrete Optimal Transport With Deceptive Adversary: A Game-Theoretic Approach

IEEE CONTROL SYSTEMS LETTERS 2022年 6卷 1166-1171页

作者： Hughes, Jason Chen, Juntao Fordham Univ Dept Comp & Informat Sci New York NY 10023 USA

Optimal transport (OT) is a framework that can be used to guide the optimal allocation of a limited amount of resources. The classical OT paradigm does not consider malicious attacks in its formulation and thus the designed transport plan lacks resiliency to an adversary. To address this concern, we establish an OT framework that explicitly accounts for the adversarial and stealthy manipulation of participating nodes in the network during the transport strategy design. Specifically, we propose a game-theoretic approach to capture the strategic interactions between the transport planner and the deceptive attacker. We analyze the properties of the established two-person zero-sum game thoroughly. We further develop a fully distributed algorithm to compute the optimal resilient transport strategies, and show the convergence of the algorithm to a saddle-point equilibrium. Finally, we demonstrate the effectiveness of the designed algorithm using case studies.

关键词： distributed algorithms Resource management Receivers Games Uncertainty Transportation Resilience Discrete optimal transport distributed algorithm adversarial attack resilience resource matching

来源：评论

学校读者我要写书评

暂无评论

A Novel distributed algorithm for Complete Targets Coverage in Energy Harvesting Wireless Sensor Networks

A Novel Distributed Algorithm for Complete Targets Coverage ...

引用

IEEE International Conference on Communications (ICC)

作者： Yang, Changlin Chin, Kwan-Wu Univ Wollongong Sch Elect Comp & Telecommun Engn Wollongong NSW 2522 Australia

ISBN: (纸本)9781479920037

A fundamental problem in energy harvesting Wireless Sensor Networks (WSNs) is to maximize coverage, whereby the goal is to capture events of interest that occur in one or more target areas. To this end, this paper addresses the problem of maximizing network lifetime whilst ensuring all targets are monitored continuously by at least one sensor node. Specifically, we will address the distributed Maximum Lifetime Coverage with Energy Harvesting (DMLC-EH) problem. The objective is to determine a distributed algorithm that allows sensor nodes to form a minimal set cover using local information whilst minimizing missed recharging opportunities. We propose an eligibility test that ensures the sensor nodes with higher energy volunteer to monitor targets. After that, we propose a Maximum Energy Protection (MEP) protocol that places an on-duty node with low energy to sleep while maintaining complete targets coverage. Our results show MEP increases network lifetime by 30% and has 10% less redundancy as compared to two similar algorithms developed for finite battery WSNs.

关键词： Wireless Sensor Networks Targets Coverage Energy Harvesting distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

2-D distributed pose estimation of multi-agent systems using bearing measurements

引用

Journal of Automation and Intelligence 2023年第2期2卷 70-78页

作者： Xu Fang Jitao Li Xiaolei Li Lihua Xie School of Electrical and Electronic Engineering Nanyang Technological University639798Singapore College of Mechanical and Electrical Engineering Harbin Engineering University150001China School of Electrical Engineering Yanshan University066004China

This article studies distributed pose(orientation and position)estimation of leader–follower multi-agent systems over𝜅-layer graphs in 2-D *** the leaders have access to their orientations and positions,while the followers can measure the relative bearings or(angular and linear)velocities in their unknown local coordinate *** the orientation estimation,the local relative bearings are used to obtain the relative orientations among the agents,based on which a distributed orientation estimation algorithm is proposed for each follower to estimate its *** the position estimation,the local relative bearings are used to obtain the position constraints among the agents,and a distributed position estimation algorithm is proposed for each follower to estimate its position by solving its position *** the orientation and position estimation errors converge to zero asymptotically.A simulation example is given to verify the theoretical results.

关键词： Pose estimation distributed algorithm Bearing measurements Multi-agent system Local coordinate frame 2-D plane

来源：评论

学校读者我要写书评

暂无评论

Jamming-Resilient Consensus for Wireless Blockchain Networks

引用

Tsinghua Science and Technology 2025年第1期30卷 262-278页

作者： Yifei Zou Meng Hou Li Yang Minghui Xu Libing Wu Dongxiao Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266237China School of Cyber Science and Engineering Wuhan UniversityWuhan 430072China

As the device complexity keeps increasing,the blockchain networks have been celebrated as the cornerstone of numerous prominent platforms owing to their ability to provide distributed and immutable ledgers and data-driven autonomous *** distributed consensus algorithm is the core component that directly dictates the performance and properties of blockchain ***,the inherent characteristics of the shared wireless medium,such as fading,interference,and openness,pose significant challenges to achieving consensus within these networks,especially in the presence of malicious jamming *** cope with the severe consensus problem,in this paper,we present a distributed jamming-resilient consensus algorithm for blockchain networks in wireless environments,where the adversary can jam the communication channel by injecting jamming *** on a non-binary slight jamming model,we propose a distributed four-stage algorithm to achieve consensus in the wireless blockchain network,including leader election,leader broadcast,leader aggregation,and leader announcement *** high probability,we prove that our jamming-resilient algorithm can ensure the validity,agreement,termination,and total order properties of consensus with the time complexity of O(n).Both theoretical analyses and empirical simulations are conducted to verify the consistency and efficiency of our algorithm.

关键词： consensus in blockchain jamming attacks distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Nash Equilibrium Seeking for Multicluster Games of Multiple Nonidentical Euler-Lagrange Systems

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2023年第4期10卷 1732-1743页

作者： Nian, Xiaohong Niu, Fuxi Li, Shiling Cent South Univ Key Lab Inst Cluster Unmanned Syst Sch Automat Changsha 410083 Peoples R China Hunan Univ Technol & Business Changsha 410083 Peoples R China

The problem of seeking Nash equilibrium (NE) in multicluster games is studied. Different from the existing multicluster game studies, the participants considered in this article have Euler-Lagrange dynamics and cannot directly obtain the information of nonneighbor participants. Agents can only communicate through directed communication graphs. In addition, there are coupling constraints between agent decisions in the same cluster. Under the widely used assumptions, two distributed algorithms are proposed to solve the NE of the multicluster game based on gradient descent, state feedback, and consensus protocol. The convergence of the two algorithms is analyzed by singular perturbation analysis and variational analysis. The theoretical results show that the first algorithm achieves exponential convergence when the parameters are certain, while the other algorithm also achieves global asymptotic convergence when the parameters are uncertain. Finally, the effectiveness of the search strategy is verified by numerical examples.

关键词： Games Clustering algorithms Cost function Heuristic algorithms Nash equilibrium Topology Convergence Coupling constraints distributed algorithm Euler-Lagrange (EL) systems multicluster game Nash equilibrium (NE)

来源：评论

学校读者我要写书评

暂无评论

distributed Conditional Gradient algorithm for Two-Network Saddle-point Problem

Distributed Conditional Gradient Algorithm for Two-Network S...

引用

第34届中国控制与决策会议

作者： Jie Hou Xianlin Zeng Key Laboratory of Intelligent Control and Decision of Complex Systems School of AutomationBeijing Institute of Technology

We consider a two-network saddle-point problem with constraints,whose projections are *** propose a projection-free algorithm,which is referred to as distributed Frank-Wolfe Saddle-Point algorithm（DFWSP）,which combines the gradient tracking technique and Frank-Wolfe *** prove that the algorithm achieves O（1/k） convergence rate for strongly-convex-strongly-concave saddle-point *** empirically shows that the proposed algorithm has better numerical performance than the distributed projected saddle-point algorithm.

关键词： Saddle-Point Problem distributed algorithm Projection-Free Method Convergence Rate

来源：评论

学校读者我要写书评

暂无评论

Loosely-Stabilizing algorithm on Almost Maximal Independent Set

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2023年第11期E106D卷 1762-1771页

作者： Dong, Rongcheng Izumi, Taisuke Kitamura, Naoki Sudo, Yuichi Masuzawa, Toshimitsu Osaka Univ Suita 565 0871 Japan Hosei Univ Koganei 1848584 Japan

The maximal independent set (MIS) problem is one of the most fundamental problems in the field of distributed computing. This paper focuses on the MIS problem with unreliable communication between processes in the system. We propose a relaxed notion of MIS, named almost MIS (ALMIS), and show that the loosely-stabilizing algorithm proposed in our previous work can achieve exponentially long holding time with logarithmic convergence time and space complexity regarding ALMIS, which cannot be achieved at the same time regarding MIS in our previous work.

关键词： maximal independent set distributed algorithm self-stabilization loose-stabilization unreliable communications

来源：评论

学校读者我要写书评

暂无评论

On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2023年第4期34卷 1115-1127页

作者： Kumar, Manish Molla, Anisur Rahaman Indian Stat Inst Kolkata 700108 West Bengal India

This article investigates the message complexity of two fundamental problems, leader election and agreement in the crash-fault synchronous and fully-connected distributed network. We present randomized (Monte Carlo) algorithms for both the problems and also show non-trivial lower bounds on the message complexity. Our algorithms achieve sublinear message complexity in the so-called implicit version of the two problems when tolerating more than a constant fraction of the faulty nodes. In comparison to the state-of-art, our results improved and extended the works of [Gilbert-Kowalski, SODA'10] (which studied only the agreement problem) in several directions. Specifically, our algorithms tolerate any number of faulty nodes up to (n - polylog n). The message complexity (and also the time complexity) of our algorithms is optimal (up to a polylog n factor). Further, our algorithm works in anonymous networks, where nodes do not know each other. To the best of our knowledge, these are the first sub-linear results for both the leader election and the agreement problem in the crash-fault distributed networks.

关键词： Complexity theory Voting Fault tolerant systems Fault tolerance Computer crashes Peer-to-peer computing Protocols distributed algorithm randomized algorithm fault-tolerant algorithm crash-fault leader election agreement message complexity

来源：评论

学校读者我要写书评

暂无评论

Non-cooperative differential game and feedback Nash equilibrium analysis for real-time electricity markets

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2023年 144卷

作者： Wu, Chenyu Gu, Wei Yi, Zhongkai Lin, Chenhui Long, Huan Southeast Univ Sch Elect Engn Nanjing 210096 Jiangsu Peoples R China Tsinghua Shenzhen Int Grad Sch Tsinghua Berkeley Shenzhen Inst Shenzhen 518055 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

Continuous liberalization of electricity markets makes a strong correlation between the economic behaviors of market participants and their profits. To guide the production of generators before the market reaches equi-librium, a new framework is proposed to model the real-time electricity market with help of optimal control theory. The market price is described as the dynamic state using a sticky price model. We establish an N-person non-cooperative differential game model, where all participants try to maximize their profits independently only by observing power prices. The existence of feedback Nash equilibrium and uniqueness of optimal price tra-jectory are proved in detail, which will help other scholars build an effective differential game model. To protect the privacy of all generators, a distributed algorithm is proposed based on neurodynamic and consensus theory, which only requires information exchange among neighboring participants. Furthermore, a special case of a duopoly power market is investigated in detail and we provide a feedback time-continuous solution for each generator. Compared with the commercial Cplex solver, the proposed distributed algorithm performs better in convergence speed.

关键词： Differential game Dynamic market analysis Electricity market distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Evaluation Mechanism for Decentralized Collaborative Pattern Learning in Heterogeneous Vehicular Networks

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2023年第11期24卷 13123-13132页

作者： Qiao, Cheng Qiu, Jing Tan, Zhiyuan Min, Geyong Zomaya, Albert Y. Tian, Zhihong Guangzhou Univ Cyberspace Inst Adv Technol Guangzhou 510006 Peoples R China Edinburgh Napier Univ Sch Comp Edinburgh EH10 5DT Midlothian Scotland Univ Exeter High Performance Comp & Network Grp Exeter EX4 4PY Devon England Univ Sydney Sch Comp Sci Sydney NSW 2006 Australia

Collaborative machine learning, especially Federated Learning (FL), is widely used to build high-quality Machine Learning (ML) models in the Internet of Vehicles (IoV). In this paper, we study the performance evaluation problem in an inherently heterogeneous IoV, where the final models across the network are not identical and are computed on different standards. Previous studies assume that local agents are receiving data from the same phenomenon, and a same final model is fitted to them. However, this "one model fits all" approach leads to a biased performance evaluation of individual agents. We propose a general approach to measure the performance of individual agents, where the common knowledge and correlation between different agents are explored. Experimental results indicate that our evaluation scheme is efficient in these settings.

关键词： Computational modeling Data models Security Standards Sea measurements Collaboration Clustering algorithms Internet of Vehicles distributed algorithm clustering similarity measurement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：