Dairu Han
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Dairu Han has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
Wenhe Liao
5 shared publications- Haixia Peng
School of Information and Communication Engineering, Xian Jiaotong University, Xian, China
3 shared publications - Huaqing Wu
University of Calgary
3 shared publications - Xuemin Shen
University of Waterloo
3 shared publications - Wen Wu
Peng Cheng Laboratory, Shenzhen, China
2 shared publications - Yuandong Hu
School of Mechanical Engineering, Nanjing University of Science and Technology, Nanjing, China
2 shared publications
Latest Publications
- 2 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 4023-4036
How Can We Establish Trustworthiness in Satellite Networks? Certificate Issuance, Checking, Revocation, and More
Certificate management is needed for securing certificates which has been widely deployed in satellite networks to support security-related services. However, directly utilizing existing certificate management mechanisms in satellite networks would cause critical issues in terms of security, privacy, and practicality. Typically, the trustworthiness of certificate revocation checking (CRC) cannot be guaranteed in the presence of active adversaries; The certificate to be checked contains the satellite’s identity, which is sensitive in some applications but could be exposed during CRC; CRC cannot be trivially launched when the satellite is under constrained networks (e.g., it enters dead zones where direct communication with base stations fails). Worse still, compromising the secret key of a single certificate authority (CA) leads to certificate forgery. In this paper, we propose a forward-secure and privacy-preserving certificate management scheme, dubbed SNCM, for satellite networks, where a forward-secure signature algorithm is used to issue certificates. We utilize a neighboring-assisted forwarding paradigm in SNCM to support CRC in constrained networks. SNCM is secure against adversaries who invalidate CRC results or violate related sensitive information about the satellite, which is achieved by utilizing authenticated encryption with associated data (AEAD). Furthermore, SNCM utilizes a 2-layer revocation checking protocol to perform lightweight CRC, where the CA and base stations handle CRC tasks from satellites in a cooperative way, which frees the CA from heavy costs and reduces CRC delay significantly. We analyze the security of SNCM, implement an SNCM prototype, and conduct a comprehensive performance evaluation, which demonstrates its security, efficiency, and practicality.
- 2 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 4023-4036
How Can We Establish Trustworthiness in Satellite Networks? Certificate Issuance, Checking, Revocation, and More
Certificate management is needed for securing certificates which has been widely deployed in satellite networks to support security-related services. However, directly utilizing existing certificate management mechanisms in satellite networks would cause critical issues in terms of security, privacy, and practicality. Typically, the trustworthiness of certificate revocation checking (CRC) cannot be guaranteed in the presence of active adversaries; The certificate to be checked contains the satellite’s identity, which is sensitive in some applications but could be exposed during CRC; CRC cannot be trivially launched when the satellite is under constrained networks (e.g., it enters dead zones where direct communication with base stations fails). Worse still, compromising the secret key of a single certificate authority (CA) leads to certificate forgery. In this paper, we propose a forward-secure and privacy-preserving certificate management scheme, dubbed SNCM, for satellite networks, where a forward-secure signature algorithm is used to issue certificates. We utilize a neighboring-assisted forwarding paradigm in SNCM to support CRC in constrained networks. SNCM is secure against adversaries who invalidate CRC results or violate related sensitive information about the satellite, which is achieved by utilizing authenticated encryption with associated data (AEAD). Furthermore, SNCM utilizes a 2-layer revocation checking protocol to perform lightweight CRC, where the CA and base stations handle CRC tasks from satellites in a cooperative way, which frees the CA from heavy costs and reduces CRC delay significantly. We analyze the security of SNCM, implement an SNCM prototype, and conduct a comprehensive performance evaluation, which demonstrates its security, efficiency, and practicality.
- Open Access
- 23 October 2025
- Published by Elsevier in Chinese Journal of Aeronautics
- Vol. 39 (9)
A DRL-based handover strategy for ISL-enabled LEO mega-constellation networks under heterogeneous QoS demands
- 23 October 2025
- Published by Elsevier in Chinese Journal of Aeronautics
- Vol. 39 (9)
Open AccessA DRL-based handover strategy for ISL-enabled LEO mega-constellation networks under heterogeneous QoS demands
- 21 April 2024
- Published by Elsevier in Advances In Space Research
- Vol. 74 (2) , 872-889
Constraint tightening-based control for small-satellite formations using differential aerodynamic forces
- 21 April 2024
- Published by Elsevier in Advances In Space Research
- Vol. 74 (2) , 872-889
Constraint tightening-based control for small-satellite formations using differential aerodynamic forces
- Top Cited Papers
- 17 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (12) , 10131-10145
Two-Timescale Learning-Based Task Offloading for Remote IoT in Integrated Satellite–Terrestrial Networks
In this article, we propose an integrated satellite–terrestrial network (ISTN) architecture to support delay-sensitive task offloading for remote Internet of Things (IoT), in which satellite networks serve as a complement to terrestrial networks by providing additional communication resources, backhaul capacities, and seamless coverage. Under this architecture, we investigate how to jointly make offloading link selection and bandwidth allocation decisions for BSs and IoT users. Considering the differentiated decision-making time granularities, we formulate a two-timescale stochastic optimization problem to minimize the overall task offloading delay. To accommodate the two-timescale network dynamics and characterize state–action relations, we establish a hierarchical Markov decision process (H-MDP) framework with two separate agents tackling two-timescale network management decisions, and two evolved MDP-based subproblems are formulated accordingly. To efficiently solve the subproblems, we further develop a hybrid proximal policy optimization (H-PPO)-based algorithm. Specifically, a hybrid actor–critic architecture is designed to deal with the mixed discrete and continuous actions. In addition, an action mask layer and an action shaping function are designed to sample feasible task offloading decisions from the time-variant action set. Extensive simulation results have validated the superiority of the proposed ISTN architecture and the H-PPO-based algorithm, especially, in scenarios with scarce spectrum resources and heavy traffic loads.
- 17 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 10 (12) , 10131-10145
Top Cited PapersTwo-Timescale Learning-Based Task Offloading for Remote IoT in Integrated Satellite–Terrestrial Networks
In this article, we propose an integrated satellite–terrestrial network (ISTN) architecture to support delay-sensitive task offloading for remote Internet of Things (IoT), in which satellite networks serve as a complement to terrestrial networks by providing additional communication resources, backhaul capacities, and seamless coverage. Under this architecture, we investigate how to jointly make offloading link selection and bandwidth allocation decisions for BSs and IoT users. Considering the differentiated decision-making time granularities, we formulate a two-timescale stochastic optimization problem to minimize the overall task offloading delay. To accommodate the two-timescale network dynamics and characterize state–action relations, we establish a hierarchical Markov decision process (H-MDP) framework with two separate agents tackling two-timescale network management decisions, and two evolved MDP-based subproblems are formulated accordingly. To efficiently solve the subproblems, we further develop a hybrid proximal policy optimization (H-PPO)-based algorithm. Specifically, a hybrid actor–critic architecture is designed to deal with the mixed discrete and continuous actions. In addition, an action mask layer and an action shaping function are designed to sample feasible task offloading decisions from the time-variant action set. Extensive simulation results have validated the superiority of the proposed ISTN architecture and the H-PPO-based algorithm, especially, in scenarios with scarce spectrum resources and heavy traffic loads.
- 28 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (3) , 3131-3143
Joint Cache Placement and Cooperative Multicast Beamforming in Integrated Satellite-Terrestrial Networks
This paper studies joint cache placement and cooperative multicast beamforming to provide content-centric data services for mobile users in the integrated satellite-terrestrial network (ISTN). Specifically, in the ISTN, users requesting the same content are arranged into a multicast group and served by the cache-enabled base stations (BSs) and low earth orbit (LEO) satellite via cooperative beamforming. To maximize the network utility that takes network throughput and backhaul traffic into consideration, the cache placement, LEO satellite and BS clustering, and multicast beamforming are jointly designed and formulated as a two-timescale optimization problem. However, the original problem is anti-causal since the cache placement strategy and content delivery policy are coupled in different timescales. By utilizing historical information, we propose a two-step scheme to decompose the problem into a short-term content delivery subproblem and a long-term cache placement subproblem. As the former subproblem is nonconvex with mixed-integer variables and coupling constraints, we transform it into an equivalent problem and propose a penalty concave-convex procedure based algorithm to solve it. To address the latter subproblem, a centralized iterative algorithm and a distributed alternating algorithm with low complexity are developed, respectively. Simulation results validate that the proposed schemes can effectively enhance the network throughput and reduce the backhaul traffic compared with benchmark scheme.
- 28 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (3) , 3131-3143
Joint Cache Placement and Cooperative Multicast Beamforming in Integrated Satellite-Terrestrial Networks
This paper studies joint cache placement and cooperative multicast beamforming to provide content-centric data services for mobile users in the integrated satellite-terrestrial network (ISTN). Specifically, in the ISTN, users requesting the same content are arranged into a multicast group and served by the cache-enabled base stations (BSs) and low earth orbit (LEO) satellite via cooperative beamforming. To maximize the network utility that takes network throughput and backhaul traffic into consideration, the cache placement, LEO satellite and BS clustering, and multicast beamforming are jointly designed and formulated as a two-timescale optimization problem. However, the original problem is anti-causal since the cache placement strategy and content delivery policy are coupled in different timescales. By utilizing historical information, we propose a two-step scheme to decompose the problem into a short-term content delivery subproblem and a long-term cache placement subproblem. As the former subproblem is nonconvex with mixed-integer variables and coupling constraints, we transform it into an equivalent problem and propose a penalty concave-convex procedure based algorithm to solve it. To address the latter subproblem, a centralized iterative algorithm and a distributed alternating algorithm with low complexity are developed, respectively. Simulation results validate that the proposed schemes can effectively enhance the network throughput and reduce the backhaul traffic compared with benchmark scheme.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Joint Cache Placement and Content Delivery in Satellite-Terrestrial Integrated C-RANs
In this paper, we investigate the joint cache placement and content delivery in satellite-terrestrial integrated cloud radio access networks. We consider the scenario where cache-enabled access points (APs), including multiple base stations (BSs) and one low orbit earth satellite, are connected to a central processor via backhaul links and cooperatively serve users via joint beamforming. To minimize the long-term power consumption, we formulate an optimization problem to jointly optimize the cache placement, AP clustering, and multicast beamforming, while satisfying the constraints on the transmission power, quality-of-service, and caching storage. Since the formulated problem has mixed timescales, it is decoupled into two sub-problems. For the short-term delivery sub-problem, we first reformulate it as an equivalent sparse multicast beamforming problem and approximate the non-convex objective function by a concave smooth function, and then solve it with a convex-concave procedure approach. For the long-term cache placement sub-problem, we propose an alternating based method to tackle it iteratively. Simulation results validate the advantages of our proposed method and show the impacts of different cache capacities and file numbers on the long-term power consumption.
- 1 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Joint Cache Placement and Content Delivery in Satellite-Terrestrial Integrated C-RANs
In this paper, we investigate the joint cache placement and content delivery in satellite-terrestrial integrated cloud radio access networks. We consider the scenario where cache-enabled access points (APs), including multiple base stations (BSs) and one low orbit earth satellite, are connected to a central processor via backhaul links and cooperatively serve users via joint beamforming. To minimize the long-term power consumption, we formulate an optimization problem to jointly optimize the cache placement, AP clustering, and multicast beamforming, while satisfying the constraints on the transmission power, quality-of-service, and caching storage. Since the formulated problem has mixed timescales, it is decoupled into two sub-problems. For the short-term delivery sub-problem, we first reformulate it as an equivalent sparse multicast beamforming problem and approximate the non-convex objective function by a concave smooth function, and then solve it with a convex-concave procedure approach. For the long-term cache placement sub-problem, we propose an alternating based method to tackle it iteratively. Simulation results validate the advantages of our proposed method and show the impacts of different cache capacities and file numbers on the long-term power consumption.