Search

Federated Learning (FL) has increasingly been recognized as an innovative and secure distributed model training paradigm, aiming to coordinate multiple edge clients to collaboratively train a shared model without uploading their private datasets. The challenge of encouraging mobile edge devices to participate zealously in FL model training procedures, while mitigating the privacy leakage risks during wireless transmission, remains comparatively unexplored so far. In this paper, we propose a novel approach, named QI-DPFL (Quality-Aware and Incentive-Boosted Federated Learning with Differential Privacy), to address the aforementioned intractable issue. To select clients with high-quality datasets, we first propose a quality-aware client selection mechanism based on the Earth Mover's Distance (EMD) metric. Furthermore, to attract high-quality data contributors, we design an incentive-boosted mechanism that constructs the interactions between the central server and the selected clients as a two-stage Stackelberg game, where the central server designs the time-dependent reward to minimize its cost by considering the trade-off between accuracy loss and total reward allocated, and each selected client decides the privacy budget to maximize its utility. The Nash Equilibrium of the Stackelberg game is derived to find the optimal solution in each global iteration. The extensive experimental results on different real-world datasets demonstrate the effectiveness of our proposed FL framework, by realizing the goal of privacy protection and incentive compatibility., Comment: To be published in IJCNN 2024

Resource management is a key issue that needs to be addressed in the future smart Internet of Things (IoT). This paper focuses on a Federated Learning (FL)-based resource management mechanism in IoT. It incorporates blockchain technology to guarantee the security of the FL model parameters exchange. We propose an IoT resource management framework incorporating blockchain and federated learning technologies; then, a specific FL-based resource management with a blockchain trust assurance algorithm is given. We use a Support Vector Machine (SVM) classifier to detect malicious nodes in order to avoid the impact on the performance of the FL-based algorithm. Finally, we perform simulation to verify the SVM classification effect and the proposed algorithm performance. The results show that the SVM-based malicious node identification accuracy can be acceptable. Moreover, the proposed algorithm obtains better performance when malicious nodes are excluded from the FL selected participant.

Federated Learning (FL) has emerged as a prominent distributed machine learning framework that enables geographically discrete clients to train a global model collaboratively while preserving their privacy-sensitive data. However, due to the non-independent-and-identically-distributed (Non-IID) data generated by heterogeneous clients, the performances of the conventional federated optimization schemes such as FedAvg and its variants deteriorate, requiring the design to adaptively adjust specific model parameters to alleviate the negative influence of heterogeneity. In this paper, by leveraging entropy as a new metric for assessing the degree of system disorder, we propose an adaptive FEDerated learning algorithm based on ENTropy theory (FedEnt) to alleviate the parameter deviation among heterogeneous clients and achieve fast convergence. Nevertheless, given the data disparity and parameter deviation of heterogeneous clients, determining the optimal dynamic learning rate for each client becomes a challenging task as there is no communication among participating clients during the local training epochs. To enable a decentralized learning rate for each participating client, we first introduce the mean-field terms to estimate the components associated with other clients' local parameters. Furthermore, we provide rigorous theoretical analysis on the existence and determination of the mean-field estimators. Based on the mean-field estimators, the closed-form adaptive learning rate for each client is derived by constructing the Hamilton equation. Moreover, the convergence rate of our proposed FedEnt is proved. The extensive experimental results on the real-world datasets (i.e., MNIST, EMNIST-L, CIFAR10, and CIFAR100) show that our FedEnt algorithm surpasses FedAvg and its variants (i.e., FedAdam, FedProx, and FedDyn) under Non-IID settings and achieves a faster convergence rate., Comment: 16 pages, 13 figures

Federated Learning (FL) has emerged as a pivotal paradigm within distributed model training, facilitating collaboration among multiple devices to refine a shared model, harnessing their respective datasets as orchestrated by a central server, while ensuring the localization of private data. Nonetheless, the non-independent-and-identically-distributed (Non-IID) data generated on heterogeneous clients and the incessant information exchange among participants may markedly impede training efficacy and retard the convergence rate. In this paper, we refine the conventional stochastic gradient descent (SGD) methodology by introducing aggregated gradients at each local training epoch and propose an adaptive learning rate iterative algorithm that concerns the divergence between local and average parameters. To surmount the obstacle that acquiring other clients' local information, we introduce the mean-field approach by leveraging two mean-field terms to approximately estimate the average local parameters and gradients over time in a manner that precludes the need for local information exchange among clients and design the decentralized adaptive learning rate for each client. Through meticulous theoretical analysis, we provide a robust convergence guarantee for our proposed algorithm and ensure its wide applicability. Our numerical experiments substantiate the superiority of our framework in comparison with existing state-of-the-art FL strategies for enhancing model performance and accelerating convergence rate under IID and Non-IID data distributions.

Terahertz communication has been proposed as one of the basic key technologies of the sixth-generation wireless network (6G) due to its significant advantages, such as ultra-large bandwidth, ultra-high transmission rates, high-precision positioning, and high-resolution perception. In terahertz-enabled 6G communication systems, the intelligent reconfiguration of wireless propagation environments by deploying reconfigurable intelligent surfaces (RIS) will be an important research direction. This paper analyzes the far field and near field of RIS-assisted wireless communication and a detailed system description is presented. Subsequently, this paper presents a specific study of the channel model for an RIS-assisted 6G communication system in the far-field and near-field cases, respectively. Finally, an integrated simulation of the channel models for the far-field and near-field cases is carried out, and the performance of the RIS auxiliary link measured in terms of signal-to-noise ratio (SNR) is compared and analyzed. The results show that increasing the size of the RIS surface to improve the SNR is an effective method to enhance the coverage performance of the 6G THz communication system under the strong guarantee of the ultra-large bandwidth of THz