A reservation-based multi-beam concurrent communication resource allocation method

Abstract

The application provides a reservation-based multi-beam concurrent communication resource allocation method, which comprises the following steps: step one, constructing an initial allocation set; step two, constructing a resource conflict application set; step three, finding an idle time period; step four, allocating beam resources; and step five, generating a result and updating. The application firstly establishes a resource conflict model, then deduces the construction method of the application set of time conflicts through the resource conflict model, and finally realizes the reservation of communication resources at any time in the future through the continuous iterative updating of the application set of time conflicts and the resource conflict application set, so that the reservation use demand of the user terminal for the communication resources at future time can be better met.

Description

Technical Field

[0001] This invention belongs to the field of satellite communication technology and relates to communication resource allocation, specifically to a method for multi-beam concurrent communication resource allocation based on reservation. Background Technology

[0002] Multibeam communication systems are advanced wireless communication systems based on beamforming technology, achieving efficient data transmission by simultaneously using multiple beams. They are widely used in satellite communication, 5G / 6G mobile communication, and many other fields. With the continuous development of multibeam communication technology, future user terminals will have increasingly flexible demands for communication resources. They not only require efficient access to communication resources in the present moment but also expect to be able to reserve future communication resources in advance to meet their diverse service needs and multi-task planning.

[0003] Chinese invention patent CN113692051B, entitled "A Method for Cross-Band Position Resource Allocation in Beam-hopping Satellites," proposes a method for cross-band position resource allocation in beam-hopping satellite scenarios. This method addresses the resource allocation problem when a user terminal moves across band positions in a beam-hopping satellite environment. By designing an onboard control module, the method utilizes beam-hopping information from the source and destination band positions to determine the resources available to the mobile terminal, enabling seamless cross-band resource switching. The method is simple in principle, highly operable, and reliably reliable.

[0004] Chinese invention patent application CN117979449A, entitled "A Dynamic Low-Earth Orbit Multi-Satellite Beam-hopping Resource Allocation Method Based on Time Slicing," proposes a method for efficiently allocating time, frequency, and power resources in scenarios with overlapping coverage among multiple satellites. This method, based on a fairness model, incorporates considerations for load balancing and dynamic coverage variations, effectively improving overall system throughput while ensuring fairness in resource allocation.

[0005] The two existing technologies described above differ in their approaches. The first focuses primarily on real-time beam hopping resource allocation, emphasizing the allocation and optimization of beam resources as user terminals move across beam positions to meet real-time communication needs and improve resource utilization efficiency. The second technology, while still focused on real-time beam hopping resource allocation, fails to consider forward-looking planning for future service demands and cannot meet user terminals' needs for reserving communication resources for future times. Summary of the Invention

[0006] As can be seen from the analysis in the background technology, most current multi-beam resource allocation algorithms focus on real-time resource allocation, emphasizing meeting the immediate needs of current services in order to achieve efficient resource utilization. This real-time-oriented allocation strategy often neglects the forward-looking planning and resource reservation arrangements for future service needs, lacks consideration for the scenario of future communication resource reservation, and cannot meet the user terminal's need for future communication resource reservation.

[0007] In view of the shortcomings of the existing technology, the purpose of this invention is to provide a reservation-based multi-beam concurrent communication resource allocation method, which solves the technical problem that the ability of user terminals to meet the reservation needs of communication resources for future times needs to be further improved in the existing technology.

[0008] To solve the above-mentioned technical problems, the present invention adopts the following technical solution:

[0009] A reservation-based method for allocating multi-beam concurrent communication resources, comprising the following steps:

[0010] Step 1: Construct the initial allocation set .

[0011] Step 2: Construct a resource conflict request set .

[0012] Step 3: Find a free time slot .

[0013] Step 4: Allocate beam resources.

[0014] Step 5: Generate results and update.

[0015] Compared with the prior art, the present invention has the following technical effects:

[0016] (I) This invention first establishes a resource conflict model, then derives a method for constructing a time conflict request set through the resource conflict model, and finally realizes the reservation of communication resources at any future time through the continuous iterative update of the time conflict request set and the resource conflict request set, which can better meet the user terminal's reservation and use needs for communication resources at future times.

[0017] (II) This invention can be effectively integrated into other existing resource allocation methods, and can quickly extend the traditional real-time resource allocation algorithm to the reservation-based resource allocation method to meet the diverse communication needs of users.

[0018] (III) The present invention has the characteristics of being simple to establish and easy to implement, highly reliable, highly operable and able to meet the user terminal’s need for future time communication resources reservation, and supports communication needs of various application scenarios.

[0019] (IV) This invention is applicable to high and low orbit satellites with on-board processing, and can better meet the user terminal's need for reservation of communication resources in the future. Moreover, this invention can be embedded into other existing resource allocation methods, and can quickly extend the traditional real-time resource allocation algorithm to the reservation-based resource allocation method to meet the diverse communication needs of users, and provide a more comprehensive and adaptable solution for communication system resource management. Attached Figure Description

[0020] Figure 1 This is a flowchart of the reservation-based multi-beam concurrent communication resource allocation method of the present invention.

[0021] Figure 2 This is a schematic diagram of a resource conflict model.

[0022] The specific content of the present invention will be further explained in detail below with reference to the embodiments. Detailed Implementation

[0023] It should be noted that, unless otherwise specified, all models and algorithms in this invention are based on models and algorithms known in the prior art.

[0024] The following are specific embodiments of the present invention. It should be noted that the present invention is not limited to the following specific embodiments. All equivalent modifications made based on the technical solutions of this application fall within the protection scope of the present invention.

[0025] Example:

[0026] This embodiment presents a reservation-based method for allocating multi-beam concurrent communication resources. This method is used for satellites with onboard processing capabilities, specifically high-orbit and / or low-orbit satellites. One beam is used to provide coverage within the ground area. Individual users provide communication services, among which > ;like Figure 1 As shown, the method includes the following steps:

[0027] Step 1: Construct the initial allocation set :

[0028] like Figure 1 As shown, let the current set of booked applications be... For a new resource application , According to the resource conflict model, in Searching for and For resource requests with time conflicts, construct a set of time-conflicting resource requests; this set of time-conflicting resource requests is the initial allocation set. , Not here Resource requests submitted in this application will not be included in this resource allocation.

[0029] In step one, the conflict types in the resource conflict model are divided into three types: the application start point is within the scope, the application end point is within the scope, and the application covers the entire time period.

[0030] In this embodiment, the resource conflict model is constructed using a commonly known method in the art. Typically, the start and end times of various resource requests are not consecutive, therefore, it is necessary to consider the possibility of time conflicts between tasks. The resource conflict model is as follows: Figure 2 As shown, Figure 2 The document outlines all possible scenarios, and therefore, this invention categorizes them into three conflict types: application start point within the scope, application end point within the scope, and application covering the entire time period.

[0031] First, when the resource application situation is as follows Figure 2 As shown in application 1, the start time of the resource application is less than tStart, while the end time of the application falls within [tStart, tEnd]. This situation meets the conflict type of "application end point is within range".

[0032] Second, when the resource application situation is as follows Figure 2 As shown in application 2, the resource application end time is greater than tEnd, but the application start time falls within [tStart, tEnd]. This situation meets the conflict type of "application start time is within range".

[0033] Third, when the resource application situation is as follows Figure 2 As shown in application 3, the start and end times of the resource application are not in [tStart, tEnd], but the start time of the application is less than tStart and the end time of the application is greater than tEnd. This situation meets the conflict type of "application covering the entire time period".

[0034] Fourth, when the resource application situation is as follows Figure 2 As shown in application 4, where both the start and end times of the resource application fall within [tStart, tEnd], this situation meets both the conflict type of "application start point is within range" and the conflict type of "application end point is within range".

[0035] In this embodiment, an initial allocation set is constructed. The pseudocode is shown in Table 1.

[0036] Table 1 Constructing the initial allocation set pseudocode

[0037]

[0038] In step one, resource application The data structure is Each resource application corresponds to a reservation request for a specific resource, where:

[0039] For the first The resource application number of each resource application;

[0040] For the first The user ID of the applicant for each resource application;

[0041] For the first The target user ID for each resource application;

[0042] Indicates the first The earliest start time for a resource application;

[0043] Indicates the first The latest deadline for each resource application;

[0044] Indicates the first Data transmission duration for each resource request;

[0045] Indicates the first The bandwidth required for each resource request.

[0046] In step one, the currently booked application collection is as follows: , ,in:

[0047] This indicates the total number of current reservations;

[0048] This indicates the maximum number of resources each user can reserve;

[0049] This indicates the number of users within the ground coverage area.

[0050] Step 2: Construct a resource conflict request set :

[0051] like Figure 1 As shown, in Searching for and Construct a resource conflict set from the resource request set. ,in Before resource allocation begins, it is assumed that... All applications and There are no resource conflicts, that is .

[0052] Step 3: Find a free time slot :

[0053] like Figure 1 As shown, in Find free time slots , and All applications are free from time conflicts and meet the requirements. ,in:

[0054] Indicates the earliest start time;

[0055] E Indicates the latest end time;

[0056] L Indicates the duration of data transmission.

[0057] Step 4, allocate beam resources:

[0058] like Figure 1 As shown, with The resource request in the request serves as a constraint, based on this request. bandwidth ,exist Resource allocation is performed to assign beam resources for this application task.

[0059] In step three, the resource allocation algorithm used is any traditional real-time resource allocation algorithm known in the art.

[0060] Step 5: Generate Results and Update:

[0061] like Figure 1 As shown, if resource allocation is successful, the resource allocation result will be generated; if resource allocation fails, then... Select the resource request with the longest task duration. As a constraint, that is, satisfying ;renew and ,Will from Remove from the list and add to the list. In the middle, that is, satisfying and Repeat steps three and four until the optimal solution is found or resource allocation fails; where:

[0062] Indicates the first One resource application;

[0063] Indicates the sequence number of the resource request;

[0064] This indicates the sequence number corresponding to the resource request with the longest task duration.

[0065] The pseudocode for the reservation-based multi-beam concurrent communication resource allocation method in this embodiment is shown in Table 2.

[0066] Table 2. Pseudocode for a reservation-based multi-beam concurrent communication resource allocation method.

[0067]

[0068] Those skilled in the art will understand that a reservation-based multi-beam concurrent communication resource allocation method can be implemented through hardware or software related to program instructions. When executed, this program performs the steps included in the embodiments described above. Content not described in detail in this specification is common knowledge to those skilled in the art.

Claims

1. A method for allocating multi-beam concurrent communication resources based on reservation, characterized in that, The method includes the following steps: Step 1: Construct the initial allocation set : Let the current set of booked applications be... For a new resource application , According to the resource conflict model, in Searching for and For resource requests with time conflicts, construct a set of time-conflicting resource requests; this set of time-conflicting resource requests is the initial allocation set. , Not here Resource requests submitted in this application will not be included in this resource allocation. The resource conflict model described above categorizes conflict types into three types: application start point within the scope, application end point within the scope, and application covering the entire time period. In step one, resource application The data structure is Each resource application corresponds to a reservation request for a specific resource, where: For the first The resource application number of each resource application; For the first The user ID of the applicant for each resource application; For the first The target user ID for each resource application; Indicates the first The earliest start time for a resource application; Indicates the first The latest deadline for each resource application; Indicates the first Data transmission duration for each resource request; Indicates the first The bandwidth required for each resource request; Step 2: Construct a resource conflict request set : exist Searching for and Construct a resource conflict set from the resource request set. ,in Before resource allocation begins, it is assumed that... All applications and There are no resource conflicts, that is ; Step 3: Find a free time slot : exist Find free time slots , and All applications are free from time conflicts and meet the requirements. ; Step 4, allocate beam resources: by The resource request in the request serves as a constraint, based on this request. bandwidth ,exist Resource allocation will be performed to allocate beam resources for this application task; Step 5: Generate Results and Update: If resource allocation is successful, the resource allocation result will be generated; if resource allocation fails, the result will be generated in the following steps. Select the resource request with the longest task duration. As a constraint, that is, satisfying ;renew and ,Will from Remove from the list and add to the list. In the middle, that is, satisfying and Repeat steps three and four until the optimal solution is found or resource allocation fails; where: Indicates the first One resource application; Indicates the sequence number of the resource request; This indicates the sequence number corresponding to the resource request with the longest task duration.

2. The method for allocating multi-beam concurrent communication resources based on reservation as described in claim 1, characterized in that, In step one, the currently booked application collection is as follows: , ,in: This indicates the total number of current reservations; This indicates the maximum number of resources each user can reserve; This indicates the number of users within the ground coverage area.

Images