4.7 Article

Auction-Promoted Trading for Multiple Federated Learning Services in UAV-Aided Networks

Journal

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
Volume 71, Issue 10, Pages 10960-10974

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2022.3184026

Keywords

Training; Data models; Smart devices; Computational modeling; Companies; Smart phones; Servers; Multiple federated learning services; one-sided matching; reverse auction; trading; UAV-aided networks; VCG

Funding

  1. National Natural Science Foundation of China [61971365, 61871339, 62171392]
  2. Digital Fujian Province Key Laboratory of IoT Communication, Architecture and Safety Technology [2010499]
  3. State Key Program of the National Natural Science Foundation of China [61731012]
  4. Natural Science Foundation of Fujian Province of China [2021J01004]

Ask authors/readers for more resources

This paper investigates the problem of trading multiple federated learning services in UAV-aided networks. An auction-based market is established to facilitate the trading among buyers (FL service demanders), data-sellers (smart devices), and UAV-sellers (UAVs). Mechanisms based on VCG and one-sided matching are proposed to maximize buyers' revenue, and their properties are analyzed. Extensive experimental results demonstrate the superiority of the proposed mechanisms.
Federated learning (FL) represents a promising distributed machine learning paradigm that allows smart devices to collaboratively train a shared model via providing local data sets. However, problems considering multiple co-existing FL services and different types of service providers are rarely studied. In this paper, we investigate a multiple FL service trading problem in Unmanned Aerial Vehicle (UAV)-aided networks, where FL service demanders (FLSDs) aim to purchase various data sets from feasible clients (smart devices, e.g., smartphones, smart vehicles), and model aggregation services from UAVs, to fulfill their requirements. An auction-based trading market is established to facilitate the trading among three parties, i.e., FLSDs acting as buyers, distributed located client groups acting as data-sellers, and UAVs acting as UAV-sellers. The proposed auction is formalized as a 0-1 integer programming problem, aiming to maximize the overall buyers' revenue via investigating winner determination and payment rule design. Specifically, since two seller types (data-sellers and UAV-sellers) are considered, an interesting idea integrating seller pair and joint bid is introduced, which turns diverse sellers into virtual seller pairs. Vickrey-Clarke-Groves (VCG)-based, and one-sided matching-based mechanisms are proposed, respectively, where the former achieves the optimal solutions, which, however, is computationally intractable. While the latter can obtain suboptimal solutions that approach to the optimal ones, with low computational complexity, especially upon considering a large number of participants. Significant properties such as truthfulness and individual rationality are comprehensively analyzed for both mechanisms. Extensive experimental results verify the properties and demonstrate that our proposed mechanisms outperform representative methods significantly.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available