Searcharxiv⌕ Search

arXiv subjects

Abolfazl Zakeri

Publications and source records attributed to Abolfazl Zakeri.

At least 19 recordsLinked to original sources

Freshness-Aware Constrained Sensing-Aided Beam Prediction with Knowledge Distillation

Beam prediction leveraging environmental data reduces over-the-air beam training overhead. Existing frameworks, however, assume continuous access to fresh sensory data, an assumption that breaks down under sensing budget constraints or sensor failures. To make this more practical, this paper proposes a sensing-aided beam prediction framework that operates under an average sensing rate constraint. We incorporate the age of information (AoI) directly into the beam prediction pipeline as a synthetic input modality: the age of the most recently captured data is encoded and fused with visual features through a gating mechanism. This provides the predictor with explicit context information about input sensory data reliability. We formalize and examine three fixed sampling policies, accumulated, uniform, and randomized, under the average sensing budget. We further develop a knowledge distillation (KD) framework that operates as a robustness regularizer rather than a pure model compression method. In particular, the high-capacity teacher is trained unconstrained on fully sampled data, and its representational knowledge is transferred to a compact student deployed under the sensing budget. We conduct numerical experiments on the DeepSense 6G data set. The results show that AoI fusion nearly doubles top-1 accuracy at strict sensing budgets, and age-aware models achieve near-optimal top-3 accuracy with only 20% of the data. Furthermore, we find that the teacher training regime is a more consequential design choice than the distillation loss function.

eess.SP↗

Beamforming Design Via GNN in mmWave Cell-Free Massive MIMO Using Sub-6 GHz CSI

Beamforming methods in millimeter-wave (mmWave) cell-free massive multiple-input multiple-output (CFmMIMO) systems require accurate channel state information (CSI), whose acquisition entails significant training overhead. This paper shows that fully digital cell-free mmWave beamforming can be effectively learned from sub-6 GHz CSI using a graph neural network (GNN). Specifically, we represent a CFmMIMO system as a wireless graph, and the GNN is trained to approximate beamformers that maximize the downlink sum-rate based on the available sub-6 GHz CSI. A message-passing mechanism is proposed to capture inter-user interference and inter-base-station cooperation across different network topologies. Simulation results demonstrate that the proposed sub-6 GHz-assisted GNN-based beamformer achieves competitive and often superior sum-rate performance compared to classical baselines that rely on full mmWave CSI.

eess.SP↗

Remote Tracking with State-Dependent Sensing in Pull-Based Systems: A POMDP Framework

We consider real-time remote tracking of a Markov source observed by multiple heterogeneous sensors with state-dependent sensing accuracy, motivated by distributed camera networks with overlapping coverage and spatial blind spots. Upon commands from a remote sink, sensors transmit their observations over error-prone channels. We aim to minimize the long-term average of a weighted sum of goal-aware distortion and transmission costs. The problem is formulated as a partially observable Markov decision process (POMDP) and cast into an equivalent belief-MDP. To address the intractability of the infinite and continuous belief space, we develop a truncation-based method that yields a finite-state MDP which can be solved via standard methods such as relative value iteration. We further use a discounted reformulation to derive a theoretical lower bound for the optimal average cost, which is tightened via the incremental pruning algorithm (IPA) and also induces a comparison policy. Numerical results demonstrate that the performance of the proposed policy improves with the truncation depth at the expense of computational effort, and also outperforms low-complexity baselines across a wide range of system parameters. The results also reveal a switching-type structure of the truncation-based policy over the belief simplex and quantify the impact of key system parameters, highlighting the importance of accounting for state-dependent~sensing.

eess.SP↗

Energy Efficiency Maximization for Hybrid RIS-Aided Communications via Deep Unfolding

We address energy-efficiency (EE) maximization in a multiuser (MU) multiple-input single-output (MISO) downlink system assisted by a hybrid reconfigurable intelligent surface(RIS), where each element can be dynamically configured to operate in either active or passive mode depending on whether its power amplifier is engaged. Practical hardware effects are explicitly incorporated, including base station (BS) and RIS power budgets, active-element amplifier gain limits, amplification noise, and binary phase control. To solve the problem, we develop an alternating-optimization framework in which the BS beamforming subproblem is handled via zero-forcing with closed-form power allocation, while the RIS subproblem is addressed using a model-driven deep unfolding approach. Numerical results show that the proposed method achieves faster convergence and higher EE than the considered benchmark schemes. In particular, it attains about 30% higher EE than the procedure without deep unfolding. Furthermore, our simulations demonstrate at least 10% EE improvement over the fully active RIS configuration and up to threefold EE gains compared with the fully passive RIS design. The results also show that most of the achievable EE gain can be captured by activating only a small fraction of RIS elements and allocating only a small portion of the dynamic power budget to the RIS.

eess.SP↗

Resource-Efficient WiFi CSI Sensing via Exploiting the Age of Samples

WiFi channel state information (CSI) sensing must coexist with data communications, which constrains the acquisition rate of fresh CSI measurements. To model this, we formulate CSI-based human activity and identity recognition under a sensing rate constraint that limits the fraction of time slots, within a measurement session, where CSI samples are available. This framework captures sensing-communication resource sharing and uncontrolled packet loss or traffic-driven irregularity. To satisfy the sensing constraint, two fixed CSI sampling policies are considered: a deterministic policy and a stochastic Bernoulli policy. We propose a low-cost age-aware WiFi sensing framework that explicitly incorporates sample freshness into the model training. The age of each retained CSI sample is first encoded and then fused with the CSI embedding via multiplicative fusion. On the NTU-Fi human activity recognition and person identification datasets, the proposed model consistently outperforms both a CSI-only baseline and the state-of-the-art time-aware attention model from the UniFi benchmark. For example, it yields up to a 10-percentage-point improvement over the UniFi method for person identification, with the largest gains observed under strict sensing budgets.

eess.SP↗

Data-Free Knowledge Distillation for LiDAR-Aided Beam Tracking in MmWave Systems

We propose a data-free knowledge distillation (DF- KD) framework for LiDAR-aided mmWave beam tracking, where the objective is to predict the optimal current and future beams from a sequence of past LiDAR measurements. Specifically, we propose a knowledge inversion approach where a generator synthesizes LiDAR-like sequences from random noise, using a metadata loss to align the teachers internal feature statistics of synthetic and real data, without access to raw LiDAR samples. The student model is then trained exclusively on the synthetic data using either the Kullback- Leibler (KL) divergence loss or a proposed mean squared error (MSE) loss between the teachers and students raw output logits. Simulation results on the DeepSense dataset demonstrate the effectiveness of the proposed approach. In particular, the proposed convolutional neural network-gated recurrent unit (CNN-GRU) teacher architecture yields superior DF-KD student performance compared to GRU-only alternatives, and the MSE loss achieves performance comparable to the standard KD loss while requiring fewer hyperparamete

eess.SP↗

On the Value of Base Station Motion Knowledge for Goal-Oriented Remote Monitoring with Energy-Harvesting Sensors

This paper investigates goal-oriented remote monitoring of an unobservable Markov source using energy-harvesting sensors that communicate with a mobile receiver, such as a Low Earth Orbit (LEO) satellite or Unmanned Aerial Vehicle (UAV). Unlike conventional systems that assume stationary base stations, the proposed framework explicitly accounts for receiver mobility, which induces time-varying channel characteristics modeled as a finite-state Markov process. The remote monitoring problem is formulated as a partially observable Markov decision process (POMDP), which is transformed into a tractable belief-state MDP and solved using relative value iteration to obtain optimal sampling and transmission policies. Two estimation strategies are considered: Maximum Likelihood (ML) and Minimum Mean Distortion (MMD). Numerical results demonstrate that incorporating receiver mobility and channel state information into the optimization reduces the average distortion by 10% to 42% compared to baseline policies and constant-channel assumptions, highlighting the importance of base station motion knowledge for effective goal-oriented communication.

eess.SY↗

AoI-Aware Machine Learning for Constrained Multimodal Sensing-Aided Communications

Using environmental sensory data can enhance communications beam training and reduce its overhead compared to conventional methods. However, the availability of fresh sensory data during inference may be limited due to sensing constraints or sensor failures, necessitating a realistic model for multimodal sensing. This paper proposes a joint multimodal sensing and beam prediction framework that operates under a constraint on the average sensing rate, i.e., how often fresh sensory data should be obtained. The proposed method combines deep reinforcement learning, i.e., a deep Q-network (DQN), with a neural network (NN)-based beam predictor. The DQN determines the sensing decisions, while the NN predicts the best beam from the codebook. To capture the effect of limited fresh data during inference, the age of information (AoI) is incorporated into the training of both the DQN and the beam predictor. Lyapunov optimization is employed to design a reward function that enforces the average sensing constraint. Simulation results on a real-world dataset show that AoI-aware training improves top-1 and top-3 inference accuracy by 44.16% and 52.96%, respectively, under a strict sensing constraint. The performance gain, however, diminishes as the sensing constraint is relaxed.

eess.SP↗

Deep Reinforcement Learning for Dynamic Sensing and Communications

Environmental sensing can significantly enhance mmWave communications by assisting beam training, yet its benefits must be balanced against the associated sensing costs. To this end, we propose a unified machine learning framework that dynamically determines when to sense and leverages sensory data for beam prediction. Specifically, we formulate a joint sensing and beamforming problem that maximizes the average signal-to-noise ratio under an average sensing budget. Lyapunov optimization is employed to enforce the sensing constraint, while a deep Q-Network determines the sensing slots. A pretrained deep neural network then maps the sensing data to optimal beams in the codebook. Simulations based on the real-world DeepSense dataset demonstrate that the proposed approach substantially reduces sensing overhead while maintaining satisfactory communications performance.

eess.SP↗

Goal-Oriented Remote Tracking Through Correlated Observations in Pull-based Communications

We address the real-time remote tracking problem in a status update system comprising two sensors, two independent information sources, and a remote monitor. The status updating follows a pull-based communication, where the monitor commands/pulls the sensors for status updates, i.e., the actual state of the sources. We consider that the observations are \textit{correlated}, meaning that each sensor's sent data could also include the state of the other source due to, e.g., inter-sensor communications or overlapping monitoring regions. The effectiveness of data communication is measured by a generic distortion, capturing the underlying application goal. We provide optimal command/pulling policies for the monitor that minimize the average weighted sum distortion and transmission cost. Since the monitor cannot fully observe the exact state of each source, we propose a partially observable Markov decision process (POMDP) and reformulate it as a belief MDP problem. We then effectively truncate the infinite belief space and transform it into a finite-state MDP problem, which is solved via relative value iteration. Simulation results show the effectiveness of the derived policy over age-based and deep-Q network baseline policies.

eess.SP↗

Constrained Multimodal Sensing-Aided Communications: A Dynamic Beamforming Design

Using multimodal sensory data can enhance communications systems by reducing the overhead and latency in beam training. However, processing such data incurs high computational complexity, and continuous sensing results in significant power and bandwidth consumption. This gives rise to a tradeoff between the (multimodal) sensing data acquisition rate and communications performance. In this work, we develop a constrained multimodal sensing-aided communications framework where dynamic sensing and beamforming are performed under a sensing budget. Specifically, we formulate an optimization problem that maximizes the average received signal-to-noise ratio (SNR) of user equipment, subject to constraints on the average number of sensing actions and power budget. Using the Saleh-Valenzuela mmWave channel model, we construct the channel primarily based on position information obtained via multimodal sensing. Stricter sensing constraints reduce the availability of position data, leading to degraded channel estimation and thus lower performance. We apply Lyapunov optimization to solve the problem and derive a dynamic sensing and beamforming algorithm. Numerical evaluations on the DeepSense and Raymobtime datasets show that halving sensing times leads to only up to 7.7% loss in average SNR.

eess.SP↗

Dynamic Joint Communications and Sensing Precoding Design: A Lyapunov Approach

This letter proposes a dynamic joint communications and sensing (JCAS) framework to adaptively design dedicated sensing and communications precoders. We first formulate a stochastic control problem to maximize the long-term average signal-to-noise ratio for sensing, subject to a minimum average communications signal-to-interference-plus-noise ratio requirement and a power budget. Using Lyapunov optimization, specifically the drift-plus-penalty method, we cast the problem into a sequence of per-slot non-convex problems. To solve these problems, we develop a successive convex approximation method. Additionally, we derive a closed-form solution to the per-slot problems based on the notion of zero-forcing. Numerical evaluations demonstrate the efficacy of the proposed methods and highlight their superiority compared to a baseline method based on conventional design.

eess.SP↗

Real-time Tracking in a Status Update System with an Imperfect Feedback Channel

We consider a status update system consisting of a finite-state Markov source, an energy-harvesting-enabled transmitter, and a sink. The forward and feedback channels between the transmitter and the sink are error-prone. We study the problem of minimizing the long-term time average of a (generic) distortion function subject to an energy causality constraint. Since the feedback channel is error-prone, the transmitter has only partial knowledge about the transmission results and, consequently, about the estimate of the source state at the sink. Therefore, we model the problem as a partially observable Markov decision process (POMDP), which is then cast as a belief-MDP problem. The infinite belief space makes solving the belief-MDP difficult. Thus, by exploiting a specific property of the belief evolution, we truncate the state space and formulate a finite-state MDP problem, which is then solved using the relative value iteration algorithm (RVIA). Furthermore, we propose a low-complexity transmission policy in which the belief-MDP problem is transformed into a sequence of per-slot optimization problems. Simulation results show the effectiveness of the proposed policies and their superiority compared to a baseline policy. Moreover, we numerically show that the proposed policies have switching-type structures.

eess.SY↗

Semantic-aware Sampling and Transmission in Energy Harvesting Systems: A POMDP Approach

We address the problem of real-time remote tracking of a partially observable Markov source in an energy harvesting system with an unreliable communication channel. We consider both sampling and transmission costs. Different from most prior studies that assume the source is fully observable, the sampling cost renders the source partially observable. The goal is to jointly optimize sampling and transmission policies for two semantic-aware metrics: i) a general distortion measure and ii) the age of incorrect information (AoII). We formulate a stochastic control problem. To solve the problem for each metric, we cast a partially observable Markov decision process (POMDP), which is transformed into a belief MDP. Then, for both AoII under the perfect channel setup and distortion, we express the belief as a function of the age of information (AoI). This expression enables us to effectively truncate the corresponding belief space and formulate a finite-state MDP problem, which is solved using the relative value iteration algorithm. For the AoII metric in the general setup, a deep reinforcement learning policy is proposed to solve the belief MDP problem. Simulation results show the effectiveness of the derived policies and, in particular, reveal a non-monotonic switching-type structure of the real-time optimal policy with respect to AoI.

eess.SP↗

Optimal Semantic-aware Sampling and Transmission in Energy Harvesting Systems Through the AoII

We study a real-time tracking problem in an energy harvesting status update system with a Markov source and an imperfect channel, considering both sampling and transmission costs. The problem primary challenge stems from the non-observability of the source due to the sampling cost. By using the age of incorrect information (AoII) as a semantic-aware performance metric, our main goal is to find an optimal policy that minimizes the time average AoII subject to an energy-causality constraint. To this end, a stochastic optimization problem is formulated and solved by modeling it as a partially observable Markov decision process (POMDP). More specifically, to solve the main problem, we use the notion of a belief state and cast the problem as a belief MDP problem. Then, for the perfect channel setup, we effectively truncate the corresponding belief space and solve the MDP problem using the relative value iteration method. For the general setup, a deep reinforcement learning policy is proposed. The simulation results show the efficacy of the derived policies in comparison to an AoI-optimal policy and an opportunistic baseline policy.

eess.SP↗

Query-Age-Optimal Scheduling under Sampling and Transmission Constraints

This letter provides query-age-optimal joint sampling and transmission scheduling policies for a heterogeneous status update system, consisting of a stochastic arrival and a generate-at-will source, with an unreliable channel. Our main goal is to minimize the average query age of information (QAoI) subject to average sampling, average transmission, and per-slot transmission constraints. To this end, an optimization problem is formulated and solved by casting it into a linear program. We also provide a low-complexity near-optimal policy using the notion of weakly-coupled constrained Markov decision processes. The numerical results show up to 32% performance improvement by the proposed policies compared with a benchmark policy.

eess.SP↗

Minimizing the AoI in Resource-Constrained Multi-Source Relaying Systems: Dynamic and Learning-based Scheduling

We consider a multi-source relaying system where independent sources randomly generate status update packets which are sent to the destination with the aid of a relay through unreliable links. We develop transmission scheduling policies to minimize the weighted sum average age of information (AoI) subject to transmission capacity and long-run average resource constraints. We formulate a stochastic control optimization problem and solve it using a constrained Markov decision process (CMDP) approach and a drift-plus-penalty method. The CMDP problem is solved by transforming it into an MDP problem using the Lagrangian relaxation method. We theoretically analyze the structure of optimal policies for the MDP problem and subsequently propose a structure-aware algorithm that returns a practical near-optimal policy. Using the drift-plus-penalty method, we devise a near-optimal low-complexity policy that performs the scheduling decisions dynamically. We also develop a model-free deep reinforcement learning policy for which the Lyapunov optimization theory and a dueling double deep Q-network are employed. The complexities of the proposed policies are analyzed. Simulation results are provided to assess the performance of our policies and validate the theoretical results. The results show up to 91% performance improvement compared to a baseline policy.

eess.SP↗

Online Service Provisioning in NFV-enabled Networks Using Deep Reinforcement Learning

In this paper, we study a Deep Reinforcement Learning (DRL) based framework for an online end-user service provisioning in a Network Function Virtualization (NFV)-enabled network. We formulate an optimization problem aiming to minimize the cost of network resource utilization. The main challenge is provisioning the online service requests by fulfilling their Quality of Service (QoS) under limited resource availability. Moreover, fulfilling the stochastic service requests in a large network is another challenge that is evaluated in this paper. To solve the formulated optimization problem in an efficient and intelligent manner, we propose a Deep Q-Network for Adaptive Resource allocation (DQN-AR) in NFV-enable network for function placement and dynamic routing which considers the available network resources as DQN states. Moreover, the service's characteristics, including the service life time and number of the arrival requests, are modeled by the Uniform and Exponential distribution, respectively. In addition, we evaluate the computational complexity of the proposed method. Numerical results carried out for different ranges of parameters reveal the effectiveness of our framework. In specific, the obtained results show that the average number of admitted requests of the network increases by 7 up to 14% and the network utilization cost decreases by 5 and 20 %.

eess.SY↗