SearcharxivSearch

arXiv subjects

Van-Phuc Bui

Publications and source records attributed to Van-Phuc Bui.

16 recordsLinked to original sources

Federated Low-Rank Koopman Learning for Multivariate Time-Series Anomaly Detection in IoT Systems

Distributed IoT systems generate multivariate time-series streams for monitoring physical assets, servers, and embedded sensing platforms. Detecting abnormal temporal behavior is critical for fault diagnosis, predictive maintenance, and security. However, practical IoT anomaly detection is hindered by decentralized and non-IID data, limited bandwidth, and the constrained computation and memory of edge devices. This paper proposes FedKAD, a resource-efficient federated Koopman anomaly detection framework for distributed IoT multivariate time series. Unlike deep-learning-based anomaly detectors that require training and communicating large neural models, FedKAD learns normal temporal dynamics through lightweight sliding-window Koopman representations. Federated training is formulated as a low-rank consensus problem, where raw sensor streams and local reduced dynamics remain on device while only compact subspace variables are exchanged with the server. To optimize the shared representation under orthonormality constraints, we develop a federated Stiefel-ADMM algorithm and provide convergence and stationarity analysis under partial client participation. During inference, each client detects anomalies locally by measuring the prediction residual between observed future trajectories and the learned Koopman dynamics. Experiments on four widely used multivariate time-series anomaly detection benchmarks show that FedKAD maintains or improves detection performance compared with federated deep-learning baselines. More importantly for IoT deployment, FedKAD provides up to $2.1\times10^3$ faster training, $80\times$ lower communication, and $79\times$ lower inference latency than neural baselines, confirming its suitability for resource-constrained edge devices.

cs.LG

Microsecond Federated SVD on Grassmann Manifold for Real-time IoT Intrusion Detection

This paper introduces FedSVD, a novel unsupervised federated learning framework for real-time anomaly detection in IoT networks. By leveraging Singular Value Decomposition (SVD) and optimization on the Grassmann manifolds, FedSVD enables accurate detection of both known and unknown intrusions without relying on labeled data or centralized data sharing. Tailored for deployment on low-power devices like the NVIDIA Jetson AGX Orin, the proposed method significantly reduces communication overhead and computational cost. Experimental results show that FedSVD achieves performance comparable to deep learning baselines while reducing inference latency by over 10x, making it suitable for latency-sensitive IoT applications.

eess.SP

Experimental Study of Low-Latency Video Streaming in an ORAN Setup with Generative AI

Current Adaptive Bit Rate (ABR) methods react to network congestion after it occurs, causing application layer buffering and latency spikes in live video streaming. We introduce a proactive semantic control channel that enables coordination between Open Radio Access Network (ORAN) xApp, Mobile Edge computing (MEC), and User Equipment (UE) components for seamless live video streaming between mobile devices. When the transmitting UE experiences poor Uplink (UL) conditions, the MEC proactively instructs downscaling based on low-level RAN metrics, including channel SNR updated every millisecond, preventing buffering before it occurs. A Generative AI (GAI) module at the MEC reconstructs high-quality frames from downscaled video before forwarding to the receiving UE via the typically more robust Downlink (DL). Experimental validation on a live ORAN testbed with 50 video streams shows that our approach reduces latency tail behavior while achieving up to 4 dB improvement in PSNR and 15 points in VMAF compared to reactive ABR methods. The proactive control eliminates latency spikes exceeding 600 ms, demonstrating effective cross-layer coordination for latency-critical live video streaming.

cs.NI

Scalable Data Transmission Framework for Earth Observation Satellites with Channel Adaptation

The immense volume of data generated by Earth observation (EO) satellites presents significant challenges in transmitting it to Earth over rate-limited satellite-to-ground communication links. This paper presents an efficient downlink framework for multi-spectral satellite images, leveraging adaptive transmission techniques based on pixel importance and link capacity. By integrating semantic communication principles, the framework prioritizes critical information, such as changed multi-spectral pixels, to optimize data transmission. The process involves preprocessing, assessing pixel importance to encode only significant changes, and dynamically adjusting transmissions to match channel conditions. Experimental results on the real dataset and simulated link demonstrate that the proposed approach ensures high-quality data delivery while significantly reducing number of transmitted data, making it highly suitable for satellite-based EO applications.

eess.SP

The Role of Game Networking in the Fusion of Physical and Digital Worlds through 6G Wireless Networks

The sixth generation (6G) of wireless technology is seen as one of the enablers of real-time fusion of the physical and digital realms, as in Digital Twin, eXtended reality, or the Metaverse. This would allow people to interact, work, and entertain themselves in an immersive social network of online 3D virtual environments. From the viewpoint of communication and networking, this will represent an evolution of the game networking technology, designed to interconnect massive users in real-time online gaming environments. This article presents the basic principles of game networking and discusses their evolution towards meeting the requirements of the Metaverse and similar applications. Several open research challenges are discussed, along with possible solutions through experimental case studies.

eess.SP

Digital Twin for Autonomous Guided Vehicles based on Integrated Sensing and Communications

This paper presents a Digital Twin (DT) framework for the remote control of an Autonomous Guided Vehicle (AGV) within a Network Control System (NCS). The AGV is monitored and controlled using Integrated Sensing and Communications (ISAC). In order to meet the real-time requirements, the DT computes the control signals and dynamically allocates resources for sensing and communication. A Reinforcement Learning (RL) algorithm is derived to learn and provide suitable actions while adjusting for the uncertainty in the AGV's position. We present closed-form expressions for the achievable communication rate and the Cramer-Rao bound (CRB) to determine the required number of Orthogonal Frequency-Division Multiplexing (OFDM) subcarriers, meeting the needs of both sensing and communication. The proposed algorithm is validated through a millimeter-Wave (mmWave) simulation, demonstrating significant improvements in both control precision and communication efficiency.

eess.SP

Timely Communication from Sensors for Wireless Networked Control in Cloud-Based Digital Twins

We consider a Wireless Networked Control System (WNCS) where sensors provide observations to build a DT model of the underlying system dynamics. The focus is on control, scheduling, and resource allocation for sensory observation to ensure timely delivery to the DT model deployed in the cloud. \phuc{Timely and relevant information, as characterized by optimized data acquisition policy and low latency, are instrumental in ensuring that the DT model can accurately estimate and predict system states. However, optimizing closed-loop control with DT and acquiring data for efficient state estimation and control computing pose a non-trivial problem given the limited network resources, partial state vector information, and measurement errors encountered at distributed sensing agents.} To address this, we propose the \emph{Age-of-Loop REinforcement learning and Variational Extended Kalman filter with Robust Belief (AoL-REVERB)}, which leverages an uncertainty-control reinforcement learning solution combined with an algorithm based on Value of Information (VoI) for performing optimal control and selecting the most informative sensors to satisfy the prediction accuracy of DT. Numerical results demonstrate that the DT platform can offer satisfactory performance while halving the communication overhead.

eess.SP

Digital Twin of Industrial Networked Control System based on Value of Information

The paper examines a scenario wherein sensors are deployed within an Industrial Networked Control System, aiming to construct a digital twin (DT) model for a remotely operated Autonomous Guided Vehicle (AGV). The DT model, situated on a cloud platform, estimates and predicts the system's state, subsequently formulating the optimal scheduling strategy for execution in the physical world. However, acquiring data crucial for efficient state estimation and control computation poses a significant challenge, primarily due to constraints such as limited network resources, partial observation, and the necessity to maintain a certain confidence level for DT estimation. We propose an algorithm based on Value of Information (VoI), seamlessly integrated with the Extended Kalman Filter to deliver a polynomial-time solution, selecting the most informative subset of sensing agents for data. Additionally, we put forth an alternative solution leveraging a Graph Neural Network to precisely ascertain the AGV's position with a remarkable accuracy of up to 5 cm. Our experimental validation in an industrial robotic laboratory environment yields promising results, underscoring the potential of high-accuracy DT models in practice.

eess.SP

On-board Change Detection for Resource-efficient Earth Observation with LEO Satellites

The amount of data generated by Earth observation satellites can be enormous, which poses a great challenge to the satellite-to-ground connections with limited rate. This paper considers problem of efficient downlink communication of multi-spectral satellite images for Earth observation using change detection. The proposed method for image processing consists of the joint design of cloud removal and change encoding, which can be seen as an instance of semantic communication, as it encodes important information, such as changed multi-spectral pixels (MPs), while aiming to minimize energy consumption. It comprises a three-stage end-to-end scoring mechanism that determines the importance of each MP before deciding its transmission. Specifically, the sensing image is (1) standardized, (2) passed through a high-performance cloud filtering via the Cloud-Net model, and (3) passed to the proposed scoring algorithm that uses Change-Net to identify MPs that have a high likelihood of being changed, compress them and forward the result to the ground station. The experimental results indicate that the proposed framework is effective in optimizing energy usage while preserving high-quality data transmission in satellite-based Earth observation applications.

eess.SP

Value-Based Reinforcement Learning for Digital Twins in Cloud Computing

The setup considered in the paper consists of sensors in a Networked Control System that are used to build a digital twin (DT) model of the system dynamics. The focus is on control, scheduling, and resource allocation for sensory observation to ensure timely delivery to the DT model deployed in the cloud. Low latency and communication timeliness are instrumental in ensuring that the DT model can accurately estimate and predict system states. However, acquiring data for efficient state estimation and control computing poses a non-trivial problem given the limited network resources, partial state vector information, and measurement errors encountered at distributed sensors. We propose the REinforcement learning and Variational Extended Kalman filter with Robust Belief (REVERB), which leverages a reinforcement learning solution combined with a Value of Information-based algorithm for performing optimal control and selecting the most informative sensors to satisfy the prediction accuracy of DT. Numerical results demonstrate that the DT platform can offer satisfactory performance while reducing the communication overhead up to five times.

eess.SP

Scheduling Policy for Value-of-Information (VoI) in Trajectory Estimation for Digital Twins

This paper presents an approach to schedule observations from different sensors in an environment to ensure their timely delivery and build a digital twin (DT) model of the system dynamics. At the cloud platform, DT models estimate and predict the system's state, then compute the optimal scheduling policy and resource allocation strategy to be executed in the physical world. However, given limited network resources, partial state vector information, and measurement errors at the distributed sensing agents, the acquisition of data (i.e., observations) for efficient state estimation of system dynamics is a non-trivial problem. We propose a Value of Information (VoI)-based algorithm that provides a polynomial-time solution for selecting the most informative subset of sensing agents to improve confidence in the state estimation of DT models. Numerical results confirm that the proposed method outperforms other benchmarks, reducing the communication overhead by half while maintaining the required estimation accuracy.

eess.SP

Learning to Optimize: Balancing Two Conflict Metrics in MB-HTS Networks

For multi-beam high throughput (MB-HTS) geostationary (GEO) satellite networks, the congestion appears when user's demands cannot be fully satisfied. This paper boosts the system performance by formulating and solving the power allocation strategies under the congestion control to admit users. A new multi-objective optimization is formulated to balance the sum data throughput and the satisfied user set. After that, we come up with two different solutions, which efficiently tackle the multi-objective maximization problem: The model-based solution utilizes the weighted sum method to enhance the number of demand-satisfied users, whilst the supervised learning solution offers a low-computational complexity design by inheriting optimization structures as continuous mappings. Simulation results verify that our solutions effectively copes with the congestion and outperforms the data throughput demand than the other previous works.

cs.IT

Robust Congestion Control for Demand-Based Optimization in Precoded Multi-Beam High Throughput Satellite Communications

High-throughput satellite communication systems are growing in strategic importance thanks to their role in delivering broadband services to mobile platforms and residences and/or businesses in rural and remote regions globally. Although precoding has emerged as a prominent technique to meet ever-increasing user demands, there is a lack of studies dealing with congestion control. This paper enhances the performance of multi-beam high throughput geostationary satellite systems under congestion, where the users' quality of service (QoS) demands cannot be fully satisfied with limited resources. In particular, we propose congestion control strategies, relying on simple power control schemes. We formulate a multi-objective optimization framework balancing the system sum-rate and the number of users satisfying their QoS requirements. Next, we propose two novel approaches that effectively handle the proposed multi-objective optimization problem. The former is a model-based approach that relies on the weighted sum method to enrich the number of satisfied users by solving a series of the sum-rate optimization problems in an iterative manner. The latter is a data-driven approach that offers a low-cost solution by utilizing supervised learning and exploiting the optimization structures as continuous mappings. The proposed general framework is evaluated for different linear precoding techniques, for which the low computational complexity algorithms are designed. Numerical results manifest that our proposed framework effectively handles the congestion issue and brings superior improvements of rate satisfaction to many users than previous works. Furthermore, the proposed algorithms show low run-time and make them realistic for practical systems.

cs.IT

Dynamic User Pairing for Non-Orthogonal Multiple Access in Downlink Networks

This paper considers a downlink (DL) system where non-orthogonal multiple access (NOMA) beamforming and dynamic user pairing are jointly optimized to maximize the minimum throughput of all DL users. The resulting problem belongs to a class of mixed-integer non-convex optimization. To solve the problem, we first relax the binary variables to continuous ones, and then devise an iterative algorithm based on the inner approximation method which provides at least a local optimal solution. Numerical results verify that the proposed algorithm outperforms other ones, such as conventional beamforming, NOMA with random-pairing and heuristic-search strategies.

eess.SP

Optimization of Rate Fairness in Multi-Pair Wireless-Powered Relaying Systems

This letter considers a multi-pair decode-and-forward relay network where a power-splitting (PS) protocol is adopted at the energy-constrained relay to provide simultaneous wireless information and energy harvesting (EH). To achieve higher efficiency of EH, we propose a new PS-based EH architecture at the relay by incorporating an alternating current (AC) computing logic, which is employed to directly use the wirelessly harvested AC energy for computational blocks. Under a nonlinear EH circuit, our goal is to maximize the fairness of end-to-end rate among user pairs subject to power constraints, resulting in a nonconvex problem. We propose an iterative algorithm to achieve a suboptimal and efficient solution to this challenging problem by leveraging the inner approximation framework. Numerical results demonstrate that the proposed algorithm outperforms the traditional direct current computing and other baseline schemes.

eess.SP

Optimal User Pairing for Achieving Rate Fairness in Downlink NOMA Networks

In this paper, a downlink non-orthogonal multiple access (NOMA) network is studied. We investigate the problem of jointly optimizing user pairing and beamforming design to maximize the minimum rate among all users. The considered problem belongs to a difficult class of mixed-integer nonconvex optimization programming. We first relax the binary constraints and adopt sequential convex approximation method to solve the relaxed problem, which is guaranteed to converge at least to a locally optimal solution. Numerical results show that the proposed method attains higher rate fairness among users, compared with traditional beamforming solutions, i.e., random pairing NOMA and beamforming systems.

cs.IT