Song Li

Dr. Song Li


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 January 2018 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SLSong Li
Song Li
Qiang NiQiang Ni
Qiang Ni
YSYanjing Sun
Yanjing Sun
Geyong  MinGeyong Min
Geyong Min
Saba Al-RubayeSaba Al-Rubaye
Saba Al-Rubaye
Cyber-physical Internet of things system (CPIoTS), as an evolution of Internet of things (IoT), plays a significant role in industrial area to support the interoperability and interaction of various machines (e.g. sensors, actuators, and controllers) by providing seamless connectivity with low bandwidth requirement. The fifth generation (5G) is a key enabling technology to revolutionize the future of industrial CPIoTS. In this paper, a communication framework based on 5G is presented to support the deployment of CPIoTS with a central controller. Based on this framework, multiple sensors and actuators can exchange information with the central controller in full-duplex mode. To accommodate the signal data in the available channel band, a resource allocation problem is formulated as a mixed integer non-convex programming problem, aiming to maximize the sum energy efficiency of CPIoTS. By introducing the transformation, we decompose the resource allocation problem into power allocation and channel allocation. Moreover, we consider an energy-efficient power allocation algorithm based on game theory and Dinkelbach's algorithm. Finally, to reduce the computational complexity, the channel allocation is modeled as a 3-dimensional matching problem, and solved by iterative Hungarian method with virtual devices (IHM-VD). A comparison is completed with well-known existing algorithms to demonstrate the performance of the proposed one. Simulation results confirm the efficiency of the proposed model, which significantly outperforms other benchmark algorithms in terms of meeting the energy efficiency and the QoS requirements.

29 August 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
BWBowen Wang
Bowen Wang
YSYanjing Sun
Yanjing Sun
SLSong Li
Song Li
QCQi Cao
Qi Cao
The Internet of Things (IoT) is expected to bring great benefits to users, operators, and manufactures in different application scenarios. Given that smart objects which can exploit their own social networks and share contents via device-to-device (D2D) communications, the combined social IoT promises to collect information as well as to provide services more efficiently. This application scenario requires lower latency and higher reliability, and then we adopt D2D-based caching to reduce the downloading latency while guaranteeing the reliable delivery. To achieve this joint optimization objective, we conceive the interdependence with the framework of hierarchical bipartite graph. In this way, this combinatorial problem can be decoupled into a content sharing problem and a resource allocation problem. To solve the first one, we propose a content sharing-oriented matching algorithm with projecting social characters onto physical links. To solve the second one, we formulate this resource allocation problem as equivalent to a many-to-one matching game with peer effect. We then design a novel distributed algorithm with rotation-swap, which can converge to a stable state with limited number of iterations. Formulating the convergence procedure as another NP-hard problem, we further design a coloring-based heuristic algorithm to find a near-optimal solution. We conduct extensive simulations to demonstrate that our proposed schemes can achieve a better trade-off between performance and complexity than other benchmarks.

27 December 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
RCRuirui Chen
Ruirui Chen
XLXinyan Li
Xinyan Li
YSYanjing Sun
Yanjing Sun
SLSong Li
Song Li
Zhi SunZhi Sun
Zhi Sun
Unmanned aerial vehicle (UAV) can act as flying base station to provide ground user (GU) with ubiquitous service in crowded or remote areas. The objective of this letter is to obtain the multi-UAV coverage scheme for maximizing the average capacity of UAV, while simultaneously ensuring that the deployed UAVs can cover all the massive or scattered GUs. We propose the dense boundary prioritized coverage (DBPC) scheme, the main idea of which is the high priority given to cover the dense boundary GU, to deploy multiple UAVs for the average UAV capacity maximization. Particularly, in DBPC scheme, the feasible region division (FRD) algorithm, which utilizes the Lagrange method, is obtained to derive the optimal placement of single UAV for maximizing the UAV capacity. Simulation results are presented to validate the superiority of proposed DBPC scheme.

21 December 2020 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
SLSong Li
Song Li
WSWeibin Sun
Weibin Sun
YSYanjing Sun
Yanjing Sun
YHYu Huo
Yu Huo
By offloading computation-intensive and latency-sensitive tasks from mobile devices to the mobile edge server, mobile edge computing (MEC) has been considered as a promising technology in 5 G and beyond to reduce task delay and energy consumption. This paper considers an optimization framework of computation offloading in a MEC system with multiple devices. We aim to minimize the energy consumption of all devices with their task delay constraints by jointly optimize the communication and computation resource allocation at both the devices and the mobile edge server. Specifically, dynamic voltage scaling (DVS) technology is considered in each device to adjust the operating frequency according to its delay constraint. The formulated problem is a non-convex problem due to a couple among multiple variables. To tackle the non-convex problem, we first decompose the original problem by optimizing the offloading ratio and transmission power iteratively. Then, we proposed a joint communication and computation optimization algorithm based on the difference of convex function algorithms (DCA) to solve the optimization problem. Finally, simulation results show that the proposed joint communication and computation scheme significantly improves the energy efficiency of the devices comparing with the local computing scheme and server computing scheme.

15 November 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZHZixuan He
Zixuan He
YSYanjing Sun
Yanjing Sun
BWBowen Wang
Bowen Wang
SLSong Li
Song Li
BZBeibei Zhang
Beibei Zhang
The computing process of tasks in Industrial Internet of Things (IIoT) environments is becoming increasingly complex due to the development of 5G and artificial intelligence. Leading devices are increasingly relying on heterogeneous platforms that integrate different types of processing units, such as CPUs, GPUs, and other resources, to meet the requirements of delay-sensitive and computing-intensive tasks. However, compared to conventional general-proposed CPU computing, CPU–GPU heterogeneous computing typically involves three processes, i.e., task preprocessing, hybrid computing, and result aggregation. These processes are associated with particular computing resources, which increases the difficulty of task offloading and computing resource allocation under task-specific resource and delay constraints. In this article, we first propose a three-stage heterogeneous computing (TSHC) model to practically describe the computing process of parallelizable tasks. Considering the heterogeneous computing resources, device queue backlogs, and collaboration of multiple edge servers, the joint task offloading and heterogeneous resource allocation (JCOHRA) problem is formulated to minimize the long-term average delay of tasks. Then, the Lyapunov optimization method is adopted to simplify the long-term queue stability constraint to a single-slot dynamic optimization problem, which is then modeled as a Markov decision process (MDP). Owing to the tight coupling between decision variables and enormous action space, we propose the multihead proximal policy optimization (MH-PPO)-based JCOHRA algorithm, which is enabled by elaborate constraint transformation and reward function design. Simulation results demonstrate that the JCOHRA scheme achieves better performance than baseline methods in minimizing the long-term average delay of tasks.

5 September 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
SLSong Li
Song Li
WSWeibin Sun
Weibin Sun
Qiang NiQiang Ni
Qiang Ni
YSYanjing Sun
Yanjing Sun
The rapid development of vehicular networks creates diverse ultra-low latency constrained and computation-intensive applications, which bring challenges to both communication and computation capabilities of the vehicles and their transmission. By offloading tasks to the edge servers or vehicles in the neighbourhood, vehicular edge computing (VEC) provides a cost-efficient solution to this problem. However, the channel state information and network structure in the vehicular network varies fast because of the inherent mobility of vehicle nodes, which brings an extra challenge to task offloading. To address this challenge, we formulate the task offloading in vehicular network as a multi-armed bandit (MAB) problem and propose a novel road side unit (RSU)-assisted learning-based partial task offloading (RALPTO) algorithm. The algorithm enables vehicle nodes to learn the delay performance of the service provider while offloading tasks. Specifically, the RSU could assist the learning process by sharing the learning information among vehicle nodes, which improves the adaptability of the algorithm to the time-varying networks. Simulation results demonstrate that the proposed algorithm achieves lower delay and better learning performance compared with the benchmark algorithms.