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

Secrecy Outage Probability Analysis for Downlink RIS-NOMA Networks with On-Off control

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Pei, Yingjie Yue, Xinwei Yi, Wenqiang Liu, Yuanwei Li, Xuehua Ding, Zhiguo Key Laboratory of Information and Communication Systems Ministry of Information Industry Key Laboratory of Modern Measurement & Control Technology Ministry of Education Beijing Information Science and Technology University Beijing100101 China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom Department of Electrical Engineering Princeton University Princeton United States School of Electrical and Electronic Engineering The University of Manchester Manchester United Kingdom

Reconfigurable intelligent surface (RIS) has been regarded as a promising technology since it has ability to create the favorable channel conditions. This paper investigates the secure communications of RIS assisted non-orthogonal multiple access (NOMA) networks, where both external and internal eavesdropping scenarios are taken into consideration. More specifically, novel approximate and asymptotic expressions of secrecy outage probability (SOP) for the k-th legitimate user (LU) are derived by invoking imperfect successive interference cancellation (ipSIC) and perfect successive interference cancellation (pSIC). To characterize the secrecy performance of RIS-NOMA networks, the diversity order of the k-th LU with ipSIC/pSIC is obtained in the high signal-to-noise ratio region. The secrecy system throughput of RIS-NOMA networks is discussed in delay-limited transmission mode. Numerical results are presented to verify theoretical analysis that: i) The SOP of RIS-NOMA networks is superior to that of RIS assisted orthogonal multiple access (OMA) and conventional cooperative communication schemes;ii) As the number of reflecting elements increases, the RIS-NOMA networks are capable of achieving the enhanced secrecy performance;and iii) The RIS-NOMA networks have better secrecy system throughput than that of RIS-OMA networks and conventional cooperative communication schemes. Copyright © 2024, The Authors. All rights reserved.

关键词： Cooperative communication

Privacy-Aware Joint DNN Model Deployment and Partition Optimization for Delay-Efficient Collaborative Edge Inference

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Cheng, Zhipeng Xia, Xiaoyu Wang, Hong Liwang, Minghui Chen, Ning Fan, Xuwei Wang, Xianbin School of Future Science and Engineering Soochow University Suzhou215006 China School of Computing Technologies RMIT University MelbourneVIC Australia Department of Control Science and Engineering The National Key Laboratory of Autonomous Intelligent Unmanned Systems Tongji University Shanghai201804 China Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Tongji University Shanghai201804 China Qingdao China College of Computer and Information Sciences Fujian Agriculture and Forestry University Fuzhou350002 China Department of Electrical and Computer Engineering Western University ON Canada

Edge inference (EI) is a key solution to address the growing challenges of delayed response times, limited scalability, and privacy concerns in cloud-based Deep Neural Network (DNN) inference. However, deploying DNN models on resource-constrained edge devices faces more severe challenges, such as model storage limitations, dynamic service requests, and privacy risks. This paper proposes a novel framework for privacy-aware joint DNN model deployment and partition optimization to minimize long-term average inference delay under resource and privacy constraints. Specifically, the problem is formulated as a complex optimization problem considering model deployment, user-server association, and model partition strategies. To handle the NP-hardness and future uncertainties, a Lyapunov-based approach is introduced to transform the long-term optimization into a single-time-slot problem, ensuring system performance. Additionally, a coalition formation game model is proposed for edge server association, and a greedy-based algorithm is developed for model deployment within each coalition to efficiently solve the problem. Extensive simulations show that the proposed algorithms effectively reduce inference delay while satisfying privacy constraints, outperforming baseline approaches in various scenarios. Copyright © 2025, The Authors. All rights reserved.

关键词： Differential privacy

Constructive barrier feedback for collision avoidance in leader-follower formation control

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Tang, Zhiqi Cunha, Rita Hamel, Tarek Silvestre, Carlos Institute for Systems and Robotics Instituto Superior Técnico Universidade de Lisboa Portugal Division of Decision and Control Systems KTH Royal Institute of Technology Sweden I3S-CNRS Université Côte d'Azur Institut Universitaire de France France Department of Electrical and Computer Engineering The Faculty of Science and Technology The University of Macau China

This paper proposes a novel constructive barrier feedback for reactive collision avoidance between two agents. It incorporates this feature in a formation tracking control strategy for a group of 2nd-order dynamic robots defined in three-dimensional space. Using only relative measurements between neighboring agents, we propose an elegant decentralized controller as the sum of a nominal tracking controller and the constructive barrier feedback for leader-follower formations under a directed single-spanning tree graph topology. The key ingredient is the use of divergent flow as a dissipative term, which slows down the relative velocity in the direction of the neighboring robots without compromising the nominal controller's performance. Compared to traditional barrier function-based optimization controllers, the proposed constructive barrier feedback avoids feasibility issues and results in more computationally efficient control algorithms with systematic equilibrium analysis. Simulations are provided to validate the effectiveness of the proposed control method. © 2023, CC BY-NC-ND.

关键词： Collision avoidance

Communication Compression for Distributed Nonconvex Optimization

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Chai, Tianyou Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm100 44 Sweden Department of Electrical Engineering University of North Texas DentonTX76203 United States State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

This paper considers distributed nonconvex optimization with the cost functions being distributed over agents. Noting that information compression is a key tool to reduce the heavy communication load for distributed algorithms as agents iteratively communicate with neighbors, we propose three distributed primal–dual algorithms with compressed communication. The first two algorithms are applicable to a general class of compressors with bounded relative compression error and the third algorithm is suitable for two general classes of compressors with bounded absolute compression error. We show that the proposed distributed algorithms with compressed communication have comparable convergence properties as state-of-the-art algorithms with exact communication. Specifically, we show that they can find first-order stationary points with sublinear convergence rate O(1/T) when each local cost function is smooth, where T is the total number of iterations, and find global optima with linear convergence rate under an additional condition that the global cost function satisfies the Polyak–Lojasiewicz condition. Numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2022, The Authors. All rights reserved.

关键词： Iterative methods

Optimal Database Allocation in Finite Time with Efficient Communication and Transmission Stopping over Dynamic Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Rikos, Apostolos I. Hadjicostis, Christoforos N. Johansson, Karl H. The Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden Digital Futures StockholmSE-100 44 Sweden Department of Electrical and Computer Engineering University of Cyprus Nicosia1678 Cyprus

In this paper, we focus on the problem of data sharing over a wireless computer network (i.e., a wireless grid). Given a set of available data, we present a distributed algorithm which operates over a dynamically changing network, and allows each node to calculate the optimal allocation of data in a finite number of time steps. We show that our proposed algorithm (i) converges to the optimal solution in finite time with very high probability, and (ii) once the optimal solution is reached, each node is able to cease transmissions without needing knowledge of a global parameter such as the network diameter. Furthermore, our algorithm (i) operates exclusively with quantized values (i.e., each node processes and transmits quantized information), (ii) relies on event-driven updates, and (iii) calculates the optimal solution in the form of a quantized fraction which avoids errors due to quantization. Finally, we demonstrate the operation, performance, and potential advantages of our algorithm over random dynamic networks. © 2022, CC BY.

关键词： Optimal systems

Finite Time Privacy Preserving Quantized Average Consensus with Transmission Stopping

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Rikos, Apostolos I. Hadjicostis, Christoforos N. Johansson, Karl H. The Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden Digital Futures StockholmSE-100 44 Sweden The Department of Electrical and Computer Engineering University of Cyprus Nicosia1678 Cyprus

Due to their flexibility, battery powered or energy-harvesting wireless networks are employed in diverse applications. Securing data transmissions between wireless devises is of critical importance in order to avoid privacy-sensitive user data leakage. In this paper, we focus on the scenario where some nodes are curious (but not malicious) and try to identify the initial states of one (or multiple) other nodes, while some nodes aim to preserve the privacy of their initial states from the curious nodes. We present a privacy preserving finite transmission event-triggered quantized average consensus algorithm. Its operation is suitable for battery-powered or energy-harvesting wireless network since it guarantees (i) efficient (quantized) communication, and (ii) transmission ceasing (which allows preservation of available energy). Furthermore, we present topological conditions under which the proposed algorithm allows nodes to preserve their privacy. We conclude with a comparison of our algorithm against other algorithms in the existing literature. © 2022, CC BY.

关键词： Wireless networks

Minimal realizations of input-output behaviors by LPV state-space representations with affine dependency

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Petreczky, Mihály Tóth, Roland Mercère, Guillaume Univ. Lille CNRS Centrale Lille UMR 9189 CRIStAL LilleF-59000 France The University of Poitiers Laboratoire d’Informatique et d’Automatique pour les Systèmes France The Control Systems Group Department of Electrical Engineering Eindhoven University of Technology Eindhoven Netherlands The Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

The paper makes the first steps towards a behavioral theory of LPV state-space representations with an affine dependency on scheduling, by characterizing minimality of such state-space representations. It is shown that minimality is equivalent to observability, and that minimal realizations of the same behavior are isomorphic. Finally, we establish a formal relationship between minimality of LPV state-space representations with an affine dependence on scheduling and minimality of LPV state-space representations with a dynamic and meromorphic dependence on scheduling. © 2023, CC BY.

关键词： State space methods

A Zeroth-Order Momentum Method for Risk-Averse Online Convex Games

学校读者我要写书评

暂无评论

A Zeroth-Order Momentum Method for Risk-Averse Online Convex...

IEEE Conference on decision and control

作者： Zifan Wang Yi Shen Zachary I. Bell Scott Nivison Michael M. Zavlanos Karl H. Johansson Division of Decision and Control Systems School of Electrical Enginnering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Mechanical Engineering and Materials Science Duke University Durham NC USA Air Force Research Laboratory Eglin AFB FL USA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

We consider risk-averse learning in repeated unknown games where the goal of the agents is to minimize their individual risk of incurring significantly high cost. Specifically, the agents use the conditional value at risk (CVaR) as a risk measure and rely on bandit feedback in the form of the cost values of the selected actions at every episode to estimate their CVaR values and update their actions. A major challenge in using bandit feedback to estimate CVaR is that the agents can only access their own cost values, which, however, depend on the actions of all agents. To address this challenge, we propose a new risk-averse learning algorithm with momentum that utilizes the full historical information on the cost values. We show that this algorithm achieves sub-linear regret and matches the best known algorithms in the literature. We provide numerical experiments for a Cournot game that show that our method outperforms existing methods.

关键词： Costs Estimation Games Numerical simulation Standards

Navigating a mobile robot using switching distributed sensor networks

学校读者我要写书评

暂无评论

arXiv 2021年

作者： He, Xingkang Hashemi, Ehsan Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Department of Mechanical Engineering University of Alberta Canada

—This paper proposes a method to navigate a mobile robot by estimating its state over a number of distributed sensor networks (DSNs) such that it can successively accomplish a sequence of tasks, i.e., its state enters each targeted set and stays inside no less than the desired time, under a resource-aware, time-efficient, and computation- and communication-constrained setting. We propose a new robot state estimation and navigation architecture, which integrates an event-triggered task-switching feedback controller for the robot and a two-time-scale distributed state estimator for each sensor. The architecture has three major advantages over existing approaches: First, in each task only one DSN is active for sensing and estimating the robot state, and for different tasks the robot can switch the active DSN by taking resource saving and system performance into account;Second, the robot only needs to communicate with one active sensor at each time to obtain its state information from the active DSN;Third, no online optimization is required. With the controller, the robot is able to accomplish a task by following a reference trajectory and switch to the next task when an event-triggered condition is fulfilled. With the estimator, each active sensor is able to estimate the robot state. Under proper conditions, we prove that the state estimation error and the trajectory tracking deviation are upper bounded by two time-varying sequences respectively, which play an essential role in the event-triggered condition. Furthermore, we find a sufficient condition for accomplishing a task and provide an upper bound of running time for the task. Numerical simulations of an indoor robot’s localization and navigation are provided to validate the proposed architecture. Copyright © 2021, The Authors. All rights reserved.

关键词： Navigation