Joint Client Selection and Bandwidth Allocation Algorithm for Federated Learning

Haneul Ko, Jaewook Lee, Sangwon Seo, Sangheon Pack, Victor C.M. Leung

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)


In federated learning (FL), if the participating mobile devices have low computing power and poor wireless channel conditions and/or they do not have sufficient data for various classes, a long convergence time is required to achieve the desired model accuracy. To address this problem, we first formulate a constrained Markov decision process (CMDP) problem that aims to minimize the average time of rounds while maintaining the numbers of trained data and trained data classes above certain numbers. To obtain the optimal scheduling policy, the formulated CMDP problem is converted into an equivalent linear programming (LP). Additionally, to overcome the problem of the curse of dimensionality in CMDP, we develop a joint client selection and bandwidth allocation algorithm (J-CSBA) that jointly selects appropriate mobile devices and allocates suitable amount of bandwidth to them at each round by considering their data information, computing power, and channel gain. Evaluation results validate that J-CSBA can reduce the convergence time by up to 49% compared to a conventional random scheme.

Original languageEnglish
Pages (from-to)3380-3390
Number of pages11
JournalIEEE Transactions on Mobile Computing
Issue number6
Publication statusPublished - 2023 Jun 1

Bibliographical note

Publisher Copyright:
© 2002-2012 IEEE.


  • Federated learning (FL)
  • bandwidth allocation
  • client selection
  • constrained Markov decision process (CMDP)
  • convergence time
  • joint optimization

ASJC Scopus subject areas

  • Software
  • Electrical and Electronic Engineering
  • Computer Networks and Communications


Dive into the research topics of 'Joint Client Selection and Bandwidth Allocation Algorithm for Federated Learning'. Together they form a unique fingerprint.

Cite this