Li Yang
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
Research Subjects
Li Yang has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Dongxiao Yu
Shandong University
4 shared publications - Yifei Zou
Shandong University
3 shared publications - Jia Yu
College of Computer Science and Technology, Qingdao University, Qingdao, China
2 shared publications - Jiguo Yu
University of Electronic Science and Technology of China
2 shared publications Peng Wang
Institute of Intelligent Computing, School of Computer Science and Technology, Shandong University, Qingdao, China
2 shared publications- Xiuzhen Cheng
Shandong University
2 shared publications
Latest Publications
- 10 October 2026
- Published by Elsevier in Computer Networks
- Vol. 290
FGIoTDI: Fine-grained IoT device identification from single-packet traffic
- 10 October 2026
- Published by Elsevier in Computer Networks
- Vol. 290
FGIoTDI: Fine-grained IoT device identification from single-packet traffic
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 5756-5771
Secure Link Scheduling for UAV Swarms: From Perspective of Covert Communication
The link scheduling is to determine which links should be scheduled at what times, each of which is a (sender, receiver) communication pair used to realize wireless transmission of a message. It is an appealing solution to fulfill the resource-constrained and latency requirements of unmanned aerial vehicle (UAV) swarms. However, most existing link scheduling algorithms primarily focus on the throughput or latency in wireless communication, neglecting the protection against the eavesdropping attack due to the openness of UAV swarms, thereby leading to unsafe message dissemination. To address this issue, we consider integrating the covert communication into the link scheduling by concealing the very existence of message transmission. We first present a successive interference cancellation-based link diversity partition (SIC-LDP) algorithm in the context of the physical interference model, to maximize the number of concurrently transmitting links in a single time round, also called the maximum link scheduling (MLS) issue. Then, using a friendly jammer, we further propose a covertness-aware SIC-LDP algorithm (named SIC-CLDP) to resolve the MLS, as well as to defend against the eavesdropping attack. Both SIC-LDP and SIC-CLDP algorithms are proven to have constant approximation ratios. Next, implementing SIC-LDP and SIC-CLDP repeatedly can minimize the number of time rounds scheduling n participating links, termed the shortest link scheduling (SLS) issue, with an approximation ratio of O(ln n). Lastly, theoretical proofs and simulation results demonstrate the correctness, covertness, and efficiency of our proposed algorithms under the eavesdropping attack.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 5756-5771
Secure Link Scheduling for UAV Swarms: From Perspective of Covert Communication
The link scheduling is to determine which links should be scheduled at what times, each of which is a (sender, receiver) communication pair used to realize wireless transmission of a message. It is an appealing solution to fulfill the resource-constrained and latency requirements of unmanned aerial vehicle (UAV) swarms. However, most existing link scheduling algorithms primarily focus on the throughput or latency in wireless communication, neglecting the protection against the eavesdropping attack due to the openness of UAV swarms, thereby leading to unsafe message dissemination. To address this issue, we consider integrating the covert communication into the link scheduling by concealing the very existence of message transmission. We first present a successive interference cancellation-based link diversity partition (SIC-LDP) algorithm in the context of the physical interference model, to maximize the number of concurrently transmitting links in a single time round, also called the maximum link scheduling (MLS) issue. Then, using a friendly jammer, we further propose a covertness-aware SIC-LDP algorithm (named SIC-CLDP) to resolve the MLS, as well as to defend against the eavesdropping attack. Both SIC-LDP and SIC-CLDP algorithms are proven to have constant approximation ratios. Next, implementing SIC-LDP and SIC-CLDP repeatedly can minimize the number of time rounds scheduling n participating links, termed the shortest link scheduling (SLS) issue, with an approximation ratio of O(ln n). Lastly, theoretical proofs and simulation results demonstrate the correctness, covertness, and efficiency of our proposed algorithms under the eavesdropping attack.
- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 8583-8596
Distributed Device-to-Device Communications in Dynamic Digital Twin Edge Networks
As a combination of digital twin and edge computing, the digital twin edge networks (DITENs) have gained significant interest due to their bridging roles between physical edge networks and digital systems. The Device-to-Device (D2D) communication acts as an ongoing transmission paradigm for DITENs since it facilitates interoperability between nearby wireless entities and enhances the spectrum utilization and overall throughput via direct link. However, most existing works on the D2D communication are related to the centralized ones, and consider the mobility and interference management separately, which cannot be used for the dynamic scenarios in DITENs. In this paper, we consider the D2D communication problem in dynamic DITENs in the context of the SINR model, and propose a dynamicity-tolerant D2D communication algorithm in a distributed manner. Using an oblivious transmission strategy, our algorithm can complete the D2D communication among$n$ entities within$O(\log n)$ time steps despite the various dynamic factors, which achieves asymptotically optimal time complexity. It is asserted that the D2D communication algorithm is asymptotically optimal, given that the lower bound for successful message dissemination is$\Omega (\log n)$ . Rigorous theoretical analyses and empirical results are conducted to show the correctness and efficiency of our proposed algorithm.- 31 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 25 (6) , 8583-8596
Distributed Device-to-Device Communications in Dynamic Digital Twin Edge Networks
As a combination of digital twin and edge computing, the digital twin edge networks (DITENs) have gained significant interest due to their bridging roles between physical edge networks and digital systems. The Device-to-Device (D2D) communication acts as an ongoing transmission paradigm for DITENs since it facilitates interoperability between nearby wireless entities and enhances the spectrum utilization and overall throughput via direct link. However, most existing works on the D2D communication are related to the centralized ones, and consider the mobility and interference management separately, which cannot be used for the dynamic scenarios in DITENs. In this paper, we consider the D2D communication problem in dynamic DITENs in the context of the SINR model, and propose a dynamicity-tolerant D2D communication algorithm in a distributed manner. Using an oblivious transmission strategy, our algorithm can complete the D2D communication among$n$ entities within$O(\log n)$ time steps despite the various dynamic factors, which achieves asymptotically optimal time complexity. It is asserted that the D2D communication algorithm is asymptotically optimal, given that the lower bound for successful message dissemination is$\Omega (\log n)$ . Rigorous theoretical analyses and empirical results are conducted to show the correctness and efficiency of our proposed algorithm.- 1 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (4) , 1731-1745
Jamming-Resilient Physical-to-Virtual Communications in Digital Twin Edge Networks
As an integration of digital twin and edge computing, the digital twin edge networks (DITENs) have been proposed in recent years to fill the gap between physical edge networks and digital systems. Meanwhile, the multi-access wireless environments in edge computing make it hard to provide ultra-reliable and low-latency communications for digital twin, especially when the jamming attacks can be launched by the adversaries. This paper studies the jamming-resilient physical-to-virtual communication (PTVC) problem in DITENs despite strong cooperative jamming. Note that the previous jamming models mainly focus on the jamming behaviors from individual adversaries and are restricted by the energy budget limitation and uniform jamming assumption. In this paper, we consider a more comprehensive jamming model, in which f adversaries can cooperatively launch their jamming attacks in totally k wireless channels with unlimited power budget and non-uniform jamming signals. Then, based on the new proposed $(k,f)$ -cooperative jamming model, we show that $k\gt f$ is the necessary and also sufficient condition to solve the PTVC problem. On one hand, we prove that the PTVC problem is insoluble when $f\leq k$ ; on the other hand, two distributed algorithms are given as the solutions of the PTVC problem among n physical objectives and one sink node when $k\gt f$ , the time complexity of which are $O\left ({{\frac {n \log n}{k (\log k-\log f)}}}\right)$ and $O\left ({{\frac {n \log n}{\log k-\log f}}}\right)$ based on the communication modes with/without acknowledgement, respectively. Both of the theoretical results and empirical simulations are conducted to show the resilience of our algorithms despite such a strong cooperative jamming model.
- 1 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (4) , 1731-1745
Jamming-Resilient Physical-to-Virtual Communications in Digital Twin Edge Networks
As an integration of digital twin and edge computing, the digital twin edge networks (DITENs) have been proposed in recent years to fill the gap between physical edge networks and digital systems. Meanwhile, the multi-access wireless environments in edge computing make it hard to provide ultra-reliable and low-latency communications for digital twin, especially when the jamming attacks can be launched by the adversaries. This paper studies the jamming-resilient physical-to-virtual communication (PTVC) problem in DITENs despite strong cooperative jamming. Note that the previous jamming models mainly focus on the jamming behaviors from individual adversaries and are restricted by the energy budget limitation and uniform jamming assumption. In this paper, we consider a more comprehensive jamming model, in which f adversaries can cooperatively launch their jamming attacks in totally k wireless channels with unlimited power budget and non-uniform jamming signals. Then, based on the new proposed $(k,f)$ -cooperative jamming model, we show that $k\gt f$ is the necessary and also sufficient condition to solve the PTVC problem. On one hand, we prove that the PTVC problem is insoluble when $f\leq k$ ; on the other hand, two distributed algorithms are given as the solutions of the PTVC problem among n physical objectives and one sink node when $k\gt f$ , the time complexity of which are $O\left ({{\frac {n \log n}{k (\log k-\log f)}}}\right)$ and $O\left ({{\frac {n \log n}{\log k-\log f}}}\right)$ based on the communication modes with/without acknowledgement, respectively. Both of the theoretical results and empirical simulations are conducted to show the resilience of our algorithms despite such a strong cooperative jamming model.
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (5) , 2851-2864
A Fault-Tolerant Communication Algorithm for Age-of-Information Optimization in DITENs
As an amalgamation of digital twin and edge computing, the digital twin edge networks (DITENs) have drawn much attention from industry and academia to bridge the divide between physical edge networks and digital systems. Meanwhile, the physical hardware and open-access wireless communication environments in edge networks raise significant challenges in timely information aggregation and real-time status updates for digital twins, especially in the presence of inherent failure and hostile jamming. In this paper, we investigate the fault-tolerant Age-of-Information (AoI) optimization problem for digital twin edge networks against the severe fault phenomena in wireless communications. In contrast to previous works that focus on single fault or individual jamming behavior, we propose a comprehensive communication failure model over the f non-overlapping wireless sub-channels, where f 1 out of the f sub-channels are inherently failed and f 2 out of the f sub-channels are jammed by adversaries. Then, based on the multi-channel communication failure model, we present a distributed fault-tolerant communication algorithm to minimize the expected average peak AoI in DITENs. Using an adaptive transmission strategy, we prove that the AoI optimization issue for n end devices can be resolved within Θ( n ) time steps when f 1 + f 2 < f . Both theoretical analyses and empirical simulations are conducted to verify the fault-tolerance and efficiency of our proposed algorithm despite the communication failures.
- 25 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (5) , 2851-2864
A Fault-Tolerant Communication Algorithm for Age-of-Information Optimization in DITENs
As an amalgamation of digital twin and edge computing, the digital twin edge networks (DITENs) have drawn much attention from industry and academia to bridge the divide between physical edge networks and digital systems. Meanwhile, the physical hardware and open-access wireless communication environments in edge networks raise significant challenges in timely information aggregation and real-time status updates for digital twins, especially in the presence of inherent failure and hostile jamming. In this paper, we investigate the fault-tolerant Age-of-Information (AoI) optimization problem for digital twin edge networks against the severe fault phenomena in wireless communications. In contrast to previous works that focus on single fault or individual jamming behavior, we propose a comprehensive communication failure model over the f non-overlapping wireless sub-channels, where f 1 out of the f sub-channels are inherently failed and f 2 out of the f sub-channels are jammed by adversaries. Then, based on the multi-channel communication failure model, we present a distributed fault-tolerant communication algorithm to minimize the expected average peak AoI in DITENs. Using an adaptive transmission strategy, we prove that the AoI optimization issue for n end devices can be resolved within Θ( n ) time steps when f 1 + f 2 < f . Both theoretical analyses and empirical simulations are conducted to verify the fault-tolerance and efficiency of our proposed algorithm despite the communication failures.
- 5 September 2022
- Published by European Society of Computational Methods in Sciences and Engineering in Journal of Computational Methods in Sciences and Engineering
- Vol. 22 (5) , 1647-1662
The research on priority selection of e-commerce agent operation service providers based on Fuzzy-DEMATEL, ANP combination weighting and TOPSIS analysis
In view of the comprehensive evaluation and selection of e-commerce agent service provider, this paper discusses the construction of e-commerce agent service provider selection index system. Fuzzy-Decision-Making Trial and Evaluation Laboratory (Fuzzy-DEMATEL) is selected to analyze the logical relationship and influence relationship between the selection indexes of e-commerce representative operation service providers, and the importance and relevance Analytic Network Process (ANP) network was constructed. The combined weighting method of Fuzzy-Dematel and ANP is used to calculate the mixed weight, and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method was used to complete the comprehensive ranking and selection of alternatives. Finally, the empirical analysis of M company, a toy manufacturing enterprise in central China, choosing e-commerce agent operation service provider is carried out by using the established evaluation method, and the results show that the evaluation method is effective and feasible.
- 5 September 2022
- Published by European Society of Computational Methods in Sciences and Engineering in Journal of Computational Methods in Sciences and Engineering
- Vol. 22 (5) , 1647-1662
The research on priority selection of e-commerce agent operation service providers based on Fuzzy-DEMATEL, ANP combination weighting and TOPSIS analysis
In view of the comprehensive evaluation and selection of e-commerce agent service provider, this paper discusses the construction of e-commerce agent service provider selection index system. Fuzzy-Decision-Making Trial and Evaluation Laboratory (Fuzzy-DEMATEL) is selected to analyze the logical relationship and influence relationship between the selection indexes of e-commerce representative operation service providers, and the importance and relevance Analytic Network Process (ANP) network was constructed. The combined weighting method of Fuzzy-Dematel and ANP is used to calculate the mixed weight, and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method was used to complete the comprehensive ranking and selection of alternatives. Finally, the empirical analysis of M company, a toy manufacturing enterprise in central China, choosing e-commerce agent operation service provider is carried out by using the established evaluation method, and the results show that the evaluation method is effective and feasible.
- 14 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1059-1062
Analysis of Online Learning Behavior Characteristics and Influencing Factors Based on Link Prediction
With the continuous development of information, people’s access to information is gradually diversified and convenient, which also leads to the fast speed of knowledge update and provides unlimited possibilities for lifelong learning. In the digital learning environment, the learning resources faced by learners far exceed the digital education resources in the campus environment, and are more dazzling. However, as a new thing, online learning still has many problems and shortcomings. The most prominent problem in online learning is the poor interactivity of the learning platform, and it is difficult for learners to answer a series of questions in the learning process in time, which directly leads to a certain gap in the effect of online learning compared with face-to-face teaching. This paper analyzes various learning behavior data of learners on the online teaching platform, finds out or discovers the characteristics and implementation practice of learners’ online learning behavior based on link prediction method, and puts forward learning support service strategies and suggestions, providing data support and useful reference for teaching quality evaluation, monitoring and teaching reform.
- 14 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1059-1062
Analysis of Online Learning Behavior Characteristics and Influencing Factors Based on Link Prediction
With the continuous development of information, people’s access to information is gradually diversified and convenient, which also leads to the fast speed of knowledge update and provides unlimited possibilities for lifelong learning. In the digital learning environment, the learning resources faced by learners far exceed the digital education resources in the campus environment, and are more dazzling. However, as a new thing, online learning still has many problems and shortcomings. The most prominent problem in online learning is the poor interactivity of the learning platform, and it is difficult for learners to answer a series of questions in the learning process in time, which directly leads to a certain gap in the effect of online learning compared with face-to-face teaching. This paper analyzes various learning behavior data of learners on the online teaching platform, finds out or discovers the characteristics and implementation practice of learners’ online learning behavior based on link prediction method, and puts forward learning support service strategies and suggestions, providing data support and useful reference for teaching quality evaluation, monitoring and teaching reform.