The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Time-dependent Decentralized Routing using Federated Learning
Abstract
Recent advancements in cloud computing have driven rapid development in data-intensive smart city applications by providing near real time processing and storage scalability. This has resulted in efficient centralized route planning services such as Google Maps, upon which millions of users rely. Route planning algorithms have progressed in line with the cloud environments in which they run. Current state of the art solutions assume a shared memory model, hence deployment is limited to multiprocessing environments in data centers. By centralizing these services, latency has become the limiting parameter in the technologies of the future, such as autonomous cars. Additionally, these services require access to outside networks, raising availability concerns in disaster scenarios. Therefore, this paper provides a decentralized route planning approach for private fog networks. We leverage recent advances in federated learning to collaboratively learn shared prediction models online and investigate our approach with a simulated case study from a mid-size U.S. city.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“To address the latency issues in these system, [153] proposed a FL-based decentralized approach using fog nodes and RSUs, reducing memory usage, latency, and communication overhead.”
From Privacy-preserving Machine Learning in Internet of Vehicle Applications: Fundamentals, Recent Advances, and Future Direction (2025) · cites this paper as [153]
Citations
Cites
Communication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215
Research works printed but not linked: 27
- 10.1007/BF01386390 · DOI
- ford, 1956, Network flow theory, RAND CORP SANTA MONICA CA Tech Rep
- 10.1090/qam/102435 · DOI
- dantzig, 2016, Linear Programming and Extensions
- 10.1109/TSSC.1968.300136 · DOI · Paper page
- goldberg, 2005, Computing point-to-point shortest paths from external memory, ALENEX/ANALCO, 26
- 10.1007/11561071_51 · DOI
- 10.1007/11946441_40 · DOI
- 10.1109/HPCC.2008.113 · DOI
- crauser, 1998, A parallelization of dijkstra’s shortest path algorithm, International Symposium on Mathematical Foundations of Computer Science, 722
- goodfellow, 2016, Deep Learning, 1
- bonawitz, 2019, Towards federated learning at scale: System design, arXiv preprint arXiv 1902 05023
- perry, 2017, Dedicated short-range communications roadside unit specifications
- manual, 1964, Bureau of public roads, US Department of Commerce
- 10.1007/BF02551274 · DOI · Paper page
- pajor, 2009, Multi-modal route planning, University of Karlsruhe
- 10.1007/978-3-540-68552-4_24 · DOI
- 10.1007/11841036_71 · DOI
- 2019, 911 dispatch software
- goldberg, 2005, Computing the shortest path: A search meets graph theory, Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics, 156
- nations, 0, World Urbanization Prospects The 2018 Revision
- vetter, 2009, Parallel time-dependent contraction hierarchies, Student Research Project, 134
- vukovic, 2016, Hilbert-geohash-hashing geographical point data using the hilbert space-filling curve
- 10.1109/SMARTCOMP.2019.00063 · DOI
- glorot, 2010, Understanding the difficulty of training deep feedforward neural networks, Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, 249
- 2019, ET Docker
- 10.1007/978-3-7908-2604-3_16 · DOI · Paper page
Cited by
Sorted by citations
Islam, N., & Zulkernine, M. (2025) · arXiv · doi:10.48550/arxiv.2503.01089 · Cited by 9
“To address the latency issues in these system, [153] proposed a FL-based decentralized approach using fog nodes and RSUs, reducing memory usage, latency, and communication overhead.”
Metadata
- Authors
- Wilbur, M., Samal, C., Talusan, J. P., Yasumoto, K., & Dubey, A.
- Affiliations
- Vanderbilt University (US)
- Nara Institute of Science and Technology (JP)
- Venue
- 2020 IEEE 23rd International Symposium on Real-Time Distributed Computing (ISORC)
- Publisher
- IEEE
- Published
- 2020-05
- Pages
- 56-64
- OpenAlex
- W3035523410
- Cited by
- 8
- References
- 1
- Citations by year
- 2024: 3 · 2023: 2 · 2021: 2 · 2020: 1
- FWCI
- 0.48
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- Locations
- IEEE International Symposium on Real-Time Distributed Computing (ISORC) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Social Sciences › Transportation › Transportation Planning and Optimization
- Keywords
- federated learning, time-dependent routing, fog computing, smart cities, autonomous vehicles, online collaborative learning, prediction model, disaster resilience
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review