Adaptive Model Aggregation for Decentralized Federated Learning in Vehicular Networks

dc.contributor.advisorGhaderi, Majid
dc.contributor.authorMovahedian Attar, Mahtab
dc.contributor.committeememberOvens, Katie
dc.contributor.committeememberDrew, Steve
dc.date.accessioned2023-12-21T21:18:42Z
dc.date.available2023-12-21T21:18:42Z
dc.date.issued2023-12-20
dc.description.abstractIn vehicular networks, Decentralized Federated Learning (DFL) has emerged as a cutting-edge methodology for the collaborative development of machine learning models, offering a unique balance between collaborative learning and individual data privacy. This approach is particularly apt in scenarios where vehicles, equipped with their own data and computation capabilities, work together to build a comprehensive and shared global model. Each vehicle contributes to this goal by training local models and merging them through model aggregation with data from nearby vehicles. A notable challenge in this context arises from vehicular networks' characteristics - primarily, their high mobility and the often unreliable nature of wireless communications. These factors frequently result in vehicles receiving only fragments of models from their peers, presenting a complex challenge: how to effectively leverage these incomplete models to accelerate the overall training process while simultaneously managing to keep the computational and communication overhead to a minimum. This thesis introduces the Adaptive Model Aggregation (AMA) algorithm to meet this challenge. AMA functions asynchronously within each vehicle and utilizes a threshold-based mechanism to decide whether to include the partially received models in the aggregation process. Given the variable nature of vehicular networks, it becomes evident that a fixed threshold is insufficient. Consequently, this thesis innovates an algorithm inspired by Contextual Multi-Arm Bandit (CMAB) theory, adapting the threshold for each vehicle based on the current communication dynamics of the network. The efficacy of AMA is tested through a series of comprehensive evaluations conducted within simulated environments, which account for various vehicular mobility patterns. These evaluations provide robust evidence that AMA substantially reduces the overhead associated with DFL aggregation - by as much as 83% - compared to traditional, non-adaptive aggregation methods, without adversely affecting the accuracy of the training process.
dc.identifier.citationMovahedian Attar, M. (2023). Adaptive Model Aggregation for Decentralized Federated Learning in vehicular networks (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca.
dc.identifier.urihttps://hdl.handle.net/1880/117803
dc.language.isoen
dc.publisher.facultyGraduate Studies
dc.publisher.institutionUniversity of Calgary
dc.rightsUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.
dc.subjectFederated Learning
dc.subjectVehicular Networks
dc.subjectAdaptive Learning
dc.subject.classificationComputer Science
dc.titleAdaptive Model Aggregation for Decentralized Federated Learning in Vehicular Networks
dc.typemaster thesis
thesis.degree.disciplineComputer Science
thesis.degree.grantorUniversity of Calgary
thesis.degree.nameMaster of Science (MSc)
ucalgary.thesis.accesssetbystudentI do not require a thesis withhold – my thesis will have open access and can be viewed and downloaded publicly as soon as possible.
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
ucalgary_2023_movahedian-attar_mahtab.pdf
Size:
5.12 MB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.62 KB
Format:
Item-specific license agreed upon to submission
Description: