Gang Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gang Liu has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Jingyuan Han
China Telecom Research Institute, Shanghai, China
5 shared publications - Wei Quan
School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
5 shared publications - Mingyuan Liu
School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
4 shared publications - Nan Cheng
Xidian University
4 shared publications - Deyun Gao
National Engineering Research Center of Advanced Network Technologies, School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, China
3 shared publications - Hongke Zhang
Beijing Jiaotong University
3 shared publications
Latest Publications
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (6) , 5775-5787
Framework for Real-Time Monitoring of Packet Loss Caused by Network Congestion
Network congestion induces performance degradation and increases the uncertainty of service delivery, so it is essential to monitor it in real time. In this paper, we discuss the requirements of real-time monitoring of packet loss caused by congestion, present the problems and challenges faced by existing measurement techniques in monitoring congestion induced packet loss, and propose a comprehensive packet loss monitoring framework. The proposed framework is described in detail and its realizability is demonstrated. The proposed scheme is capable to not only determine the time and location of packet loss occurrence, make the accurate statistics of discarded packets, parse what traffic flows are contained in discarded packets and identify what traffic flows lead to microburst, but also obtain accurate packet loss ratio results with zero error. More importantly, our proposed scheme can achieve little or even no interference to network, and is applicable to any data plane without modifying the forwarding chip and packet header as existing measurement methods do. Experimental results have verified the effectiveness of our proposed scheme. Furthermore, we present three typical application scenarios to demonstrate the advantages of the proposed framework
- 9 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 22 (6) , 5775-5787
Framework for Real-Time Monitoring of Packet Loss Caused by Network Congestion
Network congestion induces performance degradation and increases the uncertainty of service delivery, so it is essential to monitor it in real time. In this paper, we discuss the requirements of real-time monitoring of packet loss caused by congestion, present the problems and challenges faced by existing measurement techniques in monitoring congestion induced packet loss, and propose a comprehensive packet loss monitoring framework. The proposed framework is described in detail and its realizability is demonstrated. The proposed scheme is capable to not only determine the time and location of packet loss occurrence, make the accurate statistics of discarded packets, parse what traffic flows are contained in discarded packets and identify what traffic flows lead to microburst, but also obtain accurate packet loss ratio results with zero error. More importantly, our proposed scheme can achieve little or even no interference to network, and is applicable to any data plane without modifying the forwarding chip and packet header as existing measurement methods do. Experimental results have verified the effectiveness of our proposed scheme. Furthermore, we present three typical application scenarios to demonstrate the advantages of the proposed framework
- 24 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (7) , 11529-11534
VoNTN: Real-Time and High-Quality Voice Services Over Narrowband Non-Terrestrial Networks
Non-Terrestrial Networks (NTNs) are crucial for guaranteeing emergency communication services. However, providing voice services over narrowband NTNs remains challenging due to their extremely limited data rate. Therefore, this article presents a novel Voice over NTN (VoNTN) mechanism that combines a parametric voice codec and an artificial intelligence (AI) reconstruction model, achieving remarkably low data rate requirements of sub-1 Kbps. The parametric voice codec operates by first compressing and encoding vocal acoustic features at an ultra-low bitrate of 450 bps. These compressed features then enable real-time streaming inference through the AI reconstruction model, which synthesizes high-quality audio waveforms. The reconstruction model has a three-layer neural network specifically engineered for resource-constrained satellite equipment, achieving low inference latency with lightweight computational load. We implement and evaluate VoNTN in our testbed using an actual narrowband satellite. Experimental results show that VoNTN can provide a low-latency and high-fidelity voice service without high-performance computing hardware.
- 24 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (7) , 11529-11534
VoNTN: Real-Time and High-Quality Voice Services Over Narrowband Non-Terrestrial Networks
Non-Terrestrial Networks (NTNs) are crucial for guaranteeing emergency communication services. However, providing voice services over narrowband NTNs remains challenging due to their extremely limited data rate. Therefore, this article presents a novel Voice over NTN (VoNTN) mechanism that combines a parametric voice codec and an artificial intelligence (AI) reconstruction model, achieving remarkably low data rate requirements of sub-1 Kbps. The parametric voice codec operates by first compressing and encoding vocal acoustic features at an ultra-low bitrate of 450 bps. These compressed features then enable real-time streaming inference through the AI reconstruction model, which synthesizes high-quality audio waveforms. The reconstruction model has a three-layer neural network specifically engineered for resource-constrained satellite equipment, achieving low inference latency with lightweight computational load. We implement and evaluate VoNTN in our testbed using an actual narrowband satellite. Experimental results show that VoNTN can provide a low-latency and high-fidelity voice service without high-performance computing hardware.
- 11 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (3) , 572-576
Model-Driven Learning for Physical Layer Authentication in Dynamic Environments
This letter investigates the physical layer authentication (PLA) in dynamic environments, where the users have different mobility velocities. The performance of PLA in this scenario suffers from the inaccurate prediction of the channel statement information (CSI) owing to the Doppler shifts and multipath fading. To overcome the difficulty, a model-driven learning algorithm is developed to predict dynamic CSI. Specifically, the Bahdanau Attention Autoencoder (BAAE)-based PLA scheme is proposed to extract relevant channel features and mitigate inter-symbol interference and inter-carrier interference. Compared to existing deep learning-based PLA schemes, the proposed scheme addresses the core factors contributing to poor authentication accuracy at the algorithmic level, rather than brute-force learning from bigger datasets. Experiment results show that the proposed scheme presents more accurate predictions and lower complexity compared with the existing data-driven models across all tested signal noise ratio levels and velocities. Moreover, it is robust to maintain 99.6% authentication accuracy even when the users are moving with high velocities.
- 11 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (3) , 572-576
Model-Driven Learning for Physical Layer Authentication in Dynamic Environments
This letter investigates the physical layer authentication (PLA) in dynamic environments, where the users have different mobility velocities. The performance of PLA in this scenario suffers from the inaccurate prediction of the channel statement information (CSI) owing to the Doppler shifts and multipath fading. To overcome the difficulty, a model-driven learning algorithm is developed to predict dynamic CSI. Specifically, the Bahdanau Attention Autoencoder (BAAE)-based PLA scheme is proposed to extract relevant channel features and mitigate inter-symbol interference and inter-carrier interference. Compared to existing deep learning-based PLA schemes, the proposed scheme addresses the core factors contributing to poor authentication accuracy at the algorithmic level, rather than brute-force learning from bigger datasets. Experiment results show that the proposed scheme presents more accurate predictions and lower complexity compared with the existing data-driven models across all tested signal noise ratio levels and velocities. Moreover, it is robust to maintain 99.6% authentication accuracy even when the users are moving with high velocities.
- 16 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (6) , 9230-9243
E-Chain: Lightweight and Secure BIoT Voting Mechanism on Variable Bandwidth Networks
The convergence of Blockchain and Internet of Things (BIoT) is fully considered as a paradigm for mitigating threats related to the trust, security, and privacy of Internet of Things (IoT) data. However, because the bandwidth across nodes and time varies in practical IoT networks, it is difficult for existing BIoT mechanisms guarantee blockchain consensus performances. The consensus time could become long owing to low-bandwidth nodes taking longer to download blocks than high-bandwidth nodes. Conventional wisdom holds that removing low-bandwidth nodes can decrease the consensus time, but the nodes could have high-bandwidth at another time owing to bandwidth variability; thus, kicking which nodes out of the consensus is a great challenge. In this article, a novel lightweight BIoT convergence (namely, E-Chain) is proposed to overcome bandwidth variability. The E-Chain first decouples the blockchain into on-chain validating and off-chain voting components. In the off-chain voting part, each node incurs a one-bit communication overhead for voting on a block based on a reputation index. This voting component does not need to download the full content of the block, and is therefore not affected by bandwidth variability. The reputation index was formulated using a rating algorithm with multidimensional IoT network metrics. In addition, the voting mechanism is secure and can still reach the correct consensus when suffering from byzantine attacks. By contrast, a block is validated and stored in a dispersed manner in the on-chain validating part. The E-Chain performances were then evaluated and compared with state-of-the-art mechanisms. Experimental results show that the E-Chain mechanism can significantly decrease both the consensus time and memory resources, and incur an acceptable memory overhead for resource-constrained IoT nodes.
- 16 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 11 (6) , 9230-9243
E-Chain: Lightweight and Secure BIoT Voting Mechanism on Variable Bandwidth Networks
The convergence of Blockchain and Internet of Things (BIoT) is fully considered as a paradigm for mitigating threats related to the trust, security, and privacy of Internet of Things (IoT) data. However, because the bandwidth across nodes and time varies in practical IoT networks, it is difficult for existing BIoT mechanisms guarantee blockchain consensus performances. The consensus time could become long owing to low-bandwidth nodes taking longer to download blocks than high-bandwidth nodes. Conventional wisdom holds that removing low-bandwidth nodes can decrease the consensus time, but the nodes could have high-bandwidth at another time owing to bandwidth variability; thus, kicking which nodes out of the consensus is a great challenge. In this article, a novel lightweight BIoT convergence (namely, E-Chain) is proposed to overcome bandwidth variability. The E-Chain first decouples the blockchain into on-chain validating and off-chain voting components. In the off-chain voting part, each node incurs a one-bit communication overhead for voting on a block based on a reputation index. This voting component does not need to download the full content of the block, and is therefore not affected by bandwidth variability. The reputation index was formulated using a rating algorithm with multidimensional IoT network metrics. In addition, the voting mechanism is secure and can still reach the correct consensus when suffering from byzantine attacks. By contrast, a block is validated and stored in a dispersed manner in the on-chain validating part. The E-Chain performances were then evaluated and compared with state-of-the-art mechanisms. Experimental results show that the E-Chain mechanism can significantly decrease both the consensus time and memory resources, and incur an acceptable memory overhead for resource-constrained IoT nodes.
- Open Access
- 29 June 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (13) , 7699
FPLA: A Flexible Physical Layer Authentication Mechanism for Distributing Quantum Keys Securely via Wireless 5G Channels
Quantum Key Distribution (QKD) is popular for establishing a native secure quantum communication network. However, existing QKD networks are built via classical wired fiber channels; it is difficult to distribute quantum keys directly into mobile phones, and no effective candidate solution is available yet. This paper presents a novel Flexible Physical Layer Authentication (FPLA) mechanism that exploits the unique characteristic of wireless signals from mobile phones to securely distribute quantum keys via wireless 5G channels. In particular, a 5G Up-Link Sounding Reference Signal (SRS)-based transmission model is developed to capture and extract the unique characteristic, which is then used to distribute quantum keys. Moreover, the model could lose accuracy due to SRS variations introduced by 5G Multiuser Multiple-Input Multiple-Output (MU-MIMO), so a dimensional transformation residual network is designed to classify legitimate and malicious user equipment (UE). An average authentication accuracy of 96.8% is proved by FPLA in multiple experiments in a 3 dB Signal-to-Noise Ratio (SNR) test environment with a training dataset of 300 samples per malicious UE. Simulation results show that FPLA is able to adapt to antenna diversity in 5G MU-MIMO systems.
- 29 June 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (13) , 7699
Open AccessFPLA: A Flexible Physical Layer Authentication Mechanism for Distributing Quantum Keys Securely via Wireless 5G Channels
Quantum Key Distribution (QKD) is popular for establishing a native secure quantum communication network. However, existing QKD networks are built via classical wired fiber channels; it is difficult to distribute quantum keys directly into mobile phones, and no effective candidate solution is available yet. This paper presents a novel Flexible Physical Layer Authentication (FPLA) mechanism that exploits the unique characteristic of wireless signals from mobile phones to securely distribute quantum keys via wireless 5G channels. In particular, a 5G Up-Link Sounding Reference Signal (SRS)-based transmission model is developed to capture and extract the unique characteristic, which is then used to distribute quantum keys. Moreover, the model could lose accuracy due to SRS variations introduced by 5G Multiuser Multiple-Input Multiple-Output (MU-MIMO), so a dimensional transformation residual network is designed to classify legitimate and malicious user equipment (UE). An average authentication accuracy of 96.8% is proved by FPLA in multiple experiments in a 3 dB Signal-to-Noise Ratio (SNR) test environment with a training dataset of 300 samples per malicious UE. Simulation results show that FPLA is able to adapt to antenna diversity in 5G MU-MIMO systems.
- Open Access
- 27 September 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022, 1-13
QSLT: A Quantum-Based Lightweight Transmission Mechanism against Eavesdropping for IoT Networks
Quantum Key Distribution (QKD) is a promising paradigm for Internet of Things (IoT) networks against eavesdropping attacks. However, classical quantum-based mechanisms are overweight and expensive for resource-constrained IoT devices. That is, the devices need to frequently exchange with the QKD controller via an out-band quantum channel. In this paper, we propose a novel Quantum-based Secure and Lightweight Transmission (QSLT) mechanism to ease the overweight pain for IoT devices against eavesdropping. Particularly, the mechanism predistributes quantum keys into IoT devices with SIM cards. Using one of the keys, QSLT encrypts or decrypts IoT sensitive data. It is noting that an in-band key-selection method is used to negotiate the session key between two different devices. For example, on one IoT device, the in-band method inserts a key-selection field at the end of the encrypted data to indicate the key’s sequence number. After another device receives the data, QSLT extracts the key-selection field and decrypts the data with the selected quantum key stored locally. We implement the proposed mechanism and evaluate its security and transmission performances. Experimental results show that QSLT can transmit IoT data with a lower delay while guaranteeing the security performance. Besides, QSLT also decreases power usage by approximately 58.77% compared with state of the art mechanisms.
- 27 September 2022
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2022, 1-13
Open AccessQSLT: A Quantum-Based Lightweight Transmission Mechanism against Eavesdropping for IoT Networks
Quantum Key Distribution (QKD) is a promising paradigm for Internet of Things (IoT) networks against eavesdropping attacks. However, classical quantum-based mechanisms are overweight and expensive for resource-constrained IoT devices. That is, the devices need to frequently exchange with the QKD controller via an out-band quantum channel. In this paper, we propose a novel Quantum-based Secure and Lightweight Transmission (QSLT) mechanism to ease the overweight pain for IoT devices against eavesdropping. Particularly, the mechanism predistributes quantum keys into IoT devices with SIM cards. Using one of the keys, QSLT encrypts or decrypts IoT sensitive data. It is noting that an in-band key-selection method is used to negotiate the session key between two different devices. For example, on one IoT device, the in-band method inserts a key-selection field at the end of the encrypted data to indicate the key’s sequence number. After another device receives the data, QSLT extracts the key-selection field and decrypts the data with the selected quantum key stored locally. We implement the proposed mechanism and evaluate its security and transmission performances. Experimental results show that QSLT can transmit IoT data with a lower delay while guaranteeing the security performance. Besides, QSLT also decreases power usage by approximately 58.77% compared with state of the art mechanisms.
- Open Access
NetDAO: Toward Trustful and Secure IoT Networks without Central Gateways
The Internet of Things (IoT) suffers from a profound lack of trust between central gateways and sensors, e.g., gateways suspect sensors of flooding malicious packets, and vice versa, sensors suspect gateways of manipulating traffic data. One important reason for the mistrust is the asymmetry of a centralized network organization. A Decentralized Autonomous Organization (DAO) can establish a trustful and symmetric network with the blockchain. However, it is a vacant area for IoT networks to build trust between gateways and sensors within the DAO. In this paper, we firstly propose a trustful and secure IoT Network DAO solution (NetDAO) to mitigate the data manipulation and the malicious flooding packets. In particular, the NetDAO has a security rating algorithm to assign a reputation value for each entity in the network. Based on this, each entity can mitigate the malicious flooding packets using a proof-of-reputation packet-forwarding mechanism. In addition, the NetDAO stores traffic data using the blockchain to mitigate the data manipulation. The experimental results show that the NetDAO effectively mitigates malicious flooding packets and costs 1 s for ∼480 entities to complete the rating algorithm.
Open AccessNetDAO: Toward Trustful and Secure IoT Networks without Central Gateways
The Internet of Things (IoT) suffers from a profound lack of trust between central gateways and sensors, e.g., gateways suspect sensors of flooding malicious packets, and vice versa, sensors suspect gateways of manipulating traffic data. One important reason for the mistrust is the asymmetry of a centralized network organization. A Decentralized Autonomous Organization (DAO) can establish a trustful and symmetric network with the blockchain. However, it is a vacant area for IoT networks to build trust between gateways and sensors within the DAO. In this paper, we firstly propose a trustful and secure IoT Network DAO solution (NetDAO) to mitigate the data manipulation and the malicious flooding packets. In particular, the NetDAO has a security rating algorithm to assign a reputation value for each entity in the network. Based on this, each entity can mitigate the malicious flooding packets using a proof-of-reputation packet-forwarding mechanism. In addition, the NetDAO stores traffic data using the blockchain to mitigate the data manipulation. The experimental results show that the NetDAO effectively mitigates malicious flooding packets and costs 1 s for ∼480 entities to complete the rating algorithm.
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (8) , 6578-6590
Softwarized IoT Network Immunity Against Eavesdropping With Programmable Data Planes
State-of-the-art mechanisms against eavesdropping first encrypt all packet payloads in the application layer and then split the packets into multiple network paths. However, versatile eavesdroppers could simultaneously intercept several paths to intercept all the packets, classify the packets into streams using transport fields, and analyze the streams by brute-force. In this article, we propose a programming protocol-independent packet processors (P4)-based network immune scheme (P4NIS) against the intractable eavesdropping. Specifically, P4NIS is equipped with three lines of defenses to provide a softwarized network immunity. Packets are successively processed by the third, second, and first line of defenses. The third line basically encrypts all packet payloads in the application layer using cryptographic mechanisms. Additionally, the second line re-encrypts all packet headers in the transport layer to distribute the packets from one stream into different streams, and disturbs eavesdroppers to classify the packets correctly. Besides, the second line adopts a programmable design for dynamically changing encryption algorithms. Complementally, the first line uses programmable forwarding policies which could split all the double-encrypted packets into different network paths disorderly. Using a paradigm of programmable data planes-P4, we implement P4NIS and evaluate its performances. Experimental results show that P4NIS can increase difficulties of eavesdropping and transmission throughput effectively compared with state-of-the-art mechanisms. Moreover, if P4NIS and state-of-the-art mechanisms have the same level of defending eavesdropping, P4NIS can decrease the encryption cost by 69.85%-81.24%.
- 1 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (8) , 6578-6590
Softwarized IoT Network Immunity Against Eavesdropping With Programmable Data Planes
State-of-the-art mechanisms against eavesdropping first encrypt all packet payloads in the application layer and then split the packets into multiple network paths. However, versatile eavesdroppers could simultaneously intercept several paths to intercept all the packets, classify the packets into streams using transport fields, and analyze the streams by brute-force. In this article, we propose a programming protocol-independent packet processors (P4)-based network immune scheme (P4NIS) against the intractable eavesdropping. Specifically, P4NIS is equipped with three lines of defenses to provide a softwarized network immunity. Packets are successively processed by the third, second, and first line of defenses. The third line basically encrypts all packet payloads in the application layer using cryptographic mechanisms. Additionally, the second line re-encrypts all packet headers in the transport layer to distribute the packets from one stream into different streams, and disturbs eavesdroppers to classify the packets correctly. Besides, the second line adopts a programmable design for dynamically changing encryption algorithms. Complementally, the first line uses programmable forwarding policies which could split all the double-encrypted packets into different network paths disorderly. Using a paradigm of programmable data planes-P4, we implement P4NIS and evaluate its performances. Experimental results show that P4NIS can increase difficulties of eavesdropping and transmission throughput effectively compared with state-of-the-art mechanisms. Moreover, if P4NIS and state-of-the-art mechanisms have the same level of defending eavesdropping, P4NIS can decrease the encryption cost by 69.85%-81.24%.
- Open Access
- 20 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 74875-74886
Flowlet-Based Stateful Multipath Forwarding in Heterogeneous Internet of Things
Concurrent multipath transfer effectively improves network throughput and reliability by utilizing the unoccupied network links. However, the performance of concurrent multipath transfer degrades significantly in the heterogeneous Internet of Things. The reason is that the disorder and retransmission will increase sharply if the quality of links are greatly different. This paper proposes a multipath stateful forwarding mechanism in the granularity of flowlet, which is featured with planning the flowlet forwarding dynamically to improve the transmission success rate. Besides, our mechanism implements stateful forwarding by improving the state information processing capability of the data plane. It can adjust the size of the flowlet based on the network performance of the path, thereby improving the bandwidth resource utilization of the system. In particular, the proposed mechanism can sense network congestion status dynamically, detect network anomalies, and re-plan the forwarding strategy. Experimental results show that in the harsh environment (link quality varies greatly among the three test paths), the proposed mechanism can improve the throughput by 114.7% and reduce the percentage of out of order packets by 29.5% compared with the Round-Robin Scheduling mechanism.
- 20 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 74875-74886
Open AccessFlowlet-Based Stateful Multipath Forwarding in Heterogeneous Internet of Things
Concurrent multipath transfer effectively improves network throughput and reliability by utilizing the unoccupied network links. However, the performance of concurrent multipath transfer degrades significantly in the heterogeneous Internet of Things. The reason is that the disorder and retransmission will increase sharply if the quality of links are greatly different. This paper proposes a multipath stateful forwarding mechanism in the granularity of flowlet, which is featured with planning the flowlet forwarding dynamically to improve the transmission success rate. Besides, our mechanism implements stateful forwarding by improving the state information processing capability of the data plane. It can adjust the size of the flowlet based on the network performance of the path, thereby improving the bandwidth resource utilization of the system. In particular, the proposed mechanism can sense network congestion status dynamically, detect network anomalies, and re-plan the forwarding strategy. Experimental results show that in the harsh environment (link quality varies greatly among the three test paths), the proposed mechanism can improve the throughput by 114.7% and reduce the percentage of out of order packets by 29.5% compared with the Round-Robin Scheduling mechanism.