This content will become publicly available on November 30, 2027

Title: Route-Assisted Peer Model Training among Connected Vehicles under Different Radio Capabilities
Fully decentralized model training for on-road vehicles enables leveraging crowdsourced data without relying on central servers, infrastructure, or persistent Internet connectivity. However, real-world vehicular scenarios pose fundamental challenges to decentralized learning, including highly dynamic network topology, unreliable wireless links, and heterogeneous radio capability constraints. To address these challenges, we proposeRoADTrain, a route-assisted decentralized peer model training framework with formal convergence guarantees. In RoADTrain, vehicles share short-horizon route information to estimate inter-vehicle contact duration and link reliability, which are embedded into a base graph. Vehicles then select communication partners by maximizing the algebraic connectivity of the resulting communication graph, thereby accelerating information mixing and model convergence. We further investigate subcarrier reuse and extend the algorithm to three representative radio capability cases. Extensive evaluations show that RoADTrain achieves convergence comparable to communication-unconstrained state-of-the-art approaches while reducing communication overhead by up to 4.5×, and significantly outperforms communication-constrained decentralized baselines by up to 29% higher driving success rates in online evaluations. We further empirically demonstrate the robustness of RoADTrain under a range of unexpected effects encountered in complex real-world applications, as well as in a large-scale traffic scenario.  more » « less
Award ID(s):
2230101
PAR ID:
10709571
Author(s) / Creator(s):
; ; ;
Publisher / Repository:
ACM
Date Published:
Journal Name:
ACM Transactions on Internet of Things
Volume:
7
Issue:
4
ISSN:
2691-1914
Page Range / eLocation ID:
1 to 31
Subject(s) / Keyword(s):
Sponsoring Org:
National Science Foundation
More Like this
  1. Fully decentralized model training for on-road vehicles can leverage crowdsourced data while not depending on central servers, infrastructure or Internet coverage. However, under unreliable wireless communication and short contact duration, model sharing among peer vehicles may suffer severe losses thus fail frequently. To address these challenges, we propose “RoADTrain”, a route-assisted decentralized peer model training approach that carefully chooses vehicles with high chances of successful model sharing. It bounds the per round communication time yet retains model performance under vehicle mobility and unreliable communication. Based on shared route information, a connected cluster of vehicles can estimate and embed the link reliability and contact duration information into the communication topology. We decompose the topology into subgraphs supporting parallel communication, and identify a subset of them with the highest algebraic connectivity that can maximize the speed of the information flow in the cluster with high model sharing successes, thus accelerating model training in the cluster. We conduct extensive evaluation on driving decision making models using the popular CARLA simulator. RoADTrain achieves comparable driving success rates and 1.2−4.5× faster convergence than representative decentralized learning methods that always succeed in model sharing (e.g., SGP), and significantly outperforms other benchmarks that consider losses by 17−27% in the hardest driving conditions. These demonstrate that route sharing enables shrewd selection of vehicles for model sharing, thus better model performance and faster convergence against wireless losses and mobility. 
    more » « less
  2. Li, R; Chowdhury, K (Ed.)
    Federated Learning (FL) enables model training across decentralized clients while preserving data privacy. However, bandwidth constraints limit the volume of information exchanged, making communication efficiency a critical challenge. In addition, non- IID data distributions require fairness-aware mechanisms to prevent performance degradation for certain clients. Existing sparsification techniques often apply fixed compression ratios uniformly, ignoring variations in client importance and bandwidth. We propose FedBand, a dynamic bandwidth allocation framework that prioritizes clients based on their contribution to the global model. Unlike conventional approaches, FedBand does not enforce uniform client participation in every communication round. Instead, it allocates more bandwidth to clients whose local updates deviate significantly from the global model, enabling them to transmit a greater number of parameters. Clients with less impactful updates contribute proportionally less or may defer transmission, reducing unnecessary overhead while maintaining generalizability. By optimizing the trade-off between communication efficiency and learning performance, FedBand substantially reduces transmission costs while preserving model accuracy. Experiments on non-IID CIFAR-10 and UTMobileNet2021 datasets, demonstrate that FedBand achieves up to 99.81% bandwidth savings per round while maintaining accuracies close to that of an unsparsified model (80% on CIFAR- 10, 95% on UTMobileNet), despite transmitting less than 1% of the model parameters in each round. Moreover, FedBand accelerates convergence by 37.4%, further improving learning efficiency under bandwidth constraints. Mininet emulations further show a 42.6% reduction in communication costs and a 65.57% acceleration in convergence compared to baseline methods, validating its real-world efficiency. These results demonstrate that adaptive bandwidth allocation can significantly enhance the scalability and communication efficiency of federated learning, making it more viable for real- world, bandwidth-constrained networking environments. 
    more » « less
  3. In this paper, we propose and analyze SPARQSGD, an event-triggered and compressed algorithm for decentralized training of large-scale machine learning models over a graph. Each node can locally compute a condition (event) which triggers a communication where quantized and sparsified local model parameters are sent. In SPARQ-SGD, each node first takes a fixed number of local gradient steps and then checks if the model parameters have significantly changed compared to its last update; it communicates further compressed model parameters only when there is a significant change, as specified by a (design) criterion. We prove that SPARQ-SGD converges as O(1/nT ) and O(1/√nT ) in the strongly-convex and non-convex settings, respectively, demonstrating that aggressive compression, including event-triggered communication, model sparsification and quantization does not affect the overall convergence rate compared to uncompressed decentralized training; thereby theoretically yielding communication efficiency for `free'. We evaluate SPARQ-SGD over real datasets to demonstrate significant savings in communication bits over the state-of-the-art. 
    more » « less
  4. Federated Learning (FL) is a promising distributed machine learning framework that allows collaborative learning of a global model across decentralized devices without uploading their local data. However, in real-world FL scenarios, the conventional synchronous FL mechanism suffers from inefficient training caused by slow-speed devices, commonly known as stragglers, especially in heterogeneous communication environments. Though asynchronous FL effectively tackles the efficiency challenge, it induces substantial system overheads and model degradation. Striking for a balance, semi-asynchronous FL has gained increasing attention, while still suffering from the open challenge of stale models, where newly arrived updates are calculated based on outdated weights that easily hurt the convergence of the global model. In this paper, we present SEAFL, a novel FL framework designed to mitigate both the straggler and the stale model challenges in semi-asynchronous FL. SEAFL dynamically assigns weights to uploaded models during aggregation based on their staleness and importance to the current global model. We theoretically analyze the convergence rate of SEAFL and further enhance the training efficiency with an extended variant that allows partial training on slower devices, enabling them to contribute to global aggregation while reducing excessive waiting times. We evaluate the effectiveness of SEAFL through extensive experiments on three benchmark datasets. The experimental results demonstrate that SEAFL outperforms its closest counterpart by up to ∼22% in terms of the wall-clock training time required to achieve target accuracy. 
    more » « less
  5. Emerging Internet of Things (IoT) provides connectivity to a wide range of mobile nodes including indoor wireless users, pedestrian, ground robotics, vehicles, and flying objects. Such decentralized network require rethinking user-centric communication protocols which accommodate extremely dynamic environments of autonomous nodes. The authors recently proposed a predictive routing algorithm, which enables a delay-optimal communication through incorporating network topology prediction into the Dijkstra's shortest path algorithm. In this work, we extend the proposed solution to jointly optimize the end-to-end latency and total transmission power. Further, we develop a ground robotics platform in order to study the utility of the proposed algorithm in real-world applications. The simulation results which verified by the test platform, confirm the superiority of the proposed algorithm compared to the conventional shortest path algorithms by improving the delay and power consumption by a factor of 10% to 15%. 
    more » « less