{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T18:29:57Z","timestamp":1774895397321,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008629","name":"Info-communications Media Development Authority","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008629","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DSO National Laboratories"},{"name":"AI Singapore Programme","award":["AISG2-RP-2020-019"],"award-info":[{"award-number":["AISG2-RP-2020-019"]}]},{"name":"Energy Research Test-Bed and Industry Partnership Funding Initiative"},{"name":"Energy Grid (EG) 2.0 Programme"},{"name":"DesCartes"},{"name":"Campus for Research Excellence and Technological Enterprise (CREATE) programme"},{"name":"MOE Tier 1","award":["RG87\/22"],"award-info":[{"award-number":["RG87\/22"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Veh. Technol."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tvt.2023.3332898","type":"journal-article","created":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T13:54:01Z","timestamp":1700056441000},"page":"5005-5019","source":"Crossref","is-referenced-by-count":15,"title":["TravellingFL: Communication Efficient Peer-to-Peer Federated Learning"],"prefix":"10.1109","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6529-4958","authenticated-orcid":false,"given":"Vansh","family":"Gupta","sequence":"first","affiliation":[{"name":"Indian Institute of Technology, Delhi, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8291-4855","authenticated-orcid":false,"given":"Alka","family":"Luqman","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1611-9378","authenticated-orcid":false,"given":"Nandish","family":"Chattopadhyay","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8818-6983","authenticated-orcid":false,"given":"Anupam","family":"Chattopadhyay","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7442-7416","authenticated-orcid":false,"given":"Dusit","family":"Niyato","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University, Singapore"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Art. Intell. Statist.","author":"McMahan","year":"2017"},{"key":"ref2","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2019"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2987958"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2019.1800250"},{"key":"ref5","first-page":"4427","article-title":"Federated multi-task learning","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Smith","year":"2017"},{"key":"ref6","article-title":"Federated meta-learning with fast convergence and efficient communication","author":"Chen","year":"2019"},{"key":"ref7","article-title":"Federated collaborative filtering for privacy-preserving personalized recommendation system","author":"Ammad-ud-din","year":"2019"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref9","article-title":"Differentially private federated learning: A client level perspective","author":"Geyer","year":"2017"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/OJCS.2020.2993259"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2021.3124599"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/WorldS450073.2020.9210355"},{"key":"ref13","article-title":"LotteryFL: Personalized and communication-efficient federated learning with lottery ticket hypothesis on non-iid datasets","author":"Li","year":"2020"},{"key":"ref14","first-page":"16937","article-title":"Inverting gradients - how easy is it to break privacy in federated learning?","volume-title":"Proc. 34th Int. Conf. Neural Inf. Process. Syst.","author":"Geiping","year":"2020"},{"key":"ref15","article-title":"Federated learning using peer-to-peer network for decentralized orchestration of model weights","author":"Behera","year":"2021"},{"key":"ref16","article-title":"Peer-to-peer federated learning on graphs","author":"Lalitha","year":"2019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CISS48834.2020.1570617414"},{"key":"ref18","article-title":"Braintorrent: A peer-to-peer environment for decentralized federated learning","author":"Roy","year":"2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00184"},{"key":"ref20","first-page":"473","article-title":"Personalized and private peer-to-peer machine learning","volume-title":"Proc. 21st Int. Conf. Art. Intell. Statist.","author":"Bellet","year":"2018"},{"key":"ref21","first-page":"7865","article-title":"Personalized cross-silo federated learning on non-IID data","volume-title":"Proc. AAAI Conf. Art. Intell.","author":"Huang","year":"2021"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403109"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3105810"},{"key":"ref24","first-page":"864","article-title":"Fully decentralized joint learning of personalized models and collaboration graphs","volume-title":"Proc. 23rd Int. Conf. Art. Intell. Stat.","author":"Zantedeschi","year":"2020"},{"key":"ref25","first-page":"509","article-title":"Decentralized collaborative learning of personalized models over networks","volume-title":"Proc. 20th Int. Conf. Art. Intell. Statist.","author":"Vanhaesebrouck","year":"2017"},{"key":"ref26","first-page":"1388","article-title":"Gossip dual averaging for decentralized optimization of pairwise functions","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Colin","year":"2016"},{"key":"ref27","first-page":"3478","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Koloskova","year":"2019"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-20614-6_16"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86486-6_47"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3118436"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.833122"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.2984332"},{"key":"ref33","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Mach. Learn. Syst.","volume":"1","author":"Bonawitz","year":"2019"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CSCI49370.2019.00218"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2021.3075683"},{"key":"ref36","article-title":"Mobility based network lifetime in wireless sensor networks: A review","volume-title":"Comput. Netw.","volume":"174","author":"Nguyen","year":"2020"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3043716"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2021.3099597"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2906228"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/IV48863.2021.9575211"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3139039"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.5121\/ijmnct.2013.3405"},{"issue":"3","key":"ref43","first-page":"237","article-title":"The euclidean travelling salesman problem is NP-complete","volume-title":"Theor. Comput. Sci.","volume":"4","author":"Papadimitriou","year":"1977"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"issue":"1","key":"ref46","first-page":"635","article-title":"A 3-OPT based simulated annealing algorithm for vehicle routing problems","volume-title":"Comput. Ind. Eng.","volume":"21","author":"Alfa","year":"1991"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2818310"},{"issue":"2","key":"ref48","first-page":"244","article-title":"Vickrey-Clarke-Groves mechanisms and perfect competition","volume-title":"J. Econ. Theory","volume":"42","author":"Makowski","year":"1987"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/icts.2017.8265662"},{"issue":"239","key":"ref50","first-page":"1","article-title":"Docker: Lightweight linux containers for consistent development and deployment","volume":"2014","author":"Merkel","year":"2014","journal-title":"Linux J."},{"issue":"14","key":"ref51","article-title":"Network simulations with the NS-3 simulator","volume":"14","author":"Henderson","year":"2008","journal-title":"SIGCOMM Demonstration"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12331-3_2"},{"key":"ref53","article-title":"On-device federated learning with flower","author":"Mathur","year":"2021"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1023663.1023687"},{"key":"ref55","article-title":"On the convergence of federated optimization in heterogeneous networks","author":"Sahu","year":"2018"},{"key":"ref56","article-title":"Communication-efficient adaptive federated learning","author":"Wang","year":"2022"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3196503"},{"key":"ref58","article-title":"Very deep convolutional networks for large-scale image recognition","author":"Simonyan","year":"2014"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr.2016.90"},{"key":"ref60","article-title":"SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <1mb model size","author":"Iandola","year":"2016"}],"container-title":["IEEE Transactions on Vehicular Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/25\/10504682\/10319101.pdf?arnumber=10319101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T13:30:17Z","timestamp":1713447017000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10319101\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":60,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tvt.2023.3332898","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.21502137","asserted-by":"object"},{"id-type":"doi","id":"10.36227\/techrxiv.21502137.v1","asserted-by":"object"}]},"ISSN":["0018-9545","1939-9359"],"issn-type":[{"value":"0018-9545","type":"print"},{"value":"1939-9359","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]}}}