SearcharxivSearch

arXiv subjects

Mai Vu

Publications and source records attributed to Mai Vu.

At least 19 recordsLinked to original sources

Efficient Graph Neural Networks for Multicarrier Wideband Hybrid Beamforming Optimization

6G wireless technology is poised to adopt higher and wider frequency bands, leveraging highly directional beamforming. However, the vast bandwidths amplify the impact of beam squinting. Traditional solutions, such as adding a true-time-delay filter to each antenna, are cost-prohibitive due to the required hardware scale. This paper proposes a signal processing alternative using Graph Neural Networks (GNNs) to optimize hybrid beamforming in multicarrier wideband systems. Using a bipartite graph to represent a shared analog beamformer among multiple subcarriers, we develop three GNN structures with distinct digital beamformer representations (i) at the subcarrier nodes, (ii) at the edges, or (iii) integrating traditional singular-value decomposition solutions. By designing an efficient message-passing mechanism, these structures offer insights into the impact of different GNN designs on communication system performance and computational complexity. Extensive analysis and ablation studies show that our proposed GNN structures outperform traditional optimization methods and existing ML-based solutions. Furthermore, the proposed GNNs exhibit strong resiliency to beam squinting and better robustness against imperfect CSI than even fully digital beamforming and all existing hybrid designs. These GNNs can also be extended to multi-user scenarios and demonstrate excellent generalization capabilities, allowing trained models to adapt to diverse multicarrier and multi-user settings without retraining.

eess.SP

Toward Native ISAC Support in O-RAN Architectures for 6G

ISAC is an emerging paradigm in 6G networks that enables environmental sensing using wireless communication infrastructure. Current O-RAN specifications lack the architectural primitives for sensing integration: no service models expose physical-layer observables, no execution frameworks support sub-millisecond sensing tasks, and fronthaul interfaces cannot correlate transmitted waveforms with their reflections. This article proposes three extensions to O-RAN for monostatic sensing, where transmission and reception are co-located at the base station. First, we specify sensing dApps at the O-DU that process IQ samples to extract delay, Doppler, and angular features. Second, we define E2SM-SENS, a service model enabling xApps to subscribe to sensing telemetry with configurable periodicity. Third, we identify required Open Fronthaul metadata for waveform-echo association. We validate the architecture through a prototype implementation using beamforming and Full-Duplex operation, demonstrating closed-loop control with median end-to-end latency suitable for near-real-time sensing applications. While focused on monostatic configurations, the proposed interfaces extend to bistatic and cooperative sensing scenarios.

cs.NI

Joint Beamforming and Integer User Association using a GNN with Gumbel-Softmax Reparameterizations

Machine learning (ML) models can effectively optimize a multi-cell wireless network by designing the beamforming vectors and association decisions. Existing ML designs, however, often needs to approximate the integer association variables with a probability distribution output. We propose a novel graph neural network (GNN) structure that jointly optimize beamforming vectors and user association while guaranteeing association output as integers. The integer association constraints are satisfied using the Gumbel-Softmax (GS) reparameterization, without increasing computational complexity. Simulation results demonstrate that our proposed GS-based GNN consistently achieves integer association decisions and yields a higher sum-rate, especially when generalized to larger networks, compared to all other fractional association methods.

eess.SP

Graph Neural Network Based Hybrid Beamforming Design in Wideband Terahertz MIMO-OFDM Systems

6G wireless technology is projected to adopt higher and wider frequency bands, enabled by highly directional beamforming. However, the vast bandwidths available also make the impact of beam squint in massive multiple input and multiple output (MIMO) systems non-negligible. Traditional approaches such as adding a true-time-delay line (TTD) on each antenna are costly due to the massive antenna arrays required. This paper puts forth a signal processing alternative, specifically adapted to the multicarrier structure of OFDM systems, through an innovative application of Graph Neural Networks (GNNs) to optimize hybrid beamforming. By integrating two types of graph nodes to represent the analog and the digital beamforming matrices efficiently, our approach not only reduces the computational and memory burdens but also achieves high spectral efficiency performance, approaching that of all digital beamforming. The GNN runtime and memory requirement are at a fraction of the processing time and resource consumption of traditional signal processing methods, hence enabling real-time adaptation of hybrid beamforming. Furthermore, the proposed GNN exhibits strong resiliency to beam squinting, achieving almost constant spectral efficiency even as the system bandwidth increases at higher carrier frequencies.

eess.SP

Graph Neural Network Based Beamforming and RIS Reflection Design in A Multi-RIS Assisted Wireless Network

We propose a graph neural network (GNN) architecture to optimize base station (BS) beamforming and reconfigurable intelligent surface (RIS) phase shifts in a multi-RIS assisted wireless network. We create a bipartite graph model to represent a network with multi-RIS, then construct the GNN architecture by exploiting channel information as node and edge features. We employ a message passing mechanism to enable information exchange between RIS nodes and user nodes and facilitate the inference of interference. Each node also maintains a representation vector which can be mapped to the BS beamforming or RIS phase shifts output. Message generation and update of the representation vector at each node are performed using two unsupervised neural networks, which are trained off-line and then used on all nodes of the same type. Simulation results demonstrate that the proposed GNN architecture provides strong scalability with network size, generalizes to different settings, and significantly outperforms conventional algorithms.

eess.SP

Multi-Agent Q-Learning for Real-Time Load Balancing User Association and Handover in Mobile Networks

As next generation cellular networks become denser, associating users with the optimal base stations at each time while ensuring no base station is overloaded becomes critical for achieving stable and high network performance. We propose multi-agent online Q-learning (QL) algorithms for performing real-time load balancing user association and handover in dense cellular networks. The load balancing constraints at all base stations couple the actions of user agents, and we propose two multi-agent action selection policies, one centralized and one distributed, to satisfy load balancing at every learning step. In the centralized policy, the actions of UEs are determined by a central load balancer (CLB) running an algorithm based on swapping the worst connection to maximize the total learning reward. In the distributed policy, each UE takes an action based on its local information by participating in a distributed matching game with the BSs to maximize the local reward. We then integrate these action selection policies into an online QL algorithm that adapts in real-time to network dynamics including channel variations and user mobility, using a reward function that considers a handover cost to reduce handover frequency. The proposed multi-agent QL algorithm features low-complexity and fast convergence, outperforming 3GPP max-SINR association. Both policies adapt well to network dynamics at various UE speed profiles from walking, running, to biking and suburban driving, illustrating their robustness and real-time adaptability.

eess.SP

Pruning Deep Convolutional Neural Network Using Conditional Mutual Information

Convolutional Neural Networks (CNNs) achieve high performance in image classification tasks but are challenging to deploy on resource-limited hardware due to their large model sizes. To address this issue, we leverage Mutual Information, a metric that provides valuable insights into how deep learning models retain and process information through measuring the shared information between input features or output labels and network layers. In this study, we propose a structured filter-pruning approach for CNNs that identifies and selectively retains the most informative features in each layer. Our approach successively evaluates each layer by ranking the importance of its feature maps based on Conditional Mutual Information (CMI) values, computed using a matrix-based Renyi α-order entropy numerical method. We propose several formulations of CMI to capture correlation among features across different layers. We then develop various strategies to determine the cutoff point for CMI values to prune unimportant features. This approach allows parallel pruning in both forward and backward directions and significantly reduces model size while preserving accuracy. Tested on the VGG16 architecture with the CIFAR-10 dataset, the proposed method reduces the number of filters by more than a third, with only a 0.32% drop in test accuracy.

cs.LG

A Unified Approach for Multi-Scale Synchronous Correlation Search in Big Time Series -- Full Version

The wide deployment of IoT sensors has enabled the collection of very big time series across different domains, from which advanced analytics can be performed to find unknown relationships, most importantly the correlations between them. However, current approaches for correlation search on time series are limited to only a single temporal scale and simple types of relations, and cannot handle noise effectively. This paper presents the integrated SYnchronous COrrelation Search (iSYCOS) framework to find multi-scale correlations in big time series. Specifically, iSYCOS integrates top-down and bottom-up approaches into a single auto-configured framework capable of efficiently extracting complex window-based correlations from big time series using mutual information (MI). Moreover, iSYCOS includes a novel MI-based theory to identify noise in the data, and is used to perform pruning to improve iSYCOS performance. Besides, we design a distributed version of iSYCOS that can scale out in a Spark cluster to handle big time series. Our extensive experimental evaluation on synthetic and real-world datasets shows that iSYCOS can auto-configure on a given dataset to find complex multi-scale correlations. The pruning and optimisations can improve iSYCOS performance up to an order of magnitude, and the distributed iSYCOS can scale out linearly on a computing cluster.

cs.DB

On-Request Wireless Charging and Partial Computation Offloading In Multi-Access Edge Computing Systems

Wireless charging coupled with computation offloading in edge networks offers a promising solution for realizing power-hungry and computation intensive applications on user devices. We consider a multi-access edge computing (MEC) system with collocated MEC server and base-station/access point, each equipped with a massive MIMO antenna array, supporting multiple users requesting data computation and wireless charging. The goal is to minimize the energy consumption for computation offloading and maximize the received energy at the user from wireless charging. The proposed solution is a novel two-stage algorithm employing nested primal-dual and linear programming techniques to perform data partitioning and time allocation for computation offloading and design the optimal energy beamforming for wireless charging, all within MEC-AP transmit power and latency constraints. Algorithm results show that optimal energy beamforming significantly outperforms other schemes such as isotropic or directed charging without beam power allocation. Compared to binary offloading, data partition in partial offloading leads to lower energy consumption and more charging time, and hence offers better wireless charging performance. The charged energy over an extended period of time both with and without computation offloading can be substantial. Opportunistic wireless charging from MEC-AP thus offers a viable untethered approach for supplying energy to user-devices.

eess.SP

Distributed User Association in B5G Networks Using Early Acceptance Matching Games

We study distributed user association in 5G and beyond millimeter-wave enabled heterogeneous networks using matching theory. We propose a novel and efficient distributed matching game, called early acceptance (EA), which allows users to apply for association with their ranked-preference base station in a distributed fashion and get accepted as soon as they are in the base station's preference list with available quota. Several variants of the EA matching game with preference list updating and reapplying are compared with the original and stability-optimal deferred acceptance (DA) matching game, which implements a waiting list at each base station and delays user association until the game finishes. We show that matching stability needs not lead to optimal performance in other metrics such as throughput. Analysis and simulations show that compared to DA, the proposed EA matching games achieve higher network throughput while exhibiting a significantly faster association process. Furthermore, the EA games either playing once or multiple times can reach closely the network utility of a centralized user association while having much lower complexity.

eess.SP

Energy-efficient Wireless Charging and Computation Offloading In MEC Systems

Wireless charging coupled with computation offloading in edge networks offers a promising solution for realizing power-hungry and computation intensive applications on user devices. We consider a mutil-access edge computing (MEC) system with collocated MEC servers and base-stations/access points (BS/AP) supporting multiple users requesting data computation and wireless charging. We propose an integrated solution with computation offloading to satisfy the largest proportion of requested wireless charging while keeping the energy consumption at the minimum subject to the MEC-AP transmit power and latency constraints. We propose a novel algorithm to perform data partitioning, time allocation, transmit power control and design the optimal energy beamforming for wireless charging. Our resource allocation scheme offers an energy minimizing solution compared to other schemes while also delivering higher amount of transferred charge to the users.

eess.SP

Energy-Efficient Offloading in Delay-Constrained Massive MIMO Enabled Edge Network Using Data Partitioning

We study a wireless edge-computing system which allows multiple users to simultaneously offload computation-intensive tasks to multiple massive-MIMO access points, each with a collocated multi-access edge computing (MEC) server. Massive-MIMO enables simultaneous uplink transmissions from all users, significantly shortening the data offloading time compared to sequential protocols, and makes the three phases of data offloading, computing, and downloading have comparable durations. Based on this three-phase structure, we formulate a novel problem to minimize a weighted sum of the energy consumption at both the users and the MEC server under a round-trip latency constraint, using a combination of data partitioning, transmit power control and CPU frequency scaling at both the user and server ends. We design a novel nested primal-dual algorithm using two different methods to solve this problem efficiently. Optimized solutions show that for larger requests, more data is offloaded to the MECs to reduce local computation time in order to meet the latency constraint, despite higher energy cost of wireless transmissions. Massive-MIMO channel estimation errors under pilot contamination also causes more data to be offloaded to the MECs. Compared to binary offloading, partial offloading with data partitioning is superior and leads to significant reduction in the overall energy consumption.

eess.SP

A Study of Interference Distributions in Millimeter Wave Cellular Networks

We study the distribution of the interference power in a millimeter wave (mmWave) cellular network. Such interference is random and highly dependent on the employed transmission technique, as well as the varying channel conditions and the varying association between users and base stations. Traditional networks at lower frequencies usually employ omnidirectional transmission which creates an (almost) equal amount of interference in any direction. MmWave networks, however, must employ directional beamforming transmission in order to compensate for the high path loss in mmWave frequency bands. These directional transmissions drastically change the network interference structure. We examine the interference power distributions in an mmWave network employing beamforming transmission under different user association schemes, and contrast with those under omnidirectional transmission. Numerical results using an analytical mmWave channel model and a measurement-based channel generator, NYUSIM, show that beamforming not only reduces the amount of strong interference and hence significantly enhances network throughput, but also user association can considerably alter network interference and throughput structures.

eess.SP

Early Acceptance Matching Game for User Association in 5G Cellular HetNet

In this paper we examine the use of matching theory for user association in millimeter wave (mmWave)-enabled cellular heterogeneous networks (HetNets). In a mmWave system, the channel variations can be fast and unpredictable, rendering centralized user association potentially inefficient. We propose an efficient distributed matching algorithm, called early acceptance (EA), tailored for user association in 5G HetNets. The effectiveness of the proposed algorithm is assessed by comparing its performance with the well-known deferred acceptance (DA) matching algorithm, in which user association is delayed until the algorithm finishes. Numerical results show that the proposed EA matching algorithm reaches a near-optimal solution when compared with a centralized user association, and leads to a more power-efficient and much faster user association process when compared to the distributed DA algorithm.

cs.IT

AMIC: An Adaptive Information Theoretic Method to Identify Multi-Scale Temporal Correlations in Big Time Series Data -- Accepted Version

Recent development in computing, sensing and crowd-sourced data have resulted in an explosion in the availability of quantitative information. The possibilities of analyzing this so-called Big Data to inform research and the decision-making process are virtually endless. In general, analyses have to be done across multiple data sets in order to bring out the most value of Big Data. A first important step is to identify temporal correlations between data sets. Given the characteristics of Big Data in terms of volume and velocity, techniques that identify correlations not only need to be fast and scalable, but also need to help users in ordering the correlations across temporal scales so that they can focus on important relationships. In this paper, we present AMIC (Adaptive Mutual Information-based Correlation), a method based on mutual information to identify correlations at multiple temporal scales in large time series. Discovered correlations are suggested to users in an order based on the strength of the relationships. Our method supports an adaptive streaming technique that minimizes duplicated computation and is implemented on top of Apache Spark for scalability. We also provide a comprehensive evaluation on the effectiveness and the scalability of AMIC using both synthetic and real-world data sets.

cs.DC

Optimal Transmission Using a Self-sustained Relay in a Full-Duplex MIMO System

This paper investigates wireless information and power transfer in a full-duplex MIMO relay channel where the self-sustained relay harvests energy from both source transmit signal and self-interference signal to decode and forward source information to a destination. We present a novel technique to jointly optimize power splitting at the relay and precoding design (power allocation) for both the source and relay transmissions. We formulate a new convex optimization problem, establish the dual problem via closed-form optimal primal solutions, and design an efficient primal-dual algorithm to maximize the achievable throughput. Numerical results demonstrate the benefits of using multiple transmit and receive antennas in both information decoding and energy harvesting. We also extend our analysis to the case when channel state information is only available at receiving nodes and show how our algorithm can optimize the power splitting at the relay for it to remain self-sustained. Through analysis and simulation, we show how an optimal combination of non-uniform power splitting, variable power allocation, and self-interference power harvesting effectively exploits a full-duplex MIMO system to achieve significant performance gains over existing uniform power splitting and half-duplex transmission techniques.

eess.SP

Load Balancing User Association in Millimeter Wave MIMO Networks

User association is necessary in dense millimeter wave (mmWave) networks to determine which base station a user connects to in order to balance base station loads and maximize throughput. Given that mmWave connections are highly directional and vulnerable to small channel variations, user association changes these connections and hence significantly affects the user's instantaneous rate as well as network interference. In this paper, we introduce a new load balancing user association scheme for mmWave MIMO networks which considers this dependency on user association of user's transmission rates and network interference. We formulate the user association problem as mixed integer nonlinear programming and design a polynomial-time algorithm, called Worst Connection Swapping (WCS), to find a near-optimal solution. Simulation results confirm that the proposed user association scheme improves network performance significantly by moving the traffic of congested base stations to lightly-loaded ones and adjusting the interference accordingly. Further, the proposed WCS algorithm outperforms other generic algorithms for combinatorial programming such as the genetic algorithm in both accuracy and speed at several orders of magnitude faster, and for small networks where exhaustive search is possible it reaches the optimal solution.

cs.IT

Optimizing Throughput in a MIMO System with a Self-sustained Relay and Non-uniform Power Splitting

We present a novel approach to maximizing the transmission rate in a MIMO relay system, where all nodes are equipped with multiple antennas and the relay is self-sustained by harvesting energy. We formulate an optimization problem and use dual-characterization to derive a closed-form solution for the optimal power splitting ratio and precoding design. We propose an efficient primal-dual algorithm to jointly optimize the power allocation at source and relay for transmission and the power splitting at relay for energy harvesting, and show that using non-uniform power splitting is optimal. Numerical results demonstrate the significant rate gain of non-uniform power splitting over traditional uniform splitting especially at low source transmit power. We also analyze our algorithm numerically and demonstrate its efficiency at reducing the run-time by several orders of magnitudes compared to a standard solver, \textcolor{blue}{and existing algorithms in literature

eess.SP