arXiv subjects

Symeon Chatzinotas

Publications and source records attributed to Symeon Chatzinotas.

At least 55 records · Page 3Linked to original sources

arXiv2026

Stacked Intelligent Metasurfaces Assisted UAV Communications

In this paper, we investigate an unmanned aerial vehicle (UAV) communication system assisted by stacked intelligent metasurfaces (SIMs), which enable programmable wave-domain signal processing through multiple cascaded metasurface layers. By shifting part of the beamforming functionality from the RF/digital domain to the electromagnetic domain, SIMs allow the realization of energy-efficient hybrid beamforming architectures suitable for aerial platforms. We formulate the joint design of digital precoding, SIM phase configuration, and UAV positioning for multi-user downlink sum-rate maximization. To solve the resulting non-convex problem, we develop an alternating optimization framework that guarantees monotonic improvement of the objective. Numerical results demonstrate that the proposed SIM-assisted architecture significantly improves spectral efficiency while maintaining low hardware complexity, and highlight the impact of the number of metasurface layers and size of each layer on system performance.

eess.SP↗

arXiv2026

GLUSE: Enhanced Channel-Wise Adaptive Gated Linear Units SE for Onboard Satellite Earth Observation Image Classification

This study introduces ResNet-GLUSE, a lightweight ResNet variant enhanced with Gated Linear Unit-enhanced Squeeze-and-Excitation (GLUSE), an adaptive channel-wise attention mechanism. By integrating dynamic gating into the traditional SE framework, GLUSE improves feature recalibration while maintaining computational efficiency. Experiments on EuroSAT and PatternNet datasets confirm its effectiveness, achieving exceeding \textbf{94\% and 98\% accuracy}, respectively. While \textbf{MobileViT achieves 99\% accuracy}, ResNet-GLUSE offers \textbf{33x fewer parameters, 27x fewer FLOPs, 33x smaller model size (MB), $\approx$6x lower power consumption (W), and $\approx$3x faster inference time (s)}, making it significantly more efficient for onboard satellite deployment. Furthermore, due to its simplicity, ResNet-GLUSE can be easily mimicked for \textbf{neuromorphic computing}, enabling ultra-low power inference at just \textbf{852.30 mW} on Akida Brainchip. This balance between high accuracy and ultra-low resource consumption establishes ResNet-GLUSE as a practical solution for real-time Earth Observation (EO) tasks. Reproducible codes are available in our shared repository.

eess.IV↗

arXiv2026

Quantum Reservoir Computing: Recent Advances and Future Directions

Quantum reservoir computing (QRC) uses the dynamics of a fixed or weakly tuned quantum system to transform temporal and sequential inputs into measured features, while training is typically confined to a classical readout. This separation reduces reliance on repeated quantum parameter updates and avoids the barren plateaus associated with variational circuit training. Its computational power is often attributed to the exponentially large Hilbert space of the quantum system. However, the memory, nonlinearity, and expressivity that determine what a reservoir can actually compute depend jointly on the input encoding, quantum evolution, observables, measurement, and readout, not on Hilbert space dimension alone. On hardware, these capabilities are further constrained by finite sampling, hardware noise, measurement backaction, and the cost of estimating observables, so a large state space alone does not guarantee useful computation. In this survey, we develop a common system model that connects these components and use it to organize QRC foundations, computational properties, reservoir architectures, operating protocols, and physical implementations. We examine spin, photonic, superconducting, bosonic, neutral atom, and other analog platforms, together with applications, software and high performance computing support, benchmarking, and reproducibility. The analysis distinguishes hardware demonstrations from simulations and identifies the assumptions and resources that govern comparisons across implementations. Current results do not establish a broad quantum advantage over well matched classical reservoirs. We therefore specify the resource accounting, benchmark standards, and theoretical criteria needed to evaluate claims of quantum advantage.

quant-ph↗

arXiv2026

Digital-Twin-Aided Dynamic Spectrum Sharing and Resource Management in Integrated Satellite-Terrestrial Networks

The explosive growth in wireless service demand has prompted the evolution of integrated satellite-terrestrial networks (ISTNs) to overcome the limitations of traditional terrestrial networks (TNs) in terms of coverage, spectrum efficiency, and deployment cost. Particularly, leveraging LEO satellites and dynamic spectrum sharing (DSS), ISTNs offer promising solutions but face significant challenges due to diverse terrestrial environments, user and satellite mobility, and long propagation LEO-to-ground distance. To address these challenges, digitial-twin (DT) has emerged as a promising technology to offer virtual replicas of real-world systems, facilitating prediction for resource management. In this work, we study a time-window-based DT-aided DSS framework for ISTNs, enabling joint long-term and short-term resource decisions to reduce system congestion. Based on that, two optimization problems are formulated, which aim to optimize resource management using DT information and to refine obtained solutions with actual real-time information, respectively. To efficiently solve these problems, we proposed algorithms using compressed-sensing-based and successive convex approximation techniques. Simulation results using actual traffic data and the London 3D map demonstrate the superiority in terms of congestion minimization of our proposed algorithms compared to benchmarks. Additionally, it shows the adaptation ability and practical feasibility of our proposed solutions.

eess.SP↗

arXiv2026

Seeing Through WiFi: Lightweight Human Pose Estimation with Dynamic Kernel Attention

WiFi-based human pose estimation (HPE) enables the detection and interpretation of human body positions and movements without the need for wearable devices while preserving individual privacy concerns. Implementing this solution requires enhancing model performance and maintaining efficiency, especially on resource-constrained devices. This paper introduces a novel framework, WiLHPE, for lightweight and efficient human pose estimation using WiFi CSI signals. Empowered by a camera-based model during training, WiLHPE processes raw WiFi signals directly to estimate human poses in the testing phase. It employs a novel neural network architecture to dynamically learn convolutional kernels and apply attention mechanisms across channel and frequency spaces. This innovative method diversifies the kernels to improve the recognition capabilities of WiFi signals without adding complexity, ensuring efficiency. Additionally, the Tree-Structured Parzen Estimator algorithm is employed to optimize the critical hyperparameters of the neural network efficiently, minimizing the time required for optimal hyperparameter search compared to heuristic methods. Results from experiments on both the MM-Fi and WiPose datasets highlight the superiority of WiLHPE over state-of-the-art approaches, achieving 85.96% and 94.27% at PCK50, respectively, with minimal computational overhead. Notably, WiLHPE performs impressively even under challenging conditions, maintaining around 80% at PCK50 under AWGN noise with an error variance of 0.5.

cs.CV↗

arXiv2026

Robust Transmission Design for RIS-Assisted RSMA-SWIPT Systems With Movable Antennas Under Hardware Distortions

This paper investigates a robust transmission design for a multi-user rate-splitting multiple access (RSMA)-based simultaneous wireless information and power transfer (SWIPT) system empowered by movable antennas (MAs) and a reconfigurable intelligent surface (RIS) under channel state information (CSI) uncertainty and residual hardware impairments (HIs). The effective channels in MAs-enabled systems depend on antenna positions, causing CSI uncertainty to affect not only active and passive beamforming but also antenna position optimization. Furthermore, residual HIs distort the effective SINRs, creating additional coupling among beamforming, RIS reflection control, common-rate allocation, power-splitting ratio optimization, and antenna position optimization. Consequently, the joint impact of CSI uncertainty and HIs leads to a highly coupled and challenging resource allocation problem. To address this challenge, we propose a robust resource allocation framework that jointly optimizes common-rate allocation, transmit beamforming, RIS reflection coefficients, power-splitting ratios, and MAs positions to maximize the achievable sum-rate while satisfying practical system constraints. To obtain an efficient solution, the original problem is decomposed into active beamforming, RIS reflection design, power-splitting ratio optimization, and MAs position optimization subproblems, where tractable convex surrogate functions are constructed to handle the non-convex objective and constraints. Simulation results verify the effectiveness of the proposed framework and demonstrate substantial improvements in achievable sum-rate, robustness against CSI uncertainty and hardware impairments, and convergence performance compared with benchmark schemes.

eess.SP↗

arXiv2026

Multi-Timescale Latent-Action DRL for Joint Optimization in Edge-Cloud Networks

Load imbalance across edge and cloud layers degrades latency performance in hierarchical edge-cloud computing (HECC) systems under dynamic task arrivals and heterogeneous resources, leading to severe queuing delays and inefficient resource utilization. To address this challenge, we study a joint service placement, computational delegation, and power control (JSCP) problem to minimize the average end-to-end (e2e) latency. The resulting JSCP problem is a mixed-integer nonconvex and NP-hard optimization problem due to the strong coupling between discrete and continuous variables. To enable tractable optimization and stable system adaptation, we exploit the inherent difference in decision dynamics and decompose the problem into long-term system configuration and short-term resource allocation subproblems. Based on this formulation, we propose a two-timescale multi-layer deep reinforcement learning framework with a latent action space (2T-MDRL-LA) to jointly optimize service placement, user association, computational delegation, task offloading, and user transmit power. A latent action representation based on a variational autoencoder is introduced to efficiently compress the high-dimensional combinatorial action space. Simulation results demonstrate that the proposed framework effectively adapts to dynamic network conditions and achieves near-optimal performance compared to branch-and-bound solutions. It achieves up to a 20.8% reduction in average e2e latency and a 13% improvement in resource utilization over the scheme without the computational delegation, while converging approximately 50% faster than conventional proximal policy optimization.

cs.LG↗

arXiv2026

Quantum Key Distribution Without Shared Reference Frame Under Unital Noise

We consider a general and practical scenario of quantum key distribution (QKD) over an unknown, stationary, unital qubit channel. Furthermore, due to practical limitations, e.g., relative movement and rotation of communicating parties, a global shared reference frame cannot be established. This scenario can routinely appear in satellite QKD. We propose two methods to overcome the physical qubit noise and the lack of shared reference frame. The first proposed approach involves constructing the Pauli transfer matrix (PTM) description of the channel, which we achieve without requiring a shared reference frame, by absorbing the lack of shared reference frame in the channel definition. This is followed by the identification of singular vectors of PTM as the Bloch vectors for optimal signal states. In the optimized local bases, the resulting correlations are equivalent, up to outcome relabeling, to those of a Pauli channel, allowing us to show the optimality of the BB84 and six-state QKD protocols under these conditions. The second approach, called the sequential basis matching (SBM) involves sequentially identifying the channel-optimized local bases that enable QKD. We show that both of these approaches result in the same effective key exchange rate for QKD.

quant-ph↗

arXiv2026

Optimal GHZ-State Distribution in LOSR Quantum Networks via Local Decoding from Information Sets

Distributing multipartite entanglement is a prerequisite for scalable quantum networks. Networks restricted to local operations and shared randomness (LOSR) avoid the quantum-memory and latency costs associated with the real-time classical communication required by LOCC-based networks. However, when only bipartite sources are available, LOSR networks cannot prepare useful GHZ states. In earlier work, we conjectured that multipartite sources overcome this limitation and supported this claim with a single numerical example. In this work, we prove the conjecture for regular and uniform networks of arbitrary size. By identifying the hyperedges of the network with the coordinates of a linear code, we show that whenever the edges incident to each node form an information set, a fixed collection of local unitaries, namely the local decoders of the code, transforms the source state into an (N)-party GHZ state with fidelity (d^{m-M}), without requiring any classical communication. Here, (m) denotes the number of edges incident to each node and (M) the total number of edges in the network. For the complete ((N-1))-uniform hypergraph (K_N^{(N-1)}), this fidelity reduces to (1/d). We further prove that this value is optimal among all local-unitary strategies and exceeds the best fidelity achievable using only bipartite sources. For example, in the four-node case, the optimal fidelity is (1/2), compared with the bipartite bound of (1/8). These results demonstrate that multipartite sources, together with shared randomness, can replace real-time classical communication for entanglement distribution.

quant-ph↗

arXiv2026

Sparse Channel Estimation for SIM-based mmWave Near-Field Communications

In this paper, we address the channel estimation (CE) problem in SIM-based multi-user (MU) millimeter-wave (mmWave) near-field communication systems. To address the severe path loss and blockage in mmWave communication systems, many meta-atoms are typically integrated into each layer of the SIM. Then, the number of radio frequency (RF) chains at the base station (BS) is fewer than that of meta-atoms per layer, resulting in an underdetermined problem. Additionally, the increase in the number of meta-atoms in each layer expands the SIM's near-field region, leading to the user equipment (UEs) being mostly situated in this region, necessitating precise modeling of the channel under the spherical wavefront assumption. To address these issues, we introduce a compressed sensing (CS)-based CE protocol to tackle the underdetermined problem. In contrast to the traditional CS-based estimation framework, we investigate a polar-domain channel representation to tackle the severe energy spread effect of the classical angular-domain channel representation in near-field communication systems. Specifically, we design a novel polar-domain transform matrix for uniform planar arrays (UPAs), thereby transforming the CE problem into a sparse recovery task of the paths' support set and complex gains. To overcome the limitations of the sparse Bayesian learning (SBL) framework in tackling high-dimensional dictionaries, we propose a low-complexity polar-domain SBL (LCPD-SBL) algorithm, which significantly reduces computational complexity without compromising estimation accuracy.

cs.IT↗

arXiv2026

Enhancing Energy and Spectral Efficiency in IoT-Cellular Networks via Active SIM-Equipped LEO Satellites

This paper investigates a low Earth orbit (LEO) satellite communication system enhanced by an active stacked intelligent metasurface (ASIM), mounted on the backplate of the satellite solar panels to efficiently utilize limited onboard space and reduce the main satellite power amplifier requirements. The system serves multiple ground users via rate-splitting multiple access (RSMA) and IoT devices through a symbiotic radio network. Multi-layer sequential processing in the ASIM improves effective channel gains and suppresses inter-user interference, outperforming active RIS and beyond-diagonal RIS designs. Three optimization approaches are evaluated: block coordinate descent with successive convex approximation (BCD-SCA), model-assisted multi-agent constraint soft actor-critic (MA-CSAC), and multi-constraint proximal policy optimization (MCPPO). Simulation results show that BCD-SCA converges fast and stably in convex scenarios without learning, MCPPO achieves rapid initial convergence with moderate stability, and MA-CSAC attains the highest long-term spectral and energy efficiency in large-scale networks. Energy-spectral efficiency trade-offs are analyzed for different ASIM elements, satellite antennas, and transmit power. Overall, the study demonstrates that integrating multi-layer ASIM with suitable optimization algorithms offers a scalable, energy-efficient, and high-performance solution for next-generation LEO satellite communications.

eess.SY↗

arXiv2026

Deterministic versus Stochastic Optimization for Joint Path Planning and Dynamic Time Splitting in Multiple-UAV-Cached IoT Networks

This paper examines wireless-powered Internet of Things (IoT) networks involving multiple unmanned aerial vehicles (UAVs) equipped with backscatter and caching technologies to relay and transmit signals. For data communication and energy harvesting (EH), the source transmits information and power to UAVs using the dynamic time splitting (DTS) method. UAVs use harvested energy for passive communication (backscatter) and for active communication (transmitting information) to the destination. The primary objective is to maximize the total throughput by jointly optimizing the DTS ratio, trajectory, and transmission power, leveraging the UAVs' caching capability. This optimization problem is challenging due to its non-convexity. Therefore, an efficient alternating algorithm using the block coordinate descent (BCD) method is proposed to optimize each variable given the fixed values of the other parameters. By applying the Karush-Kuhn-Tucker (KKT) conditions, we derive a closed-form expression for the optimal DTS ratio, significantly reducing computation time. The optimal values for the other two parameters are determined using the BCD. In order to thoroughly assess the effectiveness of various solutions for the original problem, this paper introduces an approach leveraging a genetic algorithm (GA). The GA in this context employs a one-point crossover method, value mutation, and rank-based selection based on fitness values. Numerical results show that the BCD and GA achieve at least 31% throughput improvement over the benchmarks, with reduced computational time. These findings demonstrate the performance gain and practical feasibility of our solutions in caching-enabled UAV-aided IoT networks.

cs.IT↗

arXiv2026

Digital Twin-Assisted Adaptive Multi-Agent DRL for Intelligent Spectrum and Resource Management in Open-RAN UAV-Enabled 6G Networks

The evolution toward 6G wireless networks envisions a seamlessly intelligent, Open-RAN-enabled architecture where unmanned aerial vehicles (UAVs) play a pivotal role in extending coverage, enhancing resilience, and ensuring reliable connectivity for ground users deployment. However, efficiently managing spectrum and resources in such highly dynamic UAV-assisted environments remains a major challenge due to nonlinear system interactions, mobility-induced topology variations, and stringent latency and energy constraints. To address these challenges, we propose a digital twin (DT)-assisted adaptive deep reinforcement learning (DRL) framework that enables intelligent spectrum sharing and resource allocation across distributed ground users. The complex optimization problem is decomposed into UAV trajectory optimization using particle swarm optimization (PSO) and dynamic spectrum-power-association management via multi-agent DRL (MADRL). This hybrid DT-driven approach empowers intelligent, context-aware decision-making and adaptive coordination among UAVs. Extensive simulations demonstrate significant gains in spectral efficiency, data rates, and energy utilization, showcasing a transformative path toward self-evolving, autonomous 6G UAV and ground users (GUs) connectivity.

cs.IT↗

arXiv2026

Multi-Agent DRL for QoS and Energy Optimization in RIS-Enabled Open-RAN Industrial 6G TN/NTN Networks

Industrial 6G networks require ultra-reliable, low-latency, and energy-efficient connectivity in dynamic and blockage-prone environments, where conventional terrestrial deployments often fail to ensure stable coverage. Hence, in this paper, we propose a RIS-enabled Open-RAN framework for integrated terrestrial/non-terrestrial (TN/NTN) industrial 6G networks, in which UAVs-mounted reconfigurable intelligent surfaces (RISs) cooperate with ground radio units and a high-altitude platform (HAP) to enhance connectivity for dense industrial IoT devices. Owing to the high dimensionality and strong coupling among decision variables, conventional optimization techniques become computationally intractable. To overcome this limitation, the joint optimization problem of data rates, latency, and energy consumptions is formulated as a decentralized partially observable Markov decision process (Dec-POMDP) and solved using a multi-agent deep reinforcement learning framework. Simulation results show improvements of up to 75\% in data rate, 25\% latency reduction, and 16\% energy savings compared with state-of-the-art learning-based and non-RIS baselines, demonstrating the effectiveness of RIS-assisted Open-RAN intelligence for industrial 6G networks.

cs.NI↗

arXiv2026

Joint Service Placement and Resource Optimization in Hierarchical Edge-Cloud Networks

Hierarchical edge-cloud computing-aided Internet of Things (IoT) networks offer low-latency and cost-efficient services to a growing number of data-intensive IoT devices. However, optimizing service placement, which involves determining the most suitable locations within a network to deploy various services, is critical to balancing workloads dynamically and ensuring efficient resource utilization. In this paper, we jointly optimize service placement, edge/cloud cooperation, task offloading, and bandwidth allocation to enhance processing efficiency and response times. The main objective is to minimize both the overall end-to-end latency and the system cost, including service deployment and operational costs. The formulated problem belongs to the class of non-convex mixed-integer nonlinear programming, where finding a feasible solution is already challenging. Towards a stable system, we first transform the original problem into a more tractable form and then decompose it into sub-problems which are solved at different timescales. Combining tools from relaxation and the successive convex approximation method, we develop iterative algorithms to solve these problems efficiently. With an appropriate penalty parameter, the proposed algorithms guarantee convergence to at least a local optimum. We produce extensive numerical results to demonstrate the superior performance of the proposed algorithms over benchmark schemes as well as emphasize the significance of the joint service placement and resource allocation in enhancing system performance and efficiency.

cs.IT↗

arXiv2026

Channel Uncertainty-Aware Robust Beamforming for RIS-Assisted RSMA Communication With Movable Antennas

This work investigates a robust resource allocation framework for a downlink multi-user communication system integrating movable antennas (MAs) and reconfigurable intelligent surfaces (RISs) under the rate-splitting multiple access (RSMA) transmission protocol. Unlike conventional fixed-position antenna architectures, the considered MAs-enabled system introduces spatially adaptive channel variations in which antenna positions directly influence the effective channel responses. Consequently, under imperfect channel state information (CSI), the impact of CSI uncertainty propagates not only through active and passive beamforming design, but also through the antenna position optimization process, leading to a highly coupled robust optimization problem. To address this challenge, we formulate a system sum-rate maximization problem by jointly optimizing the transmit precoding vectors, RIS reflection matrix, common-rate allocation, and MAs positions, subject to quality-of-service (QoS), power-budget, common-rate decoding, and mutual coupling constraints. The resulting non-convex problem is efficiently handled through an iterative robust optimization framework, where the original problem is successively decomposed into active beamforming, RIS reflection matrix, and MAs position optimization subproblems, and tractable convex surrogate functions are constructed to enable iterative optimization. Moreover, system robustness is ensured by incorporating a bounded CSI uncertainty model that explicitly captures channel estimation errors and guarantees reliable communication performance under worst-case channel conditions. Finally, extensive simulation results demonstrate that the proposed framework achieves significant performance gains and enhanced robustness compared with benchmark schemes, while also exhibiting fast and stable convergence behavior under practical imperfect CSI conditions.

eess.SP↗

arXiv2026

Semantic Communication for Multi-Satellite Massive MIMO Transmission: A Mixture of Cooperative Modes Framework

This paper investigates semantic communications (SemComs) for multi-satellite cooperative massive multiple-input multiple-output (MIMO) transmission, where multiple massive-MIMO satellites jointly serve a common set of multi-antenna user terminals. For the first time, SemComs with image transmission task are integrated into satellite massive MIMO and multi-satellite cooperative transmission. For the two representative cooperative modes, namely coherent transmission (CT) and non-coherent transmission (NCT), we develop multi-satellite CT (MSCT) and multi-satellite NCT (MSNCT) SemCom frameworks, respectively. MSCT adopts a symmetric architecture, whereas MSNCT introduces transmitter-side stream allocation and a two-stage receiver design that combines per-stream semantic extraction with cross-stream semantic-interference exploitation. To instantiate MSCT, we further design a symmetric encoder and decoder network based on hybrid Swin-Transformer and lightweight bottleneck convolutional neural network (CNN) blocks, termed HSTC, where Swin Transformer provides scalable computation and the CNN branch improves performance and convergence. For MSNCT, a Transformer-based backbone is employed to support cross-stream interference exploitation through global attention. Building on these two frameworks, we propose a mixture of cooperative modes (MoCM) framework, in which a permutation-invariant network dynamically switches between MSCT and MSNCT using multi-satellite statistical channel state information, thereby balancing semantic performance and complexity. Simulation results under practical configurations demonstrate the performance gains of the proposed frameworks.

eess.SP↗

arXiv2026

Decentralized Cooperative Beamforming for Networked LEO Satellites with Statistical CSI

Inter-satellite-link-enabled low-Earth-orbit (LEO) satellite constellations are evolving toward networked architectures that support constellation-level cooperation, enabling multiple satellites to jointly serve user terminals through cooperative beamforming. While such cooperation can substantially enhance link budgets and achievable rates, its practical realization is challenged by the scalability limitations of centralized beamforming designs and the stringent computational and signaling constraints of large LEO constellations. This paper develops a fully decentralized cooperative beamforming framework for networked LEO satellite downlinks. Using an ergodic-rate-based formulation, we first derive a centralized weighted minimum mean squared error (WMMSE) solution as a performance benchmark. Building on this formulation, we propose a topology-agnostic decentralized beamforming algorithm by localizing the benchmark and exchanging a set of globally coupled variables whose dimensions are independent of the antenna number and enforcing consensus over arbitrary connected inter-satellite networks. The resulting algorithm admits fully parallel execution across satellites. To further enhance scalability, we eliminate the consensus-related auxiliary variables in closed form and derive a low-complexity per-satellite update rule that is optimal to local iteration and admits a quasi-closed-form solution via scalar line search. Simulation results show that the proposed decentralized schemes closely approach centralized performance under practical inter-satellite topologies, while significantly reducing computational complexity and signaling overhead, enabling scalable cooperative beamforming for large LEO constellations.

eess.SP↗