论文标题
无线高海拔气球网络中的任务和资源分配的联合学习
Federated Learning for Task and Resource Allocation in Wireless High Altitude Balloon Networks
论文作者
论文摘要
在本文中,在移动边缘计算(MEC)启用的气球网络中研究了任务计算和传输的能量和时间消耗的问题。在所考虑的网络中,每个用户需要在每次瞬间处理一项计算任务,在这种情况下,高空气球(HABS)充当飞行无线基站,可以使用其强大的计算能力来处理从其关联用户卸载的任务。由于每个用户的计算任务的数据大小随时间变化,因此HAB必须动态调整用户关联,服务顺序和任务分区方案,以满足用户的需求。该问题被视为一个优化问题,其目标是通过调整用户关联,服务顺序和任务分配方案来最大程度地减少任务计算和传输的能量和时间消耗。为了解决此问题,提出了支持向量机(SVM)的联合学习(FL)算法,以主动确定用户关联。提出的基于SVM的FL方法使每个HAB能够合作构建一个SVM模型,该模型可以确定所有用户关联,而无需将用户历史关联或计算任务传输到其他HAB。鉴于最佳用户关联的预测,可以优化每个用户的服务顺序和任务分配,以最大程度地减少能量和时间消耗的加权总和。与传统的集中式方法相比,上海若o汤大学的综合综合征的真实数据模拟表明,拟议的算法可以将所有用户的能源和时间消耗的加权总和最多减少16.1%。
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.