With the proliferation of Internet of Things (IoT) devices and edge nodes, edge computing has taken on much of the real-time data processing and low-latency response tasks which were previously managed by cloud computing. However, edge computing often encounters challenges such as network instability and dynamic resource variations, which can lead to task interruptions or failures. To address these issues, developing a fault-tolerant scheduling mechanism is crucial to ensure that a system continues to operate efficiently even when some nodes experience failures. In this paper, we propose an innovative fault-tolerant scheduling model based on asynchronous graph reinforcement learning. This model incorporates a deep reinforcement learning framework built upon a graph neural network, allowing it to accurately capture the complex communication relationships between computing nodes. The model generates fault-tolerant scheduling actions as output, ensuring robust performance in dynamic environments. Additionally, we introduce an asynchronous model update strategy, which enhances the model’s capability of real-time dynamic scheduling through multi-threaded parallel interactions with the environment and frequent model updates via running threads. The experimental results demonstrate that the proposed method outperformed the baseline algorithms in terms of quality of service (QoS) assurance and fault-tolerant scheduling capabilities.

The advancement of 6G (6th Generation Mobile Networks) communication technology has posed challenges for traditional communication network architectures in meeting the demands for communication efficiency and quality. Semantic communication technology, characterized by its “understand before transmit” approach, has emerged as a pivotal technology driving the progress of 6G due to its ability to enhance communication efficiency and quality. The Wireless Image Transmission Transformer (WITT) model, which operates as a semantic communication system leveraging vision transformer technology for the transmission of semantic images, has shown efficacy in transmitting input images through processes of feature extraction and channel adaptation. This study introduces an advanced channel adaptive module that is informed by deep learning methodologies and the adaptive modulation principles of the Variational Information Bottleneck (VIB). This innovation enhances the original WITT model, resulting in the development of the Adaptive Wireless Image Transmission Transformer (ADWITT) architecture. Comprehensive experimental results have unequivocally shown that the transmission performance of the ADWITT architecture substantially surpasses that of the conventional WITT (Wavelet Image Transmission Technique) model, particularly in scenarios characterized by harsh and detrimental channel conditions. These findings underscore the robustness and adaptability of the ADWITT approach, which is poised to improve the field of image transmission by offering superior performance and resilience in environments where traditional methods falter.

Federated learning is a distributed machine learning technique that enables multiple devices to collaborate on learning a shared model without exchanging data. It can be used to improve model accuracy while protecting user privacy. However, traditional federated learning is vulnerable to attacks from generative adversarial networks (GANs). As a new privacy protection method, differential privacy enhances privacy protection capabilities by sacrificing some data accuracy. We optimized the privacy budget allocation scheme in traditional differential privacy and proposed an adaptive parameter-based differential privacy method that improves training accuracy while maintaining the overall privacy budget. Additionally, we proposed an asynchronous federated learning aggregation scheme that combines privacy budget and freshness, reducing the impact of differential privacy on accuracy. We conducted extensive experiments on Gaussian mechanism-based differential privacy and Laplace mechanism-based differential privacy algorithms. Experimental results show that, under the same privacy budget, our algorithm achieves higher accuracy and lower communication overhead compared to baseline algorithms.