Accurate energy consumption forecasting is critical for optimizing energy usage, lowering operational costs, and encouraging sustainability in smart buildings. Machine learning (ML) has developed as an effective method for energy forecasting, using sensor data to anticipate consumption trends and increase efficiency. However, due to regulations such as GDPR and growing privacy concerns, sharing sensitive energy data with third parties is often prohibited, providing issues for traditional centralized ML techniques. Federated Learning (FL) provides a feasible alternative by allowing for decentralized model training across several buildings without explicitly exchanging raw data. This privacy-preserving strategy enables organizations to jointly train reliable models while retaining data sovereignty. Our experimental results demonstrate that by using the CU-BEMS dataset, both FL and centralized forecasting models perform similarly, with an R2score of ≈87%. Furthermore, FL decreases bandwidth use by limiting data transfers, making it a scalable and economical energy management solution for smart buildings. These findings demonstrate FL’s ability to ensure safe, data-driven decision-making for sustainable energy utilization.

Context: Detecting fatigue in drivers has become increasingly important for safe driving, especially with the use of more smart devices and Internet-connected vehicles. While sharing data between vehicles can enhance fatigue detection systems, privacy concerns pose significant barriers to this sharing process. We propose a Federated Learning (FL) approach for monitoring fatigue-driven behavior to address these challenges. However, there is a concern that the drivers' private information might be leaked in the FL system. In this paper, we introduce PRIV-DRIVE, a novel approach for privacy-enhanced fatigue detection applications. Our method integrates Paillier homo-morphic encryption (PHE) with a top-k parameter selection technique, bolstering privacy and confidentiality in federated fatigue detection systems. This approach reduces communication and computation overhead while ensuring model accuracy. To the best of our knowledge, this is the first paper to implement PHE in FL setups for fatigue detection applications. We ran several experiments and evaluated the PRIV-DRIVE method. The results show substantial efficiency gains with different HE key sizes, reducing computation time by up to 96% and communication traffic by up to 95%. Importantly, these improvements have minimal impact on accuracy, effectively meeting the requirements of fatigue detection applications.

Federated Learning (FL) has emerged as a powerful paradigm to train collaborative machine learning (ML) models, preserving the privacy of the participants’ datasets. However, standard FL approaches present some limitations that can hinder their applicability in some applications. Thus, the need of a server or aggregator to orchestrate the learning process may not be possible in scenarios with limited connectivity, as in some IoT applications, and offer less flexibility to personalize the ML models for the different participants. To sidestep these limitations, peer-to-peer FL (P2PFL) provides more flexibility, allowing participants to train their own models in collaboration with their neighbors. However, given the huge number of parameters of typical Deep Neural Network architectures, the communication burden can also be very high. On the other side, it has been shown that standard aggregation schemes for FL are very brittle against data and model poisoning attacks. In this paper, we propose SparSFA, an algorithm for P2PFL capable of reducing the communication costs. We show that our method outperforms competing sparsification methods in P2P scenarios, speeding the convergence and enhancing the stability during training. SparSFA also includes a mechanism to mitigate poisoning attacks for each participant in any random network topology. Our empirical evaluation on real datasets for intrusion detection in IoT, considering both balanced and imbalanced-dataset scenarios, shows that SparSFA is robust to different indiscriminate poisoning attacks launched by one or multiple adversaries, outperforming other robust aggregation methods whilst reducing the communication costs through sparsification.

Unidentified devices in a network can result in devastating consequences. It is, therefore, necessary to fingerprint and identify IoT devices connected to private or critical networks. With the proliferation of massive but heterogeneous IoT devices, it is getting challenging to detect vulnerable devices connected to networks. Current machine learning-based techniques for fingerprinting and identifying devices necessitate a significant amount of data gathered from IoT networks that must be transmitted to a central cloud. Nevertheless, private IoT data cannot be shared with the central cloud in numerous sensitive scenarios. Federated learning (FL) has been regarded as a promising paradigm for decentralized learning and has been applied in many different use cases. It enables machine learning models to be trained in a privacy-preserving way. In this article, we propose a privacy-preserved IoT device fingerprinting and identification mechanisms using FL; we call it FL4IoT. FL4IoT is a two-phased system combining unsupervised-learning-based device fingerprinting and supervised-learning-based device identification. FL4IoT shows its practicality in different performance metrics in a federated and centralized setup. For instance, in the best cases, empirical results show that FL4IoT achieves ∼99% accuracy and F1-Score in identifying IoT devices using a federated setup without exposing any private data to a centralized cloud entity. In addition, FL4IoT can detect spoofed devices with over 99% accuracy .

The increase of the computational power in edge devices has enabled the penetration of distributed machine learning technologies such as federated learning, which allows to build collaborative models performing the training locally in the edge devices, improving the efficiency and the privacy for training of machine learning models, as the data remains in the edge devices. However, in some IoT networks the connectivity between devices and system components can be limited, which prevents the use of federated learning, as it requires a central node to orchestrate the training of the model. To sidestep this, peer-to-peer learning appears as a promising solution, as it does not require such an orchestrator. On the other side, the security challenges in IoT deployments have fostered the use of machine learning for attack and anomaly detection. In these problems, under supervised learning approaches, the training datasets are typically imbalanced, i.e. the number of anomalies is very small compared to the number of benign data points, which requires the use of re-balancing techniques to improve the algorithms' performance. In this paper, we propose a novel peer-to-peer algorithm,P2PK-SMOTE, to train supervised anomaly detection machine learning models in non-IID scenarios, including mechanisms to locally re-balance the training datasets via synthetic generation of data points from the minority class. To improve the performance in non-IID scenarios, we also include a mechanism for sharing a small fraction of synthetic data from the minority class across devices, aiming to reduce the risk of data de-identification. Our experimental evaluation in real datasets for IoT anomaly detection across a different set of scenarios validates the benefits of our proposed approach.

Variational Autoencoders (VAEs) represent the given data in a low-dimensional latent space, which is generally assumed to be Euclidean. This assumption naturally leads to the common choice of a standard Gaussian prior over continuous latent variables. Recent work has, however, shown that this prior has a detrimental effect on model capacity, leading to subpar performance. We propose that the Euclidean assumption lies at the heart of this failure mode. To counter this, we assume a Riemannian structure over the latent space, which constitutes a more principled geometric view of the latent codes, and replace the standard Gaussian prior with a Riemannian Brownian motion prior. We propose an efficient inference scheme that does not rely on the unknown normalizing factor of this prior. Finally, we demonstrate that this prior significantly increases model capacity using only one additional scalar parameter.