Privacy-Preserving Handover Optimization Using Federated Learning and LSTM Networks
The rapid evolution of wireless communication systems necessitates advanced handover mechanisms for seamless connectivity and optimal network performance. Traditional algorithms, like 3GPP Event A3, often struggle with fluctuating signal strengths and dynamic user mobility, leading to frequent hando...
Gespeichert in:
Veröffentlicht in: | Sensors (Basel, Switzerland) Switzerland), 2024-10, Vol.24 (20), p.6685 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The rapid evolution of wireless communication systems necessitates advanced handover mechanisms for seamless connectivity and optimal network performance. Traditional algorithms, like 3GPP Event A3, often struggle with fluctuating signal strengths and dynamic user mobility, leading to frequent handovers and suboptimal resource utilization. This study proposes a novel approach combining Federated Learning (FL) and Long Short-Term Memory (LSTM) networks to predict Reference Signal Received Power (RSRP) and the strongest nearby Reference Signal Received Power (RSRP) signals. Our method leverages FL to ensure data privacy and LSTM to capture temporal dependencies in signal data, enhancing prediction accuracy. We develop a dynamic handover algorithm that adapts to real-time conditions, adjusting thresholds based on predicted signal strengths and historical performance. Extensive experiments with real-world data show our dynamic algorithm significantly outperforms the 3GPP Event A3 algorithm, achieving higher prediction accuracy, reducing unnecessary handovers, and improving overall network performance. In conclusion, this study introduces a data-driven, privacy-preserving approach that leverages advanced machine learning techniques, providing a more efficient and reliable handover mechanism for future wireless networks. |
---|---|
ISSN: | 1424-8220 1424-8220 |
DOI: | 10.3390/s24206685 |