Pith. sign in

REVIEW

High stable and accurate vehicle selection scheme based on federated edge learning in vehicular networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.01890 v2 pith:IIOPCQSO submitted 2022-08-03 cs.NI

High stable and accurate vehicle selection scheme based on federated edge learning in vehicular networks

classification cs.NI
keywords edgedatavehiclesschemelearningaccuracycachequeue
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Federated edge learning (FEEL) technology for vehicular networks is considered as a promising technology to reduce the computation workload while keeping the privacy of users. In the FEEL system, vehicles upload data to the edge servers, which train the vehicles' data to update local models and then return the result to vehicles to avoid sharing the original data. However, the cache queue in the edge is limited and the channel between edge server and each vehicle is time-varying. Thus, it is challenging to select a suitable number of vehicles to ensure that the uploaded data can keep a stable cache queue in edge server while maximizing the learning accuracy. Moreover, selecting vehicles with different resource statuses to update data will affect the total amount of data involved in training, which further affects the model accuracy. In this paper, we propose a vehicle selection scheme, which maximizes the learning accuracy while ensuring the stability of the cache queue, where the statuses of all the vehicles in the coverage of edge server are taken into account. The performance of this scheme is evaluated through simulation experiments, which indicates that our proposed scheme can perform better than the known benchmark scheme.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.