YLYing Liu

Ying Liu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ying Liu has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Rate-Splitting-Based Resource Allocation in FANETs: Joint Optimization of Beam Direction, Node Pairing, Power and Time Slot

    by Fukang Zhao, Chuang Song, Xu Li, Ying Liu, Yanan Liang

    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.