TY - JOUR
T1 - Trust-Enhanced Game Incentive for Secure Quantum Federated Learning in UAV-Assisted Wireless Networks
AU - Xu, Qichao
AU - Li, Ruidong
AU - Qi, Yihao
AU - Su, Zhou
AU - Fang, Dongfeng
N1 - Publisher Copyright:
© IEEE. 1983-2012 IEEE.
PY - 2025
Y1 - 2025
N2 - Recently, quantum federated learning (QFL) is advocated to leverage the robust computing power of quantum edge computing devices (QECDs) within unmanned aerial vehicle (UAV)-assisted wireless networks, to enhance the efficiency of distributed learning. However, the presence of malicious and selfish behaviors among some QECDs poses significant challenges for QFL model training to achieve high accuracy and rapid convergence. To tackle this issue, we introduce a trust-enhanced incentive scheme for QFL in the UAV-assisted wireless networks. Specifically, a QECD-empowered QFL framework is first presented in the UAV-assisted wireless networks, where the QECDs independently train local models with their private data by using the quantum computing capabilities, while UAVs aggregate these trained local models to update the global model. Then, to ensure security and eliminate malicious participants, we devise a Bayesian inference-based trust assessment mechanism to select honest QECDs for local model training. Furthermore, we design a Stackelberg game-based incentive mechanism to incentivize QECDs to cooperatively provide high-quality training services. Afterwards, through game analysis using the backward induction method, we prove the existence of a Stackelberg equilibrium. The optimal payment strategies of the UAVs are obtained using the deep Q-learning network (DQN) algorithm in dynamic networks, and the optimal training contribution strategy of each QECD is derived using the convex optimization method. Finally, extensive simulations demonstrate that the proposed scheme can significantly enhance the accuracy and training speed of QFL in UAV-assisted wireless networks.
AB - Recently, quantum federated learning (QFL) is advocated to leverage the robust computing power of quantum edge computing devices (QECDs) within unmanned aerial vehicle (UAV)-assisted wireless networks, to enhance the efficiency of distributed learning. However, the presence of malicious and selfish behaviors among some QECDs poses significant challenges for QFL model training to achieve high accuracy and rapid convergence. To tackle this issue, we introduce a trust-enhanced incentive scheme for QFL in the UAV-assisted wireless networks. Specifically, a QECD-empowered QFL framework is first presented in the UAV-assisted wireless networks, where the QECDs independently train local models with their private data by using the quantum computing capabilities, while UAVs aggregate these trained local models to update the global model. Then, to ensure security and eliminate malicious participants, we devise a Bayesian inference-based trust assessment mechanism to select honest QECDs for local model training. Furthermore, we design a Stackelberg game-based incentive mechanism to incentivize QECDs to cooperatively provide high-quality training services. Afterwards, through game analysis using the backward induction method, we prove the existence of a Stackelberg equilibrium. The optimal payment strategies of the UAVs are obtained using the deep Q-learning network (DQN) algorithm in dynamic networks, and the optimal training contribution strategy of each QECD is derived using the convex optimization method. Finally, extensive simulations demonstrate that the proposed scheme can significantly enhance the accuracy and training speed of QFL in UAV-assisted wireless networks.
KW - UAV-assisted wireless networks (UAWNs)
KW - game-based incentive
KW - quantum federated learning (QFL)
KW - trust assessment
UR - https://www.scopus.com/pages/publications/105005165633
U2 - 10.1109/JSAC.2025.3568054
DO - 10.1109/JSAC.2025.3568054
M3 - 文章
AN - SCOPUS:105005165633
SN - 0733-8716
VL - 43
SP - 2841
EP - 2856
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 8
ER -