Papers › Vehicle Selection for C-V2X Mode 4 Based Federated Edge Learning Systems

Vehicle Selection for C-V2X Mode 4 Based Federated Edge Learning Systems

14 Jan 2024arXiv:2401.07224links table onlyarchive 2025-07-28

Qiong Wu, Xiaobo Wang, Pingyi Fan, Qiang Fan, Huiling Zhu, Jiangzhou Wang

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Federated learning (FL) is a promising technology for vehicular networks to protect vehicles' privacy in Internet of Vehicles (IoV). Vehicles with limited computation capacity may face a large computational burden associated with FL. Federated edge learning (FEEL) systems are introduced to solve such a problem. In FEEL systems, vehicles adopt the cellular-vehicle to everything (C-V2X) mode 4 to upload encrypted data to road side units' (RSUs)' cache queue. Then RSUs train the data transmitted by vehicles, update the locally model hyperparameters and send back results to vehicles, thus vehicles' computational burden can be released. However, each RSU has limited cache queue. To maintain the stability of cache queue and maximize the accuracy of model, it is essential to select appropriate vehicles to upload data. The vehicle selection method for FEEL systems faces challenges due to the random departure of data from the cache queue caused by the stochastic channel and the different system status of vehicles, such as remaining data amount, transmission delay, packet collision probability and survival ability. This paper proposes a vehicle selection method for FEEL systems that aims to maximize the accuracy of model while keeping the cache queue stable. Extensive simulation experiments demonstrate that our proposed method outperforms other baseline selection methods.

PaperPDFCode

Code

qiongwu86/vehicle-selection-for-c-v2x officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections