SearcharxivSearch

arXiv subjects

Maria Potop Butucaru

Publications and source records attributed to Maria Potop Butucaru.

2 recordsLinked to original sources

FLAIR: Distributed Federated Learning with Dynamic Clustering

Federated Learning (FL) offers a privacy-preserving framework for distributed machine learning, yet conventional centralized and hierarchical architectures present significant challenges in terms of scalability, resilience, and single points of failure, particularly in dynamic, infrastructure-less environments such as sensor networks. To address these limitations, we introduce FLAIR, a novel, fully decentralized FL protocol that integrates dynamic, resource-aware secure and self-organized clustering with in-cluster model training. FLAIR leverages a probabilistic, verifiable cluster-head election mechanism, which is enhanced to favor nodes with greater computational and communication capabilities, thereby ensuring both fairness and efficiency. Through comprehensive simulations in ns-3, we evaluate FLAIR against centralized, hierarchical, and gossip-based FL benchmarks across four demanding scenarios. The results demonstrate the superiority of our approach: in static 100-node networks, FLAIR achieves a final accuracy of approximately 0.91, outperforming all baselines. The protocol exhibits exceptional robustness, maintaining graceful degradation with accuracy above 0.85 even under 90% node failure rates. Furthermore, it shows strong resilience to mobility, with a performance loss of less than 2% compared to static deployments. In a realistic smart farming simulation, FLAIR's accuracy is within 0.2% of the centralized baseline, confirming its practical viability. These findings validate that FLAIR successfully combines the scalability of decentralized learning with the structural efficiency of clustering, presenting a robust and high performing solution for large-scale, heterogeneous IoT systems.

cs.NI

Self-Stabilizing Replicated State Machine Coping with Byzantine and Recurring Transient Faults

The ability to perform repeated Byzantine agreement lies at the heart of important applications such as blockchain price oracles or replicated state machines. Any such protocol requires the following properties: (1) \textit{Byzantine fault-tolerance}, because not all participants can be assumed to be honest, (2) r\textit{ecurrent transient fault-tolerance}, because even honest participants may be subject to transient ``glitches'', (3) \textit{accuracy}, because the results of quantitative queries (such as price quotes) must lie within the interval of honest participants' inputs, and (4) \textit{self-stabilization}, because it is infeasible to reboot a distributed system following a fault. This paper presents the first protocol for repeated Byzantine agreement that satisfies the properties listed above. Specifically, starting in an arbitrary system configuration, our protocol establishes consistency. It preserves consistency in the face of up to $\lceil n/3 \rceil -1$ Byzantine participants {\em and} constant recurring (``noise'') transient faults, of up to $\lceil n/6 \rceil-1$ additional malicious transient faults, or even more than $\lceil n/6 \rceil-1$ (uniformly distributed) random transient faults, in each repeated Byzantine agreement.

cs.DC