Searcharxiv⌕ Search

arXiv subjects

Mingzhe Chen

Publications and source records attributed to Mingzhe Chen.

At least 19 recordsLinked to original sources
arXiv2026

Privacy Preserving Semantic Communications in Wireless Edge Networks with Vision Language Models

Semantic communication has emerged as a promising paradigm for next-generation wireless systems by transmitting high-level semantic features rather than raw bits. However, collaborative devices and multimodal transmission increase privacy risks because sensitive information may leak through inter-device semantic fusion and cross-modal representations. To address this issue, we propose a privacy-preserving semantic communication framework for wireless edge networks. Leveraging a vision-language model (VLM), the framework extracts textual semantics from images and identifies privacy-sensitive entities using a privacy database maintained only at the edge server. Before image transmission, each device removes the identified private regions while preserving useful semantic content. The server then reconstructs the removed regions from the received masked images using textual embeddings and VLM-based semantic priors. To protect textual information, we design an encrypted semantic-channel transceiver using physical-layer keys generated from reciprocal wireless channels, without pre-shared keys. We also introduce a semantic information bottleneck to suppress redundant information across multiple devices. The framework is evaluated against a strong model-aware adversary that can intercept wireless transmissions and access edge-device model parameters but not server-side data. Simulation results show that the proposed method reduces privacy leakage by more than 50% compared with a semantic communication scheme without privacy protection, while the authorized server achieves a 48% improvement in perceptual reconstruction quality over the adversary. The estimated mutual information between transmitted representations approaches 0 bit, indicating effective suppression of cross-device semantic redundancy.

cs.CR↗
arXiv2026

SparsePilot: Belief-Guided Network Planning under Sparse Wireless Measurements

Unmanned aerial vehicles (UAVs) have emerged as a promising solution for on-demand wireless coverage planning in urban environments. Existing learning-based UAV control methods, however, typically rely on continuous access to dense user-level received signal strength (RSS) measurements. Such full-observation assumptions are difficult to satisfy in real-world deployments due to the high cost and limited availability of dense wireless feedback. Sparse-feedback decision making under severe observation constraints therefore represents a fundamental challenge. To fill this gap, we propose SparsePilot, a measurement-efficient sensing-control framework that couples active wireless probing with belief-guided network control. SparsePilot formulates spatial probing as a multi-armed bandit problem over grid cells, uses upper confidence bound probing to select informative regions, and aggregates sparse RSS measurements into a coverage belief map. A deep reinforcement learning controller then uses this belief state to generate continuous UAV mobility actions, while the full wireless state remains hidden from the policy. We further provide a theoretical analysis connecting sparse probing, belief estimation error, and the sparse-feedback performance gap. Experiments across seven urban digital twins show that SparsePilot achieves superior coverage restoration performance while using only about 3.1% of the full-observation measurement budget and demonstrates strong cross-scene generalization to unseen urban-scale wireless environments.

cs.NI↗
arXiv2026

Channel-Agnostic Semantic Compression for Bandwidth-Limited Visual Communication

Bandwidth-limited visual communication systems require efficient transmission of high-dimensional data under dynamic wireless conditions. Existing approaches either rely on joint source-channel coding, which tightly couples representation learning with channel models and lacks flexibility across varying environments, or adopt generative reconstruction techniques that may introduce semantically inconsistent outputs. In this paper, we propose RQ-NAC, a channel-agnostic semantic compression framework for visual communication. The proposed method leverages residual quantization to produce scalable discrete semantic representations, enabling fine-grained and predictable control over the rate-distortion tradeoff. To further enhance compression efficiency, we integrate an n-gram-driven arithmetic coding module that exploits contextual dependencies among latent indices for lossless entropy coding. Extensive experiments demonstrate that RQ-NAC achieves over 600$\times$ compression relative to uncompressed visual data while preserving high perceptual quality. The results show that our approach enables efficient, flexible, and reliable semantic transmission under bandwidth-constrained conditions.

cs.IT↗
arXiv2026

Optimization of Collaborative Semantic Communication Network Performance with Channel and Content Preference Feedback

Existing semantic communication frameworks treat and transmit all image regions with equal importance, which is not practical for real-world applications which may prioritize different content in an image. To address this issue, we propose a novel semantic communication framework that enables a transmitter to use limited channel and content feedback to prioritize the transmission of important image regions. In particular, in the proposed framework, a base station (BS) divides each image into sub-images, extracts their semantic information, and transmits them to users according to their preferences. The users will reconstruct the image based on the received sub-images and cooperatively decide when to send channel state information (CSI) or content-preference feedback under dynamic channels and limited resources. We formulate an optimization problem to minimize the semantic-weighted mean square error between the original image and the regenerated image by optimizing sub-channel allocation, users' power allocation, and feedback selection. To address this problem, a value decomposition actor- critic (AC) with dynamic neighborhood construction (VDAC-DNC) scheme is proposed. The proposed method combines AC with value decomposition networks to allow the BS to approximate discrete actions by a continuous action distribution, thus reducing the output dimension and improving training efficiency. The introduced DNC method further improves training efficiency by constructing a small discrete neighboring action space to search for an action with the maximum Q value, thus avoiding traversing the large discrete action space. Simulation results show that the proposed VDAC-DNC scheme can improve the performance by up to 5.04% and 18.55% compared to the standard multi-agent QAC method and the proposed method without feedback transmission.

cs.NI↗
arXiv2026

Learning to Evade: Adaptive Attacks on Audio Watermarking

Advances in generative audio have intensified copyright concerns, making audio watermarking increasingly important for asserting ownership. However, existing audio watermarking methods are vulnerable to adversarial attacks. We find that watermark decoder message probabilities follow normal distributions, a property exploited by defenses to detect manipulations. This paper introduces an adaptive audio watermark attack method (AWM) designed to bypass existing defense strategies. AWM uses a two-stage optimization: the first stage ensures attack success, while the second improves audio quality. To evade detection, it estimates normal distribution parameters from limited samples of the target audio, and then adaptively steers decoded probabilities back into the estimated range. Evaluated on two watermarking methods across three voice datasets, AWM achieves high success while bypassing state-of-the-art detectors: detection rates are below 10% for replacement and creation, and 0% for removal.

cs.SD↗
arXiv2026

Curved Beam Enabled Wireless Communications: Modeling, Analysis and Optimization

In this paper, the problem of using curved beams to improve wireless communication performance in the presence of a blockage is studied. In particular, a transmitter equipped with a continuous aperture array can generate curved beams to serve multiple receivers by allowing signals to propagate along both straight and curved paths. To optimize the weighted sum-rate, a curved beam model is developed for controlling the beam steering, beam focusing, and beam curving functions, along with a segmented channel model to characterize practical channels induced by the blockage. Based on the introduced curved beam model, an optimization problem is posed with the goal of maximizing the weighted sum-rate of all users under a transmit power budget and physical constraints of curved beams. To solve this problem, the continuous aperture is first converted into finite summations via a discrete sampling of the continuous coordinate. Then, the performance gap between the ideal continuous aperture design and its practical discrete aperture approximation is analyzed. Based on the above discrete approximation, an iterative algorithm is developed to optimize curved beam control parameters. In particular, the original problem is reformulated as a trackable form via fractional programming (FP). Then, the transformed problem is solved by designing an enhanced block coordinate ascent (BCA) method which determines a surrogate-construction point leveraging the local descent from previous iterations, thereby accelerating convergence. Then, a proximal regularization term is included into the surrogate function to control the update magnitude and suppress aggressive update, thereby improving updates stability. Finally, the beam amplitudes are computed based on the effective channel gains. Simulation results show that the proposed method can improve the weighted sum-rate compared to using only straight beam.

eess.SP↗
arXiv2026

Hybrid Bit and Semantic Communications for UAV-Enabled Wireless Power Transfer Networks: A Decision-Assisted Deep Reinforcement Learning Approach

Semantic communications which can significantly reduce spectrum consumption in wireless networks, have recently become a popular research area. When combined with wireless power transfer (WPT), semantic communications can help achieve high spectral efficiency for energy-limited devices in wireless communications. In energy-constrained and link budget-limited scenarios such as UAV networks, the integration of semantic communications and WPT enables highly energyefficient transmission mechanisms. In this paper, we investigate semantic communications in UAV-enabled WPT networks. To achieve adaptability to varying signal-to-noise ratio (SNR) and task requirements, we introduce a multi-layer hybrid bit and semantic communication framework. We adopt a semantic communication efficiency metric and aim to maximize it by jointly optimizing UAV trajectory, energy harvesting base station (EHBS) selection, user association, semantic mode selection, and energy harvesting time allocation. To address this complex longterm optimization problem, we introduce the distributional soft actor-critic (DSAC) algorithm and introduce a decision assistant to further enhance the convergence performance of DSAC. Simulation results validate the effectiveness of the proposed method and framework and demonstrate that our algorithm can achieve superior long-term optimization performance in dynamic network environments.

cs.IT↗
arXiv2026

Network Digital Untwinning: Towards Backward Optimization of Digital Twins

Network digital twins (NDTs) are transforming network management by offering precise virtual replicas of physical network systems. However, their reliance on diverse and sensitive data introduces significant challenges related to data management, regulatory compliance, and user privacy. In scenarios where selective data removal is necessary, such as device deactivation, network reconfiguration, or regulatory compliance, traditional approaches often fall short of preserving the integrity of the twin model. To address this gap, we introduce a network digital untwinning framework that enables the targeted removal of deprecated NDT contributions while maintaining model integrity. Our approach comprises two complementary components: Single Request Untwinning (\algO) and Parallel Request Untwinning (\algM) mechanisms. \algO leverages connectivity metrics based on geographical proximity, data distribution, and network-level attributes to identify and remove the target NDT along with its propagating influence. This is achieved through an optimally selected rollback checkpoint augmented with injected Gaussian noise, followed by a precise remapping phase. \algM extends this mechanism to efficiently handle multiple removal requests by clustering NDTs with similar attributes and performing a coordinated rollback and untwinning schedule. We provide theoretical guarantees on model indistinguishability from scratch-built twins, and validate the framework through extensive experiments on real-world traffic data, demonstrating its effectiveness and operational efficiency.

cs.NI↗
arXiv2026

Toward Polymorphic Backdoor against Semantic Communication via Intensity-Based Poisoning

Semantic Communication (SC) backdoor attacks aim to utilize triggers to manipulate the system into producing predetermined outputs via backdoored shared knowledge. Current SC backdoors adopt monomorphic paradigms with single attack target, which suffers from limited attack diversity, efficiency, and flexibility in heterogeneous downstream scenarios. To overcome the limitations, we propose SemBugger, a polymorphic SC backdoor. By dynamically adjusting the trigger intensity, SemBugger finely-grained controls over the SC knowledge to generate diverse malicious results from the system. Specifically, SemBugger is realized through a multi-effect poisoning-training framework. It introduces graded-intensity triggers to poison training data and optimizes SC systems with hierarchical malicious loss. The trained system's knowledge dynamically adapts to trigger intensity in inputs to yield target outputs, all while preserving transmission fidelity for benign samples. Moreover, to augment SC security, we propose a provable robustness defense that resists SemBugger's homogeneous attacks through a controlled noise mechanism. It operates via strategically adding noise in SC inputs, and we formally provide a theoretical lower bound on the defense efficacy. Experiments across diverse SC models and benchmark datasets indicate that SemBugger attains high attack efficacy while maintaining the regular functionality of SC systems. Meanwhile, the designed defense effectively neutralizes SemBugger attacks.

cs.CR↗
arXiv2026

Agentic Open RAN: A Deterministic and Auditable Framework for Intent-Driven Radio Control

Large language models (LLMs) open new possibilities for agentic control in Open RAN, allowing operators to express intents in natural language while delegating low-level execution to autonomous agents. We present A1gent, an agentic RAN control stack that decouples reasoning from real-time actuation. A non-RT agentic rApp compiles operator goals into typed A1 policy instances, and three task-oriented near-RT agentic xApps enforce them through a deterministic loop with plane-scoped actuation - E2 for mobility and load steering, and O1 for energy orchestration. This agentic reasoning-execution split ensures auditable coordination between RAN intelligent controller (RIC) tiers, supported by encoded guardrails and a fixed-priority action merger for conflict governance. A training-free adaptive policy tuner then refines bounded parameters using KPI memory without retraining, sustaining predictable adaptation. By integrating intent-driven planning with deterministic near-RT execution, A1gent advances Open RAN toward verifiable, self-governing, and reproducible agentic intelligence.

cs.NI↗
arXiv2026

Semantic Feature Multiple Access Empowered Integrated Learning and Communication Networks

Integrated learning and communication (ILAC) unifies learned transceivers with radio resource management, where semantic feature multiple access (SFMA) enables paired users to superpose their learned representations over shared time-frequency resources. Unlike conventional multiple access schemes, SFMA interference arises in the learned feature space and depends jointly on the user pair, the transmit power, and the compression ratio. This coupling ties binary pairing decisions to continuous resource variables, yielding a mixed-integer non-convex optimization problem. To address this problem, we first propose similarity-conditioned SFMA (SC-SFMA), a Swin Transformer-based transceiver whose dual-conditioned similarity modulator (DC-SimM) gates cross-user feature fusion according to the inter-user semantic similarity. We then characterize the resulting pair-dependent interference by a bivariate logistic function parameterized by transmit power and compression ratio, thereby bridging the learned transceiver with network-level optimization. On this basis, we formulate a sum-rate maximization problem subject to per-user distortion, latency, energy, power, and bandwidth constraints. To solve this problem, we develop a three-block alternating optimization algorithm that integrates dual-decomposition-assisted compression ratio allocation, trust-region successive convex approximation (SCA) for joint power-bandwidth optimization, and dynamic feasible graph-based user pairing. Simulation results show that SC-SFMA achieves considerable peak signal-to-noise ratio (PSNR) and multi-scale structural similarity index measure (MS-SSIM) gains over deep joint source-channel coding (JSCC) and separation-based baselines. The proposed optimization framework attains significant sum rate improvements over conventional multiple access baselines.

eess.SP↗
arXiv2026

Joint Device Pairing and Bandwidth Allocation Optimisation for Semantic Feature Multiple Access Networks

This paper presents a Semantic Feature Multiple Access (SFMA) framework for multi-user semantic communication in downlink wireless systems. By extending SwinJSCC to a two-user superimposition paradigm, SFMA enables simultaneous semantic transmission to multiple users over shared time-frequency resources. A key innovation is the Cross-User Attention (CUA) module, which facilitates controlled semantic feature exchange between paired users by leveraging inter-image similarity while mitigating interference. We formulate a joint user pairing and resource allocation problem to minimize global semantic distortion under constraints on bandwidth, end-to-end latency, and energy. This mixed-integer non-convex problem is decomposed into a Minimum-Weight Perfect Matching (MWPM) sub-problem and a convex bandwidth allocation feasibility check, with semi-closed-form bandwidth bounds derived from a strictly concave rate expression. A polynomial-time algorithm based on Blossom matching and bisection search is proposed. Extensive simulations on ImageNet-100 show that SFMA significantly improves reconstruction quality across pairing modes, and the proposed optimization effectively reduces overall distortion while satisfying physical-layer constraints.

eess.SP↗
arXiv2026

Heterogeneous Mean Field Game Framework for LEO Satellite-Assisted V2X Networks

Coordinating mixed fleets of massive vehicles under stringent delay constraints is a central scalability bottleneck in next-generation mobile computing networks, especially when passenger cars, freight trucks, and autonomous vehicles share the same radio and multi-access edge computing (MEC) infrastructure. Heterogeneous mean field games (HMFG) are a principled framework for this setting, but a fundamental design question remains open: how many agent types should be used for a fleet of size $N$? The difficulty is a two-sided trade-off that existing theory does not resolve: using more types improves heterogeneity representation, but it reduces per-class sample size and weakens the mean-field approximation accuracy. This paper resolves that trade-off through an explicit $\varepsilon$-Nash error decomposition, a closed-form type-selection law, a heterogeneity-aware equilibrium solver, and a robust extension to time-varying LEO backhaul dynamics. For the 1D queue state space, the optimal type count satisfies $K^*(N)=Θ(N^{1/3})$; for the joint queue-channel model ($d=2$), the scaling becomes $K^*(N)=Θ(N^{1/5})$ with logarithmic correction. The unified formula $K^*(N)=Θ(N^{α/(α+β)})$ provides dimension-dependent design guidance, reducing type granularity to a principled, set-once system parameter rather than a per-deployment tuning burden. Experiments validate the 1D scaling law with empirical slope $0.334 \pm 0.004$, achieve $2.3\times$ faster PDHG convergence at $K=5$, and deliver up to $29.5\%$ lower delay and $60\%$ higher throughput than homogeneous baselines. Unlike model-free DRL methods whose training complexity scales with the state-action space, the proposed HMFG solver has per-iteration complexity $O(K^2 N_q N_t)$ independent of fleet size $N$, making it suitable for large-scale mobile edge computing deployment.

cs.GT↗
arXiv2026

Agentic AI-Empowered Wireless Agent Networks With Semantic-Aware Collaboration via ILAC

The rapid development of agentic artificial intelligence (AI) is driving future wireless networks to evolve from passive data pipes into intelligent collaborative ecosystems under the emerging paradigm of integrated learning and communication (ILAC). However, realizing efficient agentic collaboration faces challenges not only in handling semantic redundancy but also in the lack of an integrated mechanism for communication, computation, and control. To address this, we propose a wireless agent network (WAN) framework that orchestrates a progressive knowledge aggregation mechanism. Specifically, we formulate the aggregation process as a joint energy minimization problem where the agents perform semantic compression to eliminate redundancy, optimize transmission power to deliver semantic payloads, and adjust physical trajectories to proactively enhance channel qualities. To solve this problem, we develop a hierarchical algorithm that integrates inner-level resource optimization with outer-level topology evolution. Theoretically, we reveal that incorporating a potential field into the topology evolution effectively overcomes the short-sightedness of greedy matching, providing a mathematically rigorous heuristic for long-term energy minimization. Simulation results demonstrate that the proposed framework achieves superior energy efficiency and scalability compared to conventional benchmarks, validating the efficacy of semantic-aware collaboration in dynamic environments.

cs.NI↗
arXiv2026

On Performance of Fluid Antenna Relay (FAR)-Assisted AAV-NOMA Wireless Network

In this paper, we investigate the performance of a fluid antenna relay (FAR)-assisted downlink communication system utilizing non-orthogonal multiple access (NOMA). The FAR, which integrates a fluid antenna system (FAS), is equipped on an autonomous aerial vehicle (AAV), and introduces extra degrees of freedom to improve the performance of the system. The transmission is divided into a first phase from the base station (BS) to the users and the FAR, and a second phase where the FAR forwards the signal using amplify-and-forward (AF) or decode-and-forward (DF) relaying to reduce the outage probability (OP) for the user maintaining weaker channel conditions. To analyze the OP performance of the weak user, Copula theory and the Gaussian copula function are employed to model the statistical distribution of the FAS channels. Analytical expressions for weak user's OP are derived for both the AF and the DF schemes. Simulation results validate the effectiveness of the proposed scheme, showing that it consistently outperforms benchmark schemes without the FAR. In addition, numerical simulations also demonstrate the values of the relaying scheme selection parameter under different FAR positions and communication outage thresholds.

eess.SP↗
arXiv2026

Optimizing Reinforcement Learning Training over Digital Twin Enabled Multi-fidelity Networks

In this paper, we investigate a novel digital network twin (DNT) assisted deep learning (DL) model training framework. In particular, we consider a physical network where a base station (BS) uses several antennas to serve multiple mobile users, and a DNT that is a virtual representation of the physical network. The BS must adjust its antenna tilt angles to optimize the data rates of all users. Due to user mobility, the BS may not be able to accurately track network dynamics such as wireless channels and user mobilities. Hence, a reinforcement learning (RL) approach is used to dynamically adjust the antenna tilt angles. To train the RL, we can use data collected from the physical network and the DNT. The data collected from the physical network is more accurate but incurs more communication overhead compared to the data collected from the DNT. Therefore, it is necessary to determine the ratio of data collected from the physical network and the DNT to improve the training of the RL model. We formulate this problem as an optimization problem whose goal is to jointly optimize the tilt angle adjustment policy and the data collection strategy, aiming to maximize the data rates of all users while constraining the time delay introduced by collecting data from the physical network. To solve this problem, we propose a hierarchical RL framework that integrates robust adversarial loss and proximal policy optimization (PPO). Simulation results show that our proposed method reduces the physical network data collection delay by up to 28.01% and 1x compared to a hierarchical RL that uses vanilla PPO as the first level RL, and the baseline that uses robust-RL at the first level and selects the data collection ratio randomly.

cs.NI↗
arXiv2026

Alkaid: Resilience to Edit Errors in Provably Secure Steganography via Distance-Constrained Encoding

While provably secure steganography provides strong concealment by ensuring stego carriers are indistinguishable from natural samples, such systems remain vulnerable to real-world edit errors (e.g., insertions, deletions, substitutions) because their decoding depends on perfect synchronization and lacks error-correcting capability. To bridge this gap, we propose Alkaid, a provably secure steganographic scheme resilient to edit errors via distance-constrained encoding. The key innovation integrates the minimum distance decoding principle directly into the encoding process by enforcing a strict lower bound on the edit distance between codewords of different messages. Specifically, if two candidate codewords violate this bound, they are merged to represent the same message, thereby guaranteeing reliable recovery. While maintaining provable security, we theoretically prove that Alkaid offers deterministic robustness against bounded errors. To implement this scheme efficiently, we adopt block-wise and batch processing. Extensive experiments demonstrate that Alkaid achieves decoding success rates of 99\% to 100\% across diverse error channels, delivers a payload of 0.2 bits per token for high embedding capacity, and maintains an encoding speed of 6.72 bits per second, significantly surpassing state-of-the-art (SOTA) methods in robustness, capacity, and efficiency.

cs.CR↗
arXiv2026

Energy Efficient Federated Learning with Hyperdimensional Computing (HDC)

This paper investigates the problem of minimizing total energy consumption for secure federated learning (FL) in wireless edge networks, a key paradigm for decentralized big data analytics. To tackle the high computational cost and privacy challenges of processing large-scale distributed data with conventional neural networks, we propose an FL with hyperdimensional computing and differential privacy (FL-HDC-DP) framework. Each edge device employs hyperdimensional computing (HDC) for lightweight local training and applies differential privacy (DP) noise to protect transmitted model updates. The total energy consumption is minimized through a joint optimization of the HDC dimension, transmit power, and CPU frequency. An efficient hybrid algorithm is developed, combining an outer enumeration search for HDC dimensions with an inner one-dimensional search for resource allocation. Simulation results show that the proposed framework achieves up to 83.3% energy reduction compared with baseline schemes, while maintaining high accuracy and faster convergence.

cs.DC↗