Haoyuan Pan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Haoyuan Pan has a total of 59 co-authors. Here are the top co-authors by number of shared publications:
- Tse-Tin Chan
The Education University of Hong Kong
20 shared publications - Jianqiang Li
Shenzhen University
9 shared publications - Soung Chang Liew
The Chinese University of Hong Kong, Hong Kong, Hong Kong
8 shared publications - Jiaxin Liang
Huawei Technologies Co Ltd, Shenzhen, China
6 shared publications - Victor. C. M. Leung
Shenzhen University
6 shared publications Lu Lu
5 shared publications
Latest Publications
- 23 May 2026
- Published by Elsevier in Computer Networks
- Vol. 285
Enhancing information freshness in X-relay networks with variable-rate DeepJSCC semantic-forward relaying
- 23 May 2026
- Published by Elsevier in Computer Networks
- Vol. 285
Enhancing information freshness in X-relay networks with variable-rate DeepJSCC semantic-forward relaying
- Open Access
Diffusion Model-based Reinforcement Learning for Version Age of Information Scheduling: Average and Tail-Risk-Sensitive Control
Ensuring timely and semantically accurate information delivery is critical in real-time wireless systems. While Age of Information (AoI) quantifies temporal freshness, Version Age of Information (VAoI) captures semantic staleness by accounting for version evolution between transmitters and receivers. Existing VAoI scheduling approaches primarily focus on minimizing average VAoI, overlooking rare but severe staleness events that can compromise reliability under stochastic packet arrivals and unreliable channels. This paper investigates both average-oriented and tail-risk-sensitive VAoI scheduling in a multi-user status update system with long-term transmission cost constraints. We first formulate the average VAoI minimization problem as a constrained Markov decision process and introduce a deep diffusion-based Soft Actor-Critic (D2SAC) algorithm. By generating actions through a diffusion-based denoising process, D2SAC enhances policy expressiveness and establishes a strong baseline for mean performance. Building on this foundation, we put forth RS-D3SAC, a risk-sensitive deep distributional diffusion-based Soft Actor-Critic algorithm. RS-D3SAC integrates a diffusion-based actor with a quantile-based distributional critic, explicitly modeling the full VAoI return distribution. This enables principled tail-risk optimization via Conditional Value-at-Risk (CVaR) while satisfying long-term transmission cost constraints. Extensive simulations show that, while D2SAC reduces average VAoI, RS-D3SAC consistently achieves substantial reductions in CVaR without sacrificing mean performance. The dominant gain in tail-risk reduction stems from the distributional critic, with the diffusion-based actor providing complementary refinement to stabilize and enrich policy decisions, highlighting their effectiveness for robust and risk-aware VAoI scheduling in multi-user wireless systems.
Open AccessDiffusion Model-based Reinforcement Learning for Version Age of Information Scheduling: Average and Tail-Risk-Sensitive Control
Ensuring timely and semantically accurate information delivery is critical in real-time wireless systems. While Age of Information (AoI) quantifies temporal freshness, Version Age of Information (VAoI) captures semantic staleness by accounting for version evolution between transmitters and receivers. Existing VAoI scheduling approaches primarily focus on minimizing average VAoI, overlooking rare but severe staleness events that can compromise reliability under stochastic packet arrivals and unreliable channels. This paper investigates both average-oriented and tail-risk-sensitive VAoI scheduling in a multi-user status update system with long-term transmission cost constraints. We first formulate the average VAoI minimization problem as a constrained Markov decision process and introduce a deep diffusion-based Soft Actor-Critic (D2SAC) algorithm. By generating actions through a diffusion-based denoising process, D2SAC enhances policy expressiveness and establishes a strong baseline for mean performance. Building on this foundation, we put forth RS-D3SAC, a risk-sensitive deep distributional diffusion-based Soft Actor-Critic algorithm. RS-D3SAC integrates a diffusion-based actor with a quantile-based distributional critic, explicitly modeling the full VAoI return distribution. This enables principled tail-risk optimization via Conditional Value-at-Risk (CVaR) while satisfying long-term transmission cost constraints. Extensive simulations show that, while D2SAC reduces average VAoI, RS-D3SAC consistently achieves substantial reductions in CVaR without sacrificing mean performance. The dominant gain in tail-risk reduction stems from the distributional critic, with the diffusion-based actor providing complementary refinement to stabilize and enrich policy decisions, highlighting their effectiveness for robust and risk-aware VAoI scheduling in multi-user wireless systems.
- 24 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25  (3) , 4121-4137
A QoE-Driven Personalized Incentive Mechanism Design for AIGC Services in Resource-Constrained Edge Networks
With rapid advancements in large language models (LLMs), AI-generated content (AIGC) has emerged as a key driver of technological innovation and economic transformation. Personalizing AIGC services to meet individual user demands is essential but challenging for AIGC service providers (ASPs) due to the subjective and complex demands of mobile users (MUs), as well as the computational and communication resource constraints faced by ASPs. To tackle these challenges, we first develop a novel multi-dimensional quality-of-experience (QoE) metric. This metric comprehensively evaluates AIGC services by integrating accuracy, token count, and timeliness. We focus on a mobile edge computing (MEC)-enabled AIGC network, consisting of multiple ASPs deploying differentiated AIGC models on edge servers and multiple MUs with heterogeneous QoE requirements requesting AIGC services from ASPs. To incentivize ASPs to provide personalized AIGC services under MEC resource constraints, we propose a QoE-driven incentive mechanism. We formulate the problem as an equilibrium problem with equilibrium constraints (EPEC), where MUs as leaders determine rewards, while ASPs as followers optimize resource allocation. To solve this, we develop a dual-perturbation reward optimization algorithm, reducing the implementation complexity of adaptive pricing. Experimental results demonstrate that our proposed mechanism achieves a reduction of approximately 64.9% in average computational and communication overhead, while the average service cost for MUs and the resource consumption of ASPs decrease by 66.5% and 76.8%, respectively, compared to state-of-the-art benchmarks.
- 24 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25  (3) , 4121-4137
A QoE-Driven Personalized Incentive Mechanism Design for AIGC Services in Resource-Constrained Edge Networks
With rapid advancements in large language models (LLMs), AI-generated content (AIGC) has emerged as a key driver of technological innovation and economic transformation. Personalizing AIGC services to meet individual user demands is essential but challenging for AIGC service providers (ASPs) due to the subjective and complex demands of mobile users (MUs), as well as the computational and communication resource constraints faced by ASPs. To tackle these challenges, we first develop a novel multi-dimensional quality-of-experience (QoE) metric. This metric comprehensively evaluates AIGC services by integrating accuracy, token count, and timeliness. We focus on a mobile edge computing (MEC)-enabled AIGC network, consisting of multiple ASPs deploying differentiated AIGC models on edge servers and multiple MUs with heterogeneous QoE requirements requesting AIGC services from ASPs. To incentivize ASPs to provide personalized AIGC services under MEC resource constraints, we propose a QoE-driven incentive mechanism. We formulate the problem as an equilibrium problem with equilibrium constraints (EPEC), where MUs as leaders determine rewards, while ASPs as followers optimize resource allocation. To solve this, we develop a dual-perturbation reward optimization algorithm, reducing the implementation complexity of adaptive pricing. Experimental results demonstrate that our proposed mechanism achieves a reduction of approximately 64.9% in average computational and communication overhead, while the average service cost for MUs and the resource consumption of ASPs decrease by 66.5% and 76.8%, respectively, compared to state-of-the-art benchmarks.
- Open Access
A QoE-Driven Personalized Incentive Mechanism Design for AIGC Services in Resource-Constrained Edge Networks
With rapid advancements in large language models (LLMs), AI-generated content (AIGC) has emerged as a key driver of technological innovation and economic transformation. Personalizing AIGC services to meet individual user demands is essential but challenging for AIGC service providers (ASPs) due to the subjective and complex demands of mobile users (MUs), as well as the computational and communication resource constraints faced by ASPs. To tackle these challenges, we first develop a novel multi-dimensional quality-of-experience (QoE) metric. This metric comprehensively evaluates AIGC services by integrating accuracy, token count, and timeliness. We focus on a mobile edge computing (MEC)-enabled AIGC network, consisting of multiple ASPs deploying differentiated AIGC models on edge servers and multiple MUs with heterogeneous QoE requirements requesting AIGC services from ASPs. To incentivize ASPs to provide personalized AIGC services under MEC resource constraints, we propose a QoE-driven incentive mechanism. We formulate the problem as an equilibrium problem with equilibrium constraints (EPEC), where MUs as leaders determine rewards, while ASPs as followers optimize resource allocation. To solve this, we develop a dual-perturbation reward optimization algorithm, reducing the implementation complexity of adaptive pricing. Experimental results demonstrate that our proposed mechanism achieves a reduction of approximately $64.9\%$ in average computational and communication overhead, while the average service cost for MUs and the resource consumption of ASPs decrease by $66.5\%$ and $76.8\%$, respectively, compared to state-of-the-art benchmarks.Open AccessA QoE-Driven Personalized Incentive Mechanism Design for AIGC Services in Resource-Constrained Edge Networks
With rapid advancements in large language models (LLMs), AI-generated content (AIGC) has emerged as a key driver of technological innovation and economic transformation. Personalizing AIGC services to meet individual user demands is essential but challenging for AIGC service providers (ASPs) due to the subjective and complex demands of mobile users (MUs), as well as the computational and communication resource constraints faced by ASPs. To tackle these challenges, we first develop a novel multi-dimensional quality-of-experience (QoE) metric. This metric comprehensively evaluates AIGC services by integrating accuracy, token count, and timeliness. We focus on a mobile edge computing (MEC)-enabled AIGC network, consisting of multiple ASPs deploying differentiated AIGC models on edge servers and multiple MUs with heterogeneous QoE requirements requesting AIGC services from ASPs. To incentivize ASPs to provide personalized AIGC services under MEC resource constraints, we propose a QoE-driven incentive mechanism. We formulate the problem as an equilibrium problem with equilibrium constraints (EPEC), where MUs as leaders determine rewards, while ASPs as followers optimize resource allocation. To solve this, we develop a dual-perturbation reward optimization algorithm, reducing the implementation complexity of adaptive pricing. Experimental results demonstrate that our proposed mechanism achieves a reduction of approximately $64.9\%$ in average computational and communication overhead, while the average service cost for MUs and the resource consumption of ASPs decrease by $66.5\%$ and $76.8\%$, respectively, compared to state-of-the-art benchmarks. - 8 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12  (14) , 29032-29045
Automatic Repeat Request Design in AoI-Aware Broadcast With Heterogeneous Direct and Relay-Assisted Users
This article investigates the design of automatic repeat request (ARQ) protocols in Age of Information (AoI)-aware broadcast systems with heterogeneous users, including both direct and relay-assisted users. In this setup, a direct user receives status updates directly via a single-hop link, while a relay-assisted user can receive status updates through either a direct single-hop link or a two-hop relay-assisted link. While ARQ is commonly used to ensure reliable transmission in error-prone wireless networks, previous studies suggest that ARQ does not improve the average AoI in single-hop networks. However, its impact on AoI in systems with relays, particularly those involving heterogeneous users, remains unclear. We address this gap by analyzing the average AoI under different ARQ strategies, introducing a transmission limit $k \geq 0$ at the relay. Here, $k=0$ , $k=1$ , and $k\gt 1$ correspond to nonrelay, non-ARQ-at-relay, and truncated-ARQ-at-relay strategies, respectively. Utilizing a unified Markov chain framework that models the transmission processes for each user type, we derive the theoretical average AoI. Our results show that the direct user benefits most from nonrelay and non-ARQ strategies, similar to single-hop systems. In contrast, the relay-assisted user achieves optimal performance with truncated-ARQ-at-relay, leveraging both direct and relay-assisted links. For the overall system, applying a non-ARQ-at-relay approach strikes a balance in AoI between the direct and relay-assisted users, leading to a more stable and lower system-wide average AoI.
- 8 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12  (14) , 29032-29045
Automatic Repeat Request Design in AoI-Aware Broadcast With Heterogeneous Direct and Relay-Assisted Users
This article investigates the design of automatic repeat request (ARQ) protocols in Age of Information (AoI)-aware broadcast systems with heterogeneous users, including both direct and relay-assisted users. In this setup, a direct user receives status updates directly via a single-hop link, while a relay-assisted user can receive status updates through either a direct single-hop link or a two-hop relay-assisted link. While ARQ is commonly used to ensure reliable transmission in error-prone wireless networks, previous studies suggest that ARQ does not improve the average AoI in single-hop networks. However, its impact on AoI in systems with relays, particularly those involving heterogeneous users, remains unclear. We address this gap by analyzing the average AoI under different ARQ strategies, introducing a transmission limit $k \geq 0$ at the relay. Here, $k=0$ , $k=1$ , and $k\gt 1$ correspond to nonrelay, non-ARQ-at-relay, and truncated-ARQ-at-relay strategies, respectively. Utilizing a unified Markov chain framework that models the transmission processes for each user type, we derive the theoretical average AoI. Our results show that the direct user benefits most from nonrelay and non-ARQ strategies, similar to single-hop systems. In contrast, the relay-assisted user achieves optimal performance with truncated-ARQ-at-relay, leveraging both direct and relay-assisted links. For the overall system, applying a non-ARQ-at-relay approach strikes a balance in AoI between the direct and relay-assisted users, leading to a more stable and lower system-wide average AoI.
- Open Access
- 2 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12  (14) , 27728-27741
Reflection Optimization for Covert Ambient Backscatter Systems Under Two Jamming Patterns
Ambient backscatter communication (ABC) enables low-cost and energy-efficient connectivity for Internet of Things (IoT) devices by leveraging ambient radio-frequency (RF) signals. However, the passive nature and open wireless medium of ABC systems make them vulnerable to detection by unauthorized receivers (wardens). To mitigate this risk, covert communication, which conceals transmissions by embedding them within noise, offers a promising security enhancement for ABC systems. This article proposes a jammer-assisted reflection coefficient optimization framework to enhance the covertness and reliability of ABC systems with an endogenous warden and an external jammer. Specifically, we consider two distinct jamming patterns: 1) uniformly distributed and 2) truncated exponentially distributed artificial noise power. We derive closed-form expressions for both the outage probability of the backscatter link and the minimum detection error rate at the warden under these jamming patterns. Based on these expressions, we determine the optimal reflection coefficients that maximize the effective covert rate while satisfying a predefined covertness constraint. Additionally, we introduce the concept of jamming cost to evaluate the efficiency and applicability of different jamming patterns in terms of the required jamming power to achieve a desired level of covertness. Numerical results validate the effectiveness of the proposed optimization framework and reveal that while uniform jamming provides stronger covertness and lower jamming cost, truncated exponential jamming achieves a lower outage probability. These findings provide key insights for designing secure and efficient ABC systems across diverse IoT deployment scenarios.
- 2 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12  (14) , 27728-27741
Open AccessReflection Optimization for Covert Ambient Backscatter Systems Under Two Jamming Patterns
Ambient backscatter communication (ABC) enables low-cost and energy-efficient connectivity for Internet of Things (IoT) devices by leveraging ambient radio-frequency (RF) signals. However, the passive nature and open wireless medium of ABC systems make them vulnerable to detection by unauthorized receivers (wardens). To mitigate this risk, covert communication, which conceals transmissions by embedding them within noise, offers a promising security enhancement for ABC systems. This article proposes a jammer-assisted reflection coefficient optimization framework to enhance the covertness and reliability of ABC systems with an endogenous warden and an external jammer. Specifically, we consider two distinct jamming patterns: 1) uniformly distributed and 2) truncated exponentially distributed artificial noise power. We derive closed-form expressions for both the outage probability of the backscatter link and the minimum detection error rate at the warden under these jamming patterns. Based on these expressions, we determine the optimal reflection coefficients that maximize the effective covert rate while satisfying a predefined covertness constraint. Additionally, we introduce the concept of jamming cost to evaluate the efficiency and applicability of different jamming patterns in terms of the required jamming power to achieve a desired level of covertness. Numerical results validate the effectiveness of the proposed optimization framework and reveal that while uniform jamming provides stronger covertness and lower jamming cost, truncated exponential jamming achieves a lower outage probability. These findings provide key insights for designing secure and efficient ABC systems across diverse IoT deployment scenarios.
- 11 February 2025
- Published by Elsevier in Computer Networks
- Vol. 260
Age of collection with non-orthogonal multiple access: A theoretical-plus-experimental study
- 11 February 2025
- Published by Elsevier in Computer Networks
- Vol. 260
Age of collection with non-orthogonal multiple access: A theoretical-plus-experimental study
- 13 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24  (6) , 5298-5311
Successive Interference Cancellation-Enabled Timely Status Update in Linear Multi-Hop Wireless Networks
We investigate the timely status update in linear multi-hop wireless networks, where a source tries to deliver status update packets to a destination through a sequence of half-duplex relays. Timeliness is measured by the age of information (AoI) metric. Maintaining a low AoI at the destination typically necessitates frequent transmission of update packets from the source. However, high packet transmission frequency in multi-hop scenarios can result in mutual wireless interference at intermediate relays. Specifically, when an intermediate relay receives wireless signals of a new packet from its previous node, simultaneous transmission of an old packet by its subsequent node to the next hop may cause wireless signals to interfere at the intermediate relay, conventionally leading to packet collision. A key motivation to solve this issue is that the intermediate relay has previously received the old packet (which can thus be forwarded to the subsequent node for further relaying). Hence, successive interference cancellation (SIC) can be employed to mitigate interference of the old packet and recover the new packet. This paper designs an SIC-enabled packet relaying scheme tailored to low AoI. Initially focusing on a three-hop network, we subsequently extend our approach to general multi-hop networks. We model the multi-hop relaying scheme using a Markov chain to derive the theoretical average AoI. Theoretical and simulation results indicate that the SIC-enabled packet relaying scheme significantly reduces the average AoI compared to the non-SIC approaches, owing to an increased packet transmission frequency at the source and the effectiveness of SIC techniques at the relays.
- 13 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 24  (6) , 5298-5311
Successive Interference Cancellation-Enabled Timely Status Update in Linear Multi-Hop Wireless Networks
We investigate the timely status update in linear multi-hop wireless networks, where a source tries to deliver status update packets to a destination through a sequence of half-duplex relays. Timeliness is measured by the age of information (AoI) metric. Maintaining a low AoI at the destination typically necessitates frequent transmission of update packets from the source. However, high packet transmission frequency in multi-hop scenarios can result in mutual wireless interference at intermediate relays. Specifically, when an intermediate relay receives wireless signals of a new packet from its previous node, simultaneous transmission of an old packet by its subsequent node to the next hop may cause wireless signals to interfere at the intermediate relay, conventionally leading to packet collision. A key motivation to solve this issue is that the intermediate relay has previously received the old packet (which can thus be forwarded to the subsequent node for further relaying). Hence, successive interference cancellation (SIC) can be employed to mitigate interference of the old packet and recover the new packet. This paper designs an SIC-enabled packet relaying scheme tailored to low AoI. Initially focusing on a three-hop network, we subsequently extend our approach to general multi-hop networks. We model the multi-hop relaying scheme using a Markov chain to derive the theoretical average AoI. Theoretical and simulation results indicate that the SIC-enabled packet relaying scheme significantly reduces the average AoI compared to the non-SIC approaches, owing to an increased packet transmission frequency at the source and the effectiveness of SIC techniques at the relays.