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

NFV-Enabled Service Recovery in Space-Air-Ground Integrated Networks: A Matching Game Based Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Jia, Ziye Cao, Yilu He, Lijun Li, Guangxia Zhou, Fuhui Wu, Qihui Han, Zhu College of Electronic and Information Engineering Nanjing University of Aeronautics and Astronautics Nanjing211106 China State Key Laboratory of ISN Xidian University Xian710071 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China Department of Electrical and Computer Engineering University of Houston HoustonTX77004 United States Department of Computer Science and Engineering Kyung Hee University Seoul446-701 Korea Republic of

To achieve ubiquitous connectivity of the sixth generation communication, the space-air-ground integrated network (SAGIN) is a popular topic. However, the dynamic nodes in SAGIN such as satellites and unmanned aerial vehicles, may be fragile and out of operation, which can potentially cause service failure. Therefore, the research on service recovery in SAGIN under situations of resource failure is critical. In order to facilitate the flexible resource utilization of SAGIN, the network function virtualization technology (NFV) is proposed to be employed. Firstly, the task management is transformed into the deployment of service function chains (SFCs). Then, we design an NFV-based SFC recovery model in SAGIN in the face of resource failure, so that tasks can quickly select alternative resources to complete deployments. Moreover, the problem of SFC recovery is formulated to minimize the total time consumption for all completed SFCs. Since it is an NP-hard integer linear programming problem, we propose the efficient recovery algorithm based on the matching game. Finally, via various simulations, the effectiveness of the proposed algorithm and its advantages are verified, where the total time consumption is optimized by about 25%, compared with other benchmark methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Network function virtualization

Pinching Antennas: Principles, Applications and Challenges

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yang, Zheng Wang, Ning Sun, Yanshi Ding, Zhiguo Schober, Robert Karagiannidis, George K. Wong, Vincent W.S. Dobre, Octavia A. Fujian Provincial Engineering Technology Research Center of Photoelectric Sensing Application Fujian Normal University Fuzhou350117 China School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Khalifa University Abu Dhabi United Arab Emirates University of Manchester ManchesterM1 9BB United Kingdom Germany Group Electrical & Computer Engineering Dept. Aristotle University of Thessaloniki Thessaloniki54 124 Greece Department of Electrical and Computer Engineering The University of British Columbia Vancouver Canada Department of Electrical and Computer Engineering Memorial University St. John’sNL Canada

Flexible-antenna systems, such as fluid antennas and movable antennas, have been recognized as key enabling technologies for sixth-generation (6G) wireless networks, as they can intelligently reconfigure the effective channel gains of the users and hence significantly improve their data transmission capabilities. However, existing flexible-antenna systems have been designed to combat small-scale fading in non-line-of-sight (NLoS) conditions. As a result, they lack the ability to establish line-of-sight links, which are typically 100 times stronger than NLoS links. In addition, existing flexible-antenna systems have limited flexibility, where adding/removing an antenna is not straightforward. This article introduces an innovative flexible-antenna system called pinching antennas, which are realized by applying small dielectric particles to waveguides. We first describe the basics of pinching-antenna systems and their ability to provide strong LoS links by deploying pinching antennas close to the users as well as their capability to scale up/down the antenna system. We then focus on communication scenarios with different numbers of waveguides and pinching antennas, where innovative approaches to implement multiple-input multiple-output and non-orthogonal multiple access are discussed. In addition, promising 6G-related applications of pinching antennas, including integrated sensing and communication and next-generation multiple access, are presented. Finally, important directions for future research, such as waveguide deployment and channel estimation, are highlighted. Copyright © 2025, The Authors. All rights reserved.

关键词： Channel estimation

Data Identification Optimal control for Quantized Linear Systems under DoS Attacks

学校读者我要写书评

暂无评论

IEEE Transactions on Aerospace and Electronic Systems 2025年

作者： Wang, Xianming Li, Liwei Shen, Mouquan Zhao, Xudong Wang, Qing-Guo Zhu, Zheng Hong Nanjing Tech University School of Mechanical and Power Engineering Nanjing211816 China Nanjing Tech University College of Electrical Engineering and Control Science Nanjing211816 China Dalian University of Technology Faculty of Electronic Information and Electrical Engineering Dalian116024 China Beijing Normal University Institute of Ai and Future Networks Zhuhai519087 China BNU-HKBU United International College Guangdong Provincial Key Laboratory Irads Department of Computer Science Zhuhai519087 China York University Department of Mechanical Engineering TorontoONM3J 1P3 Canada

This paper is devoted to data identification optimal control for quantized linear systems under denial of service (DoS) attacks. A least-squares algorithm is provided to identify the unknown system matrices using a data-based representation. An output estimation algorithm utilizing identified matrices is supplied to offset DoS attacks. Consequently, an optimal controller is built on the quantized and attacked data by adaptive dynamic programming. Sufficient conditions are presented to guarantee that the resultant closed-loop system is ultimately uniformly bounded. An example is produced to verify the validity of the proposed approach. © 1965-2011 IEEE.

关键词： Optimal control systems

Switching Multiplicative Watermark Design Against Covert Attacks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Gallo, Alexander J. Anand, Sribalaji C. Teixeira, Andre M.H. Ferrari, Riccardo M.G. Department of Electronics Information and Bioengineering Politecnico di Milano Milano Italy School of Electrical Engineering and Computer Science and Digital Futures KTH Royal Institute of Technology Sweden Department of Information Technology Uppsala University PO Box 337 UppsalaSE-75105 Sweden Delft Center for Systems and Control Mechanical Engineering TU Delft Delft Netherlands

Active techniques have been introduced to give better detectability performance for cyber-attack diagnosis in cyber-physical systems (CPS). In this paper, switching multiplicative watermarking is considered, whereby we propose an optimal design strategy to define switching filter parameters. Optimality is evaluated exploiting the so-called output-to-output gain of the closed loop system, including some supposed attack dynamics. A worst-case scenario of a matched covert attack is assumed, presuming that an attacker with full knowledge of the closed-loop system injects a stealthy attack of bounded energy. Our algorithm, given watermark filter parameters at some time instant, provides optimal next-step parameters. Analysis of the algorithm is given, demonstrating its features, and demonstrating that through initialization of certain parameters outside of the algorithm, the parameters of the multiplicative watermarking can be randomized. Simulation shows how, by adopting our method for parameter design, the attacker’s impact on performance diminishes. © 2025, CC BY-NC-ND.

关键词： Networked control systems

Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms: Challenges and a Roadmap

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Xu, Jianye Alrifaee, Bassam Betz, Johannes Mokhtarian, Armin Mittal, Archak Cai, Mengchi Mangharam, Rahul Shehata, Omar M. Elias, Catherine M. Zaech, Jan-Nico Scheffe, Patrick Jahncke, Felix Ulhas, Sangeet Sankaramangalam Arfvidsson, Kaj Munhoz Department of Computer Science RWTH Aachen University Germany Department of Aerospace Engineering University of the Bundeswehr Munich Germany Professorship of Autonomous Vehicle Systems Technical University of Munich Germany Department of Civil Engineering Indian Institute of Technology Bombay India School of Vehicle and Mobility Tsinghua University China Department of Electrical and Systems Engineering University of Pennsylvania United States Mechatronics Engineering Department Faculty of Engineering and Materials Science The German University in Cairo Egypt Department of Computer Science Engineering The German University in Cairo Egypt INSAIT Sofia University "St. Kliment Ohridski" Bulgaria School for Engineering of Matter Transport and Energy Arizona State University United States Division of Decision and Control Systems KTH Royal Institute of Technology Sweden

This article proposes a roadmap to address the current challenges in small-scale testbeds for Connected and Automated Vehicles (CAVs) and robot swarms. The roadmap is a joint effort of participants in the workshop "1st Workshop on Small-Scale Testbeds for Connected and Automated Vehicles and Robot Swarms," held on June 2 at the IEEE Intelligent Vehicles Symposium (IV) 2024 in Jeju, South Korea. The roadmap contains three parts: 1) enhancing accessibility and diversity, especially for underrepresented communities, 2) sharing best practices for the development and maintenance of testbeds, and 3) connecting testbeds through an abstraction layer to support collaboration. The workshop features eight invited speakers, four contributed papers [1]–[4], and a presentation of a survey paper on testbeds [5]. The survey paper provides an online comparative table of more than 25 testbeds, available at https://***/testbeds-survey. The workshop’s own website is available at https://***/iv24-workshop. Copyright © 2025, The Authors. All rights reserved.

关键词： Testbeds

Environment-Driven Online LiDAR-Camera Extrinsic Calibration

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Huang, Zhiwei Li, Jiaqi Zhong, Ping Fan, Rui The Department of Control Science & Engineering The College of Electronics & Information Engineering Tongji University Shanghai201804 China The School of Computer Science and Engineering Central South University Hunan Changsha410083 China The National Key Laboratory of Science and Technology on Automatic Target Recognition National University of Defense Technology Hunan Changsha410073 China The Department of Control Science & Engineering The College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China The National Key Laboratory of Human-Machine Hybrid Augmented Intelligence Institute of Artificial Intelligence and Robotics Xi’an Jiaotong University Shaanxi Xi’an710049 China

LiDAR-camera extrinsic calibration (LCEC) is the core for data fusion in computer vision. Existing methods typically rely on customized calibration targets or fixed scene types, lacking the flexibility to handle variations in sensor data and environmental contexts. This paper introduces EdO-LCEC, the first environment-driven, online calibration approach that achieves human-like adaptability. Inspired by the human perceptual system, EdO-LCEC incorporates a generalizable scene discriminator to actively interpret environmental conditions, creating multiple virtual cameras that capture detailed spatial and textural information. To overcome cross-modal feature matching challenges between LiDAR and camera, we propose dual-path correspondence matching (DPCM), which leverages both structural and textural consistency to achieve reliable 3D-2D correspondences. Our approach formulates the calibration process as a spatial-temporal joint optimization problem, utilizing global constraints from multiple views and scenes to improve accuracy, particularly in sparse or partially overlapping sensor views. Extensive experiments on real-world datasets demonstrate that EdO-LCEC achieves state-of-the-art performance, providing reliable and precise calibration across diverse, challenging environments. Copyright © 2025, The Authors. All rights reserved.

关键词： Spatio-temporal data

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

Fast implementation of the forward positional acceleration of robots via the distributed arithmetic technique

学校读者我要写书评

暂无评论

CIRCUITS SYSTEMS AND SIGNAL PROCESSING 1997年第2期16卷 165-195页

作者： Grigoriadis, GK Mertzios, BG Automatic Control Systems Laboratory Department of Electrical and Computer Engineering Dimocritus University of Thrace Xanthi Greece

This paper refers to the fast implementation of the positional forward acceleration of the end effector of revolute robotic arms with spherical wrists, using the distributed arithmetic technique. The acceleration of the end effector is calculated by a cascade configuration of two pipelined arrays that calculate the Jacobian matrix and its time derivative, as well as the centrifugal-Coriolis and linear accelerations. These partial accelerations are then added in the adder tree. The building blocks of the arrays are the distributed arithmetic-based circuits that implement the matrix-vector multiplications involved in the calculations. The digit-serial configuration of the proposed implementation of the positional forward acceleration of the end effector is described. The serial and the parallel configurations may result as special cases of the digit-serial configuration. The proposed distributed arithmetic (DA) implementation of the positional forward acceleration may be applied, after appropriate modifications, to the general case of robots having either revolute or prismatic joints, with any type of wrist.

关键词： End effectors

Online Joint Power Allocation and Task Scheduling for LEO Satellite Networks

学校读者我要写书评

暂无评论

Online Joint Power Allocation and Task Scheduling for LEO Sa...

IEEE Conference on Wireless Communications and Networking

作者： Zheyuan Li Lijun He Juncheng Wang Ziye Jia Yanting Wang Chau Yuen School of Software Northwestern Polytechnical University China School of Information and Control Engineering China University of Mining and Technology China Department of Computer Science Hong Kong Baptist University China Ministry of Industry and Information Technology Nanjing University of Aeronautics and Astronautics China School of Electrical and Electronics Engineering Nanyang Technological University Singapore

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

The excessive proliferation of Low Earth Orbit (LEO) satellites inescapably bring the explosive growth of space data in LEO Satellite Networks (LSNs). Meanwhile, the stochastic arrivals of space data together with the time-varying satellite-ground links in LSNs pose significant challenges for offloading a large volume of space data from LSNs to ground stations. To circumvent these challenges, we systematically study the energy-constrained online data offloading problem to jointly optimize power allocation and task scheduling for LSNs. First, we leverage Lyapunov optimization to decouple our formulated long-term stochastic joint optimization problem into a set of per-time-slot subproblems. Then, each subproblem is decoupled into a task scheduling problem and a power allocation problem. Next, we derive the optimal solution to the power allocation problem and propose a multi-armed bandit based quasi-optimal solution to the task scheduling problem. Finally, extensive simulation results show that our proposed algorithm has superior performance over the state-of-the-art solutions.

关键词： Space vehicles Satellites Simulation Low earth orbit satellites Scheduling Explosives Resource management Optimization Space stations