SearcharxivSearch

arXiv subjects

Phee Lep Yeoh

Publications and source records attributed to Phee Lep Yeoh.

At least 19 recordsLinked to original sources

Geometry-Aware Cross-Height Channel Knowledge Map Prediction for UAV-Assisted Communications With Uncertainty-Guided 3D Sensing

Low-altitude Unmanned Aerial Vehicles (UAVs) often need to infer channel knowledge across a range of heights from only sparse observations collected at a few altitude layers. To address this challenge, this paper studies height-conditioned cross-height channel knowledge map (CKM) prediction for UAV-assisted communications in geometry-rich urban environments. We develop a geometry-aware conditional prediction framework that combines urban scene priors, sparse multi-altitude observations, and target-height descriptors to reconstruct dense CKMs at unobserved target heights. An uncertainty head is further introduced to characterize prediction confidence and to support cost-aware online UAV sensing under motion and safety constraints. Experiments on a layered aerial CKM benchmark show that the proposed Feature Pyramid Network (FPN)-Transformer achieves the best overall performance under both unseen-scene zero-shot and legacy patch-random protocols, reducing the Root Mean Square Error (RMSE) to 5.347dB and 1.111dB, respectively, compared with 6.937dB and 1.221dB for the strongest baseline 3D-RadioDiff. Moreover, after applying our unseen-scene few-shot adaptation, the RMSE further decreases from 5.347dB in zero-shot prediction to 3.518dB with 10-shot two-height support, while the uncertainty-guided cost-aware sensing policy improves active reconstruction from 6.94dB at initialization to 4.79dB at sensing budget 40, outperforming uncertainty-only sensing at 5.08dB and random aerial sampling at 5.84dB.

cs.CV

Sparse Gain Radio Map Reconstruction With Geometry Priors and Uncertainty-Guided Measurement Selection

Radio maps are important for environment-aware wireless communication, network planning, and radio resource optimization. However, dense radio map construction remains challenging when only a limited number of measurements are available, especially in complex urban environments with strong blockages, irregular geometry, and restricted sensing accessibility. Existing methods have explored interpolation, low-rank cartography, deep completion, and channel knowledge map (CKM) construction, but many of these methods insufficiently exploit explicit geometric priors or overlook the value of predictive uncertainty for subsequent sensing. In this paper, we study sparse gain radio map reconstruction from a geometry-aware and active sensing perspective. We first construct \textbf{UrbanRT-RM}, a controllable ray-tracing benchmark with diverse urban layouts, multiple base-station deployments, and multiple sparse sampling modes. We then propose \textbf{GeoUQ-GFNet}, a lightweight network that jointly predicts a dense gain radio map and a spatial uncertainty map from sparse measurements and structured scene priors. The predicted uncertainty is further used to guide active measurement selection under limited sensing budgets. Extensive experiments show that our proposed GeoUQ-GFNet method achieves strong and consistent reconstruction performance across different scenes and transmitter placements generated using UrbanRT-RM. Moreover, uncertainty-guided querying provides more effective reconstruction improvement than non-adaptive sampling under the same additional measurement budget. These results demonstrate the effectiveness of combining geometry-aware learning, uncertainty estimation, and benchmark-driven evaluation for sparse radio map reconstruction in complex urban environments.

cs.CV

Meta-Reinforcement Learning Optimization for Movable Antenna-aided Full-Duplex CF-DFRC Systems with Carrier Frequency Offset

By enabling spectrum sharing between radar and communication operations, the cell-free dual-functional radar-communication (CF-DFRC) system is a promising candidate to significantly improve spectrum efficiency in future sixth-generation (6G) wireless networks. However, in wideband scenarios, synchronization errors caused by carrier frequency offset (CFO) can severely reduce both communication capacity and sensing accuracy. To address this challenge, this paper integrates movable antennas (MAs) into the CF-DFRC framework, leveraging their spatial flexibility and adaptive beamforming to dynamically mitigate CFO-induced impairments. To fully exploit the advantages of MAs in wideband scenarios with CFO, we aim to maximize the worst-case sum-rate of communication and sensing by jointly optimizing MA positions, {beamforming}, and CFO parameters, subject to transmit power and MA positioning constraints. Due to the non-convex nature of the problem, we propose a robust meta reinforcement learning (MRL)-based two-stage alternating optimization strategy. In the first stage, we employ manifold optimization (MO) with penalty dual decomposition (PDD) to solve the CFO-robust worst-case subproblem. In the second stage, we adopt to jointly optimize {the MA positions and beamforming vectors} in a data-driven manner {for dynamic wireless environments}. Simulation results show that the proposed MRL approach significantly outperforms conventional deep reinforcement learning (DRL) schemes in both communication and sensing performance under CFO impairments. Furthermore, compared to fixed-position antennas (FPAs), the MA-aided CF-DFRC system exhibits

eess.SP

Distortion-Aware Hybrid Beamforming for Integrated Sensing and Communication

This paper investigates a practical partially-connected hybrid beamforming transmitter for integrated sensing and communication (ISAC) with distortion from nonlinear power amplification. For this ISAC system, we formulate a communication rate and sensing mutual information maximization problem driven by our distortion-aware hybrid beamforming design. To address this non-convex problem, we first solve for a fully digital beamforming matrix by alternatively solving three sub-problems using manifold optimization (MO) and our derived closed-form solutions. The analog and digital beamforming matrices are then obtained through a decomposition algorithm. Numerical results demonstrate that the proposed algorithm can improve overall ISAC performance compared to traditional beamforming methods.

eess.SP

Secure Enhancement for RIS-Aided UAV with ISAC: Robust Design and Resource Allocation

This paper analyses the security performance of a reconfigurable intelligent surface (RIS)-aided unmanned aerial vehicle (UAV) communication system with integrated sensing and communications (ISAC). We consider a multiple-antenna UAV transmitting ISAC waveforms to simultaneously detect an untrusted target in the surrounding environment and communicate with a ground Internet-of-Things (IoT) device in the presence of an eavesdropper (Eve). Given that the Eve can conceal their channel state information (CSI) in practical scenarios, we assume that the CSI of the eavesdropper channel is imperfect. For this RIS-aided ISAC-UAV system, we aim to maximize the average communication secrecy rate by jointly optimizing UAV trajectory, RIS passive beamforming, transmit beamforming, and receive beamforming. However, this joint optimization problem is non-convex due to multi-variable coupling. As such, we solve the optimization using an efficient and tractable algorithm using a block coordinate descent (BCD) method. Specifically, we develop a successive convex approximation (SCA) algorithm based on semidefinite relaxation (SDR) to optimise the joint optimization as four separate non-convex subproblems. Numerical results show that our proposed algorithm can successfully ensure the accuracy of sensing targets and significantly improve the communication secrecy rate of the IoT communication devices.

eess.SP

Movable Antenna Enabled ISAC Beamforming Design for Low-Altitude Airborne Vehicles

In mobile systems with low-altitude vehicles, integrated sensing and communication (ISAC) is considered an effective approach to increase the transmission rate due to limited spectrum resources. To further improve the ISAC performance, this paper proposes a novel method called integrated sensing and communication-movable antenna (ISAC-MA) to optimize the antenna's position. Our goal is to support low-space vehicles by optimizing radar and communication joint beamforming and antenna position in the presence of clutter. This scheme not only guarantees the required signal-to-noise ratio (SNR) for sensing but also further improves the SNR for communication. A successive convex approximation (SCA)-based block coordinate descent (BCD) algorithm is proposed to maximize communication capacity under the condition of sensing SNR. Numerical results show that, compared with the traditional ISAC system and various benchmark schemes, the proposed ISAC-MA system can achieve higher communication capacity under the same sensing SNR constraints.

eess.SP

Improving Physical-Layer Security in ISAC-UAV System: Beamforming and Trajectory Optimization

This paper investigates a novel unmanned aerial vehicle (UAV) secure communication system with integrated sensing and communications. We consider wireless security enhancement for a multiple-antenna UAV transmitting ISAC waveforms to communicate with multiple ground Internet-of-Thing devices and detect the surrounding environment. Specifically, we aim to maximize the average communication secrecy rate by optimizing the UAV trajectory and beamforming vectors. Given that the UAV trajectory optimization problem is non-convex due to multi-variable coupling develop an efficient algorithm based on the successive convex approximation (SCA) algorithm. Numerical results show that our proposed algorithm can ensure the accuracy of sensing targets and improve the communication secrecy rate.

eess.SP

A Constrained Deep Reinforcement Learning Optimization for Reliable Network Slicing in a Blockchain-Secured Low-Latency Wireless Network

Network slicing (NS) is a promising technology that supports diverse requirements for next-generation low-latency wireless communication networks. However, the tampering attack is a rising issue of jeopardizing NS service-provisioning. To resist tampering attacks in NS networks, we propose a novel optimization framework for reliable NS resource allocation in a blockchain-secured low-latency wireless network, where trusted base stations (BSs) with high reputations are selected for blockchain management and NS service-provisioning. For such a blockchain-secured network, we consider that the latency is measured by the summation of blockchain management and NS service-provisioning, whilst the NS reliability is evaluated by the BS denial-of-service (DoS) probability. To satisfy the requirements of both the latency and reliability, we formulate a constrained computing resource allocation optimization problem to minimize the total processing latency subject to the BS DoS probability. To efficiently solve the optimization, we design a constrained deep reinforcement learning (DRL) algorithm, which satisfies both latency and DoS probability requirements by introducing an additional critic neural network. The proposed constrained DRL further solves the issue of high input dimension by incorporating feature engineering technology. Simulation results validate the effectiveness of our approach in achieving reliable and low-latency NS service-provisioning in the considered blockchain-secured wireless network.

eess.SP

Hybrid-Task Meta-Learning: A GNN Approach for Scalable and Transferable Bandwidth Allocation

In this paper, we develop a deep learning-based bandwidth allocation policy that is: 1) scalable with the number of users and 2) transferable to different communication scenarios, such as non-stationary wireless channels, different quality-of-service (QoS) requirements, and dynamically available resources. To support scalability, the bandwidth allocation policy is represented by a graph neural network (GNN), with which the number of training parameters does not change with the number of users. To enable the generalization of the GNN, we develop a hybrid-task meta-learning (HML) algorithm that trains the initial parameters of the GNN with different communication scenarios during meta-training. Next, during meta-testing, a few samples are used to fine-tune the GNN with unseen communication scenarios. Simulation results demonstrate that our HML approach can improve the initial performance by 8.79%, and sample efficiency by 73%, compared with existing benchmarks. After fine-tuning, our near-optimal GNN-based policy can achieve close to the same reward with much lower inference complexity compared to the optimal policy obtained using iterative optimization. Numerical results validate that our HML can reduce the computation time by approximately 200 to 2000 times than the optimal iterative algorithm.

cs.NI

Graph Neural Network-Based Bandwidth Allocation for Secure Wireless Communications

This paper designs a graph neural network (GNN) to improve bandwidth allocations for multiple legitimate wireless users transmitting to a base station in the presence of an eavesdropper. To improve the privacy and prevent eavesdropping attacks, we propose a user scheduling algorithm to schedule users satisfying an instantaneous minimum secrecy rate constraint. Based on this, we optimize the bandwidth allocations with three algorithms namely iterative search (IvS), GNN-based supervised learning (GNN-SL), and GNN-based unsupervised learning (GNN-USL). We present a computational complexity analysis which shows that GNN-SL and GNN-USL can be more efficient compared to IvS which is limited by the bandwidth block size. Numerical simulation results highlight that our proposed GNN-based resource allocations can achieve a comparable sum secrecy rate compared to IvS with significantly lower computational complexity. Furthermore, we observe that the GNN approach is more robust to uncertainties in the eavesdropper's channel state information, especially compared with the best channel allocation scheme.

cs.IT

Secure Deep Reinforcement Learning for Dynamic Resource Allocation in Wireless MEC Networks

This paper proposes a blockchain-secured deep reinforcement learning (BC-DRL) optimization framework for {data management and} resource allocation in decentralized {wireless mobile edge computing (MEC)} networks. In our framework, {we design a low-latency reputation-based proof-of-stake (RPoS) consensus protocol to select highly reliable blockchain-enabled BSs to securely store MEC user requests and prevent data tampering attacks.} {We formulate the MEC resource allocation optimization as a constrained Markov decision process that balances minimum processing latency and denial-of-service (DoS) probability}. {We use the MEC aggregated features as the DRL input to significantly reduce the high-dimensionality input of the remaining service processing time for individual MEC requests. Our designed constrained DRL effectively attains the optimal resource allocations that are adapted to the dynamic DoS requirements. We provide extensive simulation results and analysis to} validate that our BC-DRL framework achieves higher security, reliability, and resource utilization efficiency than benchmark blockchain consensus protocols and {MEC} resource allocation algorithms.

cs.LG

Hybrid NOMA assisted Integrated Sensing and Communication via RIS

This paper investigates the optimization of reconfigurable intelligent surface (RIS) in an integrated sensing and communication (ISAC) system. \red{To meet the demand of growing number of devices, power domain non-orthogonal multiple access (NOMA) is considered. However, traditional NOMA with a large number of devices is challenging due to large decoding delay and propagation error introduced by successive interference cancellation (SIC). Thus, OMA is integrated into NOMA to support more devices}. We formulate a max-min problem to optimize the sensing beampattern \red{with constraints on communication rate}, through joint power allocation, active beamforming and RIS phase shift design. To solve the non-convex problem with a non-smooth objective function, we propose a low complexity alternating optimization (AO) algorithm, where a closed form expression for the intra-cluster power allocation (intra-CPA) is derived, and penalty and successive convex approximation (SCA) methods are used to optimize the beamforming and phase shift design. Simulation results show the effectiveness of the proposed algorithm in terms of improving minimum beampattern gain (MBPG) compared with other baselines. Furthermore, the trade-off between sensing and communication is analyzed and demonstrated in the simulation results.

eess.SP

Information Leakage in Index Coding

We study the information leakage to a guessing adversary in index coding with a general message distribution. Under both vanishing-error and zero-error decoding assumptions, we develop lower and upper bounds on the optimal leakage rate, which are based on the broadcast rate of the subproblem induced by the set of messages the adversary tries to guess. When the messages are independent and uniformly distributed, the lower and upper bounds match, establishing an equivalence between the two rates.

cs.IT

Information Leakage in Index Coding With Sensitive and Non-Sensitive Messages

Information leakage to a guessing adversary in index coding is studied, where some messages in the system are sensitive and others are not. The non-sensitive messages can be used by the server like secret keys to mitigate leakage of the sensitive messages to the adversary. We construct a deterministic linear coding scheme, developed from the rank minimization method based on fitting matrices (Bar-Yossef et al. 2011). The linear scheme leads to a novel upper bound on the optimal information leakage rate, which is proved to be tight over all deterministic scalar linear codes. We also derive a converse result from a graph-theoretic perspective, which holds in general over all deterministic and stochastic coding schemes.

cs.IT

Weighted Sum Age of Information Minimization in Wireless Networks with Aerial IRS

In this letter, we analyze a terrestrial wireless communication network assisted by an aerial intelligent reflecting surface (IRS). We consider a packet scheduling problem at the ground base station (BS) aimed at improving the information freshness by selecting packets based on their AoI. To further improve the communication quality, the trajectory of the unmanned aerial vehicle (UAV) which carries the IRS is optimized with joint active and passive beamforming design. To solve the formulated non-convex problem, we propose an iterative alternating optimization problem based on a successive convex approximation (SCA) algorithm. The simulation results shows significant performance improvement in terms of weighted sum AoI, and the SCA solution converges quickly with low computational complexity.

eess.SP

Information Leakage in Zero-Error Source Coding: A Graph-Theoretic Perspective

We study the information leakage to a guessing adversary in zero-error source coding. The source coding problem is defined by a confusion graph capturing the distinguishability between source symbols. The information leakage is measured by the ratio of the adversary's successful guessing probability after and before eavesdropping the codeword, maximized over all possible source distributions. Such measurement under the basic adversarial model where the adversary makes a single guess and allows no distortion between its estimator and the true sequence is known as the maximum min-entropy leakage or the maximal leakage in the literature. We develop a single-letter characterization of the optimal normalized leakage under the basic adversarial model, together with an optimum-achieving scalar stochastic mapping scheme. An interesting observation is that the optimal normalized leakage is equal to the optimal compression rate with fixed-length source codes, both of which can be simultaneously achieved by some deterministic coding schemes. We then extend the leakage measurement to generalized adversarial models where the adversary makes multiple guesses and allows certain level of distortion, for which we derive single-letter lower and upper bounds.

cs.IT

Random Shifting Intelligent Reflecting Surface for OTP Encrypted Data Transmission

In this paper, we propose a novel encrypted data transmission scheme using an intelligent reflecting surface (IRS) to generate secret keys in wireless communication networks. We show that perfectly secure one-time pad (OTP) communications can be established by using a simple random phase shifting of the IRS elements. To maximize the secure transmission rate, we design an optimal time slot allocation algorithm for the IRS secret key generation and the encrypted data transmission phases. Moreover, a theoretical expression of the key generation rate is derived based on Poisson point process (PPP) for the practical scenario when eavesdroppers' channel state information (CSI) is unavailable. Simulation results show that employing our IRS-based scheme can significantly improve the encrypted data transmission performance for a wide-range of wireless channel gains and system parameters.

cs.IT

Secret Key Generation for Intelligent Reflecting Surface Assisted Wireless Communication Networks

We propose and analyze secret key generation using intelligent reflecting surface (IRS) assisted wireless communication networks. To this end, we first formulate the minimum achievable secret key capacity for an IRS acting as a passive beamformer in the presence of multiple eavesdroppers. Next, we develop an optimization framework for the IRS reflecting coefficients based on the secret key capacity lower bound. To derive a tractable and efficient solution, we design and analyze a semidefinite relaxation (SDR) and successive convex approximation (SCA) based algorithm for the proposed optimization. Simulation results show that employing our IRS-based algorithm can significantly improve the secret key generation capacity for a wide-range of wireless channel parameters.

eess.SP