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


Chao Guo has a total of 85 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A split-phase PSK demodulation algorithm based on SDR and FPGA implementation

    by Chao Guo, Anqi Wang, Jingli Hao, Yuhuang Ye, Junjie Yang, Abdul Waheed

  • Optimal Strategy for Moving Target Defense on the Internet of Vehicles Based on Game Theory and Reinforcement Learning

    by Chao Guo, Tingting Zhu, Buxin Guo, Cheng Gong, Haitao Xu, Zhu Han

    As an important part of the intelligent transportation system, the Internet of Vehicles (IoV) optimizes traffic management, improves road safety, and travel experience by connecting vehicles with the cloud, infrastructure, pedestrians, and other vehicles. However, with the rapid development and widespread application of IoV technology, its network security issues have become increasingly prominent. Its attack threats may not only cause the functional failure of individual vehicles, but also seriously impact the stability of the entire transportation system. With the expansion of scale and increase in complexity, new threats and large-scale communications have put forward higher requirements for the security protection capabilities of IoV. Therefore, the introduction of adaptive active defense mechanisms can further improve the security and adaptability of the system. Because of the diverse defense needs of different levels of IoV systems, this paper constructs an intelligent agent attack and defense game scenario, and proposes an optimal defense strategy for moving targets based on an incomplete information Bayesian Markov game and Q-learning algorithm from the perspectives of adaptive active defense, reducing resource overhead, and intelligent defense scheduling. This strategy targets different types of attack problems existing at the vehicle side, pipe side, and cloud side of the IoV system. Taking into account four complex attack scenarios, namely scanning attack, false message injection attack, denial of service attack (DoS), and malware attack, this strategy establishes an incomplete information Bayesian Markov game model and adopts the reinforcement learning Q-learning algorithm to dynamically adjust the game environment strategy by continuously interacting with the environment to obtain reward values. This strategy seeks the most suitable defense elements and the optimal mutation time of defense elements for network attacks at all levels of the IoV, solves the problem of intelligent scheduling of defense resources under active defense systems at different levels, and avoids the limitations of a single defense mechanism. The experimental results show that compared with the existing comparative algorithms, the proposed method exhibits better defense performance and limitations in dealing with multi-level compound attacks on the IoV, and provides a new technical approach for building an intelligent and active IoV security protection system. This paper uses OMNeT++, SUMO, and Veins network joint simulation tools to verify the effectiveness of the above two solutions through four performance indicators: attack success rate, data packet loss rate, communication delay, and system overhead. The simulation results show that the defense mechanism performs well in reducing attack success rate, data packet loss rate, communication delay, and system overhead, and the overall defense effect is significant, especially when dealing with complex and changing attack scenarios.


  • Reputation-Based Federated Learning Algorithm for Fairness and Security in Internet of Vehicles

    by Chao Guo, Xin Zhang, Lingcui Zhang, Cheng Gong, Haitao Xu, Zhu Han

    In the Internet of Vehicles (IoV), developing accurate road information models is essential for analyzing perception data gathered from multiple vehicles. However, traditional centralized data-sharing methods can compromise the privacy and security of data providers. Federated learning (FL) presents a promising solution as a distributed machine learning approach that balances data privacy protection with efficient utilization by keeping data localized and sharing only model updates. Nevertheless, conventional FL strategies often fail to adequately address differences in resource investment and data quality among participating vehicles while aggregating local training results. This oversight can lead to inequitable model aggregation and distribution, reducing the motivation for vehicles to share their data. This paper proposes a reputation evaluation-based, fair, and secure federated learning scheme for the IoV to address these challenges. In this scheme, the aggregation node utilizes fuzzy comprehensive evaluation to assess the training outcomes of participating vehicles and assigns aggregation weights accordingly. It also calculates reputation values for each vehicle using periodic averaging methods. Subsequently, the node implements differentiated global model compression and distribution based on these reputation scores. Experimental results indicate that the proposed scheme performs comparably to established algorithms while effectively evaluating vehicle reputations. It achieves model compression and equitable distribution, demonstrating an ability to identify and counteract malicious client attacks. Consequently, this approach enhances fairness and security in FL systems designed for the IoV.


  • Authentication for Satellite Internet Resource Slicing Access Based on Trust Measurement

    by Chao Guo, Guangyu Hu, Chenglei Pan, Fenghua Li, Haitao Xu, Zhu Han

    The introduction of satellite Internet resource-slicing technology can efficiently allocate satellite network resources and meet the personalized needs of different users. This article proposes a trust-based satellite Internet resource-slicing access authentication scheme, which solves the efficient and secure access requirements in situations where satellite communication and service resources are relatively limited. The working idea of this article is to provide users with access authentication protocols with different efficiencies through trust as a standard. First, The user’s trust value is calculated by establishing a trust metric model based on Beta function, communication byte fluctuations, and centralized trend measurements. Drawing on the requirements of the security policy function in the resource slicing technology standard, assigning different security policies to users can both improve the fast access ability of high-trust users and reduce the priority of low trust users’ access. After that, based on the results of trust metrics, this article proposes a two-factor-based no certificate satellite Internet slicing access authentication protocol for users with moderate trust levels. This protocol achieves the ability for users to access slicing services anonymously and efficiently through the use of resource-slicing credentials and managers. Final, this article verify the correctness and security of the protocol. Through communication cost comparison, it is shown that this protocol has fewer costs. Through trust simulation, the effectiveness of the trust scheme is analyzed and compared.


  • Open Access

    A Lightweight Access Authentication Protocol for Satellite Network Resource Slicing Based on Trust Measurement

    by Guangyu Hu, Chao Guo, Chenglei Pan, Peihe Liu

    With the abundance of satellite network resources, the rational utilization of resources has received widespread attention, and slicing satellite network resources is of great significance for the sensible use of resources. This article is based on satellite network resource slicing and existing trust evaluation schemes. It proposes a lightweight satellite network resource-slicing access authentication scheme based on high trust, targeting the characteristics of satellite network resources. This article introduces a trust system into the access authentication protocol to provide a lightweight access authentication protocol for high trust users. This scheme determines the slicing security policies users can use based on their trust level by evaluating their trust level in advance. This scheme satisfies the anonymity of user identity and the confidentiality of messages. The results of security verification and performance evaluation show that this scheme has high security while ensuring low computational overhead.


  • Open Access

    Security Resource Scheduling Algorithm for Intelligent UAV Communication Network Based on Optimized Subgraph Isomorphism and Link Partition

    by Yanyan Han, Jiangping Yu, Peiliang Zuo, Zhanzhen Wei, Xin Jin, Kaili Dou, Chao Guo, Haitao Xu

    The resource scheduling problem of UAV communication networks has always been a hot research issue in the current environment. However, most of the current research focuses on meeting the user’s time cost requirements and rarely considers the user’s security requirements in the scheduling process. To solve the problems of low efficiency, more resource fragments, low network reliability, and unbalanced load, this paper improves the virtual network mapping model into a three-layer structure consisting of a security service request layer, virtual network provider layer, and security resource layer, so that it can be applied to the special scenario of security resource scheduling in an unmanned aerial communication network. An intelligent UAV communication network security resource scheduling algorithm based on optimized subgraph isomorphism and link segmentation is proposed. Intelligent UAVs can predict all possible access nodes and intelligently provide network services. The algorithm first improves and enriches the node constraint conditions and evaluation indicators, integrates the node resource attributes and topology attributes, optimizes the sorting process, then calculates the mapping domain in advance, considers the regional comprehensive resource capacity to balance the load, and finally combines the subgraph isomorphism and link segmentation technology to carry out a one-stage mapping scheduling to achieve the security service request in the network and the efficient allocation of network resources required to provide security services. The simulation results of the OMNeT++ show that the proposed algorithm improves the mapping success rate and the long-term average cost-benefit ratio of the UAVs.


  • Toward Secure Transmission in Fog Internet of Things Using Intelligent Resource Allocation

    by Peiliang Zuo, Guowei Sun, Zhaobin Li, Chao Guo, Shan Li, Zhanzhen Wei

    Thanks to the full play of the synergy of local node sets, fog Internet of things technology has become the focus of many researchers. Unfortunately, the data transmission of the sensing terminal therein has the risk of being eavesdropped, due to the openness of the wireless channel and the large-scale deployment of different types of terminals. Meanwhile, the encryption method based on cryptography is difficult to apply to the Internet of things terminals with limited capacity because of its high computational complexity. This paper considers the use of physical layer security technology where the fog node improves the secrecy capacity of the desired channel by sending artificial noise to the untrusted third party to ensure the reliable transmission of data. Specifically, an intelligent resource allocation method based on deep reinforcement learning is proposed to realize the rapid allocation of link resources and interference noise power in the scene, where the relevant elements, such as state, action and reward, are reasonably designed. Simulation results demonstrate that the presented algorithm could effectively resolves the allocation problem, and its transmission delay obviously outperforms that of multiple comparison methods.