Cross-system link adaptive scheduling method, device and equipment and storage medium

Abstract

The embodiment of the invention discloses a cross-system link adaptive scheduling method and device, equipment and a storage medium. The method comprises the following steps: firstly, acquiring a queue to be transmitted, determining a clustering number K according to the total load length of data packets in the queue, and then dividing the data packets into K clusters by combining CQIs (Channel Quality Indicator) corresponding to the data packets and a clustering algorithm; and for each cluster, obtaining the minimum CQI corresponding to the data packet, determining the target spectrum efficiency through a preset CQI mapping table, and screening out the highest-order modulation coding mode which does not exceed the target spectrum efficiency as the final modulation coding mode through a modulation coding scheme table. And during sending, sending is performed according to the number of the data packets contained in the clusters from high to low, and the higher the number is, the higher the sending sequence of the clusters is. According to the invention, the CQI difference of the data packets in the physical frame can be greatly reduced, the throughput of the user equipment with high channel quality is remarkably improved, and both the transmission reliability and the spectrum resource utilization rate are considered.

Description

TECHNICAL FIELD

[0001] Embodiments of the present application relate to the field of satellite communication, and particularly relate to a cross-standard link adaptive scheduling method and device, equipment and storage medium. BACKGROUND

[0002] In a satellite-terrestrial communication hybrid system, the downlink uses a DVB-S2 (Digital Video Broadcasting-Second Generation Satellite) physical layer, which supports adaptive coding and modulation. The uplink uses 5G NR (New Radio), and the user equipment reports channel quality indicators on the physical uplink control channel. The physical frame of DVB-S2 must specify a unified modulation and coding mode when transmitting. However, a physical frame usually carries MAC (Media Access Control) PDUs (Protocol Data Units) of multiple user equipment.

[0003] In order to ensure transmission reliability, if multiple user equipment with large differences in channel quality are multiplexed in a physical frame, the base station must select the modulation and coding mode of the entire physical frame according to the worst channel quality. This causes user equipment with good channel quality to be forced to use low-order modulation to transmit data, greatly wasting the precious spectrum resources and throughput of the satellite. SUMMARY

[0004] Embodiments of the present application provide a cross-standard link adaptive scheduling method, device, equipment and storage medium, which clusters data packets in a transmission queue according to channel quality indicators to obtain multiple clusters, then determines the modulation and coding mode of the data packets in the clusters according to the channel quality indicators, and preferentially fills the data packets in the clusters containing a large number of data packets into a physical frame for transmission, thereby greatly reducing the difference between the channel quality indicators corresponding to the data packets in the same physical frame, and using higher-order modulation and coding modes to transmit the data packets in the clusters with higher average channel quality indicators, thereby significantly improving the throughput of user equipment with high channel quality.

[0005] In a first aspect, embodiments of the present application provide a cross-standard link adaptive scheduling method, comprising: obtaining a transmission queue, and determining the number K of clusters based on the total payload length of the data packets contained in the transmission queue; dividing the data packets in the transmission queue into K clusters according to the CQI corresponding to each data packet in the transmission queue, the number K of clusters and a set clustering algorithm; For each cluster, the minimum CQI value corresponding to the data packets within the cluster is obtained. A pre-set CQI mapping table containing the mapping relationship between CQI and spectral efficiency is queried. The spectral efficiency corresponding to the minimum value is determined as the target spectral efficiency. A pre-defined modulation and coding scheme table containing the mapping relationship between modulation and coding schemes and spectral efficiency is queried. From the modulation and coding schemes whose spectral efficiency is less than or equal to the target spectral efficiency, the modulation and coding scheme with the highest spectral efficiency is selected as the final determined modulation and coding scheme. Data packets in each cluster are sent based on the final determined modulation and coding scheme corresponding to each cluster. The more data packets a cluster contains, the earlier it is sent.

[0006] Furthermore, when the clustering algorithm is K-means clustering, the data packets in the queue to be transmitted are divided into K clusters based on the CQI corresponding to each data packet in the queue, the number of clusters K, and the set clustering algorithm, including: Step 1: Determine if there is a historical transmission schedule with a cluster size of K. If yes, generate an initial centroid set based on the K centroids finally determined by the historical transmission schedule. If no, uniformly select K initial centroids within the range of CQI values ​​and store them in the initial centroid set. Step 2: Assign a cluster to each initial centroid in the set of initial centroids, and use the initial centroids as the centroids of the clusters in the first round of iterations; Step 3: In each iteration, calculate the CQI corresponding to each data packet in the queue to be transmitted and the distance between the centroids of each cluster; Each data packet in the queue to be transmitted is assigned to the cluster containing the centroid corresponding to the smallest distance, where each centroid corresponds to one cluster; Calculate the average CQI for all data packets in each cluster, and use the average value as the centroid of that cluster in the next iteration; Step 4: Repeat step 3 until the centroid stops changing or the preset number of iterations is reached, and then stop iterating to obtain K clusters.

[0007] Furthermore, within the range of CQI values, K initial centroids are uniformly selected and stored in the set of initial centroids, including: The difference between the maximum value and the minimum value within the range of CQI is divided by K-1 to obtain the value interval between any two adjacent initial centroids, where K is the number of clusters. The minimum value within the range of CQI values ​​is taken as the first initial centroid. Starting from the first initial centroid, each calculation adds the value interval to the previous initial centroid to obtain a new initial centroid. After K-1 calculations, K-1 initial centroids are obtained. Store the K-1 initial centroids and the first initial centroid into the set of initial centroids.

[0008] Furthermore, the number of clusters K is determined based on the total payload length of the data packets contained in the queue to be transmitted, including: The number of clusters K is calculated using the following formula: in, This indicates the total payload length of the data packets contained in the queue to be transmitted. This indicates the payload length of a single DVB-S2 physical frame. This indicates rounding up to the nearest integer.

[0009] Furthermore, before obtaining the queue to be transmitted, the following steps are also included: Receive the CQI uploaded by the user equipment corresponding to the data packets in the transmission queue. Furthermore, based on the final determined modulation and coding scheme corresponding to each cluster, data packets in each cluster are transmitted, including: If the total length of the payload corresponding to all data packets in the cluster is less than the payload length of a single DVB-S2 physical frame, then after filling all data packets into the DVB-S2 physical frame, the remaining payload space in the DVB-S2 physical frame is filled with padding symbols, and then the DVB-S2 physical frame is sent; or, the data packets in the cluster are left to be sent in the next round of transmission scheduling. If the total length of the payload corresponding to all data packets in the cluster is equal to the payload length of a single DVB-S2 physical frame, then all data packets are filled into the DVB-S2 physical frame and sent directly. If the total length of the payload corresponding to all data packets in the cluster is greater than the payload length of a single DVB-S2 physical frame, then the data packets in the cluster are filled into several DVB-S2 physical frames before being sent. For the remaining data packets in the cluster, the remaining data packets are filled into DVB-S2 physical frames, and then the remaining payload space in the DVB-S2 physical frames is filled with padding symbols before the DVB-S2 physical frames are sent. Alternatively, the remaining data packets can be reserved for the next round of transmission scheduling before being sent.

[0010] Furthermore, after sending the data packets in each cluster based on the final determined modulation and coding scheme corresponding to each cluster, the process also includes: Remove the sent data packets from the transmission sequence.

[0011] In a second aspect, embodiments of this application provide a cross-system link adaptive scheduling device, comprising: The acquisition module is used to acquire the queue to be transmitted; The determination module is used to determine the number of clusters K based on the total payload length of the data packets contained in the queue to be transmitted; The partitioning module is used to divide the data packets in the queue to be transmitted into K clusters based on the CQI corresponding to each data packet in the queue, the number of clusters K, and the set clustering algorithm. The acquisition module is also used to obtain the minimum CQI value of the data packets within each cluster for each of the divisions; The determination module is also used to query a pre-set CQI mapping table containing the mapping relationship between CQI and spectral efficiency, determine the spectral efficiency corresponding to the minimum value as the target spectral efficiency, query a pre-defined modulation and coding scheme table containing the mapping relationship between modulation and coding schemes and spectral efficiency, and select the modulation and coding scheme with the highest spectral efficiency from the modulation and coding schemes whose spectral efficiency is less than or equal to the target spectral efficiency as the finally determined modulation and coding scheme. The sending module is used to send data packets in each cluster based on the final determined modulation and coding scheme corresponding to each cluster. The more data packets a cluster contains, the earlier it is sent.

[0012] In a third aspect, embodiments of this application provide an electronic device, including: a memory and one or more processors; Memory, used to store one or more programs; When one or more programs are executed by one or more processors, the one or more processors implement the cross-system link adaptive scheduling method as described in the first aspect.

[0013] In a fourth aspect, embodiments of this application provide a storage medium for storing computer-executable instructions, which, when executed by a computer processor, are used to perform the cross-standard link adaptive scheduling method as described in the first aspect.

[0014] Beneficial effects: This invention can significantly reduce the gap in channel quality indicators (CQIs) corresponding to data packets within the same physical frame. For clusters with higher average CQIs, a higher-order modulation and coding scheme is used to transmit the data packets within the cluster, thereby significantly improving the throughput of user equipment with high channel quality. Attached Figure Description

[0015] Figure 1 This is a schematic diagram of the cross-system link adaptive scheduling method provided in the embodiments of this application; Figure 2 This is a schematic diagram illustrating the process of dividing data packets in the transmission queue into K clusters, as provided in an embodiment of this application. Figure 3This is a schematic diagram illustrating the process of uniformly selecting K initial centroids within the range of CQI values ​​and storing them in a set of initial centroids, as provided in an embodiment of this application. Figure 4 This is a schematic diagram of the cross-system link adaptive scheduling device provided in the embodiments of this application; Figure 5 This is a schematic diagram of the structure of the electronic device provided in the embodiments of this application. Detailed Implementation

[0016] To make the objectives, technical solutions, and advantages of this application clearer, specific embodiments of this application will be described in further detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are merely for explaining this application and not for limiting it. It should also be noted that, for ease of description, only the parts relevant to this application are shown in the drawings, not all of them. Before discussing exemplary embodiments in more detail, it should be mentioned that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although the flowcharts describe operations (or steps) as sequential processes, many of these operations can be performed in parallel, concurrently, or simultaneously. Furthermore, the order of the operations can be rearranged. The process can be terminated when its operation is completed, but additional steps not included in the drawings may also be present. The above processes can correspond to methods, functions, procedures, subroutines, subroutines, etc.

[0017] In a converged space-ground communication system, the downlink uses the DVB-S2 physical layer and supports adaptive coding and modulation. The uplink uses 5G NR, and user equipment reports channel quality indicators through the physical uplink control channel.

[0018] The existing technology has the following pain points: When transmitting a DVB-S2 physical frame, a uniform modulation and coding scheme must be specified. However, a single physical frame typically carries Media Access Control (MAC) protocol data units from multiple user equipment.

[0019] To ensure transmission reliability, if multiple user equipments with significantly different channel quality are multiplexed within a single physical frame, the base station must select the modulation and coding scheme for the entire physical frame based on the worst-performing channel. This forces user equipments with good channel quality to use low-order modulation to transmit data, resulting in a significant waste of the satellite's valuable spectrum resources and throughput.

[0020] Under high load, there are a large number of data packets in the transmission queue that are sent to user equipment with large differences in channel quality. How to quickly combine the data packets corresponding to user equipment with similar channel quality indicators into a frame is a complex combinatorial optimization problem.

[0021] The cross-mode link adaptive scheduling method provided in this application can be applied to heterogeneous communication networks that use DVB-S2 physical layer for downlink and 5G NR for uplink, especially base stations in heterogeneous communication networks.

[0022] Figure 1 This is a schematic diagram of the cross-system link adaptive scheduling method provided in the embodiments of this application. The cross-system link adaptive scheduling method provided in the embodiments of this application can be executed by the base station.

[0023] refer to Figure 1 The cross-system link adaptive scheduling method includes: Step S101: Obtain the queue to be transmitted, and determine the number of clusters K based on the total payload length of the data packets contained in the queue to be transmitted.

[0024] The transmission queue is a buffered scheduling queue maintained by the base station for sending downlink data to user terminals. Downlink data includes user plane service data and control plane signaling data in the 5G NR standard. User plane service data corresponds to various actual services of user terminals, including general packet data (such as data packets for internet browsing, file download, cloud services, and IoT sensor data transmission), multimedia data (such as multimedia streams such as high-definition video, live streaming, voice calls, and video conferencing), and industry-specific data (such as service data transmission from industry terminals in aerospace and marine monitoring). Control plane signaling data includes radio resource control signaling (such as core signaling for cell reselection, handover, registration, and deregistration of user terminals), media access control signaling (such as scheduling instructions, hybrid automatic repeat request feedback instructions, and power control instructions), and physical layer auxiliary signaling (such as synchronization instructions, reference signal configuration, and channel state information feedback instructions).

[0025] The data packet is a MAC PDU that encapsulates downlink data according to the DVB-S2 specification. Each MAC (Media Access Control) PDU (Protocol Data Unit) corresponds to a user terminal, which is used to receive the MAC PDU.

[0026] The payload length is the length of the data in the MAC PDU excluding the overhead fields of the MAC layer (such as user identifier, PDU length, checksum, frame delimiter, etc.). The total payload length is the sum of the payload lengths of all MAC PDUs in the queue to be transmitted.

[0027] Wherein, the number of clusters K is the total number of clusters obtained after dividing all MAC PDUs in the transmission queue.

[0028] In one implementation, determining the number of clusters K based on the total payload length of the data packets contained in the queue to be transmitted can be: The number of clusters K is calculated using the following formula: in, This indicates the total payload length of the data packets contained in the queue to be transmitted. This indicates the payload length of a single DVB-S2 physical frame. This indicates rounding up to the nearest integer.

[0029] The method described above for calculating the number of clusters avoids situations where a single physical frame exceeds its payload length due to carrying too many MAC PDUs, leading to transmission errors or data loss. During subsequent clustering, all MAC PDUs can be allocated to these K clusters, preventing wasted frame resources or capacity exceeding limits due to too many or too few groups.

[0030] In one implementation, before acquiring the queue to be transmitted, the method further includes: Receive the CQI (Channel Quality Indicator) uploaded by the user equipment corresponding to the data packets in the queue to be transmitted.

[0031] The user equipment configures the parameters for uploading CQI (including upload period, upload format, etc.) based on the downlink control signaling issued by the base station.

[0032] User equipment calculates CQI by measuring the pilot signal of the downlink of DVB-S2.

[0033] User equipment reports CQI on fixed resources of PUCCH (Physical Uplink Control Channel) based on the upload period.

[0034] If a sudden event occurs during an upload cycle, the user equipment will immediately report the latest obtained CQI, instead of waiting until the end of the current upload cycle. Sudden events include events such as the absolute value of the change in CQI values ​​between two consecutive measurements being greater than a set threshold (e.g., CQI changing from 10 to 5, the absolute value of the change is 5, which is greater than the set threshold of 3), resumption of communication after a communication interruption, and beam switching (i.e., the user terminal switching between different beams of the satellite).

[0035] Step S102: Divide the data packets in the queue to be transmitted into K clusters according to the CQI corresponding to each data packet in the queue to be transmitted, the number of clusters K, and the set clustering algorithm.

[0036] The clustering algorithm set can be either K-means clustering or Gaussian mixture model clustering.

[0037] Here, a cluster refers to a collection containing multiple data packets.

[0038] Figure 2 This is a schematic diagram illustrating the process of dividing data packets in a transmission queue into K clusters, as provided in an embodiment of this application. (Reference) Figure 2 When the clustering algorithm is K-means clustering, the data packets in the queue to be transmitted are divided into K clusters based on the CQI corresponding to each data packet in the queue, the number of clusters K, and the set clustering algorithm. These clusters include: Step S201: Determine whether there is a historical transmission schedule with a cluster size of K. If yes, generate a set of initial centroids based on the K centroids finally determined by the historical transmission schedule. If no, uniformly select K initial centroids within the range of CQI values ​​and store them in the set of initial centroids.

[0039] If the current round of transmission scheduling is not the first round of transmission scheduling, then it is determined whether the initial centroid can be selected based on the clustering results of historical transmission scheduling. Historical transmission scheduling refers to transmission scheduling with the same number of clusters as the current round of transmission scheduling that was completed before the current round of transmission scheduling. For example, it could be a historical transmission scheduling whose scheduling end time is closest to the start time of the current round of transmission scheduling.

[0040] Generating the initial centroid based on historical transmission schedules can accelerate the convergence speed of clustering algorithms.

[0041] Figure 3 This is a schematic diagram illustrating the process of uniformly selecting K initial centroids within the range of CQI values ​​and storing them in the set of initial centroids, as provided in the embodiments of this application.

[0042] Furthermore, within the range of CQI values, K initial centroids are uniformly selected and stored in the set of initial centroids, including: Step S301: Subtract the minimum value from the maximum value within the range of CQI values ​​and divide the difference by K-1 to obtain the value interval between any two adjacent initial centroids, where K is the number of clusters. Step S302: Take the minimum value within the range of CQI values ​​as the first initial centroid. Starting from the first initial centroid, each calculation adds the value interval to the previously obtained initial centroid to obtain a new initial centroid. After K-1 calculations, K-1 initial centroids are obtained. Step S303: Store the K-1 initial centroids and the first initial centroid, including the first initial centroid, into the set of initial centroids.

[0043] Satellite communication scheduling delays are strictly limited (the transmission period of DVB-S2 frames is fixed, and clustering must be completed before frame assembly), which does not allow clustering algorithms to perform a large number of iterations. Therefore, compared with the method of randomly generating centroids, the above-mentioned method of selecting initial centroids can fully cover the CQI value range, avoid initial centroids being too close, thereby effectively improving the convergence speed of clustering, avoiding the clustering results from getting trapped in local optima, and effectively ensuring the achievement of the goal of this invention to group data packets with similar CQI into the same physical frame for transmission to improve the throughput of user equipment with high channel quality.

[0044] Step S202: Assign a cluster to each initial centroid in the set of initial centroids, and use the initial centroids as the centroids of the clusters in the first round of iterations.

[0045] Step S203: In each iteration, calculate the CQI corresponding to each data packet in the queue to be transmitted and the distance between the centroids of each cluster; Each data packet in the queue to be transmitted is assigned to the cluster containing the centroid corresponding to the smallest distance, where each centroid corresponds to one cluster; Calculate the average CQI for all data packets in each cluster, and use the average value as the centroid of that cluster in the next iteration.

[0046] Step S204: Repeat step S203 until the centroid stops changing or the preset number of iterations is reached, and K clusters are obtained.

[0047] The statement that the centroid no longer changes means that the average CQI of all data packets in each cluster remains unchanged in two adjacent iterations.

[0048] Step S103: For each cluster obtained, obtain the minimum CQI value corresponding to the data packet within the cluster, query the pre-set CQI mapping table containing the mapping relationship between CQI and spectral efficiency, determine the spectral efficiency corresponding to the minimum value as the target spectral efficiency, query the pre-defined modulation and coding scheme table containing the mapping relationship between modulation and coding scheme and spectral efficiency, and select the modulation and coding scheme with the highest spectral efficiency from the modulation and coding schemes whose spectral efficiency is less than or equal to the target spectral efficiency as the final determined modulation and coding scheme.

[0049] Spectral efficiency refers to a standard quantitative indicator in the field of communications, with units of bit / s / Hz, where bit is a bit, s is a second, and Hz is a hertz. Spectral efficiency represents the maximum number of effective bits that a communication link can reliably transmit within a unit bandwidth (1 hertz) and a unit time (1 second).

[0050] In this invention, the spectrum efficiency specifically refers to the actual supportable spectrum efficiency of the DVB-S2 downlink, rather than the spectrum efficiency of 5G NR.

[0051] The CQI mapping table refers to a pre-set, configurable one-dimensional mapping table that represents the correspondence between each CQI value (0~15) and the maximum spectral efficiency that the DVB-S2 downlink can support. For example, CQI=3 corresponds to a spectral efficiency of 1.2 bit / s / Hz, CQI=7 corresponds to 3.5 bit / s / Hz, and CQI=12 corresponds to 6.8 bit / s / Hz, meaning there is a positive correlation between CQI and spectral efficiency.

[0052] In DVB-S2, modulation and coding schemes refer to the combination of modulation scheme and channel coding rate, and are core transmission parameters specified by the physical layer for physical frames. Modulation schemes in DVB-S2 include QPSK, 8PSK, 16APSK, 32APSK, and 256APSK. The channel coding rate in DVB-S2 uses LDPC+BCH concatenated coding, with the code rate being the number of effective bits after coding divided by the number of original bits, such as 1 / 2, 3 / 5, 2 / 3, 3 / 4, 9 / 10, etc. (Lower code rates result in higher redundancy, stronger transmission reliability, and lower spectral efficiency; conversely, higher code rates result in higher spectral efficiency and weaker reliability). The DVB-S2 standard predefines multiple modulation and coding schemes (such as QPSK-1 / 2, 8PSK-3 / 4, 16APSK-9 / 10, and 32APSK-9 / 10), each corresponding to a fixed spectral efficiency.

[0053] The modulation and coding scheme table refers to a predefined mapping table based on the DVB-S2 standard. This mapping maps modulation and coding schemes to the spectral efficiencies achievable under those schemes. Each modulation and coding scheme corresponds to a unique spectral efficiency, and the spectral efficiency monotonically increases with the order of the modulation and coding scheme (e.g., the frequency efficiencies of QPSK-1 / 2, 8PSK-3 / 4, 16APSK-9 / 10, and 32APSK-9 / 10 show an increasing characteristic).

[0054] Step S103 maximizes the use of satellite spectrum resources while ensuring the transmission reliability of the user terminal with the worst channel quality within the cluster.

[0055] Step S104: Send data packets in each cluster based on the final determined modulation and coding scheme corresponding to each cluster. The more data packets a cluster contains, the earlier it is sent.

[0056] In one implementation, for data packets within the same cluster, the higher the corresponding CQI value, the earlier the data packet is sent.

[0057] In one implementation, data packets in each cluster are transmitted based on the final determined modulation and coding scheme corresponding to each cluster, including: If the total length of the payload corresponding to all data packets in the cluster is less than the payload length of a single DVB-S2 physical frame, then after filling all data packets into the DVB-S2 physical frame, the remaining payload space in the DVB-S2 physical frame is filled with padding symbols, and then the DVB-S2 physical frame is sent; or, the data packets in the cluster are left to be sent in the next round of transmission scheduling. If the total length of the payload corresponding to all data packets in the cluster is equal to the payload length of a single DVB-S2 physical frame, then all data packets are filled into the DVB-S2 physical frame and sent directly. If the total length of the payload corresponding to all data packets in the cluster is greater than the payload length of a single DVB-S2 physical frame, then the data packets in the cluster are filled into several DVB-S2 physical frames before being sent. For the remaining data packets in the cluster, the remaining data packets are filled into DVB-S2 physical frames, and then the remaining payload space in the DVB-S2 physical frames is filled with padding symbols before the DVB-S2 physical frames are sent. Alternatively, the remaining data packets can be reserved for the next round of transmission scheduling before being sent.

[0058] Among them, padding symbols refer to physical layer special symbols predefined by the DVB-S2 standard that have no actual service or signaling meaning. They are one of the basic transmission units that constitute a DVB-S2 physical frame and are only used to fill the blank space of the effective payload area of ​​the physical frame to ensure frame format compliance. They do not carry any user plane or control plane data themselves and will be directly identified and discarded by the user terminal after demodulating the physical frame.

[0059] The use of padding symbols to fill the remaining payload space in the DVB-S2 physical frame refers to filling the remaining space in the payload area of ​​the physical frame with padding symbols after filling all the MAC PDU payloads in the cluster into the payload area of ​​the physical frame in accordance with the DVB-S2 protocol format.

[0060] Filling a cluster of data packets into several DVB-S2 physical frames means filling the data packets in the cluster into the physical frames one by one until a certain number of physical frames are filled.

[0061] In one implementation, after transmitting data packets in each cluster based on the final determined modulation and coding scheme corresponding to each cluster, the method further includes: Remove the sent data packets from the transmission sequence.

[0062] The above deletion operation can avoid duplicate transmission and ensure the validity of the results of the user terminal parsing the physical frame.

[0063] As can be seen from the above, this application first determines the number of clusters K according to the total load of the queue to be transmitted, and then uniformly initializes the centroids to group MAC PDUs with similar CQI into the same cluster. The target spectral efficiency and the optimal modulation and coding scheme are matched according to the minimum CQI within the cluster. This not only ensures the transmission reliability of the user terminal with the worst channel quality within the cluster, but also avoids the spectrum waste caused by global low-order modulation.

[0064] Figure 4 This is a schematic diagram of a cross-system link adaptive scheduling device provided in an embodiment of this application. (Reference) Figure 4 The cross-system link adaptive scheduling device includes: Module 401 is used to acquire the queue to be transmitted; The determination module 402 is used to determine the number of clusters K based on the total payload length of the data packets contained in the queue to be transmitted; The partitioning module 403 is used to divide the data packets in the queue to be transmitted into K clusters according to the CQI corresponding to each data packet in the queue to be transmitted, the number of clusters K, and the set clustering algorithm; The acquisition module 401 is also used to acquire the minimum CQI value corresponding to the data packets within each cluster for each of the divisions; The determining module 402 is also used to query a pre-set CQI mapping table containing the mapping relationship between CQI and spectral efficiency, determine the spectral efficiency corresponding to the minimum value as the target spectral efficiency, query a pre-defined modulation and coding scheme table containing the mapping relationship between modulation and coding schemes and spectral efficiency, and select the modulation and coding scheme with the highest spectral efficiency from the modulation and coding schemes whose spectral efficiency is less than or equal to the target spectral efficiency as the finally determined modulation and coding scheme. The sending module 404 is used to send data packets in each cluster based on the final determined modulation and coding scheme corresponding to each cluster, wherein the more data packets contained in each cluster, the earlier they are sent.

[0065] In one implementation, when the clustering algorithm is K-means clustering, the partitioning module 403 is specifically used to perform: Step 1: Determine if there is a historical transmission schedule with a cluster size of K. If yes, generate an initial centroid set based on the K centroids finally determined by the historical transmission schedule. If no, uniformly select K initial centroids within the range of CQI values ​​and store them in the initial centroid set. Step 2: Assign a cluster to each initial centroid in the set of initial centroids, and use the initial centroids as the centroids of the clusters in the first round of iterations; Step 3: In each iteration, calculate the CQI corresponding to each data packet in the queue to be transmitted and the distance between the centroids of each cluster; Each data packet in the queue to be transmitted is assigned to the cluster containing the centroid corresponding to the smallest distance, where each centroid corresponds to one cluster; Calculate the average CQI for all data packets in each cluster, and use the average value as the centroid of that cluster in the next iteration; Step 4: Repeat step 3 until the centroid stops changing or the preset number of iterations is reached, and then stop iterating to obtain K clusters.

[0066] In one implementation, the partitioning module 403 is specifically used for: The difference between the maximum value and the minimum value within the range of CQI is divided by K-1 to obtain the value interval between any two adjacent initial centroids, where K is the number of clusters. The minimum value within the range of CQI values ​​is taken as the first initial centroid. Starting from the first initial centroid, each calculation adds the value interval to the previous initial centroid to obtain a new initial centroid. After K-1 calculations, K-1 initial centroids are obtained. Store the K-1 initial centroids and the first initial centroid into the set of initial centroids.

[0067] In one implementation, the determining module 402 is specifically used for: The number of clusters K is calculated using the following formula: in, This indicates the total payload length of the data packets contained in the queue to be transmitted. This indicates the payload length of a single DVB-S2 physical frame. This indicates rounding up to the nearest integer.

[0068] In one embodiment, the cross-system link adaptive scheduling device further includes: The receiving module is used to receive the CQI uploaded by the user equipment corresponding to the data packets in the queue to be transmitted before acquiring the queue to be transmitted. In one embodiment, the sending module 404 is specifically used for: If the total length of the payload corresponding to all data packets in the cluster is less than the payload length of a single DVB-S2 physical frame, then after filling all data packets into the DVB-S2 physical frame, the remaining payload space in the DVB-S2 physical frame is filled with padding symbols, and then the DVB-S2 physical frame is sent; or, the data packets in the cluster are left to be sent in the next round of transmission scheduling. If the total length of the payload corresponding to all data packets in the cluster is equal to the payload length of a single DVB-S2 physical frame, then all data packets are filled into the DVB-S2 physical frame and sent directly. If the total length of the payload corresponding to all data packets in the cluster is greater than the payload length of a single DVB-S2 physical frame, then the data packets in the cluster are filled into several DVB-S2 physical frames before being sent. For the remaining data packets in the cluster, the remaining data packets are filled into DVB-S2 physical frames, and then the remaining payload space in the DVB-S2 physical frames is filled with padding symbols before the DVB-S2 physical frames are sent. Alternatively, the remaining data packets can be reserved for the next round of transmission scheduling before being sent.

[0069] In one embodiment, the cross-system link adaptive scheduling device further includes: The deletion module is used to delete the transmitted data packets from the transmission sequence after transmitting the data packets in each cluster based on the final determined modulation and coding scheme corresponding to each cluster.

[0070] It is worth noting that in the embodiments of the cross-system link adaptive scheduling device described above, the various units and modules included are only divided according to functional logic, but are not limited to the above division, as long as the corresponding functions can be achieved; in addition, the specific names of each functional unit are only for easy differentiation and are not used to limit the protection scope of the embodiments of this application.

[0071] This application also provides an electronic device that can integrate the cross-system link adaptive scheduling device provided in this application. Figure 5 This is a schematic diagram of the structure of the electronic device provided in an embodiment of this application. (Reference) Figure 5 The electronic device includes: an input device 53, an output device 54, a memory 52, and one or more processors 51; the memory 52 is used to store one or more programs; when one or more programs are executed by one or more processors 51, the one or more processors 51 implement the cross-standard link adaptive scheduling method provided in the above embodiments. The input device 53, output device 54, memory 52, and processor 51 can be connected via a bus or other means. Figure 5 Taking the example of a connection between China and Israel via a bus.

[0072] The memory 52, as a computing device-readable storage medium, can be used to store software programs, computer-executable programs, and modules, such as program instructions / modules corresponding to the cross-standard link adaptive scheduling method provided in any embodiment of this application (e.g., the acquisition module 401, determination module 402, partitioning module 403, and sending module 404 in the cross-standard link adaptive scheduling device). The memory 52 may primarily include a program storage area and a data storage area. The program storage area may store the operating system and at least one application program required for a function; the data storage area may store data created based on device usage, etc. Furthermore, the memory 52 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 52 may further include memory remotely located relative to the processor 51, and these remote memories can be connected to the device via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0073] Input device 53 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the device. Output device 54 may include display devices such as a display screen.

[0074] The processor 51 executes various functional applications and data processing of the device by running software programs, instructions and modules stored in the memory 52, thereby realizing the above-mentioned cross-system link adaptive scheduling method.

[0075] The cross-system link adaptive scheduling device, equipment, and computer provided above can be used to execute the cross-system link adaptive scheduling method provided in any of the above embodiments, and have corresponding functions and beneficial effects.

[0076] This application embodiment also provides a storage medium for storing computer-executable instructions, which, when executed by a computer processor, are used to perform the cross-standard link adaptive scheduling method provided in the above embodiment. The cross-standard link adaptive scheduling method includes: Obtain the queue to be transmitted, and determine the number of clusters K based on the total payload length of the data packets contained in the queue to be transmitted; The data packets in the queue to be transmitted are divided into K clusters based on the CQI corresponding to each data packet in the queue to be transmitted, the number of clusters K, and the set clustering algorithm. For each cluster, the minimum CQI value corresponding to the data packets within the cluster is obtained. A pre-set CQI mapping table containing the mapping relationship between CQI and spectral efficiency is queried. The spectral efficiency corresponding to the minimum value is determined as the target spectral efficiency. A pre-defined modulation and coding scheme table containing the mapping relationship between modulation and coding schemes and spectral efficiency is queried. From the modulation and coding schemes whose spectral efficiency is less than or equal to the target spectral efficiency, the modulation and coding scheme with the highest spectral efficiency is selected as the final determined modulation and coding scheme. Data packets in each cluster are sent based on the final determined modulation and coding scheme corresponding to each cluster. The more data packets a cluster contains, the earlier it is sent.

[0077] Storage medium – any type of memory device or storage device. The term “storage medium” is intended to include: mounting media, such as CD-ROMs, floppy disks, or magnetic tape devices; computer system memory or random access memory, such as DRAM, DDR RAM, SRAM, EDO RAM, Rambus RAM, etc.; non-volatile memory, such as flash memory, magnetic media (e.g., hard disks or optical storage); registers or other similar types of memory elements, etc. Storage media may also include other types of memory or combinations thereof. Furthermore, storage media may reside in a first computer system in which a program is executed, or may reside in a different second computer system connected to the first computer system via a network (such as the Internet). The second computer system can provide program instructions to the first computer for execution. The term “storage medium” can include two or more storage media that may reside in different locations (e.g., in different computer systems connected via a network). Storage media may store program instructions (e.g., specifically implemented as a computer program) executable by one or more processors.

[0078] Of course, the computer-executable instructions stored in the storage medium provided in the embodiments of this application are not limited to the cross-system link adaptive scheduling method provided above, but can also perform related operations in the cross-system link adaptive scheduling method provided in any embodiment of this application.

[0079] The cross-system link adaptive scheduling device, equipment, and storage medium provided in the above embodiments can execute the cross-system link adaptive scheduling method provided in any embodiment of this application. For technical details not described in detail in the above embodiments, please refer to the cross-system link adaptive scheduling method provided in any embodiment of this application.

[0080] The above description is merely a preferred embodiment and the technical principles employed in this application. This application is not limited to the specific embodiments provided herein, and various obvious changes, readjustments, and substitutions that can be made by those skilled in the art will not depart from the scope of protection of this application. Therefore, although this application has been described in detail through the above embodiments, this application is not limited to the above embodiments, and may include many other equivalent embodiments without departing from the concept of this application, the scope of which is determined by the scope of the claims.

Claims

1. A cross-mode link adaptation scheduling method, characterized in that, The method comprises the following steps: acquiring a to-be-transmitted queue, determining a cluster number K based on a total payload length of data packets contained in the to-be-transmitted queue; dividing the data packets in the to-be-transmitted queue into K clusters according to CQI corresponding to each data packet in the to-be-transmitted queue, the cluster number K and a set cluster algorithm; for each cluster obtained by the division, acquiring a minimum value of CQI corresponding to data packets in the cluster, querying a pre-set CQI mapping table containing a mapping relationship between CQI and spectral efficiency, determining a spectral efficiency corresponding to the minimum value as a target spectral efficiency, querying a pre-defined modulation and coding scheme table containing a mapping relationship between a modulation and coding mode and spectral efficiency, and selecting a modulation and coding mode with the highest spectral efficiency from the modulation and coding modes with spectral efficiency less than or equal to the target spectral efficiency as a finally determined modulation and coding mode; sending the data packets in each cluster based on the finally determined modulation and coding mode corresponding to each cluster, wherein the more data packets contained in each cluster, the earlier the sending order.

2. The cross-scheduling link adaptation method of claim 1, wherein, When the cluster algorithm is a K-means clustering algorithm, the step of dividing the data packets in the to-be-transmitted queue into K clusters according to CQI corresponding to each data packet in the to-be-transmitted queue, the cluster number K and a set cluster algorithm comprises the following steps: Step 1: determining whether there is a historical sending scheduling with a cluster number of K, if yes, generating a set of initial centroids based on K centroids finally determined by the historical sending scheduling, and if no, uniformly selecting K initial centroids in a value range of CQI and storing the K initial centroids in the set of initial centroids; Step 2: respectively assigning an initial centroid in the set of initial centroids to a cluster, and taking the initial centroid as a centroid of the cluster in a first round of iteration; Step 3: in each round of iteration, respectively calculating a distance between CQI corresponding to each data packet in the to-be-transmitted queue and a centroid of each cluster; respectively assigning each data packet in the to-be-transmitted queue to a cluster in which a centroid corresponding to a minimum distance is located, wherein each centroid corresponds to a cluster; respectively calculating an average value of CQI corresponding to all data packets in each cluster, and taking the average value as a centroid of the cluster in a next round of iteration; Step 4: repeatedly performing Step 3 until the centroid no longer changes or a preset number of iteration rounds is reached, and then stopping iteration to obtain K clusters.

3. The cross-scheduling link adaptation method of claim 2, wherein, The step of uniformly selecting K initial centroids in a value range of CQI and storing the K initial centroids in the set of initial centroids comprises the following steps: dividing a difference between a maximum value in the value range of CQI and a minimum value in the value range of CQI by K-1 to obtain a value interval between any two adjacent initial centroids, wherein K is a cluster number; taking the minimum value in the value range of CQI as a first initial centroid, and starting from the first initial centroid, calculating a new initial centroid by adding the value interval to a previous initial centroid each time, and obtaining K-1 initial centroids after K-1 times of calculation; storing K initial centroids including the K-1 initial centroids and the first initial centroid in the set of initial centroids.

4. The cross-scheduling link adaptation method of claim 1, wherein, The cluster number K is determined based on a total payload length of the data packets contained in the to-be-transmitted queue, including: The cluster number K is calculated using the following formula: wherein, denotes the total payload length of the data packets contained in said queue to be transmitted, denotes the payload length of a single DVB-S2 physical frame, denotes the ceiling function.

5. The cross-scheduling link adaptation method of claim 1, wherein, Before the to-be-transmitted queue is acquired, further including: Receiving the CQI uploaded by the user equipment corresponding to the data packets in the to-be-transmitted queue.

6. The cross-scheduling link adaptation method of claim 1, wherein, The data packets in each cluster are transmitted based on the finally determined modulation and coding mode corresponding to each cluster, including: If the total length of the payloads corresponding to all the data packets in the cluster is less than the payload length of a single DVB-S2 physical frame, after filling all the data packets into the DVB-S2 physical frame, the remaining payload space in the DVB-S2 physical frame is filled with padding symbols, and then the DVB-S2 physical frame is transmitted, or the data packets in the cluster are left for transmission in the next round of transmission scheduling; If the total length of the payloads corresponding to all the data packets in the cluster is equal to the payload length of a single DVB-S2 physical frame, after filling all the data packets into the DVB-S2 physical frame, the DVB-S2 physical frame is directly transmitted; If the total length of the payloads corresponding to all the data packets in the cluster is greater than the payload length of a single DVB-S2 physical frame, after filling the data packets in the cluster into several DVB-S2 physical frames, the remaining data packets are filled into a DVB-S2 physical frame, and then the remaining payload space in the DVB-S2 physical frame is filled with padding symbols, and then the DVB-S2 physical frame is transmitted, or the remaining data packets are left for transmission in the next round of transmission scheduling.

7. The cross-scheduling link adaptation method of claim 6, wherein, After the data packets in each cluster are transmitted based on the finally determined modulation and coding mode corresponding to each cluster, further including: The transmitted data packets are deleted from the to-be-transmitted queue.

8. A cross-system link adaptive scheduling device, characterized in that, Including: An acquisition module, configured to acquire a to-be-transmitted queue; A determination module, configured to determine a cluster number K based on a total payload length of data packets contained in the to-be-transmitted queue; A division module, configured to divide the data packets in the to-be-transmitted queue into K clusters according to CQI corresponding to each data packet in the to-be-transmitted queue, the cluster number K, and a set clustering algorithm; The acquisition module is further configured to acquire, for each cluster obtained by division, a minimum value of CQI corresponding to data packets in the cluster; The determination module is further configured to query a CQI mapping table containing a mapping relationship between CQI and spectral efficiency, determine a spectral efficiency corresponding to the minimum value as a target spectral efficiency, query a modulation and coding scheme table containing a mapping relationship between modulation and coding modes and spectral efficiency, and select, from modulation and coding modes with spectral efficiency less than or equal to the target spectral efficiency, a modulation and coding mode with the highest spectral efficiency as a finally determined modulation and coding mode; A transmission module, configured to transmit data packets in each cluster based on a finally determined modulation and coding mode corresponding to each cluster, wherein the more data packets contained in each cluster, the earlier the transmission order.

9. An electronic device, comprising: Including: A memory and one or more processors; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the cross-standard link adaptation scheduling method according to any one of claims 1-7.

10. A storage medium storing computer-executable instructions, wherein: The computer executable instructions, when executed by a computer processor, perform the cross-standard link adaptation scheduling method according to any one of claims 1-7.

Images