Incentive Mechanism for Hierarchical Federated Learning Based on Online Double Auction

Abstract

In hierarchical federated learning,energy constrained mobile devices will consume their own resources for participating in model training.In order to reduce the energy consumption of mobile devices,this paper proposes the problem of minimizing the sum of energy consumption of mobile devices without exceeding the maximum tolerance time of hierarchical federated learning.Different training rounds of edge server can select different mobile devices,and mobile devices can also train models under diffe-rent edge servers concurrently.Therefore,this paper proposes ODAM-DS algorithm based on an online double auction mechanism.Based on the optimal stopping theory,the edge server is supported to select the mobile device at the best time,so as to minimize the average energy consumption of the mobile device.Then,the theoretical analysis of the proposed online double auction mechanism proves that it meets the characteristics of incentive compatibility,individual rationality and weak budget equilibrium constraints.Simulation results show that the energy consumption of ODAM-DS algorithm is 19.04% lower than that of the existing HFEL algorithm.

Keywords

• hierarchical federated learning|minimization of energy consumption|online double auction|optimal stopping theory|incentive mechanism design