arXiv subjects

Nicola Marchetti

Publications and source records attributed to Nicola Marchetti.

At least 19 recordsLinked to original sources

arXiv2026

Identifiability and Estimation Precision in Quantum Network Tomography with Imperfect Bell-State Measurements

We study Quantum Network Tomography (QNT) for end-to-end link-error characterization under imperfect Bell-state measurements (BSMs), where multiplicative coupling between link and measurement parameters makes identifiability non-trivial. For an n-node star network, we design probes that ensure unique identifiability and derive closed-form expressions for the Fisher Information Matrix (FIM) and Maximum Likelihood Estimators (MLEs), and characterize estimation precision through the Cramer-Rao Bound (CRB). The results show that BSM imperfections degrade estimation precision, while the proposed probes maintain nearly stable precision for individual link parameters as the network size increases. Monte Carlo simulations further confirm that the Mean Squared Error (MSE) approaches the CRB with increasing sample size.

quant-ph↗

arXiv2026

Velocity Index Modulation for Movable Antenna Systems

In movable antenna (MA) systems, antenna movement induces Doppler frequency shifts that are conventionally treated as an impairment requiring mitigation. In this paper, we propose \emph{Velocity Index Modulation for Movable Antennas} (VIM-MA), which reframes this Doppler effect as an additional information-bearing degree of freedom. The transmitter selects the antenna movement velocity from a pre-designed discrete codebook, so that the resulting Doppler shift conveys extra index bits beyond those carried by the conventional modulation symbol. Codebook design is formulated as a spectral efficiency maximization over the velocity spacing $\delta$ and codebook size $N_v$, subject to an average-information Cram\'{e}r--Rao-type bound (AIF-CRB) on velocity estimation accuracy, a physical track length constraint, and a spatial channel decorrelation constraint. A logarithmic change of variables renders the problem convex and yields a closed-form solution. We further establish that the peak codebook velocity equals $D_{\max}/T_s$, and that the decorrelation-limited spacing always lies below the Rayleigh Doppler resolution, so that VIM-MA is intrinsically a super-resolution scheme. A covariance-matched detector is derived that requires neither per-path angle knowledge nor channel state information. Simulation results show that the decorrelation-limited codebook, which carries five index bits over a $10\lambda$ aperture, is attainable only with oracle angle knowledge, whereas the channel-state-free detector is limited to three bits but reaches that payload approximately $10$~dB earlier than position-domain indexing charged a realistic pilot budget.

eess.SP↗

arXiv2026

Degeneracy-Aware Resource Allocation for Resilient 6G RAN

Heterogeneous 6G radio access networks (RANs) must allocate resources reliably under interference, latency limits, imperfect channel state information (CSI), and architectural diversity. We propose a degeneracy-aware resource allocation (DG-RA) framework that casts multi-architecture orchestration as a probabilistic game and, unlike single-solution optimization, deliberately favors allocations realizable by many structurally distinct yet performance-equivalent strategy profiles. Resilience is quantified across three layers through Degeneracy-Weighted Path Robustness (DWPR), Functional Substitution Score (FSS), and an Algorithmic Resilience Quotient (ARQ). Across centralized (C-RAN), open (O-RAN), virtualized (V-RAN), and hybrid RAN architectures, and benchmarked against a fractional-programming optimizer, DG-RA matches the state-of-the-art throughput and outage at the static operating point, then exploits its equivalence set to recover $\sim$$99\%$ of throughput from a resource-unit failure with a single switch, where a single-solution optimizer needs tens of iterations to re-converge. The results recast degeneracy not as a rate booster but as a precomputed resilience reserve for disruption-tolerant 6G orchestration.

eess.SP↗

arXiv2026

Macro--Micro Decision-Making in 6G Networks: An Agent-Based Framework for the Resource-Fungibility Landscape Resource-Fungibility Landscape

A defining feature of 6G networks is that performance depends not only on the quantity of available resources (e.g., spectrum, antennas, cache memory, compute, and fronthaul bandwidth) but also on their \emph{fungibility}, i.e., the ability of one resource to substitute for another under changing conditions. We argue that the fungibility landscape of a distributed 6G system is governed by two coupled decision scales: \emph{micro} decisions made locally by agents and \emph{macro} outcomes that emerge at the network level. Existing distributed-optimization approaches largely conflate these scales. To address this gap, we develop an agent-based-modeling (ABM) framework that separates macro and micro decisions through three operator-controllable macro choices, three micro hyperparameters, and three structural metrics. We establish six key results: (i) a two-timescale decomposition theorem, (ii) a structural-metric basis theorem, (iii) a macro--micro design rule with closed-form factorization of the emergent breakdown threshold, (iv) a fungibility--resilience monotonicity proposition, (v) a connectivity--substitutability duality theorem, and (vi) a multi-application generalization proposition. Numerical results visualize the macro fungibility landscape and the micro decision-sensitivity region for a representative 6G deployment.

eess.SP↗

arXiv2026

Degeneracy-Aware Resilient Resource Allocation in Cell-Free Cache-Aided MU-MIMO Networks

Cell-free cache-aided multi-user multiple-input-multiple-output (MIMO) (CF-CA-MU-MIMO) networks improve spectral efficiency through coded multicast delivery and distributed spatial multiplexing, but their distributed architecture introduces vulnerabilities to jamming, cache-aware eavesdropping, Byzantine corruption, and pilot-contamination attacks. This paper develops a degeneracy-aware resilient framework based on four vulnerability-mode partitions (subfile, edge node, multicast stream, and user) and three attack-aware structural metrics: Degeneracy-Weighted Path Robustness (DWPR$^{\mathrm{att}}$), trust-aware Functional Substitution Score (FSS$^{\mathrm{trust}}$), and a robust degeneracy index ($D_k^{\mathrm{rob}}$). These metrics are incorporated into a fully decentralized consensus-based agent framework (DC-ABM) using trust-weighted trimmed-mean aggregation and adaptive trust evolution. Five theoretical results are established: (i) a tight top-mass concentration lemma, (ii) matching memory--rate--resilience achievability and converse bounds, (iii) a robust-degeneracy bound with outage characterization, (iv) a secrecy--cache coupling theorem, and (v) a Byzantine-robust mean-square convergence result with an explicit breakdown threshold $f_{\max}$. Simulations validate the analytical bounds and demonstrate $1.8\times$ to $3\times$ faster convergence than distributed alternating direction method of multipliers (ADMM), multi-agent reinforcement learning (MARL)/graph neural network (GNN)-based control, and Su--Vaidya consensus while maintaining throughput up to the predicted threshold $f_{\max}\approx0.19$.

eess.SP↗

arXiv2026

Optimal Illumination via Joint Movement and Phase Optimization for Movable Antenna-RIS Configuration

Reconfigurable intelligent surfaces (RIS) enable programmable control of wireless propagation but remain vulnerable to persistent deep fades in static deployments. This paper introduces a Movable Antenna-enhanced RIS (MA-RIS) architecture where antenna elements physically reposition to sample independent spatial channels, enabling mobility-induced diversity. We model antenna motion using a Stochastic Differential Equation (SDE) framework capturing controlled drift and environmental diffusion. It^o calculus-based analysis characterizes steady-state antenna distributions, spatial decorrelation, and outage probability, revealing fundamental trade-offs between control strength and mobility randomness. To maximize long-term SNR while accounting for control overhead, we propose an overhead-aware Two-timescale framework separating slow antenna trajectory control from fast phase adaptation. The stochastic optimal control problem is solved via predictive approximation of the Hamilton-Jacobi-Bellman (HJB) formulation, enabling real-time implementation. Simulations validate theoretical predictions: the Two-timescale strategy achieves up to 36 dB steady-state SNR with remarkable stability, outperforming position-only control by up to 15 dB and uncontrolled baselines by over 30 dB. Despite experiencing a lower SNR than Active RIS, the proposed approach delivers up to 16 times higher energy efficiency (EE) across varying system scales, establishing a new paradigm of mobility-enabled channel adaptation for resilient wireless systems.

eess.SP↗

arXiv2026

UAV-based Energy-Efficient Data Collection in Smart Grids with ISAC QoS Guarantees

Dynamic line rating (DLR) is a methodology that requires timely monitoring data to determine the real-time ampacity of power lines. However, DLR monitoring devices (MD) are vulnerable to connectivity disruptions, leading to missing or delayed data. Although unmanned aerial vehicles (UAV) can enable resilient data collection from MD, their limited onboard energy challenges timely monitoring over extended transmission corridors with flight hazards. This paper proposes a cooperative UAV-based data collection framework with integrated sensing and communication (ISAC) to support timely DLR updates. In this framework, ISAC is employed to maintain the sensing and communication quality required for safe and cooperative UAV data collection. Accordingly, a joint energy minimization problem is formulated over UAV trajectories and collection scheduling under ISAC constraints. To solve it, a hybrid algorithm combining deep reinforcement learning (DRL) and semidefinite relaxation (SDR) is proposed, where DRL optimizes the trajectory and collection scheduling, while SDR is used to handle the non-convex ISAC constraints. Simulation results show that the proposed scheme reduces energy consumption by up to 34.6% compared with offline benchmarks and by about 2.2% compared with the separated sensing-and-communication baseline, while satisfying the minute-level timescale requirement of DLR.

eess.SP↗

arXiv2026

Adaptive RSMA-OMA for Resilient MIMO Networks Under Imperfect CSI and SIC

This paper addresses the challenge of power control in Rate-Splitting Multiple Access (RSMA) systems for downlink Multi-Input Multi-Output (MIMO) networks under practical impairments such as spatial correlation, imperfect Channel State Information (CSI), and residual Successive Interference Cancellation (SIC) errors. We propose a novel degeneracyaware framework that adaptively adjusts the power allocation between the common and private streams, ensuring optimal performance despite CSI uncertainty and imperfect SIC. Our approach incorporates a dynamic switching mechanism between RSMA and Orthogonal Multiple Access (OMA) to maintain system feasibility and resilience in the face of these impairments. Extensive analytical and simulation results demonstrate that the proposed framework significantly enhances power efficiency, mitigates outage probability, and improves overall system robustness, making RSMA a viable and efficient solution for modern wireless networks with realistic CSI and SIC conditions.

eess.SP↗

arXiv2026

Degeneracy-Aware Agent-Based Resource Allocation for Multi-User MIMO RSMA Network

This paper proposes a pilot-aware, degeneracy-driven Agent-Based Modelling (ABM) framework for distributed resource allocation in RSMA-enabled multi-user MIMO systems under imperfect Channel State Information (CSI) and residual Successive Interference Cancellation (SIC) error. The centralized RSMA power allocation problem is reformulated as a distributed multi-agent system, where users operate as autonomous agents that iteratively adapt transmit powers based on locally observed feasibility conditions. To capture the joint impact of interference coupling, CSI estimation errors, pilot overhead, and residual SIC error, a novel degeneracy index defined as the ratio of target to achieved signal-to-interference-plus-noise ratio (SINR) is introduced as a unified feasibility metric. This enables a scalable fixed-point power control mechanism that characterizes the feasible operating region without requiring global CSI. Analytical expressions for user-level and system-level outage probabilities are derived under spatially correlated fading, providing insights into reliability under practical impairments. The fundamental interplay between degeneracy, outage probability, and effective throughput is established, revealing that system performance is governed by the feasibility of the bottleneck user. To further enhance resilience, Degeneracy-Weighted Path Robustness (DWPR) and Functional Substitution Score (FSS) are incorporated to exploit path diversity and functional redundancy. Numerical results show that the proposed framework achieves near-centralized performance in sparse networks, while providing notable throughput gains and improved scalability in dense deployments, highlighting its effectiveness for robust and distributed resource management in next-generation wireless systems.

eess.SP↗

arXiv2026

Exploring LLM in Semantic Communication for V2X Networks

The rapid growth of connected and autonomous vehicles has created a demand for more efficient and intelligent communication systems. Traditional Vehicle-to-Everything (V2X) networks rely on transmitting raw sensor data, leading to high bandwidth usage and redundant information exchange. To address this, we propose a semantic communication framework that integrates a Large Language Model (LLM) with graph-based knowledge representation, to transmit only high-level, meaningful messages instead of raw data. Within this framework, the LLM performs semantic transformation, converting structured sensor inputs into concise natural language messages that describe context and intent. It also generates high-level control decisions based on shared situational awareness across the V2X network. A multilane traffic simulation was developed to compare semantic and non-semantic modes in terms of bandwidth usage. Results show an average 33.54% reduction in data transmission and illustrate context-aware coordination in representative scenarios.

cs.NI↗

arXiv2026

Learnability, Identifiability, and Monitor Placement in Quantum Network Tomography

Reliable quantum communication requires accurate characterization of the quantum links. This paper studies Quantum Network Tomography (QNT) under limited monitoring resources, where unknown link parameters are inferred from path-based measurements performed at monitor nodes. We introduce a cyclic sequential QNT protocol (CSQP) for arbitrary network topologies and develop a fixed-point learnability framework with an explicit algorithm for estimating link-level Werner parameters. We characterize identifiability through the rank of the path-link incidence matrix and show that the CSQP learnability conditions guarantee full rank and a nonsingular Quantum Fisher Information Matrix (QFIM). Building on this framework, we formulate monitor placement and measurement assignment as an optimization problem whose constraints enforce learnability and identifiability without topology-specific reformulation. Two Integer Linear Programming (ILP) formulations are introduced: Unconstrained QFIM-based formulation (QF), which maximizes QFIM-trace, and monitoring-overhead constrained QFIM formulation (QMF), which maximizes QFIM-trace subject to a per-monitor overhead constraint. Both formulations are evaluated on star and tree networks to compare monitor placements and measurement assignments. The results show that QMF distributes monitoring load evenly across all monitors and provides greater potential for parallel monitoring under resource constraints, while QF is more suitable when estimation information is prioritized, particularly in practical networks with non-uniform link noise.

quant-ph↗

arXiv2026

TSN-IoT: A Two-Stage NOMA-Enabled Framework for Prioritized Traffic Handling in Dense IoT Networks

With the growing applications of the Internet of Things (IoT), a major challenge is to ensure continuous connectivity while providing prioritized access. In dense IoT scenarios, synchronization may be disrupted either by the movement of nodes away from base stations or by the unavailability of reliable Global Navigation Satellite System (GNSS) signals, which can be affected by physical obstructions, multipath fading, or environmental interference, such as such as walls, buildings, moving objects, or electromagnetic noise from surrounding devices. In such contexts, distributed synchronization through Non-Orthogonal Multiple Access (NOMA) offers a promising solution, as it enables simultaneous transmission to multiple users with different power levels, supporting efficient synchronization while minimizing the signaling overhead. Moreover, NOMA also plays a vital role for dynamic priority management in dense and heterogeneous IoT environments. In this article, we proposed a Two-Stage NOMA-Enabled Framework "TSN-IoT" that integrates the mechanisms of conventional Precision Time Protocol (PTP) based synchronization, distributed synchronization and data transmission. The framework is designed as a four-tier architecture that facilitates prioritized data delivery from sensor nodes to the central base station. We demonstrated the performance of "TSN-IoT" through a healthcare use case, where intermittent connectivity and varying data priority levels present key challenges for reliable communication. Synchronization speed and end-to-end delay were evaluated through a series of simulations implemented in Python. Results show that, compared to priority-based Orthogonal Frequency Division Multiple Access (OFDMA), TSN-IoT achieves significantly better performance by offering improved synchronization opportunities and enabling parallel transmissions over the same sub-carrier.

eess.SP↗

arXiv2025

Blockage-aware Hierarchical Codebook Design for RIS-Assisted Movable Antenna Systems

In this paper, we propose a novel blockage-aware hierarchical beamforming framework for movable antenna (MA) systems operating at millimeter-wave (mm-Wave) frequencies. While existing works on MA systems have demonstrated performance gains over conventional systems, they often neglect the design of specialized codebooks to leverage MA's unique capabilities and address the challenges of increased energy consumption and latency inherent to MA systems. To address these aspects, we first integrate blockage detection into the codebook design process based on the Gerchberg-Saxton (GS) algorithm, significantly reducing inefficiencies due to beam evaluations done in blocked directions. Then, we use a two-stage approach to reduce the complexity of the joint beamforming and Reconfigurable Intelligent Surfaces (RIS) optimization problem. The simulations demonstrate that the proposed adaptive codebook successfully improves the Energy Efficiency (EE) and reduces the beam training overhead, substantially boosting the practical deployment potential of RIS-assisted MA systems in future wireless networks.

eess.SP↗

arXiv2025

Measurement Strategies and Estimation Precision in Quantum Network Tomography

This work investigates measurement strategies for link parameter estimation in Quantum Network Tomography (QNT), where network links are modeled as depolarizing quantum channels distributing Werner states. Three distinct measurement schemes are analyzed: local Z-basis measurements (LZM), joint Bell-state measurements (JBM), and pre-shared entanglement-assisted measurements (PEM). For each scheme, we derive the probability distributions of measurement outcomes and examine how noise in the distributed states influences estimation precision. Closed-form expressions for the Quantum Fisher Information Matrix (QFIM) are obtained, and the estimation precision is evaluated through the Quantum Cramer-Rao Bound (QCRB). Numerical analysis reveals that the PEM scheme achieves the lowest QCRB, offering the highest estimation accuracy, while JBM provides a favorable balance between precision and implementation complexity. The LZM method, although experimentally simpler, exhibits higher estimation error relative to the other schemes; however, it outperforms JBM in high-noise regimes for single-link estimation. We further evaluate the estimation performance on a four-node star network by comparing a JBM-only configuration with a hybrid configuration that combines JBM and LZM. When two monitors are used, the JBM-only strategy outperforms the hybrid approach across all noise regimes. However, with three monitors, it achieves a lower QCRB only in low-noise regimes with heterogeneous links. The results establish a practical basis for selecting measurement strategies in experimental quantum networks, enabling more accurate and scalable link parameter estimation under realistic noise conditions.

quant-ph↗

arXiv2025

On the Performance of Tri-Hybrid Beamforming Using Pinching Antennas

The Pinching-Antenna System (PASS) reconfigures wireless channels through \emph{pinching beamforming}, in which the active positions of pinching antennas (PAs) along dielectric waveguides are optimized to shape the radiation pattern. This article investigates the performance of PASS-enabled tri-hybrid beamforming, where pinched waveguides are integrated with a hybrid digital-analog beamformer to mitigate path loss and enhance spectral efficiency. The channel capacity of the proposed system is characterized by deriving the optimal tri-hybrid beamformer at both the digital and analog domains, as well as the optimal placement of PAs. Closed-form upper and lower bounds of the channel capacity are obtained, leading to a capacity scaling law with respect to the number of PAs. Numerical results verify the tightness of the derived bounds and demonstrate that applying PASS to tri-hybrid beamforming yields a significant performance gain over conventional hybrid beamforming under the same number of radio-frequency chains.

eess.SP↗

arXiv2025

Notes on Degeneracy and Robustness

Degeneracy is the ability of structurally different elements to perform the same function or yield the same output under certain constraints. In contrast to redundancy, which implies identical backups, degeneracy allows diverse components to step in and perform the same or similar role. Mathematically, it is about mapping multiple distinct elements into the same function. In a degenerate system, failure in one part can be compensated by others not structurally linked. System functions are distributed within the system itself or the entire network. This renders faster and more adaptive recovery. In this work, we define and formulate several novel metrics for resource fungibility to address robustness in networks (static/mobile/dynamic).

cs.NI↗

arXiv2025

Mitigating xApp conflicts for efficient network slicing in 6G O-RAN: a graph convolutional-based attention network approach

O-RAN (Open-Radio Access Network) offers a flexible, open architecture for next-generation wireless networks. Network slicing within O-RAN allows network operators to create customized virtual networks, each tailored to meet the specific needs of a particular application or service. Efficiently managing these slices is crucial for future 6G networks. O-RAN introduces specialized software applications called xApps that manage different network functions. In network slicing, an xApp can be responsible for managing a separate network slice. To optimize resource allocation across numerous network slices, these xApps must coordinate. Traditional methods where all xApps communicate freely can lead to excessive overhead, hindering network performance. In this paper, we address the issue of xApp conflict mitigation by proposing an innovative Zero-Touch Management (ZTM) solution for radio resource management in O-RAN. Our approach leverages Multi-Agent Reinforcement Learning (MARL) to enable xApps to learn and optimize resource allocation without the need for constant manual intervention. We introduce a Graph Convolutional Network (GCN)-based attention mechanism to streamline communication among xApps, reducing overhead and improving overall system efficiency. Our results compare traditional MARL, where all xApps communicate, against our MARL GCN-based attention method. The findings demonstrate the superiority of our approach, especially as the number of xApps increases, ultimately providing a scalable and efficient solution for optimal network slicing management in O-RAN.

cs.NI↗

arXiv2025

Distributed Time Synchronization in NOMA-Assisted Ultra-Dense Networks

Ultra-dense networks (UDNs) represent a transformative access architecture for upcoming sixth generation (6G) systems, poised to meet the surging demand for high data rates. Achieving precise synchronization across diverse base stations (BSs) is critical in these networks to mitigate inter-cell interference (ICI). However, traditional centralized synchronization approaches face substantial challenges in dense urban, including limited access to Global Positioning System (GPS), dependence on reliable backhaul, and high signaling overhead demands. This study advances a low-complexity distributed synchronization solution. A primary focus is on assessing the algorithm's accuracy incorporating the effects of information exchange delays, which are pronounced in large-networks. Recognizing the pivotal role of neighbor-gathered information in the proposed approach, this research employs uplink Non-Orthogonal Multiple Access (NOMA) to reduce message-gathering delays between transmitters (TXs) and receivers (RXs). The proposed algorithm is evaluated to assess effectiveness under exchange delays, analyzing impact of system parameters like network connectivity, size, sub-bands, etc., on synchronization speed. The findings demonstrate that the NOMA-based information-gathering technique significantly accelerates network synchronization compared to orthogonal access schemes. This advancement is crucial for meeting the low-latency requirements of beyond fifth generation (5G) systems, underscoring the potential of distributed synchronization as a cornerstone for next-generation UDN deployments.

cs.MA↗