Tong Liu 0023

dblp:36/5558-23 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
9since 2021 · last 2025
0000-0002-3255-234XORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 8 · 3 first-author · 8 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Intelligent Reflecting Surface and Network Slicing Assisted Vehicle Digital Twin Update
abstract
Vehicle digital twin (VDT) can support multiple different vehicle services through updating, and the updating of VDT faces two fundamental issues: one is the isolation of VDT, that is VDTs can run various services without being affected by others; the other one is the timeliness of VDT updates for low latency services. In this paper, we first propose to ensure the isolation of VDTs with the assistance of intelligent reflecting surface (IRS) and network slicing (NS), and obtain better update time of the VDTs within limited resources. Specifically, we divide resources for VDTs with different update requirements to ensure the isolation of VDTs and the resources required for update. On the other hand, considering that the communication performance between vehicles and base stations is affected by urban building density, we propose using an intelligent controller to achieve intelligent control of the physical channel by adjusting the phase shift of passive reflective elements to ensure better transmission performance during VDTs updating. Secondly, considering the dynamic variability of vehicles and the environment, we propose an improved deep reinforcement learning algorithm based on the actor-critic framework to allocate communication, computing resources, and adjust the phase shift of the IRS. Finally, a large number of simulation results indicate that our proposed algorithm performs better than the benchmark algorithms.
Li Li 0095, Lun Tang, Tong Liu 0023, Qianbin Chen
IEEE Trans. Intell. Transp. Syst.4
2024 Toward Reliability-Enhanced, Delay-Guaranteed Dynamic Network Slicing: A Multiagent DQN Approach With an Action Space Reduction Strategy
abstract
Network availability and service continuity are major concerns for network operators to provide reliable communication services for Internet of Things (IoT), which are particularly challenging to achieve in virtualized network slicing environment where network services are exposed to the failure risks of both software (virtual network function (VNF) instances) and hardware (physical nodes). In general, the redundancy-based VNF backup solutions are used to improve the reliability of virtualized network slices. However, backup VNFs require the same amount of resources as the primary VNFs, which will result in high-resource cost. In this article, we propose a joint VNF partition and hybrid backup scheme for VNF orchestration, backup and mapping, whose aim is to construct the reliability-enhanced and delay-guaranteed network slices at minimum cost. Specifically, the VNF partition method divides a single VNF into multiple thinner VNFs with lower processing capacity and is expected to enhance the reliability of network slices with less additional resources. The hybrid backup scheme includes both onsite and offsite backup forms. Then, considering the time-varying network environment and IoT service requirements, we formulate the VNF orchestration, backup and mapping as a dynamic mixed integer linear programming (DMILP) problem, and model the dynamic problem as a Markov decision process (MDP). In view of the large action space of the formulated MDP, we propose a multiagent deep reinforcement learning (DRL) approach with an action space reduction strategy to achieve the dynamic VNF orchestration, backup and mapping solution. Simulation results demonstrate that the proposed joint VNF partition and hybrid backup scheme can obtain superior delay and reliability performance with low-network cost.
Weili Wang 0001, Lun Tang, Tong Liu 0023, Xiaoqiang He, Chengchao Liang, Qianbin Chen
IEEE Internet Things J.3
2023 CGAN-Based Collaborative Intrusion Detection for UAV Networks: A Blockchain-Empowered Distributed Federated Learning Approach
abstract
Numerous resource-constrained Internet of Things (IoT) devices make the edge IoT consisting of unmanned aerial vehicles (UAVs) vulnerable to network intrusion. Therefore, it is critical to design an effective intrusion detection system (IDS). However, the differences in local data sets among UAVs show small samples and uneven distribution, further reducing the detection accuracy of network intrusion. This article proposes a conditional generative adversarial net (CGAN)-based collaborative intrusion detection algorithm with blockchain-empowered distributed federated learning to solve the above problems. This study introduces long short-term memory (LSTM) into the CGAN training to improve the effect of generative networks. Based on the feature extraction ability of LSTM networks, the generated data with CGAN are used as augmented data and applied in the detection and classification of intrusion data. Distributed federated learning with differential privacy ensures data security and privacy and allows collaborative training of CGAN models using multiple distributed data sets. Blockchain stores and shares the training models to ensure security when the global model’s aggregation and updating. The proposed method has good generalization ability, which can greatly improve the detection of intrusion data.
Xiaoqiang He, Qianbin Chen, Lun Tang, Weili Wang 0001, Tong Liu 0023
IEEE Internet Things J.5
2023 Federated Continuous Learning Based on Stacked Broad Learning System Assisted by Digital Twin Networks: An Incremental Learning Approach for Intrusion Detection in UAV Networks
abstract
The edge of the Internet of Things (IoT), which consists of unmanned aerial vehicles (UAVs), is vulnerable to network intrusion because software and wireless connections are used extensively in the IoT. Designing an efficient intrusion detection system (IDS) model is imperative. However, when creating IDS models with distributed data collected by UAVs, it is necessary to take precautions to protect the data’s security and privacy. Furthermore, most of the IDS models are focused on one-time learning but not on continuous learning. To this end, we propose a federated continuous learning framework with a stacked broad learning system (FCL-SBLS) based on the digital twin network (DTN), which can learn and train the IDS model on new data quickly and continuously. In order to improve the efficiency and quality of the IDS model when training and aggregation, we employ an asynchronous federated learning (FL) architecture, and a deep deterministic policy gradient (DDPG)-based UAV selection scheme assisted by DTN is proposed to help the global IDS model aggregation. The presented algorithm is validated using the CIC-IDS2017 data set, and the simulation results reveal that our algorithm achieves higher efficiency and accuracy than the existing FL scheme.
Xiaoqiang He, Qianbin Chen, Lun Tang, Weili Wang 0001, Tong Liu 0023, Li Li 0095, Qinghai Liu, Jia Luo 0003
IEEE Internet Things J.5
2022 Digital-Twin-Assisted Task Offloading Based on Edge Collaboration in the Digital Twin Edge Network
abstract
Emerging digital twin (DT) and mobile-edge computing (MEC) are crucial for enabling the rapid development of 6G. However, the existing works ignore the edge collaboration, which can provide the system with additional performance gain. In this article, we study the problem of mobile users (MUs) intelligently offloading tasks to cooperative mobile-edge servers (MESs) with the assistance of DT. Specifically, a DT-assisted task offloading scheme (DTTOS) that consists of the selection of MESs and intelligent task offloading is proposed. Channel state information (CSI) and blockchain are employed to implement the selection of MESs. Then, we present a solution to enable MU’s task offloading that is modeled as a Markov decision process (MDP) in an intelligent way. After this, a mathematical optimization model aiming at decreasing power and time overhead is formulated. In view of the complexity, it is decomposed into two suboptimization models and solved by the decision tree algorithm (DTA) and double deep-$Q$-learning (DDQN), respectively. Simulations are conducted to prove the superiority of the proposed scheme in terms of data security assurance and network performance improvement.
Tong Liu 0023, Lun Tang, Weili Wang 0001, Qianbin Chen, Xiaoping Zeng
IEEE Internet Things J.1
2022 Resource Allocation in DT-Assisted Internet of Vehicles via Edge Intelligent Cooperation
abstract
Applications in the Internet of Vehicles (IoV) are usually accompanied by ultralow network response latency requirement. A promising approach to meet this demand is combining the IoV with mobile edge computing and enabling edge devices to share their communication, computation, and caching (3C) resources via edge intelligent cooperation. However, the allocation of 3C resources supported by artificial intelligence (AI) demands a huge number of training data and strong computing ability which is impossible to achieve on resource-limited on board unit (OBU) or road side unit (RSU). In this article, we propose a digital twin (DT) supported edge intelligent cooperation scheme, which empowers the optimal 3C resource allocation and edge intelligent cooperation possible. We focus on the response delay minimization in order to meet the requirement of latency-sensitive applications in the IoV. Specifically, mathematical expressions of the network response time are formulated according to modeling the workflow of the edge server as an M/M/1/N/FCFS queuing process. Especially, we conduct a detailed analysis of the deviations in 3C resource between the physical world and the DT space, based on which we further discuss the impact of these deviations in offloading decision. Furthermore, a mathematical optimization model aiming at minimizing the latency is formulated. In view of its complexity, we apply a deep deterministic policy gradient algorithm to solve it by modeling the cooperation process between edge nodes as a Markov decision process. Finally, we carry out simulations to demonstrate that our algorithm outperforms the existing schemes in terms of network response latency.
Tong Liu 0023, Lun Tang, Weili Wang 0001, Xiaoqiang He, Qianbin Chen, Xiaoping Zeng, Haitao Jiang 0006
IEEE Internet Things J.1
2021 Resource Allocation via Edge Cooperation in Digital Twin Assisted Internet of Vehicle
abstract
In this paper, we propose a Digital Twin (DT) Supported Resource Allocation Scheme (DTS-RAS), which empowers the intelligent edge cooperation in the Internet of Vehicles (IoV) environment possible. We focus on the latency minimization under the DT-IoV framework. Specifically, we formulate the mathematical expression for the response time of vehicle offloading tasks to cooperative edge nodes according to modeling the edge server as a M/M/1/N queen. Then, we construct the optimization model aiming at reducing the response time. In view of the complexity, we apply a Double Deep Q-learning Network (DDQN) to training the edge server to get an optimal allocation action by modeling the cooperation process as an MDP. Simulation results demonstrate that our proposed scheme outperforms the existing schemes in terms of execution latency.
Tong Liu 0023, Lun Tang, Weili Wang 0001, Xiaoqiang He, Qianbin Chen
GLOBECOM1
2021 A Distributed Online Learning Approach to Detect Anomalies for Virtualized Network Slicing
abstract
As the network slicing is one of the critical enablers in communication networks, one anomalous physical node (PN) in substrate networks that carries multiple virtual network elements can cause significant performance degradation of multiple network slices. To recover the substrate networks from anomaly within a short time, rapid and accurate identification of whether or not the anomaly exists in PNs is vital. Online anomaly detection methods that can analyze system data in real-time are preferred. Besides, as virtual nodes mapped to PNs are scattered in multiple slices, the distributed detection modes are required to preserve the data privacy of different slices. According to those requirements, we propose a distributed online PN anomaly detection algorithm based on a decentralized one-class support vector machine (OCSVM), which is realized through analyzing real-time measurements of virtual nodes mapped to PNs in a distributed manner. Specifically, to decouple the OCSVM objective function, we transform the original problem to a group of decentralized quadratic programming problems by introducing the consensus constraints. The alternating direction method of multipliers is adopted to achieve the solution for the distributed online PN anomaly detection. The simulation results on the real-world network dataset show the effectiveness and superiority of the proposed distributed online anomaly detection algorithm.
Weili Wang 0001, Qianbin Chen, Tong Liu 0023, Xiaoqiang He, Lun Tang
GLOBECOM3
2021 Digital-Twin assisted Root Cause Analysis of Anomalies in NFV Environment
abstract
Network Function Virtualization (NFV) enables the employment of novel service types with lower deployment cost and faster time-to-value, but it introduces new fault management problems and challenges. Anomalies of virtual machines (VMs) can be caused by faulty components of their located physical servers or anomaly propagation from other ones. If the data patterns of VMs are detected as anomalous, we need to locate the root causes precisely to recover the networks as soon as possible. In this paper, we first introduce digital twin to capture the real-time anomaly-fault dependency matrix for the networks. Assisted by the dependency matrix, a dynamic set-covering (DSC) problem is formulated and modeled with a set of parallel hidden Markov models to find a minimal set of faulty components at each observation epoch, which can cover all anomalous VMs. We introduce alternating direction method of multipliers to decompose the DSC problem into a set of independent sub-problems and solve it in a distributed fashion. Simulation results show the availability and superiority of the proposed digital-twin assisted root cause analysis algorithm for NFV environment.
Weili Wang 0001, Qianbin Chen, Tong Liu 0023, Lun Tang
ICC3