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

Abstract

High-altitude balloons (HABs) equipped with mobile edge computing (MEC) capabilities provide a flexible solution for on-the-fly processing in ground-level networks. However, the dynamic allocation of these resources is computationally expensive and traditionally requires centralized data collection, leading to significant latency and energy overhead. This paper presents a Support Vector Machine (SVM)-based Federated Learning (FL) framework that enables HABs to collaboratively predict optimal user-to-balloon associations. By incorporating a structure matrix to model inter-HAB relationships and sharing only model weights, the proposed approach reduces total energy and time consumption by up to 16.1% compared to centralized methods, while maintaining near-optimal prediction accuracy.

Introduction

The deployment of tethered High-Altitude Balloons (HABs) in the stratosphere offers a promising infrastructure for extending Mobile Edge Computing (MEC) to ground users, such as autonomous vehicles and mobile devices. These "flying base stations" can process heavy computational tasks offloaded from the ground. However, the dynamic nature of user requests—varying in size and location—presents a complex optimization challenge.

System architecture of MEC-enabled HABs serving ground users via directional mmWave links.

To minimize network-wide latency and energy consumption, three critical decisions must be made in real-time:

  1. User Association: Determining which ground user connects to which HAB.
  2. Service Sequence: Establishing the order in which a balloon processes tasks from its connected users.
  3. Task Allocation: Deciding the fraction of a task to be processed locally versus offloaded to the HAB.

Traditional centralized optimization requires transmitting raw user data (e.g., task sizes, locations) to a central controller, creating a communication bottleneck and increasing energy drain.

Proposed Methodology

To address these challenges, the authors propose a proactive, decentralized approach using SVM-based Federated Learning.

SVM-based Federated Learning

Instead of centralizing raw data, each HAB trains a local SVM model to predict future user associations based on historical data. The balloons then share only their trained model weights. A key innovation is the introduction of a structure matrix ($\Omega_m$) during training. This matrix mathematically captures the correlations and differences between the association schemes of different HABs, allowing the network to build a more accurate global model than standard federated averaging.

Problem Decoupling

The joint optimization of association, sequence, and allocation is a difficult mixed-integer programming problem. The authors simplify this by:

  • Using the FL model to predict the integer-based user association.
  • Proving that the optimal service sequence follows a simple rule: serving users in ascending order of their required processing time.
  • Solving the remaining task allocation as a standard convex optimization problem, which each HAB can perform independently and rapidly.

Performance Evaluation

The framework was evaluated using real-world city cellular traffic data from the OMNILab at Shanghai Jiao Tong University, serving as a proxy for computational task sizes.

Key Results

  • Efficiency Gains: The SVM-based FL algorithm reduced the weighted sum of energy and time consumption by 16.1% compared to centralized SVM and 26.7% compared to local learning.
  • High Accuracy: The federated approach achieved a 19.4% gain in prediction accuracy over local-only models. It reached within 3% of the accuracy of a fully centralized model that had access to all raw data, but without the associated communication overhead.
  • Convergence Trade-offs: While effective, the exchange of parameters for the relationship matrix increased the number of communication rounds, resulting in a 16.7% slower convergence speed compared to local learning.

Conclusion

This research demonstrates that proactive machine learning can effectively replace slow, iterative optimization in HAB-MEC networks. By leveraging federated learning with a structure matrix, the system achieves near-optimal resource allocation with significantly reduced energy and latency. Future work may explore adapting this framework for highly mobile Unmanned Aerial Vehicles (UAVs) or integrating deep reinforcement learning to improve convergence speeds in even more dynamic environments.

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