Vu Van Quang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Vu Van Quang has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Nguyen Cong Luong
Phenikaa School of Computing, Phenikaa University, Hanoi Vietnam
1 shared publication - Nguyen Thi Thanh Van
Faculty of Electrical and Electronic Engineering, Phenikaa University, Hanoi, Vietnam
1 shared publication
Latest Publications
- Open Access
- 22 September 2022
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications) in Journal of Computer Science and Cybernetics
- Vol. 38 (3) , 245-256
JOINT POWER COST AND LATENCY MINIMIZATION FOR SECURE COLLABORATIVE LEARNING SYSTEM
This work investigates the model update security in a collaborative learning or federated learning network by using the covert communication. The CC uses the jamming signal and multiple friendly jammers (FJs) are deployed that can offer jamming services to the model owner, i.e., a base station (BS). To enable the BS to select the best FJ, i.e., the lowest cost FJ, a truthful auction is adopted. Then, a problem is formulated to optimize the jamming power, transmission power, and local accuracy. The objective is to minimize the training latency, subject to the security performance requirement and budget of the BS. To solve the non-convex problem, we adopt a Successive Convex Approximation algorithm. The simulation results reveals some interesting things. For example, the trustful auction reduces the jamming cost of the BS as the number of FJs increases.
- 22 September 2022
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications) in Journal of Computer Science and Cybernetics
- Vol. 38 (3) , 245-256
Open AccessJOINT POWER COST AND LATENCY MINIMIZATION FOR SECURE COLLABORATIVE LEARNING SYSTEM
This work investigates the model update security in a collaborative learning or federated learning network by using the covert communication. The CC uses the jamming signal and multiple friendly jammers (FJs) are deployed that can offer jamming services to the model owner, i.e., a base station (BS). To enable the BS to select the best FJ, i.e., the lowest cost FJ, a truthful auction is adopted. Then, a problem is formulated to optimize the jamming power, transmission power, and local accuracy. The objective is to minimize the training latency, subject to the security performance requirement and budget of the BS. To solve the non-convex problem, we adopt a Successive Convex Approximation algorithm. The simulation results reveals some interesting things. For example, the trustful auction reduces the jamming cost of the BS as the number of FJs increases.