Fukang Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Fukang Zhao has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
Ying Liu
3 shared publicationsXu Li
2 shared publications- Xu Li
Beijing Jiaotong University
2 shared publications Yanan Liang
2 shared publications- Yanan Liang
Beijing Jiaotong University
2 shared publications - Chuang Song
National Key Laboratory of Complex System Control and Intelligent Agent Cooperation, Beijing 100074, China
1 shared publication
Latest Publications
- 12 February 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 185
Bayesian optimization-enhanced cross-layer design algorithm for efficient neighbor discovery in FANETs
- 12 February 2026
- Published by Elsevier in Ad Hoc Networks
- Vol. 185
Bayesian optimization-enhanced cross-layer design algorithm for efficient neighbor discovery in FANETs
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30, 3189-3193
Time-Diversity-Based Omnidirectional Precoding for Single-RF-Chain Phased Array Antennas
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30, 3189-3193
Time-Diversity-Based Omnidirectional Precoding for Single-RF-Chain Phased Array Antennas
- Open Access
Rate-Splitting-Based Resource Allocation in FANETs: Joint Optimization of Beam Direction, Node Pairing, Power and Time Slot
Directional flying ad hoc networks (FANETs) equipped with phased array antennas are pivotal for applications demanding high-capacity, low-latency communications. While directional beamforming extends the communication range, it necessitates the intricate joint optimization of the beam direction, power, and time-slot scheduling under hardware constraints. Existing resource allocation schemes predominantly follow two paradigms: (i) conventional physical-layer multiple access (CPMA) approaches, which enforce strict orthogonality within each beam and thus limit spatial efficiency; and (ii) advanced physical-layer techniques like rate-splitting multiple access (RSMA), which have been applied to terrestrial and omnidirectional UAV networks but not systematically integrated with the beam-based scheduling constraints of directional FANETs. Consequently, jointly optimizing the beam direction, intra-beam rate-splitting-based node pairing, transmit power, and time-slot scheduling remains largely unexplored. To bridge this gap, this paper introduces an intra-beam rate-splitting-based resource allocation (IBRSRA) framework for directional FANETs. This paper formulates an optimization problem that jointly designs the beam direction, constrained rate-splitting (CRS)-based node pairing, power control, modulation and coding scheme (MCS) selection, and time-slot scheduling, aiming to minimize the total number of time slots required for data transmission. The resulting mixed-integer nonlinear programming (MINLP) problem is solved via a computationally efficient two-stage algorithm, combining greedy scheduling with successive convex approximation (SCA) for non-convex optimization. Simulation results demonstrate that the proposed IBRSRA algorithm substantially enhances spectral efficiency and reduces latency. Specifically, for a network with 16 nodes, IBRSRA reduces the required number of transmission time slots by more than 42% compared to the best-performing baseline scheme. This confirms the significant practical benefit of integrating CRS into the resource allocation design of directional FANETs.
Open AccessRate-Splitting-Based Resource Allocation in FANETs: Joint Optimization of Beam Direction, Node Pairing, Power and Time Slot
Directional flying ad hoc networks (FANETs) equipped with phased array antennas are pivotal for applications demanding high-capacity, low-latency communications. While directional beamforming extends the communication range, it necessitates the intricate joint optimization of the beam direction, power, and time-slot scheduling under hardware constraints. Existing resource allocation schemes predominantly follow two paradigms: (i) conventional physical-layer multiple access (CPMA) approaches, which enforce strict orthogonality within each beam and thus limit spatial efficiency; and (ii) advanced physical-layer techniques like rate-splitting multiple access (RSMA), which have been applied to terrestrial and omnidirectional UAV networks but not systematically integrated with the beam-based scheduling constraints of directional FANETs. Consequently, jointly optimizing the beam direction, intra-beam rate-splitting-based node pairing, transmit power, and time-slot scheduling remains largely unexplored. To bridge this gap, this paper introduces an intra-beam rate-splitting-based resource allocation (IBRSRA) framework for directional FANETs. This paper formulates an optimization problem that jointly designs the beam direction, constrained rate-splitting (CRS)-based node pairing, power control, modulation and coding scheme (MCS) selection, and time-slot scheduling, aiming to minimize the total number of time slots required for data transmission. The resulting mixed-integer nonlinear programming (MINLP) problem is solved via a computationally efficient two-stage algorithm, combining greedy scheduling with successive convex approximation (SCA) for non-convex optimization. Simulation results demonstrate that the proposed IBRSRA algorithm substantially enhances spectral efficiency and reduces latency. Specifically, for a network with 16 nodes, IBRSRA reduces the required number of transmission time slots by more than 42% compared to the best-performing baseline scheme. This confirms the significant practical benefit of integrating CRS into the resource allocation design of directional FANETs.
- Open Access
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 61 (1)
A Measurement Matrix Design Algorithm for Ad Hoc Networks Using Phased Array Antennas
In GPS‐denied ad hoc networks equipped with single‐port phased array antennas, accurate incident‐angle estimation is critical for enabling reliable directional communication. Traditional methods based on the spatial covariance matrix or compressed sensing often assume uniformly distributed incident angles, which results in an elevated expected estimation error (EEE) in realistic deployments where nodes are randomly distributed (e.g., following a Poisson point process). To address this issue, this paper introduces a probability‐based optimisation framework that designs the measurement matrix by leveraging the distribution of incident angles. The optimisation objective is to minimise the EEE of an orthogonal matching pursuit estimator, leading to a non‐convex expectation minimisation problem. This problem is solved using a Grey Wolf Optimisation‐based algorithm that determines the beam angles for the measurement matrix. Simulation results on a six‐element uniform linear array show that the proposed algorithm reduces the EEE by 13.2% compared to uniform beam design when the node deployment region has an aspect ratio of 4. These results demonstrate that the algorithm effectively exploits angular distribution characteristics to achieve significant performance improvements.
- 1 January 2025
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 61 (1)
Open AccessA Measurement Matrix Design Algorithm for Ad Hoc Networks Using Phased Array Antennas
In GPS‐denied ad hoc networks equipped with single‐port phased array antennas, accurate incident‐angle estimation is critical for enabling reliable directional communication. Traditional methods based on the spatial covariance matrix or compressed sensing often assume uniformly distributed incident angles, which results in an elevated expected estimation error (EEE) in realistic deployments where nodes are randomly distributed (e.g., following a Poisson point process). To address this issue, this paper introduces a probability‐based optimisation framework that designs the measurement matrix by leveraging the distribution of incident angles. The optimisation objective is to minimise the EEE of an orthogonal matching pursuit estimator, leading to a non‐convex expectation minimisation problem. This problem is solved using a Grey Wolf Optimisation‐based algorithm that determines the beam angles for the measurement matrix. Simulation results on a six‐element uniform linear array show that the proposed algorithm reduces the EEE by 13.2% compared to uniform beam design when the node deployment region has an aspect ratio of 4. These results demonstrate that the algorithm effectively exploits angular distribution characteristics to achieve significant performance improvements.