VLDB 2026 Research / reviewers in the wild / expert
Yang Zhao 0017
dblp:50/2082-17
· DBLP profile ↗
17ranked-venue papers
6as first author
14since 2021 · last 2026
0000-0003-0285-503XORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 15 · 6 first-author · 14 since 2021Security and privacy · 2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Delay Minimization for Movable Antennas-Enabled Anti-Jamming Communications With Mobile Edge ComputingabstractIn future 6G networks, mobile edge computing (MEC) is envisioned to offer integrated computing, communication, and storage services at the network edge, enhancing both computational efficiency and communication quality. However, most existing MEC designs neglect the impact of jamming attacks, especially those from intelligent and adaptive jammers. To fill this important research gap, this paper investigates a jamming-resilient MEC framework that aims to improve communication reliability and reduce system delay under adversarial interference. Leveraging the emerging movable antenna (MA) technology, which allows dynamic adjustment of antenna positions and orientations, we propose a novel MA-assisted anti-jamming MEC architecture. Unlike existing works, our model explicitly considers the movement delay caused by MA, which is critical for practical deployment. We jointly optimize the MA positions at both the user equipment (UE) and the base station (BS), BS transmit beamforming, and task offloading ratios to minimize the total system delay. The resulting optimization problem is non-convex and highly coupled. Thus, we develop an efficient algorithm based on penalty dual decomposition (PDD) and successive convex approximation (SCA). Simulation results demonstrate that the proposed scheme significantly outperforms traditional fixed-position antenna (FPA) baselines in terms of jamming resilience and delay minimization, offering new insights into robust MEC system design for 6G networks. Yue Xiu 0001, Yang Zhao 0017, Kaihe Wang, Minrui Xu, Dusit Niyato, Guangyi Liu 0001 |
IEEE Trans. Commun. | 2 |
| 2026 | Movable Antenna-Aided Cooperative ISAC Network With Time Synchronization Error and Imperfect CSIabstractCooperative-integrated sensing and communication (C-ISAC) networks have emerged as promising solutions for communication and target sensing. However, imperfect channel state information (CSI) estimation and time synchronization (TS) errors degrade performance, affecting communication and sensing accuracy. This paper addresses these challenges by employing movable antennas (MAs) to enhance C-ISAC robustness. We analyze the impact of CSI errors on achievable rates and introduce a hybrid Cramer-Rao lower bound (HCRLB) to evaluate the effect of TS errors on target localization accuracy. Based on these models, we derive the worst-case achievable rate and sensing precision under such errors. We optimize cooperative beamforming, base station (BS) selection factor and MA position to minimize power consumption while ensuring accuracy. We then propose a constrained deep reinforcement learning (C-DRL) approach to solve this non-convex optimization problem, using a modified deep deterministic policy gradient (DDPG) algorithm with a Wolpertinger architecture for efficient training under complex constraints. To the best of our knowledge, this is the first work that jointly integrates TS errors and imperfect CSI into a unified MA-aided cooperative ISAC framework, providing a physically consistent model for both communication and sensing under dual uncertainties. Simulation results show that the proposed method significantly improves system robustness against CSI and TS errors, where robustness mean reliable data transmission under poor channel conditions. These findings demonstrate the potential of MA technology to reduce power consumption in imperfect CSI and TS environments. Yue Xiu 0001, Yang Zhao 0017, Dusit Niyato, Jing Jin 0007, Qixing Wang, Guangyi Liu 0001 |
IEEE Trans. Commun. | 2 |
| 2026 | Power Source Allocation for RIS-Aided Integrating Sensing, Communication, and Power Transfer Communication Systems Based on NOMAabstractThe integration of sensing, communication, and power transfer (ISCPT) has emerged as a promising paradigm for energy- and spectrum-efficient 6G networks. Recent studies have revealed that sensing accuracy, achievable rate, and harvested energy inherently exhibit conflicting design requirements and form a nontrivial trade-off region. However, existing integrated sensing and communication (ISAC) and simultaneous wireless information and power transfer (SWIPT) schemes typically optimize at most two of these functionalities and lack a unified resource-allocation framework that can flexibly balance all three under stringent power budgets. Motivated by this gap, we consider a reconfigurable intelligent surface (RIS)-aided ISCPT system that employs non-orthogonal multiple access (NOMA) to support multi-user connectivity. In the proposed design, the RIS reshapes the wireless propagation environment in an energy-efficient manner to enhance both sensing and power transfer, while NOMA provides power-domain multiplexing to improve spectral efficiency and user scalability. We formulate a total transmit power minimization problem by jointly optimizing the base-station beamforming, RIS phase shifts, power splitting (PS) ratios, and NOMA decoding order under quality-of-service (QoS), Cramér–Rao-bound-based sensing accuracy, and energy-harvesting constraints. The resulting problem is highly non-convex due to the coupling among the design variables. To solve it efficiently, we develop a block coordinate descent (BCD)-based algorithm that leverages semidefinite relaxation (SDR), successive convex approximation (SCA), and the alternating direction method of multipliers (ADMM). Simulation results verify that the proposed RIS-aided NOMA-ISCPT framework significantly reduces the base-station transmit power while achieving favorable trade-offs among communication reliability, sensing precision, and energy-transfer efficiency. Yue Xiu 0001, Yang Zhao 0017, Chenfei Xie, Fatma Benkhelifa, Songjie Yang, Wanting Lyu, Chadi Assi |
IEEE Trans. Mob. Comput. | 2 |
| 2026 | Latency Minimization for Movable Relay-Aided D2D-MEC Communication SystemsabstractDevice-to-device (D2D)-aided mobile edge computing (MEC) has emerged as a key enabling technology for future sixth-generation (6G) wireless networks. The goal of D2D-MEC is to reduce system latency for edge user equipments (UEs) by enabling access to cloud computing capabilities at the network edge, thereby supporting high transmission rates. To address the vulnerability of communication signals to physical obstructions, we employ relay techniques to enhance system performance and extend coverage. However, relay nodes and base station (BS) are typically equipped with large-scale antenna arrays, which lead to significant implementation costs and limiting practical deployment. To address this issue in a cost-efficient manner without sacrificing system performance, movable antenna (MA) technology is introduced. The key idea of MA technology lies in dynamically optimizing antenna positions to improve system capacity. Therefore, we propose a novel resource allocation framework for an movable relay-aided D2D-MEC system. The proposed scheme jointly optimizes the MA positions at UEs, relays, and the BS, along with the associated beamforming vectors, MEC server resource allocation, and computational task offloading rates. The objective is to minimize the maximum system latency while satisfying both computation and communication rate constraints. Furthermore, considering that current MA control mechanisms primarily rely on mechanical actuation, MA movement delay is incorporated into the latency model to capture the trade-off between antenna mobility and system delay. The resulting optimization problem is non-convex and involves multiple coupled variables. To solve this problem, we develop a parallel and distributed algorithm based on the penalty dual decomposition (PDD) framework, which is further integrated with the successive convex approximation (SCA) method to obtain a suboptimal solution. Simulation results demonstrate that the proposed algorithm significantly reduces system latency and enhances overall efficiency compared to benchmark schemes employing conventional fixed-position antennas (FPAs) at the relays and BS. Yue Xiu 0001, Yang Zhao 0017, Long Qu, Maurice Khabbaz, Chadi Assi |
IEEE Trans. Mob. Comput. | 2 |
| 2026 | Robust Optimization for Movable Antenna-Aided Cell-Free ISAC With Time Synchronization ErrorsabstractThe cell-free integrated sensing and communication (CF-ISAC) system, which effectively mitigates intra-cell interference and provides precise sensing accuracy, is a promising technology for future 6G networks. However, to fully capitalize on the potential of CF-ISAC, accurate time synchronization (TS) between access points (APs) is critical. Due to the limitations of current synchronization technologies, TS errors have become a significant challenge in the development of the CF-ISAC system. In this paper, we propose a novel CF-ISAC architecture based on movable antennas (MAs), which exploits spatial diversity to enhance communication rates, maintain sensing accuracy, and reduce the impact of TS errors. We formulate a worst-case sensing accuracy optimization problem for TS errors to address this challenge, deriving the worst-case Cramér-Rao lower bound (CRLB). Subsequently, we develop a joint optimization framework for AP beamforming and MA positions to satisfy communication rate constraints while improving sensing accuracy. A robust optimization framework is designed for the highly complex and non-convex problem. Specifically, we employ manifold optimization (MO) to solve the worst-case sensing accuracy optimization problem. Then, we propose an MA-enabled meta-reinforcement learning (MA-MetaRL) to design optimization variables while satisfying constraints on MA positions, communication rate, and transmit power, thereby improving sensing accuracy. The simulation results demonstrate that the proposed robust optimization algorithm significantly improves the accuracy of the detection and is strong against TS errors. Moreover, compared to conventional fixed position antenna (FPA) technologies, the proposed MA-aided CF-ISAC architecture achieves higher system capacity, thus validating its effectiveness. Yue Xiu 0001, Yang Zhao 0017, Wanting Lyu, Dusit Niyato, Dong In Kim 0001, Guangyi Liu 0001 |
IEEE Trans. Wirel. Commun. | 2 |
| 2025 | Movable Antenna-Aided Federated Learning with Over-The-Air Aggregation: Joint Optimization of Positioning, Beamforming, and User Selection
Yang Zhao 0017, Yue Xiu 0001, Minrui Xu |
ICC | 1 |
| 2025 | Robust Beamforming Design for Near-Field DMA-NOMA mmWave Communications With Imperfect Position InformationabstractFor millimeter-wave (mmWave) non-orthogonal multiple access (NOMA) communication systems, we propose an innovative near-field (NF) transmission framework based on dynamic metasurface antenna (DMA) technology. In this framework, a base station (BS) utilizes the DMA hybrid beamforming technology combined with the NOMA principle to maximize communication efficiency between near-field users (NUs) and far-field users (FUs). In conventional communication systems, obtaining channel state information (CSI) requires substantial pilot signals, significantly reducing system communication efficiency. We propose a beamforming design scheme based on position information to address with this challenge. This scheme does not depend on pilot signals but indirectly obtains CSI by analyzing the geometric relationship between user position information and channel models. However, in practical applications, the accuracy of position information is challenging to guarantee and may contain errors. We propose a robust beamforming design strategy based on the worst-case scenario to tackle this issue. Since this problem is a multi-variable coupled non-convex problem, we employ a dual-loop iterative joint optimization algorithm to update beamforming using block coordinate descent (BCD) and derive the optimal power allocation (PA) expression. We analyze its convergence and complexity to verify the proposed algorithm’s performance and robustness thoroughly. We validate the theoretical derivation of the CSI error bound through simulation experiments. Numerical results show that our proposed scheme performs better than traditional beamforming schemes. Additionally, the transmission framework exhibits strong robustness to NU and FU position errors, laying a solid foundation for the practical application of mmWave NOMA communication systems. The NF transmission framework for mmWave NOMA communication systems based on DMA technology proposed in this work shows significant advantages in improving communication sum rate, reducing reliance on pilot signals, and coping with position errors. This provides new insights for the future development of mmWave NOMA communication technology. Yue Xiu 0001, Yang Zhao 0017, Songjie Yang, Dusit Niyato, Hongyang Du 0001 |
IEEE Trans. Wirel. Commun. | 2 |
| 2024 | TranDRL: A Transformer-Driven Deep Reinforcement Learning Enabled Prescriptive Maintenance FrameworkabstractIndustrial systems require reliable predictive maintenance strategies to enhance operational efficiency and reduce downtime. Existing studies rely on heuristic models which may struggle to capture complex temporal dependencies. This paper introduces an integrated framework that leverages the capabilities of the Transformer and Deep Reinforcement Learning (DRL) algorithms to optimize system maintenance actions. Our approach employs the Transformer model to effectively capture complex temporal patterns in IoT sensor data, thus accurately predicting the Remaining Useful Life (RUL) of equipment. Additionally, the DRL component of our framework provides cost-effective and timely maintenance recommendations. Numerous experiments conducted on the NASA C-MPASS dataset demonstrate that our approach has a performance similar to the ground-truth results and could be obviously better than the baseline methods in terms of RUL prediction accuracy as the time cycle increases. Additionally, experimental results demonstrate the effectiveness of optimizing maintenance actions. Yang Zhao 0017, Jiaxi Yang 0003, Wenbo Wang 0004, Helin Yang, Dusit Niyato |
IEEE Internet Things J. | 1 |
| 2023 | Correction to "Privacy-Preserving Blockchain-Based Federated Learning for IoT Devices"abstractIn[1], on page 1824,Fig. 3should be as follows: Yang Zhao 0017, Jun Zhao 0007, Linshan Jiang, Rui Tan 0001, Dusit Niyato, Zengxiang Li, Lingjuan Lyu |
IEEE Internet Things J. | 1 |
| 2023 | Enhanced Secure Communication via Novel Double-Faced Active RISabstractAlthough the reconfigurable intelligent surface (RIS) technology is envisioned promising to enhance communication from all aspects, including physical-layer security, increasing concerns have lately been cast onto its defects—the severe “double-fading” loss and its confined-to-half-space coverage. Diverse novel RIS architectures have recently emerged to partially overcome these shortcomings, yet perfect solution is still absent. This paper proposes a novel double-faced active (DFA)-RIS structure to surmount the above two prominent defects simultaneously. Furthermore, we utilize the DFA-RIS to promote secrecy performance via jointly designing access point (AP)’s beamforming and DFA-RIS configuration towards maximizing sum secrecy rate (SR). The optimization problem is highly challenging due to the constraints deriving from the DFA-RIS architecture, especially the presence of power splitting parameters. By leveraging majorization–minimization (MM) and penalty dual decomposition (PDD) methods, we develop an efficient solution that updates all variables via convex optimization techniques. Our proposed solution is significant and general as it is applicable to all other cutting-the-edge RIS architectures to maximize sum SR, which has not yet been thoroughly worked out. Numerical results verify the convergence and effectiveness of our proposed algorithm and demonstrate that our proposed DFA-RIS architecture outperforms all other state-of-the-art RIS techniques to enhance communication security. Yang Liu 0017, Qingqing Wu 0001, Qingjiang Shi, Yang Zhao 0017 |
IEEE Trans. Commun. | 5 |
| 2023 | Queueing Aware Power Minimization for Wireless Communication Aided by Double-Faced Active RISabstractAlthough reconfigurable intelligent surface (RIS) technology has manifested great potentials in improving wireless network’s power saving, most existing literature restricts to pure physical (PHY) layer beamforming design and neglects the impact of media access control (MAC) layer’s data traffic flows. Simultaneously, current RIS technology suffers from defects — the severe fading loss and the limitation of half-space coverage. This paper aims to perform a cross-layer design via jointly optimizing MAC layer scheduling and PHY layer RIS beamforming to reduce power consumption. Besides, we propose a novel double-faced-active (DFA)-RIS architecture to promote RIS’ capability. The proposed design task leads to a highly challenging stochastic problem to minimize long-term power consumption while stabilizing queues. Inspired by Lyapunov control theory, we propose an online optimization strategy to resolve this challenge. Via exploiting alternative directional method of multipliers (ADMM), we develop an analytic-based solution to solve the online sub-problems highly efficiently without resorting to any numerical solvers. Our strategy theoretically guarantees all queues’ stability and achieves a tunable trade-off between the power expenditure and queue lengths. Extensive numerical results are presented to demonstrate the effectiveness of our proposed cross-layer design and the DFA-RIS’ advantage over other cutting-the-edge RIS architectures. Yuyan Zhou, Yang Liu 0017, Qingqing Wu 0001, Qingjiang Shi, Jun Zhao 0007, Yang Zhao 0017 |
IEEE Trans. Commun. | 6 |
| 2021 | Privacy-Preserving Blockchain-Based Federated Learning for IoT DevicesabstractHome appliance manufacturers strive to obtain feedback from users to improve their products and services to build a smart home system. To help manufacturers develop a smart home system, we design a federated learning (FL) system leveraging a reputation mechanism to assist home appliance manufacturers to train a machine learning model based on customers’ data. Then, manufacturers can predict customers’ requirements and consumption behaviors in the future. The working flow of the system includes two stages: in the first stage, customers train the initial model provided by the manufacturer using both the mobile phone and the mobile-edge computing (MEC) server. Customers collect data from various home appliances using phones, and then they download and train the initial model with their local data. After deriving local models, customers sign on their models and send them to the blockchain. In case customers or manufacturers are malicious, we use the blockchain to replace the centralized aggregator in the traditional FL system. Since records on the blockchain are untampered, malicious customers or manufacturers’ activities are traceable. In the second stage, manufacturers select customers or organizations as miners for calculating the averaged model using received models from customers. By the end of the crowdsourcing task, one of the miners, who is selected as the temporary leader, uploads the model to the blockchain. To protect customers’ privacy and improve the test accuracy, we enforce differential privacy (DP) on the extracted features and propose a new normalization technique. We experimentally demonstrate that our normalization technique outperforms batch normalization when features are under DP protection. In addition, to attract more customers to participate in the crowdsourcing FL task, we design an incentive mechanism to award participants. Yang Zhao 0017, Jun Zhao 0007, Linshan Jiang, Rui Tan 0001, Dusit Niyato, Zengxiang Li, Lingjuan Lyu |
IEEE Internet Things J. | 1 |
| 2021 | A Blockchain-Based Approach for Saving and Tracking Differential-Privacy CostabstractAn increasing amount of users' sensitive information is now being collected for analytics purposes. Differential privacy has been widely studied in the literature to protect the privacy of users' information. The privacy parameter bounds the information about the data set leaked by the noisy output. Oftentimes, a data set needs to be used for answering multiple queries, so the level of privacy protection may degrade as more queries are answered. Thus, it is crucial to keep track of privacy budget spending, which should not exceed the given limit of privacy budget. Moreover, if a query has been answered before and is asked again on the same data set, we may reuse the previous noisy response for the current query to save the privacy cost. In view of the above, we design an algorithm to reuse previous noisy responses if the same query is asked repeatedly. In particular, considering that different requests of the same query may have different privacy requirements, our algorithm can set the optimal reuse fraction of the old noisy response and add new noise to minimize the accumulated privacy cost. Furthermore, we design and implement a blockchain-based system for tracking and saving differential-privacy cost. As a result, the owner of the data set will have full knowledge about how the data set has been used and be confident that no new privacy cost will be incurred for answering queries once the specified privacy budget is exhausted. Yang Zhao 0017, Jun Zhao 0007, Jiawen Kang 0001, Zehang Zhang, Dusit Niyato, Shuyu Shi, Kwok-Yan Lam |
IEEE Internet Things J. | 1 |
| 2021 | Local Differential Privacy-Based Federated Learning for Internet of ThingsabstractThe Internet of Vehicles (IoV) is a promising branch of the Internet of Things. IoV simulates a large variety of crowdsourcing applications, such as Waze, Uber, and Amazon Mechanical Turk, etc. Users of these applications report the real-time traffic information to the cloud server which trains a machine learning model based on traffic information reported by users for intelligent traffic management. However, crowdsourcing application owners can easily infer users' location information, traffic information, motor vehicle information, environmental information, etc., which raises severe sensitive personal information privacy concerns of the users. In addition, as the number of vehicles increases, the frequent communication between vehicles and the cloud server incurs unexpected amount of communication cost. To avoid the privacy threat and reduce the communication cost, in this article, we propose to integrate federated learning and local differential privacy (LDP) to facilitate the crowdsourcing applications to achieve the machine learning model. Specifically, we propose four LDP mechanisms to perturb gradients generated by vehicles. The proposed Three-Outputs mechanism introduces three different output possibilities to deliver a high accuracy when the privacy budget is small. The output possibilities of Three-Outputs can be encoded with two bits to reduce the communication cost. Besides, to maximize the performance when the privacy budget is large, an optimal piecewise mechanism (PM-OPT) is proposed. We further propose a suboptimal mechanism (PM-SUB) with a simple formula and comparable utility to PM-OPT. Then, we build a novel hybrid mechanism by combining Three-Outputs and PM-SUB. Finally, an LDP-FedSGD algorithm is proposed to coordinate the cloud server and vehicles to train the model collaboratively. Extensive experimental results on real-world data sets validate that our proposed algorithms are capable of protecting privacy while guaranteeing utility. Yang Zhao 0017, Jun Zhao 0007, Mengmeng Yang 0002, Ning Wang 0026, Lingjuan Lyu, Dusit Niyato, Kwok-Yan Lam |
IEEE Internet Things J. | 1 |
| 2020 | POSTER: Blockchain-Based Differential Privacy Cost Management SystemabstractPrivacy preservation is a big concern for various sectors. To protect individual user data, one emerging technology is differential privacy. However, it still has limitations for datasets with frequent queries, such as the fast accumulation of privacy cost. To tackle this limitation, this paper explores the integration of a secured decentralised ledger, blockchain. Blockchain will be able to keep track of all noisy responses generated with differential privacy algorithm and allow for certain queries to reuse old responses. In this paper, a demo of a proposed blockchain-based privacy management system is designed as an interactive decentralised web application (DApp). The demo created illustrates that leveraging on blockchain will allow the total privacy cost accumulated to decrease significantly. Leong Mei Han, Yang Zhao 0017, Jun Zhao 0007 |
AsiaCCS | 2 |
| 2020 | POSTER: Attacks to Federated Learning: Responsive Web User Interface to Recover Training Data from User GradientsabstractLocal differential privacy (LDP) is an emerging privacy standard to protect individual user data. One scenario where LDP can be applied is federated learning, where each user sends in his/her user gradients to an aggregator who uses these gradients to perform stochastic gradient descent. In a case where the aggregator is untrusted and LDP is not applied to each user gradient, the aggregator can recover sensitive user data from these gradients. In this paper, we present a new interactive web demo showcasing the power of local differential privacy by visualizing federated learning with local differential privacy. Moreover, the live demo shows how LDP can prevent untrusted aggregators from recovering sensitive training data. A measure called the exp-hamming recovery is also created to show the extent of how much data the aggregator can recover. Hans Albert Lianto, Yang Zhao 0017, Jun Zhao 0007 |
AsiaCCS | 2 |
| 2020 | Deep Reinforcement Learning Based Intelligent Reflecting Surface for Secure Wireless CommunicationsabstractIn this paper, we study an intelligent reflecting surface (IRS)-aided wireless secure communication system for physical layer security, where an IRS is deployed to adjust its reflecting elements to secure the communication of multiple legitimate users in the presence of multiple eavesdroppers. Aiming to improve the system secrecy rate, a design problem for jointly optimizing the base station (BS)'s beamforming and the IRS's reflecting beamforming is formulated considering different quality of service (QoS) requirements and time-varying channel conditions. As the system is highly dynamic and complex, a novel deep reinforcement learning (DRL)-based secure beamforming approach is firstly proposed to achieve the optimal beamforming policy against eavesdroppers in dynamic environments. Simulation results demonstrate that the proposed deep learning based secure beamforming approach can significantly improve the system secrecy performance compared with other approaches. Helin Yang, Yang Zhao 0017, Zehui Xiong, Jun Zhao 0007, Dusit Niyato, Kwok-Yan Lam, Qingqing Wu 0001 |
GLOBECOM | 2 |