YLYu Li

Yu Li

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


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


Latest Publications

  • Open Access

    Age-Aware Scheduling for Federated Learning with Caching in Wireless Computing Power Networks

    by Xiaochong Zhuang, Chuanbai Luo, Zhenghao Xie, Yu Li, Li Jiang

    With the rapid development of Wireless Computing Power Networks (WCPNs), the urgent need for data privacy protection and communication efficiency has led to the emergence of the federated learning (FL) framework. However, the time delay leads to dragging problems and reduces the convergence performance of FL in the training process. In this article, we propose an FL resource scheduling strategy based on information age perception in WCPNs, which can effectively reduce the time delay and enhance the convergence performance of FL. Moreover, a data cache buffer and a model cache buffer are set up at the user end and the central server, respectively. Next, we formulate the parametric age-aware problem to simultaneously minimize the global parameter age, energy consumption, and FL service delays. Considering the dynamic WCPN environment, the optimization target is modeled as a Markov decision process (MDP), and the Proximal Policy Optimization (PPO) algorithm is used to achieve the optimal solution. Numerical simulation results demonstrate that the proposed method significantly outperforms baseline schemes across critical metrics. Specifically, the proposed approach reduces FL service delays by 25.2%. It also decreases the global parameter age by 45.5% through the joint optimization of the data collection frequency, computation frequency, and bandwidth allocation. The method attains a reward value of 65 at convergence, 18.2% higher than the WithoutAnyCache scheme and 8.3% higher than the OnlyLocalCache scheme. FL accuracy improves to 98.2% with a 0.08 final loss. Finally, numerical simulation results further confirm the superiority and outstanding performance of the proposed method.


  • Open Access

    Age-Aware Scheduling for Federated Learning with Caching in Wireless Computing Power Networks

    by Xiaochong Zhuang, Chuanbai Luo, Zhenghao Xie, Yu Li, Li Jiang

    With the rapid development of the Wireless Computing Power Network (WCPN), the urgent need for data privacy protection and communication efficiency led to the emergence of the Federated learning (FL) framework. However, the time delay leads to dragging problems and reduces the convergence performance of FL in the training process. In this article, we propose a FL resource scheduling strategy based on information age perception in WCPN, which can effectively reduce the time delay and enhance the convergence performance of FL. Moreover, a data cache buffer and a model cache buffer are set up at the user and the central server respectively. Next, we formulate the parametric age-aware problem to minimize the age of global parameter, energy consumption and FL service latency simultaneously. Taking account of the dynamic WCPN environment, the optimization target is modeled as a Markov decision process (MDP), and Proximal Policy Optimization (PPO) algorithm is used to achieve the optimal solution. Finally, a large number of numerical simulation results prove the superiority and outstanding performance of the proposed method.


  • Adaptive Resource Allocation Considering Power-Consumption Outage: A Deep Reinforcement Learning Approach

    by Jia Luo, Qianbin Chen, Lun Tang, Zhicai Zhang, Yu Li

    A major feature of mobile devices in the future wireless network is the high data rate. However, the newly proposed power-consumption outage indicates that the heat generated by high data rate devices has an influence on the performance. This correspondence investigates a novel resource allocation scheme considering power-consumption outage. Specifically, based on the analysis of the heat transfer model in the smartphone, we formulate the problem to jointly allocate the downlink power and bandwidth while considering the impact of power-consumption outage. According to the dynamic feature of the problem, the Markov decision process (MDP) is utilized to model it. Furthermore, dut to the continuity of action space, the problem is handled by normalized advantage function (NAF), a deep reinforcement learning (DRL) algorithm. The effectiveness of the proposed scheme is corroborated in the simulation results on the basis of which its applicability for services with different features is further discussed.


  • Cloud–Edge Collaborative Resource Allocation for Blockchain-Enabled Internet of Things: A Collective Reinforcement Learning Approach

    by Meng Li, Pan Pei, F. Richard Yu, Pengbo Si, Yu Li, Enchang Sun, Yanhua Zhang

    Driven by numerous emerging mobile devices and various Quality-of-Service (QoS) requirements, mobile-edge computing (MEC) has been recognized as a prospective paradigm to promote the computation capability of mobile devices, as well as reduce energy overhead and service latency of applications for the Internet of Things (IoT). However, there are still some open issues in the existing research works: 1) limited network and computing resource; 2) simple or nonintelligent resource management; and 3) ignored security and reliability. In order to cope with these issues, in this article, 6G and blockchain technology are considered to improve network performance and ensure the authenticity of data sharing for the MEC-enabled IoT. Meanwhile, a novel intelligent optimization method named as collective reinforcement learning (CRL) is proposed and introduced, to realize intelligent resource allocation, meet distributed training results sharing, and avoid excessive consumption of system resources. Based on the designed network model, a cloud–edge collaborative resource allocation framework is formulated. By joint optimizing the offloading decision, block interval, and transmission power, it aims to minimize the consumption overheads of system energy and latency. Then, the formulated problem is designed as a Markov decision process, and the optimal strategy can be obtained by the CRL. Some evaluation results reveal that the system performance based on the proposed scheme outperforms other existing schemes obviously.


  • Satisfied Matching-Embedded Social Internet of Things for Content Preference-Aware Resource Allocation in D2D Underlaying Cellular Networks

    by Yu Li, Zhiwei Guo, Ting Yang, Li Jiang, Meng Li

    The explosion of intelligent mobile applications has generated an unprecedented increase in the demand for diverse social content access. Device-to-device (D2D) communication, which enables direct transmission of content, can partly support these needs by reusing cellular spectrum resources. Most existing works focus on mitigating interference in D2D communication only in physical space. However, the effect of user content preference on interference in social space is ignored. In this article, a satisfied matching-embedded Social Internet of Things (IoT) is proposed for content preference-aware resource allocation (SIoT-RA). The Social IoT architecture is explored for user social characteristic analysis scenarios to ensure credible data management. Specifically, the user’s content preference characteristics are modeled as the probability of selecting similar content in the social IoT by employing the Dirichlet process. A satisfied matching-based model is proposed and embedded into the architecture as the core algorithm to achieve content preference-aware resource allocation. This design not only helps to reduce interference from the perspective of social space but also realizes maximized and satisfactory resource allocation performance by a matching algorithm that can quantify satisfaction as perceived utility. Extensive simulation results demonstrate the significant performance gains and high cost effectiveness of the proposed core algorithm of SIoT-RA in terms of the weighted sum data rate and users matching satisfaction.


  • Deep Learning-Embedded Social Internet of Things for Ambiguity-Aware Social Recommendations

    by Zhiwei Guo, Keping Yu, Yu Li, Gautam Srivastava, Jerry Chun-Wei Lin

    With the increasing demand of users for personalized social services, social recommendation (SR) has been an important concern in academia. However, current research on SR universally faces two main challenges. On the one hand, SR lacks the considerable ability of robust online data management. On the other hand, SR fails to take the ambiguity of preference feedback into consideration. To bridge these gaps, a deep learning-embedded social Internet of Things (IoT) is proposed for ambiguity-aware SR (SIoT-SR). Specifically, a social IoT architecture is developed for social computing scenarios to guarantee reliable data management. A deep learning-based graph neural network model that can be embedded into the model is proposed as the core algorithm to perform ambiguity-aware SR. This design not only provides proper online data sensing and management but also overcomes the preference ambiguity problem in SR. To evaluate the performance of the proposed SIoT-SR, two real-world datasets are selected to establish experimental scenarios. The method is assessed using three different metrics, selecting five typical methods as benchmarks. The experimental results show that the proposed SIoT-SR performs better than the benchmark methods by at least 10% and has good robustness.


  • Open Access

    Concurrent transmission scheduling algorithm based on Stackelberg game to enhance time reuse for D2D communications in mmWave networks

    by Yu Li, Honggang Wang, Zhiwei Guo, Ting Yang, Shiju Yang

    Due to the tremendous propagation loss of millimeter wave (mmWave) communication, device‐to‐device (D2D) communications are widely used over directional mmWave networks to improve network throughput. Most of existing works are mainly focused on concurrent transmission among D2D pairs that have no mutual interference. However, considering the propagation loss and directional interference features, the D2D pairs that interfere with each other can be used to improve network throughput. In this paper, we propose a time resource sharing scheme based on Stackelberg game for D2D pairs to further enhance network throughput. The interference D2D pairs can access to the time resource through paying the price for the interference caused by them. At the same time, the non‐interference D2D pairs can be scheduled. Concurrent transmission scheduling among interference D2D pairs is formulated as a non‐cooperative game, which enables a distributed transmission power control for interference D2D pairs. Moreover, the price strategy can be adjusted by setting interference threshold such that the transmission quality can be guaranteed. Simulation results show that the proposed scheme can achieve significant performance gains compared with classical concurrent transmission in terms of network throughput and energy efficiency. In addition, the convergence and utility of the game are also verified.