Research On Multi-link Resource Allocation For Airborne Tasks

In today's information age,people want to break down time and space restrictions and exchange information anytime,anywhere.Facing the impact of high-speed rail and other means of transportation,the civil aviation industry,which has developed into today's society,hopes to provide passengers with more information and personalized services in order to attract more passengers,improve their competitiveness and obtain more profits.The provision of communication services to passengers during the flight is in line with the current development trend of society.However,airborne communication also faces many problems.In the context of increasingly diversified communication tasks and increasingly heterogeneous links for communication,this article hopes to design reasonable allocation algorithms for different types of tasks.In order to achieve differentiated services,the allocation algorithm can provide communication services,and also guarantee to reduce the operating costs of airlines to improve communication services.Therefore,this paper first divides the task types into indivisible tasks,divisible real-time tasks,and divisible non-real-time tasks.The resource allocation algorithm is also designed to adapt to three different types of tasks.For indivisible tasks,this paper first performs mathematical modeling in accordance with the lowest transmission cost.At the same time,this article also hopes to maximize the utilization of the link,so it also performs mathematical modeling with the goal of maximizing the utilization of the link.This article combines these two problems and uses the greedy algorithm to solve the problem of the lowest transmission cost.To use the greedy algorithm,the amount of link tasks must be maximized.The branch and bound method is used to maximize the link utilization.By using greedy algorithm and branch and bound method,the whole problem is solved.For divisible real-time tasks,this paper first performs mathematical modeling based on the lowest transmission cost,and uses greedy algorithms to solve them.The transmission time of divisible real-time tasks has a limit.When using greedy algorithms,take this limitation as a condition for solving the problem,the task amount of the link is determined,and the problem solving is simplified.For divisible non-real-time tasks,tasks no longer have a limitation on transmission time,but tasks may have different sensitivity to time.Some tasks hope to transfer faster,while some tasks do not care about the transmission time.Therefore,this paper combines price cost and time cost,completes mathematical modeling,and solves the problem by genetic algorithm,so that the overall cost of the task is the lowest.