Zhenzhen Han
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
Zhenzhen Han has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Guofeng Zhao
School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China
9 shared publications - Chuan Xu
School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China
8 shared publications - Shui Yu
University of Technology Sydney
8 shared publications - Gang Chen
School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China
2 shared publications - Kefei Cheng
School of Cyber Security and Information Law, Chongqing University of Posts and Telecommunications, Chongqing, China
2 shared publications Yu Hu
School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China
2 shared publications
Latest Publications
- 27 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (14) , 31255-31269
Joint Robust Routing, Scheduling, and Load Balancing in Deterministic UAV Rescue Networks: A DFS-PPO Method
In post-disaster recovery scenarios, Unmanned Aerial Vehicles (UAVs) are widely deployed as aerial base stations to ensure deterministic communication services for time-sensitive (TS) flows requiring strict latency and reliability requirements. However, dynamic network topologies may render existing schedules invalid, and newly arriving flows can cause time-slot conflicts with ongoing transmissions, resulting in low resource utilization. To address these challenges, we propose a Depth-First Search-based Proximal Policy Optimization (DFS-PPO) approach for robust data flow routing and scheduling. The proposed method aims to balance link loads while satisfying reliability and latency constraints. A pruned DFS algorithm is used to determine the candidate routing set. To capture the spatial dependencies of all link states in the network, a Graph Attention Network (GAT) is employed to extract the global network state. In addition, a Transformer is adopted to model the nonlinear relationship between candidate routes and the network state. A PPO agent then makes routing decisions based on the high-level representation generated by the Transformer, enabling the model to adapt dynamically to changing network conditions and effectively mitigate bottlenecks. Simulation results demonstrate that the proposed DFS-PPO approach significantly outperforms benchmark algorithms in terms of network load balancing, reliability, and the number of successfully scheduled TS flows.
- 27 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (14) , 31255-31269
Joint Robust Routing, Scheduling, and Load Balancing in Deterministic UAV Rescue Networks: A DFS-PPO Method
In post-disaster recovery scenarios, Unmanned Aerial Vehicles (UAVs) are widely deployed as aerial base stations to ensure deterministic communication services for time-sensitive (TS) flows requiring strict latency and reliability requirements. However, dynamic network topologies may render existing schedules invalid, and newly arriving flows can cause time-slot conflicts with ongoing transmissions, resulting in low resource utilization. To address these challenges, we propose a Depth-First Search-based Proximal Policy Optimization (DFS-PPO) approach for robust data flow routing and scheduling. The proposed method aims to balance link loads while satisfying reliability and latency constraints. A pruned DFS algorithm is used to determine the candidate routing set. To capture the spatial dependencies of all link states in the network, a Graph Attention Network (GAT) is employed to extract the global network state. In addition, a Transformer is adopted to model the nonlinear relationship between candidate routes and the network state. A PPO agent then makes routing decisions based on the high-level representation generated by the Transformer, enabling the model to adapt dynamically to changing network conditions and effectively mitigate bottlenecks. Simulation results demonstrate that the proposed DFS-PPO approach significantly outperforms benchmark algorithms in terms of network load balancing, reliability, and the number of successfully scheduled TS flows.
- Open Access
Integrated Scheduling Algorithm Based on Matching Game Theory in LEO Satellite Networks
As an indispensable component of space–terrestrial integrated networks, low-Earth orbit (LEO) satellite networks are capable of providing flexible access and low delay communication services for emerging time-sensitive traffic. However, the inconsistent transmission rates between intra-satellite wired links and inter-satellite wireless links will undoubtedly result in unstable delay at the satellites. This disparity poses a challenge to ensuring deterministic communication for time-sensitive traffic. Aiming at this problem, we put forward an integrated scheduling algorithm based on matching game theory to concurrently determine the positions of wired and wireless time slots. First, we establish a theoretical model to quantify the influence of integrated scheduling on deterministic communication by elucidating the interrelationships among time-sensitive traffic, wired time slots, and wireless time slots. Second, drawing inspiration from scheduling sequences and matching game theory, the established integrated scheduling model is reformulated into a cyclic three-sided matching game model. Third, we design an integrated scheduling algorithm (ISA) to derive scheduling optimization solutions. Experimental results demonstrate that the proposed algorithm ISA outperforms existing scheduling algorithms, achieving an average delay reduction of 16.6% over all comparison algorithms.
Open AccessIntegrated Scheduling Algorithm Based on Matching Game Theory in LEO Satellite Networks
As an indispensable component of space–terrestrial integrated networks, low-Earth orbit (LEO) satellite networks are capable of providing flexible access and low delay communication services for emerging time-sensitive traffic. However, the inconsistent transmission rates between intra-satellite wired links and inter-satellite wireless links will undoubtedly result in unstable delay at the satellites. This disparity poses a challenge to ensuring deterministic communication for time-sensitive traffic. Aiming at this problem, we put forward an integrated scheduling algorithm based on matching game theory to concurrently determine the positions of wired and wireless time slots. First, we establish a theoretical model to quantify the influence of integrated scheduling on deterministic communication by elucidating the interrelationships among time-sensitive traffic, wired time slots, and wireless time slots. Second, drawing inspiration from scheduling sequences and matching game theory, the established integrated scheduling model is reformulated into a cyclic three-sided matching game model. Third, we design an integrated scheduling algorithm (ISA) to derive scheduling optimization solutions. Experimental results demonstrate that the proposed algorithm ISA outperforms existing scheduling algorithms, achieving an average delay reduction of 16.6% over all comparison algorithms.
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (1) , 1310-1321
Spatiotemporal-Aware Deep Reinforcement Learning for Multi-UAV Cooperative Coverage in Emergency Deterministic Communications
In post-disaster reconstruction and rescue work, unmanned aerial vehicles (UAVs) are often used as aerial base stations to provide communication services for ground users (GUs), owing to their flexibility and controllability. The premise for the efficient completion of cooperative rescue tasks is the deterministic transmission of data, that is, to ensure that the end-to-end delay of data (Time Sensitive Flow, TSF) is bounded and the jitter is stable. However, a single UAV is insufficient to fully cover the entire target area. To obtain an efficient multi-UAV cooperative control coverage strategy that directs multiple UAVs to maximize the number of coverage tasks in a cooperative manner, the centralized controller must jointly consider the spatial positions of both the mission and the UAVs, as well as the effective transmission time windows for TSFs. Towards this end, we propose a spatiotemporal aware deep reinforcement learning (STA-DRL) method. The proposed method 1) The transformer is used to extract spatiotemporal features from environmental states to improve the generalization representation ability of the model; 2) Prioritized Experience Replay Buffer helps accelerate model convergence; 3) A coverage strategy is formulated under the guidance of two Transformer models. Simulation results show that the proposed method is superior to existing methods in terms of task completion coverage quantity.
- 14 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (1) , 1310-1321
Spatiotemporal-Aware Deep Reinforcement Learning for Multi-UAV Cooperative Coverage in Emergency Deterministic Communications
In post-disaster reconstruction and rescue work, unmanned aerial vehicles (UAVs) are often used as aerial base stations to provide communication services for ground users (GUs), owing to their flexibility and controllability. The premise for the efficient completion of cooperative rescue tasks is the deterministic transmission of data, that is, to ensure that the end-to-end delay of data (Time Sensitive Flow, TSF) is bounded and the jitter is stable. However, a single UAV is insufficient to fully cover the entire target area. To obtain an efficient multi-UAV cooperative control coverage strategy that directs multiple UAVs to maximize the number of coverage tasks in a cooperative manner, the centralized controller must jointly consider the spatial positions of both the mission and the UAVs, as well as the effective transmission time windows for TSFs. Towards this end, we propose a spatiotemporal aware deep reinforcement learning (STA-DRL) method. The proposed method 1) The transformer is used to extract spatiotemporal features from environmental states to improve the generalization representation ability of the model; 2) Prioritized Experience Replay Buffer helps accelerate model convergence; 3) A coverage strategy is formulated under the guidance of two Transformer models. Simulation results show that the proposed method is superior to existing methods in terms of task completion coverage quantity.
- 3 December 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-25
LPQAA: a lightweight post-quantum access authentication scheme for satellite network
- 3 December 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (1) , 1-25
LPQAA: a lightweight post-quantum access authentication scheme for satellite network
- 9 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (4) , 4197-4212
Dynamic Bond Percolation-Based Reliable Topology Evolution Model for Dynamic Networks
With the development of wireless communications, the 6G network is evolving toward dynamics, complexity, and integration. The mobility of nodes and intermittently of links lead to frequent variations in the network topology. When constructing the topology model, the reliability of topology is not only affected by the physical properties of wireless links but also related to the evolution process of nodes and links states, which is indispensable for improving the accuracy of the topology model. In this paper, we propose the evolution model based on dynamic bond percolation to characterize the reliable topology evolution. Firstly, key factors that cause the network topology changes are analyzed, integrating the characteristics of the node mobility and link channel conditions. Especially signal interference, buffer of nodes, and link availability are modeled for wireless link states. Then, the interactions between adjacent links are formulated by an extended Dynamic Bond Percolation (DBP) model to obtain the topology state transition matrix, which can accurately depict the change of link connection. Based on the quantitative analysis of wireless link states, Markov chain and master equation are employed to build the Dynamic Topology Evolution (DTE) model. Meanwhile, the network topology prediction problem is transformed into a linear system solution problem to obtain the steady-state network topology based on the DTE algorithm. Finally, the results suggest that utilizing the DTE model can significantly improve the accuracy of topology prediction and overall network performance.
- 9 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (4) , 4197-4212
Dynamic Bond Percolation-Based Reliable Topology Evolution Model for Dynamic Networks
With the development of wireless communications, the 6G network is evolving toward dynamics, complexity, and integration. The mobility of nodes and intermittently of links lead to frequent variations in the network topology. When constructing the topology model, the reliability of topology is not only affected by the physical properties of wireless links but also related to the evolution process of nodes and links states, which is indispensable for improving the accuracy of the topology model. In this paper, we propose the evolution model based on dynamic bond percolation to characterize the reliable topology evolution. Firstly, key factors that cause the network topology changes are analyzed, integrating the characteristics of the node mobility and link channel conditions. Especially signal interference, buffer of nodes, and link availability are modeled for wireless link states. Then, the interactions between adjacent links are formulated by an extended Dynamic Bond Percolation (DBP) model to obtain the topology state transition matrix, which can accurately depict the change of link connection. Based on the quantitative analysis of wireless link states, Markov chain and master equation are employed to build the Dynamic Topology Evolution (DTE) model. Meanwhile, the network topology prediction problem is transformed into a linear system solution problem to obtain the steady-state network topology based on the DTE algorithm. Finally, the results suggest that utilizing the DTE model can significantly improve the accuracy of topology prediction and overall network performance.
- 21 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 12 (6) , 1061-1065
DTE-RR: Dynamic Topology Evolution-Based Reliable Routing in VANET
The dynamics of Vehicular Ad-hoc Network (VANET) brings tremendous challenges to reliable routing. In the existing topology evolution schemes, the link connectivity and the interaction between links have yet to be well investigated, resulting in the inability to accurately describe the evolution of routing topology. In this letter, we propose a Dynamic Topology Evolution (DTE) based reliable routing algorithm to improve transmission reliability. The DTE model is constructed to formulate the evolution of network topology. Especially, we analyze the network topology changes from the perspective of nodes and links. Meanwhile, the Dynamic Bond Percolation (DBP) model is extended to describe link interaction. Then, the DTE model is completed by deriving the state transition matrix of the network topology based on the link change using Markov theory. Finally, the DTE-based Reliable Routing (DTE-RR) algorithm is designed to optimize routing paths. The experimental results demonstrate that DTE-RR outperforms the existing protocols regarding packet delivery ratio and end-to-end delay.
- 21 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 12 (6) , 1061-1065
DTE-RR: Dynamic Topology Evolution-Based Reliable Routing in VANET
The dynamics of Vehicular Ad-hoc Network (VANET) brings tremendous challenges to reliable routing. In the existing topology evolution schemes, the link connectivity and the interaction between links have yet to be well investigated, resulting in the inability to accurately describe the evolution of routing topology. In this letter, we propose a Dynamic Topology Evolution (DTE) based reliable routing algorithm to improve transmission reliability. The DTE model is constructed to formulate the evolution of network topology. Especially, we analyze the network topology changes from the perspective of nodes and links. Meanwhile, the Dynamic Bond Percolation (DBP) model is extended to describe link interaction. Then, the DTE model is completed by deriving the state transition matrix of the network topology based on the link change using Markov theory. Finally, the DTE-based Reliable Routing (DTE-RR) algorithm is designed to optimize routing paths. The experimental results demonstrate that DTE-RR outperforms the existing protocols regarding packet delivery ratio and end-to-end delay.
- Top Cited Papers
- 28 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (3) , 3440-3454
Time-Varying Topology Model for Dynamic Routing in LEO Satellite Constellation Networks
With the characteristics of low-latency, seamless coverage and high bandwidth, the Low Earth Orbit (LEO) satellite network has been the promising technology for the sixth-generation mobile communication (6G) networks, especially, the inter-satellite link can improve the flexibility of inter-satellite networking and routing. However, in the existing works, since the impact of link attributes on the satellite topology has not been well investigated, it is difficult to avoid the loss of topology information for the transmission path selection, which may aggravate the unreliability of routing path. In this paper, we propose a novel time-varying topology model for the LEO satellite network, to improve the adaptability of the satellite routing. Firstly, the weighted time-space evolution graph based on the link attributes is established to construct the time-varying topology model of LEO satellite networks. Then, the utility function of the link attributes is modelled and the multi-attribute decision-making is introduced to calculate the weight of each link attribute for the quantification of the link utility. Finally, based on the topology model, the inter-satellite link utility-based dynamic routing algorithm is proposed to improve the adaptability of satellite routing. The simulation results demonstrate that the proposed routing algorithm outperforms the existing routing algorithms in terms of packet drop rate, end-to-end delay and throughput.
- 28 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (3) , 3440-3454
Top Cited PapersTime-Varying Topology Model for Dynamic Routing in LEO Satellite Constellation Networks
With the characteristics of low-latency, seamless coverage and high bandwidth, the Low Earth Orbit (LEO) satellite network has been the promising technology for the sixth-generation mobile communication (6G) networks, especially, the inter-satellite link can improve the flexibility of inter-satellite networking and routing. However, in the existing works, since the impact of link attributes on the satellite topology has not been well investigated, it is difficult to avoid the loss of topology information for the transmission path selection, which may aggravate the unreliability of routing path. In this paper, we propose a novel time-varying topology model for the LEO satellite network, to improve the adaptability of the satellite routing. Firstly, the weighted time-space evolution graph based on the link attributes is established to construct the time-varying topology model of LEO satellite networks. Then, the utility function of the link attributes is modelled and the multi-attribute decision-making is introduced to calculate the weight of each link attribute for the quantification of the link utility. Finally, based on the topology model, the inter-satellite link utility-based dynamic routing algorithm is proposed to improve the adaptability of satellite routing. The simulation results demonstrate that the proposed routing algorithm outperforms the existing routing algorithms in terms of packet drop rate, end-to-end delay and throughput.
- 22 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (3) , 2915-2928
On-Demand Dynamic Controller Placement in Software Defined Satellite-Terrestrial Networking
Software defined satellite-terrestrial networking has been identified as a promising approach to support the diversity of network services. As the fundamental issue to improve the flexibility of network management, the controller placement problem has been attracted increasing attentions for the integration of satellite and terrestrial networking. However, the impact of the dynamic coverage demands on the controller placement have not been well investigated in existed works, which makes them fail to adjust the coverage dynamically according to the actual demands, and leads to an obvious increase of networking response latency to the terminals. Aiming to address this issue, we propose a novel on-demand dynamic controller placement scheme, which can optimize the placement of controllers to improve networking response latency while meeting the dynamic coverage demands. Firstly, to optimize the number of controllers and meet the dynamic coverage demands, we define the coverage redundancy and propose the redundancy-based satellite subnet division method to establish the reliable satellite subnets. Secondly, we quantify the networking response latency of the distributed satellite subnet, and build an optimization mathematical model to optimize the number and location of controllers. Then, we formulate the controller placement problem into the capacitated facility location problem and build the mathematical model for it. Moreover, the on-demand dynamic approximation algorithm is proposed to obtain the approximation solution. Finally, the simulation results demonstrate that the proposed algorithm can effectively optimize the network latency compared with related algorithms.
- 22 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 18 (3) , 2915-2928
On-Demand Dynamic Controller Placement in Software Defined Satellite-Terrestrial Networking
Software defined satellite-terrestrial networking has been identified as a promising approach to support the diversity of network services. As the fundamental issue to improve the flexibility of network management, the controller placement problem has been attracted increasing attentions for the integration of satellite and terrestrial networking. However, the impact of the dynamic coverage demands on the controller placement have not been well investigated in existed works, which makes them fail to adjust the coverage dynamically according to the actual demands, and leads to an obvious increase of networking response latency to the terminals. Aiming to address this issue, we propose a novel on-demand dynamic controller placement scheme, which can optimize the placement of controllers to improve networking response latency while meeting the dynamic coverage demands. Firstly, to optimize the number of controllers and meet the dynamic coverage demands, we define the coverage redundancy and propose the redundancy-based satellite subnet division method to establish the reliable satellite subnets. Secondly, we quantify the networking response latency of the distributed satellite subnet, and build an optimization mathematical model to optimize the number and location of controllers. Then, we formulate the controller placement problem into the capacitated facility location problem and build the mathematical model for it. Moreover, the on-demand dynamic approximation algorithm is proposed to obtain the approximation solution. Finally, the simulation results demonstrate that the proposed algorithm can effectively optimize the network latency compared with related algorithms.
- 20 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (10) , 11771-11785
Link Reliability-Based Adaptive Routing for Multilevel Vehicular Networks
In multilevel vehicular ad-hoc network (VANET) scenario, dynamic vehicles, complex node distribution and poor wireless channel environment deteriorate the reliability of routing protocols. However, for the key issues of relay selection, existing algorithms analyze the wireless link performance without considering the influence of dynamics and shadow fading on location from GPS, as well as channel condition and buffer queue, which would lead to inaccurate link characterization and maladaptive to network variation. In this paper, we establish a dynamic link reliability model to portray the link complexity of multilevel VANET scenario, and propose a link reliability-based adaptive routing algorithm (LRAR) to improve the transmission efficiency. Firstly, we propose a Kalman filter-based estimation approach to amend GPS original data for precise location of vehicles. Then, we define link reliability to quantify the wireless link performance, and establish a multilevel dynamic link model (MDLM) to evaluate it. Moreover, to accurately describe the complexity of wireless links, we integrate the corrected GPS data and characteristics of multilevel VANET including vehicle dynamics, distribution hierarchy and shadow fading into the modeling of link reliability. Considering the difference of link state among diverse vehicles, a maximum deviation algorithm is introduced to adaptively calculate the weight of each parameter in the modeling. Finally, we formulate the routing decision as a multi-attribute decision problem, and select the link with highest reliability as transmission path. Simulation results demonstrate that LRAR outperforms the existing routing algorithms in terms of average end-to-end delay and packet delivery ratio.
- 20 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (10) , 11771-11785
Link Reliability-Based Adaptive Routing for Multilevel Vehicular Networks
In multilevel vehicular ad-hoc network (VANET) scenario, dynamic vehicles, complex node distribution and poor wireless channel environment deteriorate the reliability of routing protocols. However, for the key issues of relay selection, existing algorithms analyze the wireless link performance without considering the influence of dynamics and shadow fading on location from GPS, as well as channel condition and buffer queue, which would lead to inaccurate link characterization and maladaptive to network variation. In this paper, we establish a dynamic link reliability model to portray the link complexity of multilevel VANET scenario, and propose a link reliability-based adaptive routing algorithm (LRAR) to improve the transmission efficiency. Firstly, we propose a Kalman filter-based estimation approach to amend GPS original data for precise location of vehicles. Then, we define link reliability to quantify the wireless link performance, and establish a multilevel dynamic link model (MDLM) to evaluate it. Moreover, to accurately describe the complexity of wireless links, we integrate the corrected GPS data and characteristics of multilevel VANET including vehicle dynamics, distribution hierarchy and shadow fading into the modeling of link reliability. Considering the difference of link state among diverse vehicles, a maximum deviation algorithm is introduced to adaptively calculate the weight of each parameter in the modeling. Finally, we formulate the routing decision as a multi-attribute decision problem, and select the link with highest reliability as transmission path. Simulation results demonstrate that LRAR outperforms the existing routing algorithms in terms of average end-to-end delay and packet delivery ratio.
- 1 August 2020
- Published by Wiley in SID Symposium Digest of Technical Papers
- Vol. 51 (1) , 1258-1260
83‐4: Techniques to Achieve an AMOLED Display with Ultra‐narrow Border
To achieve mobile phone with ultra‐narrow border, different design methods are proposed. By decreasing fanout line width and place clock signal lines under frit, an ultra‐narrow border full screen is obtained. Additionally, we verified that the line width of fanout with 2um has the feasibility of mass production and the luminance uniformity can be improved by 5%. What's more, the proportion of bright spots caused by anode residue is reduced to 0. At last, the best matching conditions are obtained to achieve ultra‐narrow border full screen mobile phone.
- 1 August 2020
- Published by Wiley in SID Symposium Digest of Technical Papers
- Vol. 51 (1) , 1258-1260
83‐4: Techniques to Achieve an AMOLED Display with Ultra‐narrow Border
To achieve mobile phone with ultra‐narrow border, different design methods are proposed. By decreasing fanout line width and place clock signal lines under frit, an ultra‐narrow border full screen is obtained. Additionally, we verified that the line width of fanout with 2um has the feasibility of mass production and the luminance uniformity can be improved by 5%. What's more, the proportion of bright spots caused by anode residue is reduced to 0. At last, the best matching conditions are obtained to achieve ultra‐narrow border full screen mobile phone.