Data transmission method and device, electronic equipment, storage medium and chip

Abstract

The invention is applied to the technical field of communication, and provides a data transmission method and device, electronic equipment, a storage medium and a chip, in the method, a plurality of data frames are cached in network equipment, and each data frame is to be transmitted to terminal equipment; and the network equipment calculates the priority of each data frame based on the transmission success probability of each data frame so as to determine the first data frame to be transmitted currently. As the transmission success probability for determining the priority is related to the residual transmission time and the complete transmission time corresponding to the data frame, the number and quality of successful transmission of the data frame are considered when the first data frame needing to be transmitted is determined, so that more data frames can be transmitted as successfully as possible.

Description

Technical Field

[0001] This application relates to the field of communications, and in particular, to a data transmission method, apparatus, electronic device, storage medium, and chip. Background Art

[0002] In a wireless communication network, extended reality (XR) technology has advantages such as multiple perspectives and strong interactivity, and can provide users with a brand-new visual experience, with great application value and commercial potential. XR includes technologies such as virtual reality (VR), augmented reality (AR), and mixed reality (MR), and is widely used in many fields such as entertainment, gaming, healthcare, advertising, industry, online education, and engineering. Correspondingly, XR terminal devices may include devices such as VR glasses and AR glasses.

[0003] In some scenarios of XR applications, the service data stream provided by XR terminal devices is usually processed frame by frame, and in different scenarios, each data frame may correspondingly include different contents, and each data frame can be transmitted through multiple data packets. For example, in a video transmission scenario, the service data stream is a data stream formed by several video frames, and a video frame can represent part or all of the content in the video picture. Another example is in a haptic transmission scenario, the service data stream is a data stream formed by several haptic frames, and a haptic frame can represent a haptic information of a user. In these scenarios, when XR terminal devices perform data transmission with network devices such as base stations, since usually only a part of the data of a data frame can be transmitted at a time, generally multiple transmissions are required to successfully transmit a data frame.

[0004] However, due to the latency requirement of data frames, network devices will clear the remaining data of data frames that have not been transmitted within the specified time. At this time, it is very likely that a data frame cannot be completely transmitted to the corresponding XR terminal device, resulting in the invalidation of the data frame. Therefore, in XR scenarios, how to improve the ratio of successful frame transmission has become a problem to be solved. Summary of the Invention

[0005] To solve the above problems, embodiments of this application provide a data transmission method, apparatus, electronic device, storage medium, and chip, which are used to solve the problem of improving the ratio of successful frame transmission.

[0006] In a first aspect, an embodiment of the present application provides a data transmission method. In an extended reality scenario, it includes a first electronic device (for example, a network device below) and multiple second electronic devices (for example, terminal devices below). The first electronic device includes devices such as a base station, and the second electronic devices include devices such as VR glasses and AR glasses. Data frames need to be transmitted between the first electronic device and the multiple second electronic devices. Moreover, during downlink transmission, the first electronic device caches multiple data frames and needs to transmit each data frame to a second electronic device respectively, and different data frames correspond to different second electronic devices. Since there are many data frames to be transmitted and the transmission resources are limited, the first electronic device needs to determine the first data frame to be currently transmitted from the multiple cached data frames. The first electronic device can determine the first data frame to be currently transmitted based on the transmission success probability of each data frame, where the transmission success probability is used to evaluate the probability of a data frame being successfully transmitted. Then, the first electronic device transmits the first data frame to the second electronic device corresponding to the first data frame. Here, the second electronic device corresponding to the first data frame is the second electronic device to which the first data frame is to be transmitted. It can be understood that since the first electronic device considers the transmission success probability of each data frame when determining the first data frame to be currently transmitted, and the transmission success probability is used to evaluate the probability of a data frame being successfully transmitted, the first electronic device can increase the ratio of successfully transmitted data frames among the data frames to be transmitted within a certain period when transmitting the first data frame.

[0007] In a possible implementation of the above first aspect, the data frame is the data frame cached by the first electronic device at the current moment. The current moment is any time point within the delay period, and the starting point of the delay period is the initial moment; the transmission success probability is determined based on the remaining transmission time and the complete transmission time. Among them, the remaining transmission time is the time required for the data frame to be transmitted from the current moment until it is completely transmitted; the complete transmission time is the time required for the data frame to be transmitted from the initial moment until it is completely transmitted. Moreover, the transmission success probability is negatively correlated with both the remaining transmission time and the complete transmission time. It can be understood that the specific data in the data frame will change dynamically during the transmission process. Each time the first electronic device transmits, it needs to determine the data frame cached by the first electronic device at the current moment. When determining the transmission success probability, the remaining transmission time and the complete transmission time are taken into account. Since the remaining transmission time is the time required for the data frame to be transmitted from the current moment until it is completely transmitted, the remaining transmission time can reflect the number of data frames that can be successfully transmitted within a certain period when transmitting the current data frame. The longer the remaining transmission time, the smaller the probability of each data frame being successfully transmitted, and the fewer the number of data frames that can be completely transmitted successfully within a certain time. The complete transmission time is the time required for the data frame to be transmitted from the initial moment until it is completely transmitted, which can reflect whether the current data frame can be transmitted within the specified delay period and can reflect the transmission quality of the data frame, thereby increasing the successful transmission probability of the data frame.

[0008] In a possible implementation of the above first aspect, the transmission success probability, the complete transmission time, and the remaining transmission time may satisfy the following relationship:

[0009] P1 = g(ts) * h(tw)

[0010] Among them, P1 is the transmission success probability; ts is the remaining transmission time; g(ts) is the urgency factor, and the urgency factor is negatively correlated with the remaining transmission time ts; tw is the complete transmission time; h(tw) is the success factor, and the success factor is negatively correlated with the complete transmission time tw. When the remaining transmission time is smaller, the urgency factor is larger, and the transmission success probability is larger; when the complete transmission time is smaller, the success factor is larger, and the transmission success probability is larger.

[0011] In a possible implementation of the above first aspect, the urgency factor g(ts) and the remaining transmission time ts satisfy the following relationship:

[0012]

[0013] Among them, ka is a hyperparameter used to adjust the relationship between the urgency factor and the remaining transmission time. It can be understood that the relationship between the urgency factor g(ts) and the remaining transmission time ts is a non-linear relationship, and it has good robustness.

[0014] In a possible implementation of the above first aspect, the success degree factor h(tw) and the complete transmission time tw satisfy the following relationship:

[0015]

[0016] where D represents the delay period; μ is a hyperparameter used to adjust the relationship between the complete transmission time and the delay period of the data frame; c is a hyperparameter used to adjust the relationship between the complete transmission time and the success degree factor. It can be understood that the urgency factor g(ts) and the remaining transmission time ts are also non-linear relationships, with good robustness.

[0017] In a possible implementation of the above first aspect, the first electronic device can determine the remaining transmission time in the following manner: The first electronic device determines the remaining transmission time of the data frame based on the data frame length of the data frame at the current moment and the historical channel average transmission bit count of the data frame, where the historical channel average transmission bit count is the average number of bits supported for transmission between the first electronic device and the second electronic device corresponding to the data frame within the first historical time period. It can be understood that the first electronic device can record the maximum number of bits supported for transmission at each time point of the channel corresponding to the data frame within the first historical time period, and then average the maximum number of bits at each time point of the channel within the first historical time period to obtain the historical channel average transmission bit count of the channel within the first historical time period. And the specific time period of the first historical time period can be configured in advance. For example, 1 ms before the current moment is used as the time period for calculating the historical channel average transmission bit count each time, and then the maximum number of bits supported for transmission corresponding to each data frame 1 ms before the current moment stored is averaged to obtain the historical channel average transmission bit count. Specifically, there are many calculation methods for the historical channel average transmission bit count, which are not limited here. It can be understood that the historical channel average transmission bit count reflects a trend of the maximum number of bits supported for transmission of the channels corresponding to each data frame, and using the data frame length of the data frame at the current moment and the historical channel average transmission bit count of the data frame can reasonably obtain the remaining transmission time.

[0018] In a possible implementation of the above first aspect, the remaining transmission time ts satisfies:

[0019]

[0020] where q represents the data frame length; represents the historical channel average transmission bit count.

[0021] In a possible implementation of the above first aspect, the complete transmission time tw satisfies:

[0022]

[0023] Wherein, w represents the waiting time for the data frame to wait for transmission, and the waiting time for the data frame to wait for transmission is the time from the initial moment to the current moment; q represents the data frame length; represents the average number of transmitted bits of the historical channel; r represents the current number of transmitted bits of the data frame on the channel, and the current number of transmitted bits of the data frame on the channel is the maximum number of bits that the channel supports for transmission between the first electronic device and the second electronic device corresponding to the data frame at the current moment.

[0024] In a possible implementation of the foregoing first aspect, the first electronic device determines a first data frame to be currently transmitted based on the transmission success probabilities of each data frame, including: the first electronic device calculates a priority score for each data frame according to the transmission success probabilities of each data frame; and determines the first data frame according to each priority score. It can be understood that the first electronic device can calculate the priority scores of each data frame, and the priority scores can intuitively show the priorities of transmitting each data frame, so as to determine the first data frame.

[0025] In a possible implementation of the foregoing first aspect, the priority score of each data frame satisfies:

[0026] Priority = β * f(·) * P1

[0027] Wherein, Priority is the priority score, β is a hyperparameter, f(·) represents a channel dominance factor, and the channel dominance factor is related to the data frame length of the data frame, the current number of transmitted bits of the channel, and the average number of transmitted bits of the historical channel. The current number of transmitted bits of the channel is the maximum number of bits that the channel supports for transmission between the first electronic device and the second electronic device corresponding to the data frame at the current moment; the average number of transmitted bits of the historical channel is the average number of bits that the channel supports for transmission between the first electronic device and the second electronic device corresponding to the data frame within the first historical time period. It can be understood that the explanation of the average number of transmitted bits of the historical channel is as above and will not be elaborated here. It can be understood that the priority score not only considers the transmission success probabilities of each data frame, but also considers the channel dominance situations corresponding to each data frame, which is more scientific and reasonable.

[0028] In a possible implementation of the foregoing first aspect, the channel dominance factor satisfies:

[0029]

[0030] Wherein, r represents the current number of transmitted bits of the channel; represents the average number of transmitted bits of the historical channel; q represents the data frame length. It can be understood that the channel dominance factor fully considers the current number of transmitted bits of the channel, the average number of transmitted bits of the historical channel, and the data frame length, which is more scientific and reasonable.

[0031] In a second aspect, an embodiment of the present application provides a data transmission method applied to an extended reality scenario. The extended reality scenario includes a first electronic device and multiple second electronic devices. During downlink transmission, a second electronic device receives a first data frame transmitted by the first electronic device. The first data frame is the first data frame among multiple data frames cached by the first electronic device. Moreover, each data frame corresponds to a second electronic device one by one, and the determination method of the first data frame is related to the transmission success probability of each data frame. It can be understood that the beneficial effects of this method can refer to the relevant beneficial effects of the first aspect and will not be elaborated here.

[0032] In a third aspect, an embodiment of the present application provides a data transmission method. In the method, during uplink transmission, a first electronic device (for example, the network device below) needs to receive data frames transmitted by multiple second electronic devices (for example, the terminal devices below). The first electronic device includes devices such as a base station, and the second electronic devices include devices such as VR glasses and AR glasses. Due to limited transmission resources, the first electronic device can only receive a limited number of data frames sent by second electronic devices at a time. Therefore, the first electronic device needs to determine the second electronic devices allowed to transmit data frames and send an allow-transmission instruction to the second electronic devices allowed to transmit data frames so that the second electronic devices can transmit data frames. Specifically, the first electronic device (for example, the network device below) detects data transmission request messages sent by multiple second electronic devices (for example, the terminal devices below). The data transmission request messages are used to indicate that the second electronic devices will transmit the cached data frames to the first electronic device; based on the transmission success probability corresponding to the data frames of each second electronic device, determine the first data frame to be transmitted currently, where the transmission success probability is used to evaluate the probability of a data frame being successfully transmitted; the first electronic device sends a transmission allow instruction to the second electronic device corresponding to the first data frame; and then the first electronic device receives the first data frame from the second electronic device corresponding to the first data frame. It can be understood that the first electronic device can determine the first data frame to be transmitted currently based on the transmission success probability of each data frame, where the transmission success probability is used to evaluate the probability of a data frame being successfully transmitted. Then, the first electronic device sends an allow-transmission instruction to the second electronic device corresponding to the first data frame. Since the first electronic device considers the transmission success probability of each data frame when determining the first data frame to be transmitted currently, and the transmission success probability is used to evaluate the probability of a data frame being successfully transmitted, the number of data frames successfully sent by all second electronic devices within a period of time can be increased.

[0033] In a possible implementation of the third aspect described above, the data frame is the data frame cached by the first electronic device at the current moment. The current moment is any time point within the delay period, and the starting point of the delay period is the initial moment. The transmission success probability is determined based on the remaining transmission time and the complete transmission time. The remaining transmission time is the time required for the data frame to be transmitted from the current moment until completion. The complete transmission time is the time required for the data frame to be transmitted from the initial moment until completion. Moreover, the transmission success probability is negatively correlated with both the remaining transmission time and the complete transmission time. It can be understood that the specific data in the data frame will change dynamically during the transmission process. Each time the first electronic device transmits, it needs to determine the data frame cached by the first electronic device at the current moment. When determining the transmission success probability, the remaining transmission time and the complete transmission time are taken into account. Since the remaining transmission time is the time required for the data frame to be transmitted from the current moment until completion, the remaining transmission time can reflect the number of data frames that can be successfully transmitted within a certain period when transmitting the current data frame. The longer the remaining transmission time, the smaller the probability of each data frame being successfully transmitted, and the fewer the number of data frames that can be completely transmitted successfully within a certain time. The complete transmission time is the time required for the data frame to be transmitted from the initial moment until completion, which can reflect whether the current data frame can be transmitted within the specified delay period and can reflect the transmission quality of the data frame, thereby increasing the success probability of data frame transmission.

[0034] In a possible implementation of the third aspect described above, the transmission success probability, the complete transmission time, and the remaining transmission time may satisfy the following relationship:

[0035] P1 = g(ts) * h(tw)

[0036] where P1 is the transmission success probability; ts is the remaining transmission time; g(ts) is the urgency factor, and the urgency factor is negatively correlated with the remaining transmission time ts; tw is the complete transmission time; h(tw) is the success factor, and the success factor is negatively correlated with the complete transmission time tw. When the remaining transmission time is smaller, the urgency factor is larger, and the transmission success probability is larger; when the complete transmission time is smaller, the success factor is larger, and the transmission success probability is larger.

[0037] In a possible implementation of the third aspect described above, the urgency factor g(ts) and the remaining transmission time ts satisfy the following relationship:

[0038]

[0039] where ka is a hyperparameter used to adjust the relationship between the urgency factor and the remaining transmission time. It can be understood that the relationship between the urgency factor g(ts) and the remaining transmission time ts is a non-linear relationship, with good robustness.

[0040] In a possible implementation of the above third aspect, the success degree factor h(tw) and the complete transmission time tw satisfy the following relationship:

[0041]

[0042] where D represents the delay period; μ is a hyperparameter used to adjust the relationship between the complete transmission time and the delay period of the data frame; c is a hyperparameter used to adjust the relationship between the complete transmission time and the success degree factor. It can be understood that the urgency factor g(ts) and the remaining transmission time ts also have a non-linear relationship, with good robustness.

[0043] In a possible implementation of the above third aspect, the first electronic device can determine the remaining transmission time in the following way: The first electronic device determines the remaining transmission time of the data frame based on the data frame length of the data frame at the current moment and the historical channel average transmission bit number of the data frame, where the historical channel average transmission bit number is the average number of bits supported by the channel between the first electronic device and the second electronic device corresponding to the data frame within the first historical time period. It can be understood that the first electronic device can record the maximum number of bits supported by the channel corresponding to the data frame at each time point within the first historical time period, and then average the maximum number of bits of the channel at each time point within the first historical time period to obtain the historical channel average transmission bit number of the channel within the first historical time period. And the specific time period of the first historical time period can be configured in advance. For example, 1 ms before the current moment is used as the time period for calculating the historical channel average transmission bit number each time, and then the maximum number of bits supported by the stored data frames corresponding to 1 ms before the current moment is averaged to obtain the historical channel average transmission bit number. Specifically, there are many calculation methods for the historical channel average transmission bit number, which are not limited here. It can be understood that the historical channel average transmission bit number reflects a trend of the maximum number of bits supported by the channels corresponding to each data frame. Using the data frame length of the data frame at the current moment and the historical channel average transmission bit number of the data frame can reasonably obtain the remaining transmission time.

[0044] In a possible implementation of the above third aspect, the remaining transmission time ts satisfies:

[0045]

[0046] where q represents the data frame length; represents the historical channel average transmission bit number.

[0047] In a possible implementation of the above third aspect, the complete transmission time tw satisfies:

[0048]

[0049] Wherein, w represents the waiting time for a data frame to wait for transmission, and the waiting time for a data frame to wait for transmission is the time from the initial moment to the current moment; q represents the data frame length; represents the average number of transmitted bits on the historical channel; r represents the current number of transmitted bits on the channel of the data frame, and the current number of transmitted bits on the channel is the maximum number of bits that the channel between the first electronic device and the second electronic device corresponding to the data frame supports for transmission at the current moment.

[0050] In a possible implementation of the third aspect above, the first electronic device determines the first data frame to be transmitted currently based on the transmission success probabilities of each data frame, including: the first electronic device calculates the priority scores of each data frame according to the transmission success probabilities of each data frame; and determines the first data frame according to each priority score. It can be understood that the first electronic device can calculate the priority scores of each data frame, and the priority scores can intuitively show the priorities of transmitting each data frame, so as to determine the first data frame.

[0051] In a possible implementation of the third aspect above, the priority score of each data frame satisfies:

[0052] Priority = β * f(·) * P1

[0053] Wherein, Priority is the priority score, β is a hyperparameter, f(·) represents the channel dominance factor. Among them, the channel dominance factor is related to the data frame length, the current number of transmitted bits on the channel, and the average number of transmitted bits on the historical channel. Among them, the current number of transmitted bits on the channel is the maximum number of bits that the channel between the first electronic device and the second electronic device corresponding to the data frame supports for transmission at the current moment; the average number of transmitted bits on the historical channel is the average number of bits that the channel between the first electronic device and the second electronic device corresponding to the data frame supports for transmission within the first historical time period. It can be understood that the explanation of the average number of transmitted bits on the historical channel is as above and will not be elaborated here. It can be understood that the priority score not only considers the transmission success probabilities of each data frame, but also considers the channel dominance situations corresponding to each data frame, which is more scientific and reasonable.

[0054] In a possible implementation of the third aspect above, the channel dominance factor satisfies:

[0055]

[0056] Wherein, r represents the current number of transmitted bits on the channel; represents the average number of transmitted bits on the historical channel; q represents the data frame length. It can be understood that the channel dominance factor fully considers the current number of transmitted bits on the channel, the average number of transmitted bits on the historical channel, and the data frame length, which is more scientific and reasonable.

[0057] It can be understood that in this process, the first electronic device may determine the first data frame to be transmitted in the same manner as in the above first aspect. For specific beneficial effects, refer to various possible implementations of the above first aspect, which will not be elaborated here.

[0058] In a fourth aspect, an embodiment of the present application provides a data transmission method, which is applied to an extended reality scenario. The extended reality scenario includes a first electronic device and multiple second electronic devices. During the uplink transmission process, the multiple second electronic devices send data transmission request messages to the first electronic device. The data transmission request messages are used to indicate that the second electronic devices will transmit the cached data frames to the first electronic device. The second electronic device corresponding to the first data frame receives a transmission permission instruction sent by the first electronic device, where the determination method of the first data frame is related to the transmission success probability of the data frames cached by each second electronic device. The second electronic device corresponding to the first data frame sends the first data frame to the first electronic device.

[0059] In a fifth aspect, an embodiment of the present application provides a data transmission device. The data transmission device includes: a caching module for caching multiple data frames, where each data frame is to be transmitted to a second electronic device; a determining module for determining the first data frame to be currently transmitted based on the transmission success probability of each data frame, where the transmission success probability is used to evaluate the probability of a data frame being successfully transmitted; and a transmission module for transmitting the first data frame to the second electronic device corresponding to the first data frame.

[0060] For example, during the downlink transmission process, the data transmission device may be the network device 90A in the following text.

[0061] In a possible implementation of the above fifth aspect, the data frame is the data frame cached by the caching module at the current moment. The current moment is any time point within the time delay period. The starting point of the time delay period is the initial moment. The transmission success probability is determined based on the remaining transmission time and the complete transmission time. The remaining transmission time is the time required for the data frame to be transmitted from the current moment until it is completely transmitted. The complete transmission time is the time required for the data frame to be transmitted from the initial moment until it is completely transmitted. Moreover, the transmission success probability is negatively correlated with both the remaining transmission time and the complete transmission time.

[0062] In a possible implementation of the above fifth aspect, the transmission success probability satisfies:

[0063] P1 = g(ts) * h(tw)

[0064] Among them, P1 is the transmission success probability; ts is the remaining transmission time; g(ts) is the urgency factor, and the urgency factor is negatively correlated with the remaining transmission time ts; tw is the complete transmission time; h(tw) is the success factor, and the success factor is negatively correlated with the complete transmission time tw.

[0065] In a possible implementation of the above fifth aspect, the urgency factor satisfies:

[0066]

[0067] Among them, ka is a hyperparameter used to adjust the relationship between the urgency factor and the remaining transmission time.

[0068] In a possible implementation of the above fifth aspect, the success factor satisfies:

[0069]

[0070] Among them, D represents the delay period; μ is a hyperparameter used to adjust the relationship between the complete transmission time and the delay period of the data frame; c is a hyperparameter used to adjust the relationship between the complete transmission time and the success factor.

[0071] In a possible implementation of the above fifth aspect, the determination module is further used to determine the remaining transmission time in the following manner: The determination module is further used to determine the remaining transmission time of the data frame based on the data frame length of the data frame and the historical channel average transmission bit number of the data frame, where the historical channel average transmission bit number is the average number of bits supported by the channel between the data transmission device and the second electronic device corresponding to the data frame within the first historical time period.

[0072] In a possible implementation of the above fifth aspect, the remaining transmission time ts satisfies:

[0073]

[0074] Among them, q represents the data frame length; represents the historical channel average transmission bit number.

[0075] In a possible implementation of the above fifth aspect, the complete transmission time tw satisfies:

[0076]

[0077] Among them, w represents the waiting time for the data frame to be transmitted, and the waiting time for the data frame to be transmitted is the time from the initial moment to the current moment; q represents the data frame length; represents the average number of transmitted bits of the historical channel; r represents the current number of transmitted bits of the data frame on the channel, and the current number of transmitted bits on the channel is the maximum number of bits that the channel can support for transmission between the data transmission device and the second electronic device corresponding to the data frame at the current moment.

[0078] In a possible implementation of the fifth aspect described above, the determination module is used to determine the first data frame to be transmitted currently based on the transmission success probability of each data frame, including: the determination module is used to calculate the priority score of each data frame according to the transmission success probability of each data frame; the determination module is used to determine the first data frame according to each priority score.

[0079] In a possible implementation of the fifth aspect described above, the priority score of each data frame satisfies:

[0080] Priority = β * f(·) * P1

[0081] where Priority is the priority score, β is a hyperparameter, f(·) represents the channel dominance factor, and the channel dominance factor is related to the data frame length of the data frame, the current number of transmitted bits on the channel, and the average number of transmitted bits of the historical channel. Among them, the current number of transmitted bits on the channel is the maximum number of bits that the channel can support for transmission between the data transmission device and the second electronic device corresponding to the data frame at the current moment; the average number of transmitted bits of the historical channel is the average number of bits that the channel can support for transmission between the data transmission device and the second electronic device corresponding to the data frame within the first historical time period.

[0082] In a possible implementation of the fifth aspect described above, the channel dominance factor satisfies:

[0083]

[0084] where r represents the current number of transmitted bits on the channel; represents the average number of transmitted bits of the historical channel; q represents the data frame length.

[0085] Sixth aspect, an embodiment of the present application provides a data transmission device, which includes a processor and a memory. The processor is used to execute the data in the memory, so that the data transmission device executes any data transmission method in the first aspect and various implementations of the first aspect, or any data transmission method in the second aspect and various implementations of the second aspect.

[0086] In a seventh aspect, an embodiment of the present application provides a data transmission system, which includes a first electronic device and multiple second electronic devices. Among them, the first electronic device is any one of the data transmission devices in the above-mentioned sixth aspect and various implementations of the sixth aspect, or the data transmission device in the sixth aspect. The second electronic device is configured to receive the first data frame sent by the first electronic device.

[0087] For example, in the downlink transmission process, the data transmission system is the data transmission system 90 described below, the first electronic device is the network device 90A, and the second electronic device is the terminal device 90B.

[0088] In an eighth aspect, an embodiment of the present application provides a data transmission device, which includes a detection module configured to detect data transmission request messages sent by multiple second electronic devices. The data transmission request messages are used to indicate that the second electronic devices will transmit the cached data frames to be transmitted to the data transmission device. A determination module is configured to determine the first data frame to be transmitted currently based on the transmission success probabilities corresponding to the data frames of each second electronic device, where the transmission success probability is used to evaluate the probability that the data frame is successfully transmitted. A sending module is configured to send a transmission permission instruction to the second electronic device corresponding to the first data frame. A receiving module is configured to receive the first data frame from the second electronic device corresponding to the first data frame.

[0089] For example, in the uplink transmission process, the data transmission device is the network device 1000A described below, and the second electronic device is the terminal device 1000B.

[0090] In a ninth aspect, an embodiment of the present application provides a data transmission device, which includes a first sending module configured to send a data transmission request message to a first electronic device. The data transmission request message is used to indicate that the data transmission device will transmit the cached data frame to the first electronic device. A receiving module is configured to receive the transmission permission instruction sent by the first electronic device. A second sending module is configured to send the first data frame to the first electronic device, where the determination method of the first data frame is related to the transmission success probability of the data frame cached by the data transmission device.

[0091] For example, in the uplink transmission process, the data transmission device can be the terminal device 1000B described below, and the first electronic device is the network device 1000A.

[0092] In a tenth aspect, an embodiment of the present application provides a data transmission device, which includes a processor and a memory. The processor is configured to execute the data in the memory, so that the data transmission device executes any one of the data transmission methods in the above-mentioned third aspect and various implementations of the third aspect, or any one of the data transmission methods in the fourth aspect.

[0093] In an eleventh aspect, an embodiment of the present application provides a data transmission system, which includes a first electronic device and a plurality of second electronic devices. Among them, the first electronic device is the data transmission device as described in the above eighth aspect, and the second electronic device is the data transmission device as described in the above ninth aspect.

[0094] For example, during the uplink transmission, the data transmission system may be the data transmission system 1000 described below.

[0095] In a twelfth aspect, an embodiment of the present application provides a readable storage medium, on which instructions are stored. When the instructions are executed on an electronic device, the electronic device is caused to execute any of the data transmission methods in the above first aspect and various implementations of the first aspect, any of the data transmission methods in the above second aspect and various implementations of the second aspect, any of the data transmission methods in the above third aspect and various implementations of the third aspect, or any of the data transmission methods in the above fourth aspect and various implementations of the fourth aspect.

[0096] In a thirteenth aspect, an embodiment of the present application provides a chip, which is applied to an electronic device to execute any of the data transmission methods in the above first aspect and various implementations of the first aspect, any of the data transmission methods in the above second aspect and various implementations of the second aspect, any of the data transmission methods in the above third aspect and various implementations of the third aspect, or any of the data transmission methods in the above fourth aspect and various implementations of the fourth aspect.

[0097] In a fourteenth aspect, an embodiment of the present application provides a computer program product, which includes: computer program code. When the computer program code runs on a computer, the computer is caused to execute any of the data transmission methods in the above first aspect and various implementations of the first aspect, any of the data transmission methods in the above second aspect and various implementations of the second aspect, any of the data transmission methods in the above third aspect and various implementations of the third aspect, or any of the data transmission methods in the above fourth aspect and various implementations of the fourth aspect.

[0098] Among them, the beneficial effects of the fourth aspect to the eleventh aspect can refer to the beneficial effects related to the first aspect, which will not be elaborated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0099] Figure 1A According to some embodiments provided by the present application, a schematic diagram of the architecture of a communication system 1000 is shown;

[0100] Figure 1B According to some embodiments provided by the present application, a schematic diagram of a video scene corresponding to XR is shown;

[0101] Figure 2AAccording to some embodiments provided by the present application, a schematic diagram of a video frame F1 is shown;

[0102] Figure 2B According to some embodiments provided by the present application, a schematic diagram of successful reception of a video frame F1 is shown;

[0103] Figure 2C According to some embodiments provided by the present application, a schematic diagram of failed reception of a video frame F1 is shown;

[0104] Figure 3A According to some embodiments provided by the present application, a schematic diagram of a queue corresponding to each video frame is shown;

[0105] Figure 3B According to some embodiments provided by the present application, a schematic diagram of the state of each data frame before and after the i-th transmission is shown;

[0106] Figure 3C According to some embodiments provided by the present application, a schematic diagram of data packets transmitted at the T0-th, T1-th, and T2-th times is shown;

[0107] Figure 3D According to some embodiments provided by the present application, a diagram showing the influence relationship between factors and priorities in priority scoring is shown;

[0108] Figure 3E According to some embodiments provided by the present application, a schematic diagram of data packets transmitted at the T0-th, T1-th, and T2-th times is shown;

[0109] Figure 4 According to some embodiments provided by the present application, a schematic diagram of the framework of the network side 400 and the terminal side 500 is shown;

[0110] Figure 5 According to some embodiments provided by the present application, a schematic diagram of the interaction between a network device and a terminal device during downlink transmission is shown;

[0111] Figure 6 According to some embodiments provided by the present application, a schematic diagram of the interaction between a network device and a terminal device during uplink transmission is shown;

[0112] Figure 7A According to some embodiments provided by the present application, a schematic diagram of the 7-layer model of OSI is shown;

[0113] Figure 7B According to some embodiments provided by the present application, a schematic diagram of the effect of a simulation experiment is shown;

[0114] Figure 8 According to some embodiments provided by the present application, a schematic diagram of the structure of a device 800 is shown;

[0115] Figure 9 According to some embodiments provided by the present application, a schematic structural diagram of a data transmission system 90 is shown;

[0116] Figure 10 According to some embodiments provided by the present application, a schematic structural diagram of a data transmission device system 1000 is shown. Detailed implementation manners

[0117] The illustrative embodiments of the present application include, but are not limited to, a data transmission method, device, electronic device, storage medium, and chip.

[0118] Some terms in the present application are introduced below.

[0119] Figure 1A It is a schematic structural diagram of a communication system 1000 to which the embodiments of the present application are applied. As shown in FIG. 1A, the communication system includes a network device and a terminal device. The network device can be connected to the terminal device wirelessly or by wire. One network device and six terminal devices are shown in the figure. The six terminal devices are terminal device 10, terminal device 20, terminal device 30, terminal device 40, terminal device 50, and terminal device 60, etc.

[0120] For example, Figure 1A In the illustrated example, terminal device 10 is a smart tea cup, terminal device 20 is a VR glasses, terminal device 30 is a smart fuel dispenser, terminal device 40 is a vehicle, terminal device 50 is a mobile phone, and terminal device 60 is a printer for illustration.

[0121] It can be understood that in some cases, when data is transmitted between the network device and the terminal device, the transmitted service data stream is frame by frame, that is, in units of "frames". When transmitting data in the downlink, there will be multiple queues in the network device. Each queue caches the content of a data frame, and the network device will transmit a data frame stored in the queue to a terminal device, and different data frames will correspond to different terminal devices. When transmitting data in the uplink, that is, the terminal device will also have a queue, and will send the data frame in the queue to the network device when permitted by the network device.

[0122] It can be understood that due to the limitation of communication resources, for the downlink process, each time of transmission, the network device will select a terminal device and send part or all of the data of the data frame in the queue corresponding to the terminal device to the corresponding terminal device. For the uplink process, each time of transmission, the terminal device will send part or all of the data of the data frame cached in the queue to the network device when permitted by the network device.

[0123] For the convenience of description, in each downlink or uplink transmission, a part or all of the data in a certain data frame that needs to be transmitted between a network device and a terminal device is called a "data packet", that is, the data transmission unit during transmission.

[0124] In the following, taking the downlink transmission as an example, with the network device being a base station and each terminal device being a VR glasses, this solution will be described.

[0125] Figure 1B According to some embodiments of the present application, a schematic diagram of a video scene corresponding to XR is shown. In this scene, multiple users can play games using VR glasses A1 - An respectively. At this time, the VR glasses A1 - An can perform data interaction with the cloud C through the base station B. The video frames generated by the cloud C will be sent to the base station B. At the base station B, there is a queue corresponding to each VR glasses, and each queue caches the video frames to be transmitted to the corresponding VR glasses, that is, one video frame corresponds to one VR glasses. Each VR glasses A1 - An can receive the video frames including game screen content sent from the base station B. During transmission, due to limited communication resources, a video frame needs to be transmitted multiple times before all data can be transmitted completely.

[0126] Continue to refer to Figure 2A , assuming that the cloud C generates a video frame F1, and the video frame F1 includes a smiling face content. After receiving the video frame F1, the base station B will cache it in the queue corresponding to the VR glasses A1. The queue will initially cache all the data of the video frame F1. It can be understood that due to limited communication resources, when the base station B receives multiple video frames and stores the video frames in each queue respectively, it will calculate the priorities of the video frames in each queue, determine the video frames to be transmitted, and then transmit the data in the determined video frames according to the allowed transmission data volume. During subsequent transmissions, the base station B will transmit the data in the video frame to the VR glasses A1 multiple times. After each transmission, the length of the video frame in the queue will change. After multiple transmissions, all the data initially cached in the queue (i.e., the video frame F1) can be sent to the VR glasses A1 completely. When all the data of the video frame F1 is transmitted in n times, the data of each data frame transmitted each time is denoted as data packets B1, B2,..., Bn.

[0127] It can be understood that there is usually a correlation between multiple data packets B1 - Bn corresponding to the same video frame. If one or more data packets in the video frame sent by the VR glasses A1 are received fails, then the video frame is very likely to decode fails and finally cannot be displayed, affecting the user experience. As an example, as Figure 2B shown, the VR glasses A1 successfully receives the data packets B1 - Bn. The VR glasses A1 can obtain the above video frame F1 according to the received data packets B1 - Bn. At this time, it is considered that the video frame F1 is successfully received. AsFigure 2C As shown, in some cases, the VR glasses A1 may also fail to receive some data packets. For example, if it fails to receive the data packet Bn, even if the VR glasses A1 successfully receives other data packets, at this time, it is considered that the video frame F1 fails to be received, and thus the video frame F1 may not be decoded for display. Therefore, when each XR terminal device transmits single-frame data to the base station B, the transmission integrity of the data frame needs to be considered to ensure the success rate of the completion of the transmission of each data frame.

[0128] The following specifically introduces the transmission process:

[0129] In some embodiments, after the cloud C generates data, the data generated by the cloud C will reach the base station B in a batch arrival manner. All the data corresponding to the same frame will reach the base station B simultaneously (i.e., batch arrival). At this time, each queue in the base station B will respectively cache a data frame to be transmitted (for example, in addition to the above-mentioned video frame, it can also be a tactile frame, etc.), and the sizes of each data frame can be different.

[0130] For example, as Figure 3A shown, multiple queues A11 - Ann are set in the base station. The queues A11 - Ann respectively cache a data frame M1 - Mn, and the example of the base station transmitting the data frames M1 - Mn to the VR glasses A1 - An respectively is introduced. Specifically, the queue A11 can cache the data frame M1 that the base station B needs to send to the VR glasses A1, the queue A22 can cache the data frame M2 that the base station B needs to send to the VR glasses A2,..., and the queue Ann can cache the data frame Mn that the base station B needs to send to the VR glasses An.

[0131] It can be understood that the bandwidth resources of the base station B are limited. In some cases, the base station B can only communicate with a limited number of XR terminal devices each time it transmits. For example, in the current transmission, the base station B can only transmit with the VR glasses A1, and in the next transmission, the base station B can only transmit with the VR glasses A2. At this time, there will be competition among the XR terminal devices. Then, each time the base station B transmits, it will calculate the priority for each data frame and transmit the data frame that meets the priority condition (for example, the priority level meets the first threshold) to the corresponding VR glasses. And after each transmission by the base station B, the length of the data frame of the transmitted data frame will change, that is, after each transmission, the data frame will change dynamically during the transmission process.

[0132] For example, if the bandwidth resources of base station B allow transmission with two XR terminal devices at a time, at this time, base station B will transmit the two data frames with the highest and the second highest priority levels (i.e., the first and second priority levels) to the corresponding VR glasses respectively each time. For another example, if the bandwidth resources of base station B allow transmission with one XR terminal device at a time, at this time, base station B will transmit the data frame with the highest priority level to the corresponding VR glasses each time. Continuing to refer to Figure 3A As shown, taking the case where base station B transmits one data frame each time as an example, since base station B can only transmit one data frame each time. Base station B successfully transmits data frame M1 to VR glasses A1 only after determining it as the highest priority twice, that is, corresponding to transmitting data packets M11 and M12 respectively twice; it successfully transmits data frame M12 to VR glasses A2 only after determining it as the highest priority five times;..., it successfully transmits data frame M1n to VR glasses An only after determining it as the highest priority twice.

[0133] For a clearer understanding, Figure 3B shows a comparison diagram of the dynamic changes of each data frame before and after transmission when base station B transmits a certain data frame at a certain time. As Figure 3B shows the data frame change diagram of each data frame of base station B before and after transmission when base station B makes the i-th transmission. Assume that the data transmitted by the base station for the i-th time is the data of data frame M2. Referring to Figure 3B As shown in it, before the i-th transmission of base station B, data frame M1 is the remaining data after transmitting data packet M11. Assume that subsequent data packet M12 is transmitted to VR glasses A1; since data frame M2 has not been determined as the highest priority since the first time its priority was calculated, data frame M2 is all the data received by base station B from the cloud,..., since data frame Mn has not been determined as the highest priority since the first time its priority was calculated, data frame Mn is all the data received by base station B from the cloud. Assume that base station B determines to transmit data frame M2 to VR glasses A2 during the i-th transmission. At this time, base station B transmits the data in data frame M2 to VR glasses A2 in data packet M12. At this time, after the i-th transmission, the data in data frame M2 will decrease by the data volume of data packet M21, and the data in the remaining data frames remains unchanged. Therefore, the data in the queue will change dynamically with the transmission of base station B.

[0134] It can be understood that there is a time delay constraint for the frame, that is, after the data frame arrives at base station B, it needs to be completely transmitted within the time delay period (for example, 10 ms), otherwise the data that fails to be transmitted successfully in each queue will be cleared, which will correspondingly cause each XR terminal device to be unable to successfully receive the data frame. For example, in some embodiments, the time delay period can be 10 ms, that is, every 0.5 ms is a time slot, and 10 ms includes 20 time slots. For Figure 3AAfter transmitting data packet M11 of data frame M1, the remaining data in queue A11, that is, the partially untransmitted data of data frame M1, is not transmitted within the specified time. At this time, the remaining data of data frame M1 in queue A11 will be cleared, and VR glasses A1 will not be able to receive the complete data frame M1, which means the transmission of this frame fails.

[0135] Currently, there are various methods to determine the priorities of data frames. For example, the proportional fairness (PF) algorithm, the modified largest weighted delay first (M-LWDF) algorithm, etc. However, the current algorithms for determining priorities are all optimized with the goal of maximizing throughput or minimizing delay in data transmission, without considering the number of complete data frames received by each XR terminal device, thus affecting the quality of service (QoS) of users.

[0136] Taking the proportional fairness algorithm as an example, in various scenarios of XR applications, the frame integrity and frame delay during data frame transmission are closely related to the quality of service, while the proportional fairness algorithm cannot guarantee the ratio of frames successfully arriving within a certain transmission time. For example, assume that base station B can only transmit one data packet of the data frame with the highest priority each time. Refer to Figure 3C As shown, at the T0th transmission, assume that the channel of current VR glasses A1 is good, that is, the instantaneous rate is large and the priority is the highest. At this time, base station B transmits data packet M11 corresponding to data frame M1 to VR glasses A1; at the T1th transmission, assume that the channel of current VR glasses A2 is good, that is, the instantaneous rate is large and the average rate is small, and the priority is the highest. At this time, base station B transmits data packet M21 corresponding to data frame M2 to VR glasses A2; at the T2th transmission, assume that the channel of current VR glasses A3 is good, that is, the instantaneous rate is large and the average rate is small, and the priority is the highest. At this time, base station B transmits data packet M31 corresponding to data frame M3 to VR glasses A3. It can be found that assume that after 3 transmissions, the specified time is reached. At this time, there is still a lot of untransmitted data remaining in the queues corresponding to VR glasses A1, VR glasses A2, and VR glasses A3, that is, data frames M1, M2, and M3 are not completely transmitted, that is, base station B has not successfully transmitted the content of a single data frame, thus affecting the quality of service of users.

[0137] It can be understood that the successful transmission situation of corresponding data frames within a period of time is closely related to the quality of service. Therefore, when determining the priorities of data frames, it is necessary to comprehensively consider not only the channel state but also the relevant information of the data frames, such as the transmission time of the remaining data of the current frame and other information, as well as the frame delay period requirements, etc.

[0138] Therefore, to solve the above problems, the present application proposes a data transmission method. In this method, when a first electronic device (such as a network device like a base station) needs to perform data transmission with multiple second electronic devices (such as terminal devices like VR glasses), when the first electronic device determines the data frame to be transmitted, it not only needs to consider the channel state of each second electronic device, but also needs to consider the integrity of the data frame and the delay requirement of the data frame. Then, the first electronic device determines the data frame to be transmitted considering the integrity and delay requirement of the data frame, and sends the data frame to the corresponding second electronic device.

[0139] For example, the base station can not only consider the channel state but also consider the possibility of successful transmission of the data frame during each transmission. Specifically, when determining the data frame to be transmitted, based on the transmission success probability of each data frame, the first data frame to be transmitted currently is determined.

[0140] Among them, the transmission success probability is used to evaluate the probability of successful transmission of each data frame. Among them, the transmission success probability can be determined based on the remaining transmission time and the complete transmission time.

[0141] Specifically, the remaining transmission time is the time required for the data frame at the current moment to be transmitted completely. The current moment is any time point within the delay period, and the starting point of the delay period is the initial moment. The complete transmission time is the time required for the data frame to be transmitted completely from the initial moment. It can be understood that the remaining transmission time represents the time required for the untransmitted data buffered in each queue at the current moment to be transmitted. When the remaining transmission time is smaller, it means that the data frame at the current moment can be transmitted quickly, so the priority can be increased, and this data frame can be transmitted first, thereby increasing the number of successfully transmitted frames. However, as mentioned above, the transmission of each data frame has a frame delay requirement, that is, each frame of data needs to be transmitted within the delay period. Therefore, while considering the remaining transmission time, the complete transmission time also needs to be considered, that is, considering whether the data frame at the current moment can be transmitted within the specified time, so as to improve the quality of data frame transmission. Therefore, it is necessary to consider whether the frame delay requirement is met when all the data of the data frame buffered in the queue at the initial moment is completely transmitted. If the complete transmission time exceeds the frame delay requirement, the transmission priority of the current data frame can be reduced.

[0142] Therefore, on the basis of comprehensively considering the remaining transmission time and the complete transmission time, the first electronic device can determine the priority for each data frame according to the transmission success probability during each transmission, then determine the first data frame to be transmitted based on the priority of each data frame, and then send the first data frame to the corresponding second electronic device.

[0143] It can be understood that since the priority not only considers the channel state between the first electronic device and each second electronic device, but also considers the number and quality of successful transmissions of each data frame during the transmission process. For example, the remaining transmission time and the complete transmission time mentioned above are considered, thereby increasing the number of data frames transmitted as much as possible within a certain period of time.

[0144] Specifically, in some embodiments, a priority score that can reflect the priority can be calculated for each data frame. According to the calculated values of the priority scores corresponding to each data frame, the priorities of each data frame are determined, and the larger the value of the priority score, the higher the corresponding priority.

[0145] In some embodiments, the priority score not only includes a channel dominance factor related to the channel state, but also includes an urgency factor of the data frame and a success factor; among them, the urgency factor is negatively correlated with the remaining transmission time. The shorter the remaining transmission time, the larger the urgency factor and the higher the priority; the success factor is also negatively correlated with the complete transmission time. The smaller the complete transmission time, the larger the success factor and the higher the priority.

[0146] Below, taking the priority considering both the remaining transmission time and the complete transmission time as an example, and taking the transmission success probability as the product of the urgency factor and the success factor as an example.

[0147] In some embodiments, the following formula (1-1) shows an expression for the relationship between the priority score of the data frame Li (corresponding to the XR terminal device Ei) and the transmission success probability, and formula (1-2) shows the relationship expression between the transmission success probability and the remaining transmission time and the complete transmission time:

[0148] Priority=β*f(·)*P1 (1-1)

[0149] P1=g(ts)*h(tw) (1-2)

[0150] Among them, in formula (1-1), Priority is the priority score, P1 is the transmission success probability, f(·) represents the channel dominance factor, β is a hyperparameter, in formula (1-2), g(ts) represents the urgency factor, h(tw) represents the success factor, ts is the remaining transmission time, and tw is the complete transmission time. In the embodiments of the present application, the better the channel state, the higher the priority; the larger the urgency factor, the higher the priority; the larger the success factor, the higher the priority.

[0151] In some embodiments, the channel dominance factor f(·) can be obtained through the following formula (2):

[0152]

[0153] Among them, f(·) represents the channel dominance factor. r i represents the number of bits transmitted by the current channel, that is, the current channel state. Specifically, it is the maximum number of bits that the channel between the corresponding XR terminal device Ei and the network device can support for transmission at the current moment. If ri is larger, it indicates that the channel state is better. qi represents the data frame length of the data frame Li at the current moment, that is, the number of bits of the data frame Li that have not been transmitted at the current moment. min{ri, qi} represents the maximum number of bits that the data frame Li can be transmitted on the current channel.

[0154] It can be understood that although the corresponding ri of the data frame Li is larger, the maximum amount of data that can be transmitted currently does not exceed the data frame length qi of the data frame Li. represents the average number of bits transmitted by the historical channel (i.e., the historical channel state). Specifically, it is the average number of bits that the channel between the network device and the XR terminal device Ei can support for transmission in the historical time period. It can be understood that the historical channel state reflects the channel quality trend between the network device and the XR terminal device Ei in the past period of time, and the specific calculation method is not required. For example, the network device can record the maximum number of bits that the channel corresponding to the data frame can support for transmission at each time point in the historical time period, and then calculate the average value of the maximum number of bits of the channel at each time point in the historical time period to obtain the average number of bits transmitted by the historical channel of the channel in the historical time period. It can be understood that when calculating the historical channel state, the data of the current channel state can also be used for calculation, or it can not be used, which is not required here. Example 1, when not considering the current channel state, the maximum transmission at three consecutive past time points can be 6bit, 8bit, and 12bit respectively. At this time, the average value of the maximum number of bits of data transmitted between the XR terminal device Ei and the network device at three consecutive past time points is calculated to obtain the historical channel state as an average number of bits of 8bit. Example 2, when considering the current channel state, the maximum transmission at three consecutive past time points can be 6bit, 8bit, and 12bit respectively, and the current maximum transmission can be 10bit. At this time, the average number of bits transmitted corresponding to the historical time period including the current moment is 9bit.

[0155] It can be understood that the ratio in formula (2) reflects the dominance situation of the channel corresponding to the data frame Li. If the current channel is good and the historical channel is poor, it indicates that the current channel has an advantage, and at this time, transmission needs to be carried out quickly. If the current channel is good and the historical channel is also good, it indicates that the channel of this terminal device has always been good, and it does not have an advantage compared with other terminal devices whose historical channel state is poor but the current channel is good.

[0156] It can be understood that when the current channel state corresponding to the data frame Li improves, the higher the priority, enabling high-priority users to make full use of the channel.

[0157] It can be understood that the channel dominance factor can also be other expressions, and no excessive restrictions are imposed here.

[0158] In some embodiments, the urgency factor g(ts) can be obtained through the following formulas (3-1) and (3-2):

[0159]

[0160]

[0161] Among them, ka≥0 in formula (3-1) is an adjustment parameter, that is, a hyperparameter, used to adjust the influence degree of the urgency factor on the priority calculation result. In formula (3-2), qi, ri, and Referring to the description of the above formula (2), it will not be elaborated here. And for a calculation method of the remaining transmission time ts in formula (3-2), in some other implementation manners, other calculation methods can also be used, such as the numerator is calculated using the current channel state, and no specific requirements are imposed here. It can be understood that if the remaining transmission time corresponding to the data frame Li is smaller, it indicates that the data frame Li can be transmitted faster, and the transmission success probability will increase.

[0162] In some embodiments, the success factor h(tw) can be obtained through the following formulas (4-1) and (4-2):

[0163]

[0164]

[0165] Among them, D in formula (4-1) represents the time delay period corresponding to the frame hard time delay constraint, which can be 10ms, and 10ms is 20 time slots. c>0 is a hyperparameter. In some implementation manners, c = 1. μ>0 is a hyperparameter, used to adjust the relationship between the complete transmission time and the time delay period of the data frame. In some implementation manners, μ = 1.

[0166] Formula (4-2) shows a calculation method of the complete transmission time tw, and tw can also be obtained through other methods, and no restrictions are imposed here. w i is the waiting time of the data frame Li, that is, the time from the initial moment to the current moment of the data frame Li, q i 、r i and Referring to the description of the above formula (2), it will not be elaborated here. It represents the time required to transmit the remaining data in the data frame Li after the current channel transmission. Tw - μ*D represents the size of the complete transmission time and the delay period. When the complete transmission time is larger, the value of Tw - μ*D is larger. At this time, the possibility of failed transmission is greater, and the value of the success degree factor is smaller. It can be understood that by the size of the success degree factor, the data frame Li can be monitored to timely identify the data frame that cannot be transmitted successfully and reduce its priority.

[0167] It can be understood that the priority of each data frame can be updated during each transmission, or the priority of each data frame can be updated after a preset number of transmissions. There is no requirement here.

[0168] Figure 3D According to some embodiments of the present application, a diagram showing the influence relationship between factors in priority scoring and priority is shown. As Figure 3D shown, the channel dominance factor in priority scoring reflects the dominance of the channels corresponding to each data frame, and the urgency factor and the success degree factor reflect the transmission success probability. Specifically, the urgency factor mainly involves the remaining transmission time, which can further reflect the number of data frames that are all transmitted successfully within a certain time. The longer the required remaining transmission time, the smaller the probability that each data frame is successfully transmitted, and the fewer the number of data frames that are all transmitted successfully within a certain time. The success degree factor involves the complete transmission time, and the complete transmission time can reflect the failure degree of the queue within the delay constraint, and further reflect the probability that the data frame can be successfully transmitted. The smaller the complete transmission time, the greater the probability that the data frame is transmitted successfully.

[0169] It can be understood that observing the above formulas (1-1) and (1-2), if the current channel is dominant, but if the urgency factor and the success degree factor are smaller, the priority will be relatively low at this time. For example, if the data frame just arrives at the base station, and at this time the number of bits of the data frame is large and the remaining transmission time is long, so the transmission is not urgent, that is, the urgency factor g(ts) is small, and the priority will be reduced at this time. At this time, there will be an opportunity to transmit other data frames, thereby improving the frame satisfaction rate.

[0170] It can be understood that for Figure 1B the scenario shown, the base station B can calculate the priority scores of the devices of each VR glasses according to the above formulas (1-1) to (4-2), and then determine the priorities of each data frame according to the priority scores, so as to determine the first data frame to be transmitted, and then send the data in the first data frame, that is, the data packet, to the corresponding terminal device. For example, referring to Figure 3EAs shown in the figure, at the T0th transmission, it is assumed that the base station B calculates that the data frame M1 has the highest priority. At this time, the base station B transmits the data packet M11 corresponding to the data frame M1 to the VR glasses A1; at the T1th transmission, it is assumed that the base station B calculates that the data frame M1 has the highest priority. At this time, the base station B continues to transmit the data packet M12 corresponding to the data frame M1 to the VR glasses A1; at the T2th transmission, it is assumed that the base station B calculates that the data frame M2 has the highest priority. At this time, the base station B transmits the data packet M21 corresponding to the data frame M2 to the VR glasses A2. It can be found that after 3 transmissions, the data frame M1 corresponding to the VR glasses A1 is successfully transmitted at this time, improving the frame success rate.

[0171] For example, the following formula (5) shows an expression of the ratio of successful frame transmission (also known as "frame success rate"):

[0172]

[0173] Among them, xi represents the number of frames transmitted to the XR terminal device Ei (i = 1, 2, 3... n) within the preset observation time T, and yi represents the number of frames successfully transmitted to the XR terminal device Ei (i = 1, 2, 3... n). The larger the number of data frames successfully transmitted within the specified time, the larger the frame success rate.

[0174] It can be understood that the scenarios corresponding to XR include but are not limited to the video scenarios mentioned above, and can also be tactile scenarios, auditory scenarios, olfactory and other perceptual scenarios. The embodiments of the present application do not limit the application scenarios of the base station and the XR device. As long as the service data stream is a scenario of data frames, it is within the protection scope of the present application and will not be elaborated here.

[0175] In some embodiments of the present application, the network device may be a device in a wireless network. For example, the network device may be a RAN node (or device) that connects a terminal device to a wireless network, and may also be referred to as a base station. For example, the RAN device may be: a base station, an evolved Node B (eNodeB), a gNB (gNodeB) in a 5G communication system, a transmission reception point (TRP), an evolved Node B (eNB), a radio network controller (RNC), a Node B (NB), a home base station (e.g., home evolved Node B, or home Node B, HNB), a base band unit (BBU), or a wireless fidelity (Wi-Fi) access point AP, etc. Additionally, in a network structure, the network device may include a centralized unit (CU) node, or a distributed unit (DU) node, or a RAN device including a CU node and a DU node.

[0176] Optionally, the RAN node may also be a macro base station, a micro base station or an indoor station, a relay node or a donor node, or a radio controller in a cloud radio access network (CRAN) scenario. The RAN node may also be a server, a wearable device, a vehicle or an in-vehicle device, etc. For example, the access network device in vehicle to everything (V2X) technology may be a road side unit (RSU).

[0177] In another possible scenario, multiple RAN nodes cooperate to assist a terminal in achieving wireless access, and different RAN nodes respectively implement partial functions of a base station. For example, the RAN nodes can be a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU), etc. The CU and the DU can be set separately, or can also be included in the same network element, such as a baseband unit (BBU). The RU can be included in a radio frequency device or a radio frequency unit, such as included in a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH).

[0178] In different systems, the CU (or CU-CP and CU-UP), DU, or RU may also have different names, but those skilled in the art can understand their meanings. For example, in an open radio access network (openRAN, O-RAN or ORAN) system, the CU can also be called an O-CU (open CU), the DU can also be called an O-DU, the CU-CP can also be called an O-CU-CP, the CU-UP can also be called an O-CU-UP, and the RU can also be called an O-RU. For ease of description, in this application, the CU, CU-CP, CU-UP, DU, and RU are used as examples for description. Any one of the CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0179] The network device can be other devices that provide wireless communication functions for the terminal device. The embodiments of this application do not limit the specific technologies and specific device forms adopted by the network device. For ease of description, the embodiments of this application do not limit.

[0180] The network device may further include core network devices, such as the mobility management entity (MME), home subscriber server (HSS), serving gateway (S-GW), policy and charging rules function (PCRF), and public data network gateway (PDN gateway, P-GW) in the 4th generation (4G) network; network elements such as the access and mobility management function (AMF), user plane function (UPF), or session management function (SMF) in the 5G network. In addition, the core network device may further include other core network devices in the 5G network and the next-generation network of the 5G network.

[0181] In the embodiments of this application, the device for implementing the functions of the network device may be the network device or a device capable of supporting the network device to implement such functions, such as a chip system, and this device may be installed in the network device. In the technical solutions provided in the embodiments of this application, the technical solutions provided in the embodiments of this application are described by taking the device for implementing the functions of the network device as the network device as an example.

[0182] In the embodiments of this application, the terminal device may be a terminal in the Internet of Things (IoT) system. The IoT is an important part of the future development of information technology. Its main technical feature is to connect objects to the network through communication technology, so as to realize an intelligent network of human-machine interconnection and thing-thing interconnection. The terminal in this application may be a terminal in machine type communication (MTC). The terminal of this application may be an in-vehicle module, in-vehicle module group, in-vehicle component, in-vehicle chip, or in-vehicle unit built into the vehicle as a component or unit. The vehicle can implement the method of this application through the built-in in-vehicle module, in-vehicle module group, in-vehicle component, in-vehicle chip, or in-vehicle unit. Therefore, the embodiments of this application can be applied to vehicle networking, such as vehicle to everything (V2X), long term evolution vehicle (LTE-V), vehicle to vehicle (V2V), etc.

[0183] In the present application, the terminal device can sometimes also be referred to as a user equipment (UE), an access terminal device, a vehicle-mounted terminal, an industrial control terminal, a UE unit, a UE station, a mobile station, a mobile device, a remote station, a remote terminal device, a mobile device, a UE terminal device, a wireless communication device, a machine terminal, a UE agent, or a UE device, etc.

[0184] The terminal device in the present application can be a VR terminal device, an AR terminal device, or an MR terminal device. VR terminals, AR terminals, and MR terminals can all be referred to as XR terminal devices. The XR terminal device can be, for example, a head-mounted device (such as a helmet or glasses), an all-in-one machine, a TV, a monitor, a car, a vehicle-mounted device, a tablet, a smart screen, a holographic projector, a video player, a remote control robot, a tactile Internet terminal, etc. The XR terminal can present XR data to the user, and the user can experience diverse XR services by wearing or using the XR terminal. The XR terminal can access the network in a wireless or wired manner, for example, by accessing the network through wireless-fidelity (WiFi) or a 5G system. The base station and the terminal can be in fixed positions or movable. The base station and the terminal can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on the water surface; they can also be deployed on airplanes, balloons, and artificial satellites in the air.

[0185] Figure 4 According to some embodiments of the present application, a schematic framework diagram of a network side 400 and a terminal side 500 is shown. Among them, the network side 400 represents network devices, and the terminal side 500 represents one or more terminal devices that transmit with the network devices.

[0186] As shown in the figure, the network side 400 includes a data collection unit 401, a priority calculation module 402, and a priority scheduling module 403. The terminal side 500 includes a packet receiving unit 501 and a frame receiving unit 502.

[0187] Specifically, the data collection unit 401 is used to collect the waiting time, channel state, and data frame length of each data frame on the terminal side 500. For example, the waiting time of the first bit to be transmitted in the data frame can be viewed as the waiting time of the data frame. In some implementation manners, when the cache queue of the service data frame is on the network side, the scheduler reads the waiting time of the first bit of each queue and the data frame length, and obtains the channel state corresponding to each data frame according to the channel state information (CQI) feedback by the terminal device corresponding to each data frame to the network device.

[0188] The priority determination module 402 is used to determine the priorities of the data frames on the terminal side 500. Specifically, the priority calculation module 402 calculates the priority scores of the data frames and determines the priorities according to the priority scores.

[0189] The priority determination module 402 includes a failure identification module 402A, an urgency judgment module 402B, and a channel dominance identification module 402C.

[0190] Among them, the failure identification module 402A is used to: 1. Calculate the complete transmission time of the data frame according to the waiting time and the remaining transmission time of each data frame at the current moment; 2. Estimate whether the data frame can be successfully transmitted according to the comparison between the complete transmission time and the delay period of the data frame (for example, 10s). It can be understood that according to the comparison between the complete transmission time and the delay period (for example, 10s), the probability of the data frame being unsuccessfully transmitted can be reflected. And the failure identification module 402A is also used to determine the success degree factor related to the failure / success degree according to the complete transmission time and the delay constraint.

[0191] The urgency judgment module 402B is used to calculate the remaining transmission time; it is also used to calculate the urgency factor according to the remaining transmission time. It can be understood that the remaining transmission time can reflect the number of data frames that can be successfully transmitted.

[0192] The channel dominance identification module 402C is used to compare the channel states corresponding to the data frames with the historical channel states, and the obtained comparison result can reflect the data frame that dominates the current channel; it is also used to calculate the channel dominance factor according to the channel states corresponding to the data frames and the historical channel states.

[0193] It can be understood that the priority calculation module 402 can calculate the priority scores of the data frames according to the success degree factor obtained by the failure identification module 402A, the urgency factor obtained by the urgency judgment module 402B, and the channel dominance factor obtained by the channel dominance identification module 402C, so as to determine the corresponding priorities.

[0194] The priority scheduling module 403 is used to perform scheduling according to the determined priority order. For example, the data packets corresponding to the data frames with high priorities can be transmitted according to the priority order.

[0195] The packet receiving unit 501 is used to receive the data packets transmitted by the network device. It can be understood that if a certain data frame is scheduled by the network device, the terminal device corresponding to the data frame can receive the data packet, and the data of the data packet is counted by the terminal device, and it is detected whether the data packet belongs to the last data packet of a frame. If so, the information is passed to the frame receiving unit 502.

[0196] The frame receiving unit 502 is used to obtain the corresponding data frame according to the received data packets corresponding to the same frame; it is also used to reflect the real-time reception situation of the frame to the network side (for example, the data collection unit 401), such as whether the data frame is successfully received. It can be understood that if the frame receiving unit 502 receives the last packet of a frame, it can then pass the message to the network device.

[0197] Figure 5 This application embodiment provides an interaction schematic diagram between a network device and a terminal device during downlink transmission. Figure 5 Taking the network device and the terminal device as the execution subjects of the interaction schematic diagram as an example, the data transmission method of this application is shown. However, this application does not limit the execution subjects of the interaction schematic diagram. Figure 5 The network device in this can also be a chip, a chip system or a processor that supports the network device to implement this method. Figure 5 The terminal device in this can also be a chip, a chip system or a processor that supports the terminal device to implement this method. And, Figure 5 This introduces the example where the network device 400A can only transmit one data packet to one terminal device in one transmission.

[0198] The specific process is as follows.

[0199] S501A, the terminal device 500A sends the first information Z1 to the network device 400A, and the first information Z1 includes the channel state.

[0200] In some embodiments, the above channel state may include the maximum number of bits that the channel between the terminal device 500A and the network device 400A can support for transmission at the current moment, denoted as r1.

[0201] S501B, the terminal device 500B sends the first information Z2 to the network device 400A, and the first information Z2 includes the channel state.

[0202] In some embodiments, the above channel state may include the maximum number of bits that the channel between the terminal device 500B and the network device 400A can support for transmission at the current moment, denoted as r2.

[0203] S501C, the terminal device 500C sends the first information Z3 to the network device 400A, and the first information Z3 includes the channel state.

[0204] In some embodiments, the above channel state may include the maximum number of bits that the channel between the terminal device 500C and the network device 400A can support for transmission at the current moment, denoted as r3.

[0205] S501D, the terminal device 500D sends the first information Z4 to the network device 400A, and the first information Z4 includes the channel state.

[0206] In some embodiments, the above channel state may include the maximum number of bits that the channel between the terminal device 500D and the network device 400A can support for transmission at the current moment, denoted as r4.

[0207] It can be understood that there is no order of execution for the above steps S501A - S501D. For example, in some embodiments, they can be executed simultaneously, and in other embodiments, they can be executed in other orders.

[0208] S502, the network device 400A statistically analyzes the channel state, queue state, and waiting time corresponding to each data frame to obtain statistical information.

[0209] It can be understood that the channel state statistically analyzed by the network device 400A includes the current channel state and also the historical channel state. The network device 400A can store the channel state corresponding to each data frame at each time point, so as to calculate the historical channel state based on the channel state in the past period of time. Specifically, the historical channel state can be updated according to the current channel states r1, r2, r3, r4 corresponding to each data frame received, to obtain the historical channel state corresponding to each data frame. Among them, the terminal devices 500A, 500B, 500C, and 500D respectively correspond to the data frames LA, LB, LC, and LD.

[0210] It can be understood that the queue state represents the length of each queue, that is, the data frame length of the data frames stored in the queue. Specifically, the data frame lengths corresponding to the terminal devices 500A, 500B, 500C, and 500D are denoted as q1, q2, q3, and q4 respectively.

[0211] It can be understood that the waiting time is the waiting time of each data frame at the current moment. Specifically, the waiting times of the data frames LA, LB, LC, and LD are denoted as w1, w2, w3, and w4 respectively.

[0212] In some embodiments, the network device 400A statistically analyzes the channel state, queue state, and waiting time corresponding to each data frame to obtain statistical information, and the statistical information includes the current channel state, historical channel state, waiting time, and data frame length corresponding to each data frame.

[0213] S503, the network device 400A determines the transmission priority of each data frame according to the statistical information.

[0214] In some embodiments, the network device 400A calculates the channel dominance situation, the remaining transmission time, and the complete transmission time according to the current channel state, historical channel state, data frame length, and waiting time corresponding to each queue included in the statistical information; and determines the priorities corresponding to each data frame based on the channel dominance situation, the remaining transmission time, and the complete transmission time.

[0215] In some implementation manners, the priority score may be calculated according to the channel dominance situation, the remaining transmission time, and the complete transmission time, and the priorities are determined according to the numerical magnitudes of the priority scores of each data frame. Specifically, according to the channel dominance situation, the remaining transmission time, and the complete transmission time, the success degree factor, the urgency degree factor, and the channel dominance factor corresponding to each queue are calculated respectively, so as to obtain the specific priority score value. Moreover, the larger the numerical value of the priority score is, the higher the priority is.

[0216] The following steps S503A - S503C specifically introduce the specific steps for determining the success degree factor, the urgency degree factor, and the channel dominance factor in some implementation manners.

[0217] S503A, the network device 400A estimates the complete transmission time to obtain the success degree factor.

[0218] In some implementation manners, the network device 400A respectively estimates the complete transmission time according to the waiting times w1, w2, w3, w4, data frame lengths q1, q2, q3, q4, channel states r1, r2, r3, r4, and historical channel states corresponding to each data frame and compares the complete transmission time with a pre - specified frame delay constraint to obtain the success degree factor.

[0219] For example, referring to the above formula (4), according to the waiting times w1, w2, w3, w4, data frame lengths q1, q2, q3, q4, channel states r1, r2, r3, r4, and historical channel states corresponding to each data frame the success degree factors h1 of data frame LA, h2 of data frame LB, h3 of data frame LC, and h4 of data frame LD are calculated respectively.

[0220] S503B, the network device 400A estimates the remaining transmission time to obtain the urgency degree factor.

[0221] In some embodiments, the network device 400A respectively estimates the remaining transmission time according to the data frame lengths q1, q2, q3, q4 of each queue and the corresponding historical channel states and thus determines the success degree factor.

[0222] For example, referring to the above formula (3), according to the data frame lengths q1, q2, q3, q4 of each queue, and the corresponding historical channel states calculate respectively the urgency factor g1 of data frame LA, the urgency factor g2 of data frame LB, the urgency factor h3 of data frame LC, and the urgency factor h4 of data frame LD.

[0223] S503C, the network device 400A estimates the channel dominance situation to obtain a channel dominance factor.

[0224] In some embodiments, the network device 400A estimates the channel dominance situation based on the data frame lengths q1, q2, q3, q4 of each queue, the corresponding channel states r1, r2, r3, r4, and the historical channel state to obtain a channel dominance factor.

[0225] For example, referring to the above formula (2), according to the data frame lengths q1, q2, q3, q4 of each queue, the corresponding channel states r1, r2, r3, r4, and the historical channel state calculate respectively the channel dominance factor f1 of data frame LA, the channel dominance factor f2 of data frame LB, the channel dominance factor f3 of final data frame LC, and the channel dominance factor f4 of data frame LD.

[0226] It can be understood that the executions of S503A - S503C have no sequence, and the specific processes can be split or combined.

[0227] It can be understood that referring to formula (1), the corresponding priority scores are obtained based on the calculated success degree factor, urgency factor, and channel dominance factor, and then the priorities are determined according to the priority scores.

[0228] S504, the network device 400A performs scheduling according to the priorities.

[0229] In some embodiments, the network device 400A determines the first data frame to be transmitted according to the priorities of each data frame and the current transmission resources, and transmits the data in the first data frame to the corresponding terminal device, that is, transmits data packets to the terminal device corresponding to the first data frame. If the current transmission resources are such that N data packets can be transmitted, then it is determined to transmit the data frames with the top N priorities, that is, transmit the corresponding data packets to the terminal devices corresponding to the data frames with the top N priorities. In some implementation manners, since the network device 400A can calculate precoding weights, specific scheduling can be realized.

[0230] For example, the priority score of the current terminal device 500A is the largest and the priority level is the highest. At this time, the network device 400A needs to send the data packet from the data frame LA to the terminal device 500A.

[0231] S505. The network device 400A transmits the data packet to the terminal device 500A.

[0232] In some embodiments, at the t-th transmission, the network device 400A transmits the data packet from the data frame LA to the terminal device 500A.

[0233] It can be understood that after the network device 400A transmits the data packet from the data frame LA to the corresponding terminal device 500A, subsequent data packet transmissions will be carried out. When transmitting the data packet from a certain data frame each time subsequently, the priority determination process from step S501A to step S504 needs to be passed through, and then the data packet to be transmitted is determined. It can be understood that the terminal device for transmission with the network device can be the same or different each time subsequently. For example, S506, S507, and S508 respectively show the terminal devices corresponding to the transmission of the network device at the (t + 1)-th transmission, at the (t + 2)-th transmission, and at the (t + 3)-th transmission.

[0234] S506. The network device 400A transmits the data packet to the terminal device 500C.

[0235] For the next transmission, the network device 400A will still receive the first messages sent by each terminal device, and determine the priorities of each data frame according to steps S502 and S503, and then perform scheduling according to the priorities of each data frame. Assume that the priority of the current terminal device 500C is the highest. At this time, the network device 400A transmits the data packet to the terminal device 500C.

[0236] In some embodiments, at the (t + 1)-th transmission, the network device 400A transmits the data packet from the data frame LB to the terminal device 500C.

[0237] S507. The network device 400A transmits the data packet to the terminal device 500B.

[0238] In some embodiments, similarly, at the (t + 2)-th transmission, the network device 400A may transmit the data packet from the data frame LC to the terminal device 500B.

[0239] S508. The network device 400A transmits the data packet to the terminal device 500D.

[0240] In some embodiments, similarly, at the (t + 3)-th transmission, the network device 400A may transmit the data packet from the data frame LD to the terminal device 500C.

[0241] The "......" in the figure may indicate that after the network device 400A continues to transmit data packets to each terminal device for a period of time. It can be understood that the network device 400A may have transmitted multiple data frames to each terminal device, or it is also possible that none of them have been successfully transmitted. If each terminal device receives a complete data frame, for example, observes that the received data packet includes the identifier of the last data packet belonging to a data frame, which indicates that a complete data frame has been received, it will feedback to the network device 400A that the data frame has been successfully received. If each terminal device determines that it has not received a complete data frame, for example, under the time delay constraint, observes that the received data packet does not include the identifier of the last data packet belonging to a data frame, which indicates that a complete data frame has not been received, it will feedback to the network device 400A that the data frame reception has failed. Specifically, as shown in the following steps S509A to S509D, where the order of S509A to S509D can be different, and other steps can also be interspersed in between, which will not be elaborated here.

[0242] S509A, the terminal device 500A feedbacks to the network device 400A whether the frame reception is successful / failed.

[0243] It can be understood that after a period of time, after the terminal device 500A receives all the data packets corresponding to the same data frame, it can determine whether the received frame is complete, that is, whether the data frame has been successfully received, and then feedbacks to the network device 400A whether the frame reception is successful or failed.

[0244] In some implementation manners, the terminal device 500A can feedback the success / failure situation of reception to the network device 400A after receiving a data frame, or can also feedback the reception situation to the network device 400A after receiving multiple data frames, which is not limited here.

[0245] S509B, the terminal device 500B feedbacks to the network device 400A whether the frame reception is successful / failed.

[0246] S509C, the terminal device 500C feedbacks to the network device 400A whether the frame reception is successful / failed.

[0247] S509D, the terminal device 500D feedbacks to the network device 400A whether the frame reception is successful / failed.

[0248] Steps S509B - S509D are substantially the same as S509A, which will not be elaborated here; and there is no limit on the execution order between steps S509A - S509D.

[0249] S510, the network device 400A counts the number of successfully transmitted frames to all terminal devices.

[0250] In some implementations, the network device 400A counts the number of successfully received frames sent to all terminal devices based on the received feedback information, so as to obtain the frame success situation.

[0251] It can be understood that the execution order of the above steps S501 to S510 is only an example. In other embodiments, other execution orders can also be adopted, and some steps can be split or combined, which is not limited herein.

[0252] It can be understood that the network device not only transmits according to the channel state of each terminal device, but also considers the remaining transmission time and the complete transmission time to ensure the number of frames successfully transmitted within the specified time, thereby improving the frame satisfaction rate. It can be understood that through the above transmission method, the frame satisfaction rate can be effectively improved and the user experience of related services can be enhanced.

[0253] It can be understood that the above describes the interaction schematic diagram between the network device and the terminal device during downlink transmission. During uplink transmission, the method for the network device and the terminal device to determine the priority is essentially the same. The following describes the data transmission method corresponding to uplink transmission.

[0254] Figure 6 This is an interaction schematic diagram between a network device and a terminal device during uplink transmission provided by an embodiment of the present application.

[0255] It can be understood, Figure 6 Taking the network device and the terminal device as the execution subjects of the interaction schematic diagram as an example, the data transmission method of the present application is demonstrated. However, the present application does not limit the execution subjects of the interaction schematic diagram. In other embodiments, Figure 6 the network device in Figure 6 can also be a chip, a chip system or a processor that supports the network device to implement this method, Figure 6 and the terminal device in

[0256] can also be a chip, a chip system or a processor that supports the terminal device to implement this method. And,

[0257] S601A, the terminal device 500A sends the second information K1 to the network device 400A, and the second information K1 includes the channel state, the queue state and the waiting time.

[0258] It can be understood that since it is an uplink transmission process, each terminal device generates data frames to be transmitted, or receives data frames from other terminal devices, and needs to transmit the data frames in the buffer queue to the network device 400A. The terminal device 500A will send the channel state, queue state, and waiting time to the network device 400A. Among them, the channel state is substantially the same as the description of S501A in Figure 5 and will not be elaborated here. The queue state and waiting time are substantially the same as the description in S502 of Figure 5 and will not be elaborated here.

[0259] S601B, send the second information K2, where the second information K2 includes channel information, queue state, and waiting time.

[0260] S601C, send the second information K3, where the second information K3 includes channel information, queue state, and waiting time.

[0261] S601D, send the second information K4, where the second information K4 includes channel information, queue state, and waiting time.

[0262] Steps S601B to S601D are substantially the same as S601A and will not be elaborated here.

[0263] S602, the network device 400A statistically calculates the channel state, queue state, and waiting time corresponding to each queue to obtain statistical information.

[0264] It can be understood that this step is substantially the same as step S502 in the above Figure 5 and will not be elaborated here.

[0265] S603, the network device 400A calculates the priority according to the statistical information.

[0266] S603A, the network device 400A estimates the complete transmission time to obtain a success degree factor.

[0267] S603B, the network device 400A estimates the remaining transmission time to obtain an urgency degree factor.

[0268] S603C, the network device 400A estimates the channel dominance situation to obtain a channel dominance factor.

[0269] It can be understood that S603 and S603A - S603C are substantially the same as step S503 and S503A - S503C in Figure 5 and will not be elaborated here.

[0270] S604, the network device 400A performs scheduling according to the priority.

[0271] In some embodiments, the network device 400A determines to transmit the first data frame based on the priorities of each data frame and the current transmission resources, and allows the terminal device corresponding to the first data frame to send data packets. If the current transmission resources are sufficient to transmit N data packets, the terminal devices corresponding to the N queues with the highest priorities are allowed to transmit data packets.

[0272] For example, during one transmission, the network device 400A can communicate with 2 terminal devices, and currently the priority scores of data frame LA and data frame LC are the largest and the priorities are the highest. At this time, the network device 400A notifies the terminal device 500A and the terminal device 500C to send data frames, and then notifies the terminal device 500A and the terminal device 500C that they are allowed to send data packets.

[0273] S605A, the network device 400A sends a transmission notification to the terminal device 500A.

[0274] In some embodiments, the network device 400A notifies the terminal device 500A to perform a transmission.

[0275] S605B, the network device 400A sends a transmission notification to the terminal device 500C.

[0276] In some embodiments, the network device 400A notifies the terminal device 500C to perform a transmission.

[0277] It can be understood that S605A and S605B can be executed in any order.

[0278] S606A, the terminal device 500A prepares to transmit data packets.

[0279] In some embodiments, after receiving the notification from the network device 400A, the terminal device 500A will be authorized to perform a transmission. At this time, the terminal device 500A will prepare to transmit data packets.

[0280] S606B, the terminal device 500C prepares to transmit data packets.

[0281] It can be understood that this step is substantially the same as S606A and will not be elaborated here.

[0282] S607A, the terminal device 500A transmits data packets to the network device 400A.

[0283] S607B, the terminal device 500B transmits data packets to the network device 400A.

[0284] S608, the network device 400A receives data.

[0285] In some embodiments, the network device 400A receives data packets from the terminal device 500A and the terminal device 500C.

[0286] In the figure, "......" may indicate that after the terminal device 500A and the terminal device 500C have transmitted the determined data packets to the network device 400A, thereafter, each terminal device and the network device 400A still need to continue to transmit the corresponding data packets. It can be understood that the process of each subsequent transmission is substantially the same as the process of steps S601A to S608. Each time of transmission, it can be the same terminal device transmitting to the network device 400A, or different terminal devices transmitting to the network device 400A. According to the priorities of each data frame determined at each time of transmission, the terminal devices allowed to transmit are obtained, and the details are not described again here.

[0287] S609A, the network device 400A feeds back frame reception success / failure to the terminal device 500A.

[0288] It can be understood that after a period of time, the network device 400A feeds back frame reception success / failure to the terminal device 500A.

[0289] S609B, the network device 400A feeds back frame reception success / failure to the terminal device 500B.

[0290] S609C, the network device 400A feeds back frame reception success / failure to the terminal device 500C.

[0291] S609D, the network device 400A feeds back frame reception success / failure to the terminal device 500D.

[0292] Steps S609B - S609D are substantially the same as S609A, and steps S609A - S609D are substantially the same as the process of the above steps S509A - S509D. For the specific description, refer to the above steps S509A - S509D, and details are not described here.

[0293] It can be understood that the execution order of the above steps S601 to S609 is only an example. In some other embodiments, other execution orders can also be adopted, and some steps can also be split or combined, which are not limited here.

[0294] Figure 7A According to some embodiments of the present application, a schematic diagram of the 7 - layer model of OSI is shown.

[0295] As Figure 7AAs shown, the network side 400 corresponds to the application layer, presentation layer, session layer, transport layer, network layer, link layer, and physical layer. Each terminal device on the terminal side 500 also corresponds to the application layer, presentation layer, session layer, transport layer, network layer, link layer, and physical layer. Priority is determined and the corresponding data packet is transmitted to the link layer during the data transmission process.

[0296] Figure 7B According to some embodiments of the present application, a simulation experiment effect diagram of four terminal devices transmitting under XR service and corresponding to different frame delay constraints (i.e., different delay periods) is shown. Among them, the horizontal axis is the frame delay constraint, and the figure shows that the frame delay constraint (i.e., the delay period D) is 1 to 19ms; and the frame arrival period T = D + 5, that is, the time period for the arrival of two adjacent frames; the channel adopts large-scale path loss and Rayleigh fading small-scale channel. The total number of frames simulated is e 5 .

[0297] like Figure 7B As shown, the figure shows the frame satisfaction rate corresponding to the data transmission method of the present application and other four different scheduling methods. Among them, curve 1 corresponds to the proportional fairness algorithm, curve 2 corresponds to the logarithmic rule algorithm, curve 3 corresponds to the exponential rule algorithm, curve 4 corresponds to the optimized maximum weight delay priority algorithm, and curve 5 corresponds to the method of the embodiment of the present application. The average effect curve is obtained after multiple delays of curves 1-5. Curve 6 is the optimal effect curve obtained in multiple simulations corresponding to the method of the embodiment of the present application. And reference Figure 7B It can be found that the frame satisfaction rates corresponding to curve M5 and curve M6 of the embodiment of the present application are better than those of other solutions.

[0298] Table 1 below shows the improvement in frame satisfaction rate of the data transmission scheme in the embodiment of this application compared to other existing algorithms. Referring to Table 1 below, the first row shows the average frame satisfaction rate data of each method obtained after multiple experiments for each scheme. The second row shows the improvement ratio of the scheme provided by the embodiment of this application compared to other schemes. It can be seen that the scheme proposed in this application is more effective.

[0299] Table 1

[0300]

[0301] Figure 8 A schematic structural diagram of a device is shown according to an embodiment of the present application.

[0302] It can be understood that the device 800 can be a network device, a terminal device, a chip, a chip system, or a processor that supports the network device to implement the above method, or a chip, a chip system, or a processor that supports the terminal device to implement the above method, without limitation here. The device 800 can be used to implement the method described in the above method embodiments, and for specific details, reference can be made to the descriptions in the above method embodiments.

[0303] As Figure 8 shown, the device 800 may include one or more processors 801. The processor 801 can also be referred to as a processing unit and can implement certain control functions. The processor 801 can be a general-purpose processor or a dedicated processor, etc. For example, it can be a baseband processor or a central processing unit. The baseband processor can be used to process communication protocols and communication data, and the central processing unit can be used to control communication devices, such as base stations, baseband chips, terminals, terminal chips, DUs, or CUs, etc., execute software programs, and process the data of software programs.

[0304] In an alternative design, the processor 801 may also store instructions and / or data 803, and the instructions and / or data 803 can be run by the processor, enabling the device 800 to execute the method described in the above method embodiments.

[0305] In another alternative design, the processor 801 may include a transceiver unit for implementing receiving and sending functions. For example, the transceiver unit can be a transceiver circuit, an interface, or an interface circuit. The transceiver circuit, interface, or interface circuit for implementing receiving and sending functions can be separate or integrated together. The above transceiver circuit, interface, or interface circuit can be used for reading and writing code / data, or the above transceiver circuit, interface, or interface circuit can be used for signal transmission or transfer.

[0306] In yet another possible design, the device 800 may include a circuit, and the circuit can implement the functions of sending, receiving, or communicating in the foregoing method embodiments.

[0307] Optionally, the device 800 may include one or more memories 802, on which instructions / data 804 may be stored. The instructions can be run on the processor, enabling the device 800 to execute the method described in the above method embodiments. Optionally, data may also be stored in the memory. Optionally, instructions and / or data may also be stored in the processor. The processor and the memory can be set separately or integrated together. For example, the corresponding relationships described in the above method embodiments can be stored in the memory or in the processor.

[0308] Optionally, the device 800 may further include a transceiver 805 and / or an antenna 806. The processor 801 may be referred to as a processing unit to control the device 800. The transceiver 805 may be referred to as a transceiver unit, transceiver, transceiver circuit, transceiver device, interface, interface circuit, or transceiver module, etc., for implementing the transceiver function.

[0309] Optionally, the device 800 in the embodiments of the present application may be used to execute the Figure 5 or Figure 6 data transmission method described in the embodiments of the present application.

[0310] Figure 9 A schematic structural diagram of a data transmission system 90 is shown according to an embodiment of the present application. As shown in the figure, the data transmission system 90 includes a network device 90A and multiple terminal devices 90B.

[0311] The network device 90A is used to cache multiple data frames, each data frame to be transmitted to a terminal device 90B; and is further used to determine a first data frame to be transmitted currently based on the transmission success probability of each data frame, where the transmission success probability is used to evaluate the probability that the data frame is successfully transmitted; and is used to transmit the first data frame to the terminal device 90B corresponding to the first data frame; the terminal device 90B is used to receive the first data frame sent by the network device 90A.

[0312] Specifically, the network device 90A includes a caching module 901, a determining module 902, and a transmitting module 903.

[0313] The caching module 901 is used to cache multiple data frames, where each data frame is to be transmitted to a second electronic device.

[0314] The determining module 902 is used to determine a first data frame to be transmitted currently based on the transmission success probability of each data frame, where the transmission success probability is used to evaluate the probability that the data frame is successfully transmitted.

[0315] The transmitting module 903 is used to transmit the first data frame to the terminal device 90B corresponding to the first data frame.

[0316] In some embodiments, the data frames cached by the network device 90A are the data frames cached by the caching module 901 at the current moment. The current moment is any time point within the delay period. The starting point of the delay period is the initial moment. The transmission success probability is determined based on the remaining transmission time and the complete transmission time. The remaining transmission time is the time required for the data frame to be transmitted from the current moment to the end of transmission; the complete transmission time is the time required for the data frame to be transmitted from the initial moment to the end of transmission. And the transmission success probability is negatively correlated with both the remaining transmission time and the complete transmission time.

[0317] In some embodiments, the determining module 902 is configured to determine the transmission success probability of the first data frame currently to be transmitted by the network device 90A, and the transmission success probability satisfies:

[0318] P1 = g(ts) * h(tw)

[0319] Wherein, P1 is the transmission success probability; ts is the remaining transmission time; g(ts) is the urgency factor, and the urgency factor is negatively correlated with the remaining transmission time ts; tw is the complete transmission time; h(tw) is the success factor, and the success factor is negatively correlated with the complete transmission time tw.

[0320] In some embodiments, the determining module 902 is configured to obtain the urgency factor, and the urgency factor satisfies:

[0321]

[0322] Wherein, ka is a hyperparameter used to adjust the relationship between the urgency factor and the remaining transmission time.

[0323] In some embodiments, the determining module 902 is configured to obtain the success factor based on, and the success factor satisfies:

[0324]

[0325] Wherein, D represents the delay period; μ is a hyperparameter used to adjust the relationship between the complete transmission time and the delay period of the data frame; c is a hyperparameter used to adjust the relationship between the complete transmission time and the success factor.

[0326] In some embodiments, the determining module 902 is further configured to determine the remaining transmission time in the following manner: based on the data frame length of the data frame and the historical channel average transmission bits of the data frame, determine the remaining transmission time of the data frame, wherein the historical channel average transmission bits is the average number of bits supported by the channel between the network device 90A and the terminal device 90B corresponding to the data frame during the first historical time period.

[0327] In some embodiments, the determining module 902 is configured to obtain the remaining transmission time ts, and the remaining transmission time satisfies:

[0328]

[0329] Wherein, q represents the data frame length; represents the historical channel average transmission bits.

[0330] In some embodiments, the determining module is configured to obtain the complete transmission time tw, and the complete transmission time satisfies:

[0331]

[0332] Wherein, w represents the waiting time for the data frame to wait for transmission, and the waiting time for the data frame to wait for transmission is the time from the initial moment (i.e., the starting point of the delay period) to the current moment of the data frame; q represents the data frame length, that is, the length of the data frame at the current moment; represents the average number of transmitted bits of the historical channel; r represents the current channel transmission bit number of the data frame, and the current channel transmission bit number is the maximum number of bits that the network device 90A and the terminal device 90B corresponding to the data frame can support for transmission at the current moment.

[0333] In some embodiments, the determining module 902 is configured to determine the first data frame to be transmitted currently based on the transmission success probability of each data frame, including: the determining module 902 is configured to calculate the priority score of each data frame according to the transmission success probability of each data frame; and determine the first data frame according to the corresponding priority score of each data frame.

[0334] In some embodiments, the determining module is configured to obtain a priority score, and the priority score satisfies:

[0335] Priority = β * f(·) * P1

[0336] Wherein, Priority is the priority score, β is a hyperparameter, f(·) represents the channel dominance factor, P1 is the transmission success probability, and the channel dominance factor is related to the data frame length, the current channel transmission bit number, and the historical channel average transmission bit number of the data frame.

[0337] Wherein, the current channel transmission bit number is the maximum number of bits that the network device 90A and the terminal device 90B corresponding to the data frame can support for transmission at the current moment; the historical channel average transmission bit number is the average number of bits that the network device 90A and the terminal device 90B corresponding to the data frame can support for transmission within the first historical time period.

[0338] In some embodiments, the determining module 902 is configured to obtain a channel dominance factor, and the channel dominance factor satisfies:

[0339]

[0340] Wherein, r represents the current channel transmission bit number; represents the historical channel average transmission bit number; q represents the data frame length.

[0341] The terminal device 90B is configured to receive the first data frame transmitted by the network device 900A.

[0342] Figure 10The structural schematic diagram of a data transmission device system is shown according to an embodiment of the present application. As shown in the figure, the data transmission device system includes a network device 1000A and multiple terminal devices 1000B.

[0343] The network device 1000A is configured to detect data transmission request messages sent by the multiple terminal devices 1000B. The data transmission request messages are used to indicate that the terminal devices 1000B will transmit the buffered data frames to the network device 1000A. Moreover, it is further configured to determine a first data frame to be currently transmitted based on the transmission success probabilities corresponding to the data frames of the respective terminal devices 1000B, where the transmission success probability is used to evaluate the probability of a data frame being successfully transmitted. The network device 1000A is further configured to send a transmission permission instruction to the terminal device 1000B corresponding to the first data frame. Moreover, it is further configured to receive the first data frame from the terminal device 1000B corresponding to the first data frame.

[0344] The network device 1000A further includes: a detection module 1001, configured to detect data transmission request messages sent by the multiple terminal devices 1000B, where the data transmission request messages are used to indicate that the terminal devices 1000B will transmit the buffered data frames to the network device 1000A; a determination module 1002, configured to determine a first data frame to be currently transmitted based on the transmission success probabilities corresponding to the data frames of the respective terminal devices 1000B, where the transmission success probability is used to evaluate the probability of the data frame being successfully transmitted; a sending module 1003, configured to send a transmission permission instruction to the terminal device 1000B corresponding to the first data frame; and a receiving module 1004, configured to receive the first data frame from the terminal device 1000B corresponding to the first data frame.

[0345] The terminal device 1000B includes:

[0346] A first sending module 1005, configured to send a data transmission request message to the network device 1000A, where the data transmission request message is used to indicate that the terminal device 1000B will transmit the buffered data frame to the network device 1000A;

[0347] A receiving module 1006, configured to receive the transmission permission instruction sent by the network device 1000A;

[0348] A second sending module 1007, configured to send the first data frame to the network device 1000A, where the determination method of the first data frame is related to the transmission success probability of the data frame buffered by the data transmission device.

[0349] According to the method provided by the embodiments of the present application, the present application also provides a computer program product, which includes computer program code. When the computer program code runs on a computer, the computer is enabled to implement the steps executed by the apparatus 800 in any one of the above embodiments.

[0350] According to the method provided by the embodiments of the present application, the present application also provides a computer-readable medium, which stores program code. When the program code runs on a computer, the computer is enabled to implement the steps executed by the apparatus 800 in any one of the above embodiments.

[0351] According to the method provided by the embodiments of the present application, the present application also provides a chip, which is applied to a network device or a terminal device to execute the data transmission method as described above.

[0352] The processor and transceiver described in the present application can be implemented on an integrated circuit (IC), analog IC, radio frequency integrated circuit RFIC, mixed signal, application specific integrated circuit (ASIC), printed circuit board (PCB), electronic device, etc. The processor and transceiver can also be manufactured using various IC process technologies, such as complementary metal oxide semiconductor (CMOS), N-type metal oxide semiconductor, P-type metal oxide semiconductor (positive channel metal oxide semiconductor, PMOS), bipolar junction transistor, etc.

[0353] The apparatus described in the above embodiments may be a network device or a terminal device, but the scope of the apparatus described in the present application is not limited thereto, and the structure of the apparatus 800 may not be limited by Figure 8 The apparatus 800 may be an independent device or may be a part of a larger device. For example, the apparatus may be: (1) an independent integrated circuit IC, or a chip, a chip system or a subsystem; (2) a set having one or more ICs. Optionally, the IC set may also include a storage component for storing data and / or instructions; (3) an ASIC, such as a modem; (4) a module that can be embedded in other devices; (5) a receiver, a terminal, a smart terminal, a cellular phone, a wireless device, a handheld device, a mobile unit, a vehicle-mounted device, a network device, a cloud device, an artificial intelligence device, a machine device, a home device, a medical device, an industrial device, etc.; (6) others, etc.

[0354] According to the method provided by the embodiments of the present application, the present application further provides a computer program product, which includes: computer program code. When the computer program code runs on a computer, it enables the computer to implement the steps executed by the device 800 in any one of the above embodiments.

[0355] According to the method provided by the embodiments of the present application, the present application further provides a computer-readable medium, which stores program code. When the program code runs on a computer, it enables the computer to implement the steps executed by the device 800 in any one of the above embodiments.

[0356] The embodiments disclosed in the present application can be implemented in hardware, software, firmware, or a combination of these implementation methods. The embodiments of the present application can be implemented as a computer program or program code executed on a programmable system, which includes at least one processor, a storage system (including volatile and non-volatile memories and / or storage elements), at least one input device, and at least one output device.

[0357] The program code can be applied to the input instructions to execute the various functions described in the present application and generate output information. The output information can be applied to one or more output devices in a known manner. For the purposes of the present application, the processing system includes any system having a processor such as, for example, a digital signal processor (DSP), a microcontroller, an application-specific integrated circuit (ASIC), or a microprocessor.

[0358] The program code can be implemented in a high-level procedural language or an object-oriented programming language to communicate with the processing system. When needed, the program code can also be implemented in assembly language or machine language. In fact, the mechanisms described in the present application are not limited to the scope of any specific programming language. In any case, the language can be a compiled language or an interpreted language.

[0359] In some cases, the disclosed embodiments may be implemented in hardware, firmware, software, or any combination thereof. The disclosed embodiments may be implemented as instructions carried or stored on one or more transient or non-transitory machine-readable (e.g., computer-readable) storage media, which may be read and executed by one or more processors. For example, the instructions may be distributed via a network or via other computer-readable media. Thus, machine-readable media can include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer), including but not limited to, floppy disks, optical disks, optical discs, read-only memories, magneto-optical disks, read-only memories, random access memories, erasable programmable read-only memories, electrically erasable programmable read-only memories, magnetic or optical cards, flash memory, or tangible machine-readable memories for transmitting information (e.g., carrier waves, infrared signals, digital signals, etc.) in electrical, optical, acoustic, or other forms of propagated signals using the Internet. Thus, machine-readable media includes any type of machine-readable media suitable for storing or transmitting electronic instructions or information in a form readable by a machine (e.g., a computer).

[0360] In the drawings, some structural or method features are shown in a particular arrangement and / or order. However, it should be understood that in some embodiments, such a particular arrangement and / or ordering may not be required. Rather, in some embodiments, these features may be arranged in a manner and / or order different from that shown in the illustrative drawings. Additionally, the inclusion of a structural or method feature in a particular figure does not imply that such a feature is required in all embodiments, and in some embodiments, these features may not be included or may be combined with other features.

[0361] It should be noted that each unit / module mentioned in the device embodiments of the present application is a logical unit / module. Physically, a logical unit / module may be a physical unit / module, may be a part of a physical unit / module, or may also be implemented as a combination of multiple physical units / module. The physical implementation manner of these logical units / module themselves is not the most important. The combination of the functions implemented by these logical units / module is the key to solving the technical problems proposed by the present application. In addition, in order to highlight the innovative part of the present application, the above-mentioned device embodiments of the present application do not introduce units / module that are not closely related to solving the technical problems proposed by the present application. This does not mean that there are no other units / module in the above-mentioned device embodiments.

[0362] It should be noted that in the examples and descriptions of this patent, relational terms such as first and second are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual relationship or order between these entities or operations. Moreover, the terms "comprising", "including" or any other variant thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device comprising a series of elements not only includes those elements, but also includes other elements not expressly listed, or also includes elements inherent to such process, method, article or device. Without further limitation, an element defined by the statement "comprising one" does not exclude the presence of additional identical elements in the process, method, article or device comprising the said element. Although this application has been illustrated and described by reference to certain preferred embodiments of the present application, those of ordinary skill in the art should understand that various changes can be made in form and detail without departing from the scope of this application.

Claims

1. A data transmission method is applied to an extended reality scenario, and the extended reality scenario includes a first electronic device and multiple second electronic devices, characterized in that, Including: The first electronic device caches multiple data frames, and each of the data frames is to be transmitted to one of the second electronic devices; The first electronic device determines a first data frame to be currently transmitted based on the transmission success probability of each of the data frames, where the transmission success probability is used to evaluate the probability that the data frame is successfully transmitted; The first electronic device transmits the first data frame to the second electronic device corresponding to the first data frame.

2. The method according to claim 1, characterized in that, The data frame is a data frame cached by the first electronic device at the current moment, the current moment is any time point within the delay period, the starting point of the delay period is the initial moment, and the transmission success probability is determined based on the remaining transmission time and the complete transmission time. Among them, The remaining transmission time is the time required for the data frame to be transmitted from the current moment until it is completely transmitted; the complete transmission time is the time required for the data frame to be transmitted from the initial moment until it is completely transmitted, and The transmission success probability is negatively correlated with both the remaining transmission time and the complete transmission time.

3. The method according to claim 2, characterized in that, The transmission success probability satisfies: P1 = g(ts) * h(tw) Wherein, P1 is the transmission success probability; ts is the remaining transmission time; g(ts) is the urgency factor, and the urgency factor is negatively correlated with the remaining transmission time ts; tw is the complete transmission time; h(tw) is the success factor, and the success factor is negatively correlated with the complete transmission time tw.

4. The method according to claim 3, wherein The urgency factor satisfies: where k a is a hyperparameter used to adjust the relationship between the urgency factor and the remaining transmission time.

5. The method according to claim 3, characterized in that The success factor satisfies: Wherein, D represents the delay period; μ is a hyperparameter used to adjust the relationship between the complete transmission time and the delay period of the data frame; c is a hyperparameter used to adjust the relationship between the complete transmission time and the success factor.

6. The method according to claim 4, wherein The remaining transmission time is determined by the following method: Based on the data frame length of the data frame and the historical channel average transmission bits of the data frame, the remaining transmission time of the data frame is determined, where the historical channel average transmission bits is the average number of bits supported by the channel between the first electronic device and the second electronic device corresponding to the data frame within the first historical time period.

7. The method according to claim 6, wherein The remaining transmission time ts satisfies: where q represents the length of the data frame; represents the average number of transmitted bits of the historical channel.

8. The method according to claim 7, characterized in that, The complete transmission time tw satisfies: Where, w represents the waiting time for the data frame to be transmitted, and the waiting time for the data frame to be transmitted is the time from the initial moment to the current moment; q represents the data frame length; represents the average number of bits transmitted by the historical channel; r represents the current number of bits transmitted by the data frame on the channel, and the current number of bits transmitted by the data frame on the channel is the maximum number of bits supported by the channel between the first electronic device and the second electronic device corresponding to the data frame at the current moment.

9. The method according to any one of claims 3, characterized in that, The first electronic device determines the first data frame to be currently transmitted based on the transmission success probability of each of the data frames, including: The first electronic device calculates the priority score of each of the data frames according to the transmission success probability of each of the data frames; According to each of the priority scores, the first data frame is determined.

10. The method according to claim 9, characterized in that, The priority score of each of the data frames satisfies: Priority = β * f(·) * P1 Wherein, Priority is the priority score, β is a hyperparameter, f(·) represents the channel dominance factor, and the channel dominance factor is related to the data frame length of the data frame, the current channel transmission bits, and the historical channel transmission average bits. Wherein, the number of bits transmitted by the current channel is the maximum number of bits that the channel supports transmission between the first electronic device and the second electronic device corresponding to the data frame at the current moment; the average number of bits transmitted by the historical channel is the average number of bits that the channel supports transmission between the first electronic device and the second electronic device corresponding to the data frame within the first historical time period.

11. The method according to claim 10, wherein The channel dominance factor satisfies: where r represents the number of bits transmitted on the current channel; represents the average number of bits transmitted on the historical channel; q represents the data frame length.

12. A data transmission method, applied to an extended reality scenario, the extended reality scenario including a first electronic device and a plurality of second electronic devices, characterized in that, The method includes: The second electronic device receives a first data frame transmitted by the first electronic device, where the first data frame is the first data frame among multiple data frames cached by the first electronic device, and each data frame is to be transmitted to a second electronic device, and the determination method of the first data frame is related to the transmission success probability of each data frame.

13. A data transmission method is applied to an extended reality scenario. The extended reality scenario includes a first electronic device and multiple second electronic devices, and is characterized in that, The method includes: The first electronic device detects data transmission request messages sent by the multiple second electronic devices, and the data transmission request messages are used to indicate that the second electronic devices will transmit the cached data frames to the first electronic device. The first electronic device determines a first data frame to be transmitted currently based on the transmission success probabilities corresponding to the data frames of the second electronic devices, where the transmission success probability is used to evaluate the probability that the data frame is successfully transmitted. The first electronic device sends a transmission permission instruction to the second electronic device corresponding to the first data frame. The first electronic device receives the first data frame from the second electronic device corresponding to the first data frame.

14. The method according to claim 13, wherein The first electronic device executes the method according to any one of claims 2 to 11 above.

15. A data transmission method, applied to an extended reality scenario, the extended reality scenario including a first electronic device and a plurality of second electronic devices, characterized in that, The method includes: The multiple second electronic devices send data transmission request messages to the first electronic device, and the data transmission request messages are used to indicate that the second electronic devices will transmit the cached data frames to the first electronic device. The second electronic device corresponding to the first data frame receives the transmission permission instruction sent by the first electronic device, where the determination method of the first data frame is related to the transmission success probabilities of the data frames cached by the second electronic devices. The second electronic device corresponding to the first data frame sends the first data frame to the first electronic device.

16. A data transmission device, characterized in that, The data transmission device includes: A caching module for caching multiple data frames, where each data frame is to be transmitted to a second electronic device. A determination module for determining a first data frame to be transmitted currently based on the transmission success probabilities of the data frames, where the transmission success probability is used to evaluate the probability that the data frame is successfully transmitted. A transmission module for transmitting the first data frame to the second electronic device corresponding to the first data frame.

17. The data transmission device according to claim 16, wherein The data frame is the data frame cached by the caching module at the current moment, the current moment is any time point within the delay period, the starting point of the delay period is the initial moment, and the transmission success probability is determined based on the remaining transmission time and the complete transmission time, where The remaining transmission time is the time required for the data frame to be completely transmitted from the current moment; the complete transmission time is the time required for the data frame to be completely transmitted from the initial moment, and the transmission success probability is negatively correlated with both the remaining transmission time and the complete transmission time.

18. The data transmission device according to claim 17, wherein The transmission success probability satisfies: P1 = g(ts) * h(tw) where P1 is the transmission success probability; ts is the remaining transmission time; g(ts) is the urgency factor, and the urgency factor is negatively correlated with the remaining transmission time ts; tw is the complete transmission time; h(tw) is the success factor, and the success factor is negatively correlated with the complete transmission time tw.

19. The data transmission device according to claim 18, characterized in that, The urgency factor satisfies: where k a is a hyperparameter used to adjust the relationship between the urgency factor and the remaining transmission time.

20. The data transmission device according to claim 18, wherein The success factor satisfies: where D represents the delay period; μ is a hyperparameter used to adjust the relationship between the complete transmission time and the delay period of the data frame; c is a hyperparameter used to adjust the relationship between the complete transmission time and the success factor.

21. The data transmission device according to claim 19, characterized in that, The determining module is further configured to determine the remaining transmission time in the following manner: The determining module is further configured to determine the remaining transmission time of the data frame based on the data frame length of the data frame and the historical channel average transmission bits of the data frame, where the historical channel average transmission bits is the average number of bits supported by the channel between the data transmission device and the second electronic device corresponding to the data frame during the first historical period.

22. The data transmission device according to claim 21, wherein The remaining transmission time ts satisfies: where q represents the length of the data frame; represents the average number of transmitted bits of the historical channel.

23. The data transmission device according to claim 20, wherein The complete transmission time tw satisfies: Wherein, w represents the waiting time for the data frame to be transmitted, and the waiting time for the data frame to be transmitted is the time from the initial moment to the current moment; q represents the data frame length; represents the average number of bits transmitted by the historical channel; r represents the current channel transmission bit number of the data frame, and the current channel transmission bit number is the maximum number of bits supported by the channel between the data transmission device and the second electronic device corresponding to the data frame at the current moment.

24. The data transmission device according to claim 16, wherein The determining module is configured to determine the first data frame to be currently transmitted based on the transmission success probability of each data frame, including: The determining module is configured to calculate the priority score of each data frame according to the transmission success probability of each data frame; The determining module is configured to determine the first data frame according to each priority score.

25. The data transmission device according to claim 24, wherein The priority score of each data frame satisfies: Priority = β * f(·) * P1 where Priority is the priority score, β is a hyperparameter, and f(·) represents the channel dominance factor, where the channel dominance factor is related to the data frame length of the data frame, the current channel transmission bits, and the historical channel transmission average bits. where the current channel transmission bits is the maximum number of bits supported by the channel between the data transmission device and the second electronic device corresponding to the data frame at the current moment; the historical channel transmission average bits is the average number of bits supported by the channel between the data transmission device and the second electronic device corresponding to the data frame during the first historical period.

26. The data transmission device according to claim 25, characterized in that, The channel dominance factor satisfies: where r represents the number of bits transmitted on the current channel; represents the average number of bits transmitted on the historical channel; q represents the data frame length.

27. A data transmission device, characterized in that, The data transmission device includes a processor and a memory, and the processor is configured to execute the data in the memory, so that the data transmission device executes the method according to any one of claims 1-12.

28. A data transmission system, characterized in that, The system includes a first electronic device and a plurality of second electronic devices; wherein, the first electronic device is a data transmission device as described in any one of claims 16 - 27; the second electronic devices are configured to receive the first data frame sent by the first electronic device.

29. A data transmission device, characterized in that, The data transmission device includes: A detection module, configured to detect data transmission request messages sent by a plurality of second electronic devices, where the data transmission request messages are used to indicate that the second electronic devices are to transmit buffered data frames to the data transmission device; A determination module, configured to determine a first data frame to be currently transmitted based on the transmission success probabilities corresponding to the data frames of the second electronic devices, where the transmission success probability is used to evaluate the probability of successful transmission of the data frame; A sending module, configured to send a transmission permission instruction to the second electronic device corresponding to the first data frame; A receiving module, configured to receive the first data frame from the second electronic device corresponding to the first data frame.

30. A data transmission device, characterized in that, The data transmission device includes: A first sending module, configured to send a data transmission request message to a first electronic device, where the data transmission request message is used to indicate that the data transmission device is to transmit buffered data frames to the first electronic device; A receiving module, configured to receive the transmission permission instruction sent by the first electronic device; A second sending module, configured to send a first data frame to the first electronic device, where the determination manner of the first data frame is related to the transmission success probability of the data frames buffered by the data transmission device.

31. A data transmission device, characterized in that, The data transmission device includes a processor and a memory, and the processor is configured to execute the data in the memory, such that the data transmission device executes the method as described in any one of claims 13 - 15.

32. A data transmission system, the system comprising a first electronic device and a plurality of second electronic devices, wherein, The first electronic device is the data transmission device in claim 29, and the second electronic device is the data transmission device in claim 30.

33. A readable storage medium, characterized in that, Instructions are stored on the readable medium, and when the instructions are executed on an electronic device, the electronic device is caused to execute the data transmission method as described in any one of claims 1 to 15.

34. A chip, characterized in that, The chip is applied to an electronic device for executing the data transmission method as described in any one of claims 1 to 15.

35. A computer program product, the computer program product comprising: Computer program code, when the computer program code runs on a computer, causes the computer to execute the data transmission method as described in any one of claims 1 to 15.

Images