Research On Resource Allocation In Mobile Base Station Networks

In some certain applications, when the communication networks in the work area have not been deployed, or have been severely damaged, in order to offer the user necessary communications services, there is a need to deploy a communication system which can enter the area quickly and can be installed in a short time. Such systems also need the ability to change their real-time coverage areas based on the process of the particular application. Since it is difficult for the detailed planning and optimization in advance, the location of the communication access point is also restricted to the actual conditions. Such communication systems must have topologies which can be adjusted dynamically. Driven by such a growing demand, the base station device mounted on a mobile platform has attracted increasing attention. Based on the research background, this article gives the concept and classification of mobile base stations and describes a typical application case. However, related works did not started a long time ago, there still exist many technical issues to be studied. Among these issues, an important one is about the complex interference condition caused by dynamic irregular topology. Therefore, how to manage spectrum resources to coordinate the interference cased by the movement of mobile base stations and further improve resource utilization is an important problem. At the same time, how to improve network performance by designing a mobility strategy is another key issue. Focus on spectrum resource allocation and path planning, this article studied resource allocation techniques for mobile base stations. Since the mobile base station network has the requirement for robustness, the distributed feature was considered when designing all the algorithms proposed in this paper. The main contents and contributions of this paper consist of the following two aspects:A dynamic spectrum resources allocation algorithm based on graph theory was proposed. Using this algorithm, spectrum resources can be utilized efficiently even if the interference is complex. At first, a priority policy of resource allocation based on the dwell time was presented. This priority policy can distinguish different impacts of neighbor base stations with different movement directions. From the perspective of interference graph, two proposed resource allocation mechanisms were compared and the equations of average number of neighbors and resource utilization index were derived. Based on these studies, a distributed dynamic spectrum resource block allocation algorithm with low complexity was proposed. Simulation results show that the algorithm can improve resource utilization and maintain good fairness.A distributed load balancing algorithm based on base station path planning was proposed. At first, in order to ensure rapidity and practicality, a distributed path planning algorithm based on virtual force method was proposed, mobile base stations use the load differences between them to determine their next new locations. The paper derived the convergence of the distributed algorithm theoretically. Simulation results show that the proposed algorithm has a rapid convergence. Compared with the power-based load balancing method, the proposed algorithm is more suitable for situations where user distribution is extremely uneven.