A method and apparatus for resource allocation for a MF-TDMA based hop-beam reverse link

Abstract

The application discloses a resource allocation method and device for a hop-beam reverse link based on MF-TDMA, and the method comprises the following steps: acquiring the carrier time slot demand numbers of users in a target wave position; arranging the carrier time slot demand numbers in descending order according to their numerical values to generate a first sequence; randomly arranging carriers in a target wave beam to generate a second sequence; distributing the carrier time slot demand numbers to the carriers corresponding to the same sequence number in the second sequence according to the sequence numbers of the carrier time slot demand numbers in the first sequence; if there are unallocated carrier time slot demand numbers in the first sequence, then the unallocated carrier time slot demand numbers are sequentially distributed to the carriers with the largest remaining number of carrier time slots according to their sequence in the first sequence. The application can comprehensively schedule time-frequency two-dimensional resources, effectively improve the system throughput and service satisfaction.

Description

Technical Field

[0001] This invention relates to a resource allocation method and apparatus for a beam-hopping reverse link based on MF-TDMA, belonging to the field of satellite communication technology. Background Technology

[0002] Satellite internet services are characterized by uneven spatial distribution and variable temporal distribution. To better adapt to this unevenness, researchers have proposed beam hopping technology. Current research on beam hopping mainly focuses on forward link scenarios, with limited research on reverse link scenarios. The forward link in beam hopping scenarios typically employs a "beam hopping + single-carrier TDM" working mechanism, while the reverse link, originating from the ground user end, can utilize a "beam hopping + multi-carrier" mechanism, employing MF-TDMA multiple access, resulting in a more complex resource allocation algorithm. Therefore, designing specific resource allocation algorithms for beam hopping reverse link scenarios is particularly important.

[0003] MF-TDMA, as the mainstream system currently used in broadband satellite internet, combines TDMA and FDMA, dividing resources in the time / frequency domain into time slots / carriers, allowing numerous user terminals to share a series of carriers with different rates. However, traditional MF-TDMA resource allocation methods mostly aim to minimize the number of carriers used, while beam hopping is based on time slicing, aiming to serve as many positions as possible within a beam hopping cycle. If beam hopping is combined with MF-TDMA, it is necessary to focus on the time domain to minimize the waste of time domain resources. Summary of the Invention

[0004] The purpose of this invention is to overcome the shortcomings of the prior art and provide a resource allocation method and apparatus for MF-TDMA-based beam hopping reverse links, thereby solving the technical problem that the traditional MF-TDMA resource allocation method cannot meet the resource allocation requirements of combining beam hopping and MF-TDMA, resulting in wasted time-domain resources.

[0005] To achieve the above objectives, the present invention is implemented using the following technical solution:

[0006] In a first aspect, the present invention provides a resource allocation method for a beam-hopping reverse link based on MF-TDMA, comprising:

[0007] Obtain the number of carrier slot requirements for each user within the target frequency band;

[0008] The number of carrier slot requirements is arranged in descending order of their numerical values ​​to generate a first sequence;

[0009] The carriers in the target beam are randomly arranged to generate a second sequence;

[0010] According to the sequence number of each carrier slot demand in the first sequence, it is allocated to the carrier corresponding to the same sequence number in the second sequence;

[0011] If there are unallocated carrier slot requirements in the first sequence, then the unallocated carrier slot requirements are allocated sequentially to the carrier with the largest remaining number of carrier slots at the time of allocation, according to their order in the first sequence.

[0012] Optionally, obtaining the number of carrier slot requirements for each user within the target frequency band includes:

[0013] Obtain the uplink service demand of each user within the target frequency range;

[0014] Calculate the number of carrier slot requirements for each user based on the aforementioned uplink service demands:

[0015]

[0016] In the formula, N i R represents the number of carrier slots required by the i-th user. i Let T be the upstream service demand of the i-th user. sf C0 is the frame length of MF-TDMA, C0 is the capacity of each carrier slot, and ceil is the rounding function.

[0017] Optionally, the step of sequentially allocating the carrier with the largest remaining number of carrier time slots at the time of allocation further includes:

[0018] When the carrier with the largest remaining number of carrier slots is not unique during allocation, the carrier with the smallest sequence number in the second sequence is selected for allocation.

[0019] Secondly, the present invention provides a resource allocation device for a beam-hopping reverse link based on MF-TDMA, the device comprising:

[0020] The demand acquisition module is used to acquire the number of carrier slots required by each user within the target frequency band;

[0021] The first sequence module is used to generate a first sequence by arranging the number of carrier time slot requirements in descending order of their numerical values.

[0022] The second sequence module is used to randomly arrange each carrier in the target beam to generate a second sequence;

[0023] The first allocation module is used to allocate each of the carrier slot demand numbers to the carrier corresponding to the same number in the second sequence according to the sequence number of each carrier slot demand number in the first sequence;

[0024] The second allocation module is configured to, if there are unallocated carrier time slot requirements in the first sequence, allocate the unallocated carrier time slot requirements to the carrier with the largest remaining number of carrier time slots at the time of allocation, according to their order in the first sequence.

[0025] Optionally, obtaining the number of carrier slot requirements for each user within the target frequency band includes:

[0026] Obtain the uplink service demand of each user within the target frequency range;

[0027] Calculate the number of carrier slot requirements for each user based on the aforementioned uplink service demands:

[0028]

[0029] In the formula, N i R represents the number of carrier slots required by the i-th user. i Let T be the upstream service demand of the i-th user. sf C0 is the frame length of MF-TDMA, C0 is the capacity of each carrier slot, and ceil is the rounding function.

[0030] Optionally, the step of sequentially allocating the carrier with the largest remaining number of carrier time slots at the time of allocation further includes:

[0031] When the carrier with the largest remaining number of carrier slots is not unique during allocation, the carrier with the smallest sequence number in the second sequence is selected for allocation.

[0032] Thirdly, the present invention provides an electronic device, including a processor and a storage medium;

[0033] The storage medium is used to store instructions;

[0034] The processor is configured to operate according to the instructions to perform the steps according to the method described above.

[0035] Fourthly, the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the above-described method.

[0036] Compared with the prior art, the beneficial effects achieved by the present invention are as follows:

[0037] This invention provides a resource allocation method and apparatus for a hop beam reverse link based on MF-TDMA. By allocating the number of carrier time slots required by each user to each carrier with the goal of minimizing the maximum number of carrier time slots among all carriers within a beam, fewer time slots are allocated to each carrier within the beam, and fewer hop beam dwell time slots are required for each beam. This will greatly reduce the waste of time domain resources, and can serve as many beams as possible within a limited time, thereby improving system throughput and service satisfaction. Attached Figure Description

[0038] Figure 1 This is a flowchart of a resource allocation method for a beam-hopping reverse link based on MF-TDMA provided in an embodiment of the present invention;

[0039] Figure 2A This is a diagram showing the allocation result of the resource allocation method provided in this embodiment of the invention.

[0040] Figure 2B This is a diagram showing the allocation results of the resource allocation method using the traditional fair polling carrier provided in an embodiment of the present invention;

[0041] Figure 2C This is an allocation result diagram of the resource allocation method using the traditional descending first-fit method provided in an embodiment of the present invention;

[0042] Figure 3 This is a schematic diagram of the hop beam reverse link model provided in an embodiment of the present invention;

[0043] Figure 4 This is a schematic diagram comparing the system throughput of various resource allocation methods provided in the embodiments of the present invention;

[0044] Figure 5 This is a schematic diagram comparing the business satisfaction of various resource allocation methods provided in the embodiments of the present invention. Detailed Implementation

[0045] The present invention will be further described below with reference to the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solution of the present invention, and should not be used to limit the scope of protection of the present invention.

[0046] Example 1:

[0047] In beam-hopping scenarios, the reverse link originates from the ground user end and employs a "beam-hopping + multi-carrier" mechanism. MF-TDMA multiple access is used for carrier / time slot two-dimensional resource scheduling to improve user service satisfaction and system resource utilization. To this end, the following objective function is established: The goal is to minimize the maximum dwell time of each beam while maximizing resource utilization, while meeting user service requirements within the beam slot as much as possible. The objective function is:

[0048]

[0049] In the formula, T m T0 represents the maximum and start times of carrier allocation to users within a wavelength range, φ represents the set of users within the wavelength range, and N represents the set of users within the wavelength range. i The number of carrier slot requirements for the i-th user:

[0050]

[0051] In the formula, R i Let T be the upstream service demand of the i-th user. sf C0 is the frame length of MF-TDMA, C0 is the capacity of each carrier slot, and ceil is the rounding function.

[0052] τ is the time for each carrier time slot:

[0053]

[0054] In the formula, N c M represents the maximum number of carriers within the beam, and M represents the maximum number of time slots that can be allocated to each carrier.

[0055] Due to system resource limitations and the stipulations of the DVB-RCS protocol, in order to efficiently utilize limited resources and avoid resource waste:

[0056] (1) It restricts the time slots of the same user to be continuously allocated to the same carrier channel:

[0057]

[0058] (2) The number of user time slots that can be allocated to each carrier cannot exceed the maximum number of time slots of the carrier:

[0059]

[0060] (3) It limits the power allocated on each carrier channel to not exceed the system's maximum power:

[0061]

[0062] In the formula, N is the number of users within the wavelength range, and P and P' are also represented by their respective numbers. max Power allocated to each carrier and maximum system power; x i,j The time slot state where the i-th user occupies the j-th carrier within the wavelet:

[0063]

[0064] y j The channel state for the j-th carrier:

[0065]

[0066] To obtain the optimal solution to the above objective function, such as Figure 1 As shown, this embodiment provides a resource allocation method for a beam-hopping reverse link based on MF-TDMA, including the following steps:

[0067] Step 101: Obtain the number of carrier slots required by each user within the target frequency band.

[0068] In one optional implementation, obtaining the number of carrier slot requirements for each user within the target frequency band includes:

[0069] Obtain the uplink service demand of each user within the target frequency range;

[0070] Calculate the number of carrier slot requirements for each user based on the aforementioned uplink service demands:

[0071]

[0072] In the formula, N i R represents the number of carrier slots required by the i-th user. i Let T be the upstream service demand of the i-th user. sf C0 is the frame length of MF-TDMA, C0 is the capacity of each carrier slot, and ceil is the rounding function.

[0073] Step 102: Arrange the number of carrier time slot requirements in descending order of their numerical values ​​to generate a first sequence.

[0074] Step 103: Randomly arrange each carrier in the target beam to generate a second sequence.

[0075] Step 104: Assign each of the carrier slot requirements to the carrier corresponding to the same number in the second sequence according to the number of slots required in the first sequence.

[0076] For example, the number of carrier slot requests in the first sequence is allocated to the first carrier in the second sequence, and so on, until the Nth carrier slot request in the first sequence is allocated to the first carrier in the second sequence. c The number of carrier slot requirements is allocated to the Nth slot in the second sequence. c The carriers.

[0077] Step 105: If there are unallocated carrier time slot requirements in the first sequence, i.e., N>N c Then, the unallocated carrier slot demand number will be allocated sequentially to the carrier with the largest remaining number of carrier slots at the time of allocation, according to the order in which they are in the first sequence.

[0078] The carrier that is sequentially allocated to the carrier with the largest remaining number of carrier time slots at the time of allocation further includes:

[0079] When the carrier with the largest remaining number of carrier slots is not unique during allocation, the carrier with the smallest sequence number in the second sequence is selected for allocation.

[0080] After allocation, the maximum number of carrier time slots among all carriers within the wavelet can be obtained, denoted as N. max According to the number of carrier time slots N max Calculate the maximum dwell time T of the hopping beam at this position. B :

[0081] T B =N max ·τ

[0082] That is, the optimization result of the objective function, min(T) m -T0)=T B .

[0083] like Figure 2A , 2B As shown in Figure 2C, in a resource allocation scenario of a beam-hopping reverse link based on MF-TDMA with 4 carriers and 128 carrier slots, among the resource allocation methods provided in this embodiment, the traditional fair polling carrier resource allocation method, and the traditional descending first-fit resource allocation method, the resource allocation method provided in this embodiment has the largest number of carrier slots N. max Minimum, therefore the maximum dwell time T of the hopping beam B Also the smallest.

[0084] To further verify the effectiveness of the resource allocation method for MF-TDMA-based beam hopping reverse links provided in this embodiment, the following method is used: Figure 3 The illustrated hopping beam reverse link model has an LEO satellite altitude of 550 km, a beam radius of 25 km, and a system bandwidth of 125 MHz. All positions are divided into three clusters, each containing seven positions. Each cluster has a time slot window length of 256 hopping beam time slots, with each hopping beam time slot lasting 1 ms. The MF-TDMA frame length is 24 ms, the number of carriers is 50, the number of carrier time slots is 128, and the ATM cell in each carrier time slot is 53 bytes.

[0085] The system throughput was calculated using the resource allocation method provided in this embodiment, the traditional fair polling carrier resource allocation method, and the traditional descending first-fit resource allocation method for this system model. The throughput comparison graph is shown below. Figure 4 As shown in the figure, a comparison chart of service satisfaction calculated based on system throughput using different algorithms is presented. Figure 5As shown. System throughput is the total service volume of users within the allocated bandwidth that can be satisfied, and service satisfaction is the ratio of system throughput to the total system service volume.

[0086] Depend on Figure 4 and Figure 5 As can be seen, compared with other resource allocation methods, the resource allocation method provided in this embodiment is significantly better in terms of system throughput and service satisfaction in each hopping beam cycle. This is because, within the same window size of the hopping beam cycle, in order to meet the service needs of different users within a beam position, the algorithm of this invention obtains fewer carrier allocation slots within the beam, and each beam position requires fewer hopping beam dwell slots. This greatly reduces the waste of time domain resources, allowing more beam positions to be served within a limited time, thereby improving system throughput and service satisfaction.

[0087] Example 2:

[0088] This embodiment provides a resource allocation device for a beam-hopping reverse link based on MF-TDMA, the device comprising:

[0089] The demand acquisition module is used to acquire the number of carrier slots required by each user within the target frequency band;

[0090] The first sequence module is used to generate a first sequence by arranging the number of carrier time slot requirements in descending order of their numerical values.

[0091] The second sequence module is used to randomly arrange each carrier in the target beam to generate a second sequence;

[0092] The first allocation module is used to allocate each of the carrier slot demand numbers to the carrier corresponding to the same number in the second sequence according to the sequence number of each carrier slot demand number in the first sequence;

[0093] The second allocation module is configured to, if there are unallocated carrier time slot requirements in the first sequence, allocate the unallocated carrier time slot requirements to the carrier with the largest remaining number of carrier time slots at the time of allocation, according to their order in the first sequence.

[0094] Optionally, obtaining the number of carrier slot requirements for each user within the target frequency band includes:

[0095] Obtain the uplink service demand of each user within the target frequency range;

[0096] Calculate the number of carrier slot requirements for each user based on the aforementioned uplink service demands:

[0097]

[0098] In the formula, N i R represents the number of carrier slots required by the i-th user.i Let T be the upstream service demand of the i-th user. sf C0 is the frame length of MF-TDMA, C0 is the capacity of each carrier slot, and ceil is the rounding function.

[0099] Optionally, the step of sequentially allocating the carrier with the largest remaining number of carrier time slots at the time of allocation further includes:

[0100] When the carrier with the largest remaining number of carrier slots is not unique during allocation, the carrier with the smallest sequence number in the second sequence is selected for allocation.

[0101] Example 3:

[0102] Based on Embodiment 1, this embodiment provides an electronic device, including a processor and a storage medium;

[0103] The storage medium is used to store instructions;

[0104] The processor is configured to operate according to the instructions to perform the steps according to the method described above.

[0105] Example 4:

[0106] Based on Embodiment 1, this embodiment provides a computer-readable storage medium storing a computer program thereon, which, when executed by a processor, implements the steps of the above-described method.

[0107] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0108] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0109] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0110] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0111] The above description is only a preferred embodiment of the present invention. It should be noted that for those skilled in the art, several improvements and modifications can be made without departing from the technical principles of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.

Claims

1. A resource allocation method for beam-hopping reverse links based on MF-TDMA, characterized in that, include: Obtain the number of carrier slot requirements for each user within the target frequency band; The number of carrier slot requirements is arranged in descending order of their numerical values ​​to generate a first sequence; The carriers in the target beam are randomly arranged to generate a second sequence; According to the sequence number of each carrier slot demand in the first sequence, it is allocated to the carrier corresponding to the same sequence number in the second sequence; If there are unallocated carrier slot requirements in the first sequence, then the unallocated carrier slot requirements are allocated sequentially to the carrier with the largest remaining number of carrier slots at the time of allocation, according to their order in the first sequence. The step of obtaining the number of carrier slot requirements for each user within the target frequency band includes obtaining the uplink service requirements for each user within the target frequency band. Calculate the number of carrier slot requirements for each user based on the aforementioned uplink service demands: ； In the formula, For the first Number of carrier slot requirements per user For the first The upstream business demand of each user For MF-TDMA frame length, The capacity of each carrier slot, This is the floor function.

2. The resource allocation method for beam-hopping reverse links based on MF-TDMA according to claim 1, characterized in that, The carriers that are sequentially allocated to the carriers with the largest remaining number of carrier slots at the time of allocation also include: When the carrier with the largest remaining number of carrier slots is not unique during allocation, the carrier with the smallest sequence number in the second sequence is selected for allocation.

3. A resource allocation device for a beam-hopping reverse link based on MF-TDMA, characterized in that, The device includes: The demand acquisition module is used to acquire the number of carrier slots required by each user within the target frequency band, including: acquiring the uplink service demand of each user within the target frequency band; Calculate the number of carrier slot requirements for each user based on the aforementioned uplink service demands: ； In the formula, For the first Number of carrier slot requirements per user For the first The upstream business demand of each user For MF-TDMA frame length, The capacity of each carrier slot, It is a rounding function; The first sequence module is used to generate a first sequence by arranging the number of carrier time slot requirements in descending order of their numerical values. The second sequence module is used to randomly arrange each carrier in the target beam to generate a second sequence; The first allocation module is used to allocate each of the carrier slot demand numbers to the carrier corresponding to the same number in the second sequence according to the sequence number of each carrier slot demand number in the first sequence; The second allocation module is configured to, if there are unallocated carrier time slot requirements in the first sequence, allocate the unallocated carrier time slot requirements to the carrier with the largest remaining number of carrier time slots at the time of allocation, according to their order in the first sequence.

4. The resource allocation device for MF-TDMA-based beam hopping reverse link according to claim 3, characterized in that, The carriers that are sequentially allocated to the carriers with the largest remaining number of carrier slots at the time of allocation also include: When the carrier with the largest remaining number of carrier slots is not unique during allocation, the carrier with the smallest sequence number in the second sequence is selected for allocation.

5. An electronic device, characterized in that, Including processor and storage media; The storage medium is used to store instructions; The processor is configured to operate according to the instructions to perform the steps of the method according to claim 1 or 2.

6. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the steps of the method described in claim 1 or 2.

Images