Federated Learning for Task and Resource Allocation in Wireless High Altitude Balloon Networks

Sihua Wang, Mingzhe Chen, Changchuan Yin, Walid Saad, Choong Seon Hong, Shuguang Cui, H. Vincent Poor

TL;DR

This paper introduces a proactive resource allocation framework for High Altitude Balloon (HAB) networks equipped with mobile edge computing. By leveraging a novel Support Vector Machine (SVM)-based Federated Learning algorithm, the system predicts optimal user-balloon associations locally and cooperatively, reducing overall energy and latency by up to 16.1% without exposing private user data.

What Problem Does This Paper Address?

High Altitude Balloons (HABs) operating in the stratosphere are emerging as a promising solution for wide-area wireless coverage due to their low deployment costs and large footprint. By equipping these flying base stations with Mobile Edge Computing (MEC) capabilities, they can process computational tasks offloaded by ground users directly, bypassing the significant delays associated with long-haul backhaul links to terrestrial clouds.

Fig. 1. An illustration of the considered MEC-enabled HAB network model.

However, managing these networks is highly challenging. Ground users generate tasks with data sizes that vary dynamically over time. To minimize energy consumption and latency, the network must constantly adjust three things: user association (which user connects to which balloon), service sequence (the order in which tasks are processed via Time Division Multiple Access), and task partitioning (how much data is processed locally on the device vs. offloaded to the balloon). Traditional optimization techniques require global knowledge of every user's task data, creating massive communication overhead and processing delays. Furthermore, sharing raw historical user data between balloons to train machine learning models is too energy-expensive and raises privacy concerns.

Methods

The authors tackle this joint optimization problem by splitting it into a two-stage framework:

  1. Proactive User Association via SVM-based Federated Learning (FL): Instead of relying on a centralized controller or purely isolated local learning, the HABs cooperatively train a multi-classification SVM model. Crucially, the authors introduce a structure matrix ($\Omega_m$) into the FL process. Rather than simply averaging the parameters of local models (as in standard FL), this matrix captures the underlying relationships and correlations between the association schemes of different HABs. The training is performed distributively using a quadratic approximation method to solve the local dual optimization problems.
  2. Service Sequence and Task Allocation Optimization: Once the user associations are predicted by the SVM-FL model, the remaining optimization problem decouples independently for each HAB. The authors mathematically prove (Theorem 1) that the optimal service sequence follows an ascending order of task processing times, which can be easily sorted using a simple algorithm like bubble sort. With the sequence fixed, the task allocation problem becomes a standard convex optimization problem that is solved efficiently using standard toolboxes like CVX.

Datasets

The framework was evaluated using real-world city cellular traffic data obtained from the OMNILab at Shanghai Jiao Tong University. The data size of the cellular traffic within the dataset was utilized to simulate the fluctuating computational task sizes of the ground users over time.

Key Insights and Ideas

  • Proactive vs. Reactive Management: Instead of waiting for users to request tasks and then running heavy iterative optimization algorithms (which adds massive delay), the HABs use historical traffic patterns to predict optimal associations ahead of time.
  • Smart Federated Learning: Standard federated learning often suffers from performance degradation because it blindly averages local models. Introducing the structure matrix allows the balloons to learn how their coverage zones and user behaviors correlate, bridging the performance gap between distributed and centralized learning.
  • Complexity Reduction: By predicting user association first, a daunting mixed-integer non-linear programming problem is reduced to a simple sorting mechanism and a straightforward convex optimization problem.

Key Results

  • Resource Efficiency: Simulation results show that the proposed algorithm reduces the weighted sum of energy and time consumption for all users by up to 16.1% compared to conventional centralized methods and 26.7% compared to purely local learning.
  • High Prediction Accuracy: The SVM-based FL algorithm achieves up to a 90% accuracy rate in predicting optimal user associations, trailing the communication-heavy global learning baseline (which requires sharing all raw data) by a mere 3%.
  • Cooperative Gain: The proposed federated approach yields up to a 19.4% gain in accuracy over a baseline where HABs perform SVM learning purely locally without collaboration.

Limitations and Future Work

While the proposed algorithm demonstrates strong performance, the authors note a slight trade-off in convergence speed: the federated approach requires roughly 16.7% more iterations to converge compared to global or isolated local learning due to the overhead of exchanging model parameters.

Additionally, the system model assumes relatively stable or tethered HAB positions. Future work could expand this framework to accommodate highly dynamic balloon topologies, wind-induced drift, and the integration of deep reinforcement learning to handle continuous, fast-changing state spaces.

Summary updated

Abstract

In this paper, the problem of minimizing energy and time consumption for task computation and transmission is studied in a mobile edge computing (MEC)-enabled balloon network. In the considered network, each user needs to process a computational task in each time instant, where high-altitude balloons (HABs), acting as flying wireless base stations, can use their powerful computational abilities to process the tasks offloaded from their associated users. Since the data size of each user's computational task varies over time, the HABs must dynamically adjust the user association, service sequence, and task partition scheme to meet the users' needs. This problem is posed as an optimization problem whose goal is to minimize the energy and time consumption for task computing and transmission by adjusting the user association, service sequence, and task allocation scheme. To solve this problem, a support vector machine (SVM)-based federated learning (FL) algorithm is proposed to determine the user association proactively. The proposed SVM-based FL method enables each HAB to cooperatively build an SVM model that can determine all user associations without any transmissions of either user historical associations or computational tasks to other HABs. Given the prediction of the optimal user association, the service sequence and task allocation of each user can be optimized so as to minimize the weighted sum of the energy and time consumption. Simulations with real data of city cellular traffic from the OMNILab at Shanghai Jiao Tong University show that the proposed algorithm can reduce the weighted sum of the energy and time consumption of all users by up to 16.1% compared to a conventional centralized method.
BibTeX
@article{wang2020federated,
  author = {Sihua Wang and Mingzhe Chen and Changchuan Yin and Walid Saad and Choong Seon Hong and Shuguang Cui and H. Vincent Poor},
  title = {{Federated Learning for Task and Resource Allocation in Wireless High Altitude Balloon Networks}},
  journal = {IEEE Internet of Things Journal},
  year = {2020},
  doi = {10.1109/jiot.2021.3080078},
}
Figure