YLYuanhao Liu

Yuanhao 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

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


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


Latest Publications

  • Fairness Enhancement in Grant-Free Random Access With Power Control for Cell-Free Massive MIMO

    by Yuxuan He, Yiru Zhang, Yuanhao Liu, Li Zhen, Xiaodai Dong, Keping Yu, Derrick Wing Kwan Ng

  • A Novel Initialization Method for Hybrid Underwater Optical Acoustic Networks

    by Yuanhao Liu, Fen Zhou, Tao Shang

    To satisfy the high data rate requirement and reliable transmission demands in underwater scenarios, it is desirable to construct an efficient hybrid underwater optical acoustic network (UWOAN) architecture by considering the key features and critical needs of underwater terminals. In UWOANs, optical uplinks and acoustic downlinks are configured between underwater nodes (UWNs) and the base station (BS), where the optical beam transmits the high data rate traffic to the BS, while the acoustic waves carry the control information to realize the network management. In this paper, we focus on solving the network initializing problem in UWOANs, which is a challenging task due to the lack of GPS service and limited device payload in underwater environments. The difficulty lies in the contradiction that the UWNs without acoustic equipment need to access the BS to get their position information, which is however required for the link establishment between them. This work aims to fill this gap. To this end, we explain and discuss the conundrums of how to initialize such a UWOAN. Then, we leverage acoustic waves to locate UWNs and propose a novel network initialization method, which consists of UWN identification, discovery, localization, as well as decomposition. Numerical simulations are also conducted to verify the proposed initialization method.


  • Cost-Oriented and Delay-Constrained Anycasting for Service Function Chain Provisioning Leveraging Cloud–Edge Collaboration in Space–Air–Ground Integrated Networks

    by Yuanhao Liu, Yuxuan He, Yongjun Li, Xiang Wang, Kai Zhang, Min Ju, Zhiqiang Ma, Qin Tian

    Network function virtualization (NFV) offers a flexible and effective means to utilize heterogeneous resources for space-air–ground integrated networks (SAGINs), enabling seamless connectivity for data transmission over large spans. Converging the cloud and edge computing capabilities, SAGINs have the potential to further provision service function chains (SFCs) with various Internet applications. This is driving the need for efficient schemes of the cloud- or edge-based services in SAGINs. In this article, we propose a novel SAGIN architecture based on the cloud-serving and edge-processing collaboration. The cloud-based services are provisioned by the selected ground data centers (DCs), in which the traffic is processed by the virtual network function (VNF) hosted in the edge nodes and DCs. In such an architecture, the edge nodes enable flexible SFC provisioning solutions while DCs offer a variety of cloud-oriented network services. In addition, we apply anycast to further improve the agility of SFC provisioning. From these perspectives, we investigate the cloud-serving and edge-processing SFC provisioning problem leveraging anycast, concerning DC assignment, edge and VNF placement, SFC mapping, and delay constraints simultaneously. The joint problem is formulated by a mixed integer linear program (MILP) model to jointly minimize the communication and computation costs subject to their tradeoff. A decomposition approach is further developed for the sake of scalability. Results from numerical simulations show that the proposed approach can reduce overall costs by up to 32.99%.


  • Earth Observation Satellite Downlink Scheduling With Satellite-Ground Optical Communication Links

    by Hai Li, Yongjun Li, Yuanhao Liu, Boyu Deng, Yu Li, Xin Li, Shanghong Zhao

    Consistent growth in the number of high-resolution earth observation satellites (EOSs) poses a significant challenge to the downlink scheduling problem for observation data. Satellite-to-ground optical communication is considered promising for downloading massive observation data due to its large communication capacity. To improve the downlink transmission capacity of the EOS observation system, this paper focuses on the EOS downlink scheduling problem with satellite-ground optical communication links (EDSPO). Firstly, we establish a mathematical model considering many practical constraints for EDSPO to maximize the profit of downloaded observation data. To tackle this complex scheduling problem, a downlink scheduling algorithm combining with the adaptive large neighborhood search algorithm and the tabu search algorithm (ALNS_TS) is then proposed. In ALNS_TS, a heuristic solution initialization is developed, five removal operators and five repair operators are designed based on the heuristic characteristics of EDSPO, and a task insert algorithm is proposed for repair operators. Moreover, ALNS_TS introduces the tabu value for each downlink transmission task to avoid repeated searches in the neighborhood of the same solution. Finally, extensive experiments are carried out to verify the effectiveness of the ALNS_TS and the superiority of the satellite-ground optical communication link. Simulation results show that the ALNS_TS performs better in profits and the number of completed tasks compared to the existing downlink scheduling algorithms. Besides, the satellite-ground optical communication link has been proven effective in improving the downlink transmission capacity of the EOS observation system.


  • Disaster Protection for Service Function Chain Provisioning in EO-DCNs

    by Yuanhao Liu, Fen Zhou, Tao Shang, Juan-Manuel Torres-Moreno

    Network function virtualization (NFV) in Elastic Optical Inter-DataCenter Networks (EO-DCNs) enables a flexible, adaptive, effective, and economic network services deployment and upgrade. However, it is facing critical threats from large-scale network failures due to natural disasters. This is driving the need for efficient network protection schemes of service function chain (SFC) provisioning. In this paper, we investigate the disaster-resilient SFC provisioning problem leveraging power-efficient path protection with distance-adaptive modulation format (MF) assignment, concerning virtual network function (VNF) placement, SFC mapping, path protection, constrained recovery delay, and spectrum allocation simultaneously. An integer linear program (ILP) model is formulated to jointly minimize power consumption and spectrum usage, subject to disaster resilience. A heuristic algorithm is further developed for the sake of scalability. Numerical simulation results demonstrate that the proposed disaster protection schemes enable saving up to 32.05% power consumption.


  • Disaster Protection in Inter-DataCenter Networks Leveraging Cooperative Storage

    by Yuanhao Liu, Fen Zhou, Cao Chen, Zuqing Zhu, Tao Shang, Juan-Manuel Torres-Moreno

    Natural disasters have challenged the survivability of Elastic Optical Inter-DataCenter Networks (EO-DCNs), and it is urgent to establish efficient disaster protection schemes. In this paper, we investigate the disaster-resilient service provisioning problem leveraging cooperative storage system (CSS). Instead of mirrored content backup on a single DC, our proposed CSS partitions a required content into no less than three fragments if possible, each of which is then stored on a DC located in different disaster zones. Accordingly, multi-path routing with the adaptive number of working paths to distinct DCs is employed to serve each request, while a protection path is computed to protect against a disaster failure. Our main objective is to jointly minimize the spectrum usage and maximal occupied frequency slot index (MOFI) subject to disaster resilience. Besides, we also expect to cut the content storage space. To this end, we propose for the first time a CSS-based dedicated end-to-content path protection (CDP), which allows service provisioning through multiple paths with the adaptive number of paths rather than a single path. This consequently reduces at least half of the reserved spectrum on the protection path. To find the optimal CDP strategy, we formulate the studied problem as an integer linear program (ILP) and then propose a fast heuristic algorithm. Observing the trade-off between the spectrum usage and content storage space, we further design a maximum-CDP (M-CDP), which generates the maximum number of working paths to reduce the content storage space. Simulations are conducted to compare the proposed schemes with the traditional protection strategy using mirrored storage and single-path routing. Numerical results demonstrate that the proposed CSS-based protection schemes enable to cut up to 21.6% of the spectrum usage and 15% of the content storage space.