CULypso: A Clustered Federated Unlearning paradigm for Vehicular Ad-Hoc Networks
Abstract
Unlearning has emerged as an essential security and privacy-preserving solution in Machine Learning, enabling networks to support their clients' rights for data erasure, as mandated by data protection regulations. Introducing such a non-trivial task to an edge, highly mobile and time-sensitive vehicular network is an even greater, largely unexplored challenge. This article argues that a hierarchical Federated Unlearning approach could be aptly integrated into vehicular ad-hoc networks (VANETs), leveraging topology and movement to reduce communication, resource and time costs, while effectively forgetting a client's influence on the global model updates. In order to achieve this, we propose CULypso, an approximate, surgical, hierarchical unlearning algorithm tailored for clustered VANETs. Inspired by the nymph in Greek mythology, Calypso, whose name translates to 'she who conceals the knowledge', CULypso, with the capital letters referencing Clustered UnLearning, aims to achieve exactly what its name suggests: conceal, erase or forget in our case, knowledge it contains. Extensive experiments uphold the potency of our paradigm with it performing approximately 65% better than FedEraser in terms of time, server storage load, and unlearning fidelity while utterly outperforming baseline full retraining.
Figures & tables
| Symbol | Description | Symbol | Description |
|---|---|---|---|
| Vehicles in the snapshot; eligible vehicles ( and MEC coverage), | Training round index; number of federated learning rounds | ||
| V2V and V2I transmission ranges | Global model at round ; model size in bytes | ||
| Participation gate | Local update of vehicle at round | ||
| Samples, CPU score and storage score of vehicle | Aggregated update of cluster at round | ||
| Link expiration time (LET) of ; LET horizon cap | Intra-cluster and inter-cluster aggregation weights | ||
| Relative-mobility stability of vehicle | Target vehicle requesting to be forgotten (RTBF) |
| Competitor | Topology | Basic algorithm |
|---|---|---|
| CULypso | clustered | hierarchical FedAvg, clustered replay, recovery rounds |
| FedEraser | flat | FedAvg, FedEraser calibration |
| From-scratch | flat and clustered | Retraining without the target |
| ID | Junctions | Map | MEC coverage |
|---|---|---|---|
| M4 | 100% | ||
| M8 | 100% | ||
| M10 | 97% |
| ID | Target vehicle count | Dense | Median | Sparse |
|---|---|---|---|---|
| M4T16 | 16 | 17 @ 347 s | 13 @ 122 s | 9 @ 271 s |
| M4T8 | 8 | 8 @ 120 s | 5 @ 206 s | 2 @ 208 s |
| M8T64 | 64 | 58 @ 198 s | 52 @ 170 s | 43 @ 123 s |
| M8T32 | 32 | 32 @ 263 s | 29 @ 198 s | 22 @ 132 s |
| M10T100 | 100 | 94 @ 292 s | 82 @ 207 s | 66 @ 120 s |
| M10T50 | 50 | 54 @ 456 s | 45 @ 211 s | 36 @ 120 s |
| Parameter | Setting |
|---|---|
| Task | Temperature prediction |
| Input | Sliding window of 4 scaled observations |
| Model | One-layer GRU (hidden size 16) with residual linear head |
| Local solver | Adam, learning rate , 10 epochs per round |
| Aggregation | Weighted FedAvg ( ) |
| Rounds |
Federated Unlearning
Federated unlearning removes a client’s or record’s influence from a collaboratively trained model while preserving useful knowledge.
See all 31 papers