Data transmission method and device and related equipment

Abstract

The invention provides a data transmission method and device and related equipment, particularly relates to the technical field of 5G mobile communication, is applied to a first node in a self-organizing network, and comprises the following steps: determining a first scheduling unit and a second scheduling unit in a plurality of scheduling units of a scheduling period of the self-organizing network, the number of the first scheduling units is matched with the data sending requirement of the first node in the scheduling period; based on the first scheduling unit and the second scheduling unit, a set transmission operation is executed, and the set transmission operation comprises at least one of the following items: in an uplink time slot of the first scheduling unit, a data sending operation is executed; executing a data receiving operation in a downlink time slot of the first scheduling unit; and executing a data receiving operation in the downlink time slot of the second scheduling unit. By setting the number of the first scheduling units comprising the uplink time slots, the data transmission requirements of the corresponding first nodes are dynamically matched, so that the overall data transmission efficiency of the self-organizing network is improved.

Description

Technical Field

[0001] The present application relates to the technical field of 5G mobile communications, and specifically to a data transmission method, apparatus and related equipment. Background Art

[0002] In 5G mobile communication technology, self-organizing networks have received widespread attention due to their adaptability and decentralization.

[0003] At present, in the self-organizing network communication scheme designed by related technologies, data transmission between multiple nodes in the self-organizing network is achieved through polling. Although the control of the polling method is simple, the utilization of time domain resources is relatively low, which leads to low overall data transmission efficiency of the self-organizing network. Summary of the invention

[0004] The purpose of the present application is to provide a data transmission method, apparatus and related equipment, which are used to solve the technical problem of low data transmission efficiency existing in the data transmission scheme of the self-organizing network provided by the related technology.

[0005] In a first aspect, an embodiment of the present application provides a data transmission method, which is applied to a first node, where the first node is a node in a self-organizing network, and the method includes:

[0006] Determine a first scheduling unit and a second scheduling unit among multiple scheduling units of a scheduling period, wherein the scheduling period is one of multiple scheduling periods of the self-organizing network, and the number of the first scheduling units matches the data transmission demand of the first node in the scheduling period;

[0007] Based on the first scheduling unit and the second scheduling unit, a setting transmission operation is performed, wherein the setting transmission operation includes at least one of the following:

[0008] In an uplink time slot of the first scheduling unit, sending first service data to a second node or broadcasting public data to at least one third node;

[0009] receiving, in a downlink timeslot of the first scheduling unit, second service data or service feedback data sent by a second node;

[0010] receiving, in a downlink timeslot of the second scheduling unit, third service data or broadcast data sent by a fourth node;

[0011] The second node, the third node and the fourth node are all nodes in the self-organizing network.

[0012] In a second aspect, an embodiment of the present application provides a data transmission device, which is applied to a first node, where the first node is a node in a self-organizing network, and the data transmission device includes:

[0013] A scheduling unit determination module, configured to determine a first scheduling unit and a second scheduling unit from among a plurality of scheduling units in a scheduling period, wherein the scheduling period is one of a plurality of scheduling periods of the self-organizing network, and the number of the first scheduling units matches a data transmission requirement of the first node in the scheduling period;

[0014] A data transmission module, configured to perform a setting transmission operation based on the first scheduling unit and the second scheduling unit, wherein the setting transmission operation includes at least one of the following:

[0015] In an uplink time slot of the first scheduling unit, sending first service data to a second node or broadcasting public data to at least one third node;

[0016] receiving, in a downlink timeslot of the first scheduling unit, second service data or service feedback data sent by a second node;

[0017] receiving, in a downlink timeslot of the second scheduling unit, third service data or broadcast data sent by a fourth node;

[0018] The second node, the third node and the fourth node are all nodes in the self-organizing network.

[0019] In a third aspect, the present application provides an electronic device, comprising a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the computer program, when executed by the processor, implements the steps of the method described in the first aspect.

[0020] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the steps of the method described in the first aspect are implemented.

[0021] In a fifth aspect, the present application provides a computer program product, comprising computer instructions, which, when executed by a processor, implement the steps of the method described in the first aspect.

[0022] In the present application, time slot scheduling of multiple nodes in a self-organizing network is performed based on scheduling units, and the number of first scheduling units including uplink time slots is set to dynamically match the data sending requirements of the corresponding first node, so as to support the total number of time slots allocated to each node in the self-organizing network during the scheduling period to match the time slot resources actually required by the node, so that the master control node can dynamically increase or decrease the number of scheduling units including uplink time slots allocated to each node as needed, so as to maximize the utilization of time slot resources for each node while ensuring the stability of data transmission of each node, thereby improving the overall data transmission efficiency of the self-organizing network. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] Figure 1 It is a flowchart of a data transmission method provided by an embodiment of the present application;

[0024] Figure 2 is a schematic diagram of a mapping relationship between a scheduling unit and a node provided in an embodiment of the present application;

[0025] Figure 3 is a schematic diagram of time slot distribution in a first scheduling unit provided in an embodiment of the present application;

[0026] Figure 4 is a schematic diagram of another time slot distribution in a first scheduling unit provided in an embodiment of the present application;

[0027] Figure 5 is a schematic diagram for representing transmission delay provided in an embodiment of the present application;

[0028] Figure 6 It is a structural schematic diagram of a data transmission device provided in an embodiment of the present application;

[0029] Figure 7 It is a structural schematic diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0030] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0031] See also Figure 1 , the present application embodiment provides a data transmission method, such as Figure 1 As shown, the method is applied to a first node, where the first node is a node in a self-organizing network, and includes:

[0032] Step 101: Determine a first scheduling unit and a second scheduling unit among multiple scheduling units in a scheduling cycle of the self-organizing network.

[0033] The number of the first scheduling units matches the data transmission requirements of the first node in the scheduling period.

[0034] In the present application, a self-organizing network may be understood as a wireless self-organizing network implemented based on the 5G NR standard, which includes a plurality of nodes, each of which may represent a 5G NR device.

[0035] The self-organizing network includes multiple scheduling cycles to achieve periodic scheduling of time slots (used for corresponding nodes to send data) of multiple nodes included in the self-organizing network, thereby ensuring the flexibility of time slot scheduling in one-to-many scenarios while reducing the complexity of time slot scheduling of the self-organizing network; the scheduling cycle referred to in step 101 can be understood as one scheduling cycle among the multiple scheduling cycles.

[0036] It should be noted that, in multiple scheduling periods of the self-organizing network, the time slot scheduling strategies corresponding to different scheduling periods may be the same or different, wherein the same time slot scheduling strategies corresponding to different scheduling periods should be understood as: the number of scheduling units included in different scheduling periods is the same, and the number of time slots included in the scheduling units in different scheduling periods is the same;

[0037] Correspondingly, different scheduling periods corresponding to different time slot scheduling strategies should be understood as: different scheduling periods include different numbers of scheduling units, and / or different scheduling periods include different numbers of time slots.

[0038] In the application, it can be set that during the periodic time slot scheduling of the self-organizing network, the time slot scheduling strategy will be updated only when the set update conditions are met, otherwise the used / set time slot scheduling strategy will be used to reduce the update frequency of the time slot scheduling strategy and reduce the complexity and energy consumption of the time slot scheduling strategy configuration, wherein the set update conditions may include at least one of the following:

[0039] The nodes forming the self-organizing network are updated (such as increasing or decreasing the number of nodes in the self-organizing network, replacing the original nodes in the self-organizing network with other nodes, etc.);

[0040] The set indicators of the self-organizing network exceed the threshold (such as high packet loss rate, high transmission delay, etc.).

[0041] Among them, the number of the first scheduling units matches the data sending demand of the first node within the scheduling period, which can be understood as: the actual number of the first scheduling units is greater than or equal to the minimum number, and the minimum number is the minimum number of first scheduling units required to meet the data sending demand of the first node within the scheduling period.

[0042] In the present application, the first scheduling unit can be understood as a scheduling unit among the aforementioned multiple scheduling units that includes the uplink time slot corresponding to the first node, and the second scheduling unit can be understood as a scheduling unit among the aforementioned multiple scheduling units that does not include the uplink time slot corresponding to the first node.

[0043] Step 102: Perform a transmission setting operation based on the first scheduling unit and the second scheduling unit.

[0044] The setting transmission operation includes at least one of the following:

[0045] In an uplink time slot of the first scheduling unit, sending first service data to a second node or broadcasting public data to at least one third node;

[0046] receiving, in a downlink timeslot of the first scheduling unit, second service data or service feedback data sent by a second node;

[0047] receiving, in a downlink timeslot of the second scheduling unit, third service data or broadcast data sent by a fourth node;

[0048] The second node, the third node and the fourth node are all nodes in the self-organizing network.

[0049] The service feedback data may be understood as positive feedback (Acknowledgement, ACK) or negative feedback (Negative Acknowledgement, NACK) for specific service data (such as the first service data or the second service data mentioned above).

[0050] In the application, in the uplink time slot of the first scheduling unit, the first node may choose to send / broadcast data, or may choose neither to send nor broadcast data.

[0051] It should be noted that the uplink time slot in the present application should be understood as: a time slot used to send data to the corresponding node (in a point-to-point form or a point-to-multipoint form); accordingly, the downlink time slot in the present application should be understood as: a time slot used to receive data to the corresponding node.

[0052] It should also be noted that in the present application, the definition of uplink time slot and downlink time slot depends on the node distinction. For example: if a time slot A is set, and time slot A is defined as a time slot used for node a to send data to node b, then for node a, time slot A is an uplink time slot, and for node b, time slot A is a downlink time slot.

[0053] In addition, in order to avoid conflicts caused by different nodes sending data in the same time slot, it is set that any time slot in any scheduling cycle is allocated at most one node for data transmission. That is to say, for any time slot in any scheduling cycle, it corresponds to at most one node when used as an uplink time slot.

[0054] In the present application, by specifying the corresponding uplink time slot and downlink time slot for each node, the uplink and downlink time slot scheduling format in the self-organizing network is fixed. For example, each node can determine whether the current time slot belongs to an uplink time slot or a downlink time slot based on the system frame number (System Frame Number, SFN) and the time slot number.

[0055] In the present application, time slot scheduling of multiple nodes in a self-organizing network is performed based on scheduling units, and the number of first scheduling units including uplink time slots is set to dynamically match the data sending requirements of the corresponding first node, so as to support the total number of time slots allocated to each node in the self-organizing network in each scheduling cycle to match the time slot resources actually required by the node, so that the master control node can dynamically increase or decrease the number of scheduling units including uplink time slots allocated to each node as needed, so as to maximize the utilization of time slot resources for each node while ensuring the stability of data transmission of each node, thereby improving the overall data transmission efficiency of the self-organizing network.

[0056] In the present application, the multiple nodes use different time slots on the same channel and perform time slot scheduling in a time division duplexing (TDD) manner.

[0057] The multiple nodes in the self-organizing network can be divided into two categories: master control nodes and ordinary nodes. The master control node is at least used to obtain the data transmission requirements of each of the multiple nodes in the self-organizing network, and flexibly allocate an appropriate number of scheduling units to each node within the scheduling period based on this, so that the number of scheduling units including the uplink time slot of the node allocated to each node within the scheduling period matches the data transmission requirements of the node; ordinary nodes do not have the above-mentioned scheduling management authority and / or scheduling management capabilities.

[0058] In some embodiments, the master control node and ordinary nodes can be distinguished among multiple nodes in the self-organizing network based on information such as node location and node data processing capabilities. For example, the node with the smallest sum of distances to other nodes in the self-organizing network can be determined as the master control node, and other nodes except the master control node can be determined as ordinary nodes.

[0059] In the present application, the aforementioned first node can be a master control node or a common node; similarly, the second node / third node / fourth node can also be a master control node or a common node.

[0060] In one embodiment, the number of scheduling units included in any scheduling period of the self-organizing network is greater than or equal to the number of nodes included in the self-organizing network, and each node in the self-organizing network has at least one corresponding scheduling unit in each scheduling period, and the scheduling unit corresponding to the node includes the uplink time slot of the node.

[0061] In this embodiment, the above configuration is used to ensure that each node in the self-organizing network can get a transmission opportunity in each scheduling period, thereby ensuring that the data transmission delay of each node in the self-organizing network is within a controllable range.

[0062] In one example, the scheduling unit corresponding to the node may only include the uplink time slot of the node, for example: the node broadcasts the node information (such as node type, node location, node data transmission capability, etc.) and / or demand information of the node in the corresponding scheduling unit, and does not require other nodes to reply to the broadcast.

[0063] In another example, the scheduling unit corresponding to the node may include an uplink time slot of the node and a downlink time slot of the node.

[0064] In one embodiment, the number of the first scheduling units is K, K is a positive integer, and K is determined based on demand information indicating the data sending demand of the first node in the scheduling period, wherein the demand information includes the amount of data to be transmitted by the first node in the scheduling period, and the data amount is positively correlated with K.

[0065] In this embodiment, based on the above settings, it is ensured that the number of scheduling units including the uplink time slot corresponding to the node allocated to each node matches the data transmission requirements of each node in the scheduling period.

[0066] Exemplarily, after determining the amount of data to be transmitted by the first node within the scheduling period, a pre-set mapping table can be searched to determine the K value corresponding to the data amount, wherein the mapping table includes multiple mapping data, and the multiple mapping data correspond one-to-one to multiple groups of continuous data amount value intervals, each mapping data indicates a K value, and among the multiple mapping data, the larger the data amount value interval corresponding to the mapping data, the larger the K value indicated by the mapping data.

[0067] In one example, the demand information may also include the node importance of the first node in the self-organizing network, the data importance of the data to be transmitted by the first node in the scheduling period, the maximum transmission delay allowed by the first node, etc., wherein the higher the node importance, the higher K; the higher the data importance, the higher K; the lower the maximum transmission delay, the higher K.

[0068] Furthermore, when the K value is greater than 1, K first scheduling units may be set continuously to simplify the representation of scheduling units including uplink time slots corresponding to multiple nodes in the scheduling unit. For example: Figure 2 As shown, the scheduling units including uplink time slots allocated to node 0 are scheduling unit 0 (SU0) and scheduling unit 1 (SU1), the scheduling units including uplink time slots allocated to node 1 are scheduling unit 2 (SU2), the scheduling units including uplink time slots allocated to node 2 are scheduling unit 3 (SU3), scheduling unit 4 (SU4) and scheduling unit 5 (SU5)… The scheduling unit including uplink time slots allocated to node N-1 is scheduling unit p-1 (SUp-1). At this time, the correspondence between the N nodes of the self-organizing network and the p scheduling units of the target scheduling unit can be expressed as: [2,1,3,…,1], wherein each element in the sequence [2,1,3,…,1] corresponds to a node, and the element value of each element represents the number of scheduling units including uplink time slots allocated to the corresponding node.

[0069] In one embodiment, in the case where the self-organizing network is associated with an uplink service, the uplink time slot in the first scheduling unit is located before the downlink time slot in the first scheduling unit;

[0070] In the case where the self-organizing network is associated with a downlink service, the downlink time slot in the first scheduling unit is located before the uplink time slot in the first scheduling unit.

[0071] In this embodiment, based on the service conditions associated with the self-organizing network, the distribution of uplink time slots and downlink time slots within each scheduling unit is adaptively adjusted to increase the transmission priority of the uplink service or downlink service associated with the self-organizing network and ensure the response speed of the uplink service or downlink service associated with the self-organizing network.

[0072] Furthermore, when the number of uplink time slots and / or downlink time slots of the first scheduling unit is greater than 2, multiple uplink time slots within the first scheduling unit can be set to be continuous, and multiple downlink time slots within the first scheduling unit can be set to be continuous to simplify the representation of multiple time slots within the first scheduling unit.

[0073] The self-organizing network associated with uplink services can be understood as the self-organizing network being a network mainly engaged in uplink services, while the self-organizing network associated with downlink services can be understood as the self-organizing network being a network mainly engaged in downlink services.

[0074] When the self-organizing network is associated with an uplink service, the distribution of the uplink time slot and the downlink time slot in the first scheduling unit can be as follows: Figure 3 shown.

[0075] When the self-organizing network is associated with downlink services, the distribution of uplink time slots and downlink time slots in the first scheduling unit can be as follows: Figure 4 shown.

[0076] exist Figure 3 and Figure 4 In the figure, the rectangular block marked with U represents the uplink time slot, and the rectangular block marked with D represents the downlink time slot. Figure 3 In the embodiment, after the first node sends the first service data to the second node in the time slot indicated by the end of the arc with an arrow, the first node may receive a positive feedback (Acknowledgement, ACK) or a negative feedback (Negative Acknowledgement, NACK) in response to the first service data from the second node in the time slot indicated by the end of the arc without an arrow; Figure 4 In the embodiment, after the first node receives the second service data sent by the second node in the time slot indicated by the end of the arc with an arrow, it can reply to the second node with positive feedback (Acknowledgement, ACK) or negative feedback (Negative Acknowledgement, NACK) regarding the second service data in the time slot indicated by the end of the arc without an arrow.

[0077] In one embodiment, the scheduling cycle of the self-organizing network includes a target scheduling unit, wherein the target scheduling unit is a scheduling unit including a target time slot group, the target time slot group includes adjacent target downlink time slots and target uplink time slots, and the target downlink time slot is located before the target uplink time slot, a guard interval is set at the tail of the target downlink time slot, and / or a guard interval is set at the head of the target uplink time slot.

[0078] In this embodiment, based on the setting of the guard interval, the inter-symbol interference that may be encountered when the node switches from the target downlink time slot to the target uplink time slot is avoided, thereby ensuring the reliability of communication between nodes.

[0079] In one embodiment, the guard interval is an upward rounded value of the product of the number of OFDM symbols included in the unit time slot, the reciprocal of the duration of the unit time slot, and a reference propagation time, the duration of the unit time slot is determined according to the subcarrier spacing, and the reference propagation time is twice the ratio of the distance between two nodes associated with the target time slot group to the speed of light;

[0080] The OFDM symbol corresponding to the guard interval is located at the tail of the OFDM symbol sequence included in the target downlink time slot, and / or the OFDM symbol corresponding to the guard interval is located at the head of the OFDM symbol sequence included in the target uplink time slot.

[0081] In this embodiment, for the guard interval designed for the uplink timing advance (TA), based on the above settings, the number of OFDM symbols corresponding to the guard interval when the node switches from the target downlink time slot to the target uplink time slot is calculated, so as to reduce the number of OFDM symbols occupied by the guard interval while ensuring that the data to be transmitted can be received by the receiving side node in a timely manner at the predetermined time. This can increase the number of OFDM symbols used to carry business data in the OFDM symbol sequence included in the target uplink time slot during the period when the node switches from the target downlink time slot to the target uplink time slot.

[0082] For example, if Figure 5 As shown, node Q1, as a downlink transmitter, sends data D to node Q2, as a downlink receiver, at the starting endpoint of time slot 0 (slot0). Due to the existence of transmission delay, node Q2 starts to receive data D after the downlink reception delay at the starting endpoint of time slot 0 (slot0). When node Q2, as an uplink transmitter, sends data U to node Q1, as a downlink receiver, considering the existence of transmission delay, in order for node Q1 to start receiving data U at the starting endpoint of time slot 1 (slot1), it chooses to send data U in advance. The advance time is the uplink reception delay. The aforementioned uplink TA is the sum of the uplink reception delay and the downlink reception delay.

[0083] Exemplarily, if the number of OFDM symbols occupied by the guard interval is set to L, the number of OFDM symbols occupied by the guard interval can be calculated based on the following formula:

[0084]

[0085] T slot =10 -3 *2 -mu (2)

[0086] In the above formula, c represents the speed of light, c = 3 × 10 8 m / s, Indicates the number of OFDM symbols in a time slot (that is, the number of OFDM symbols included in a unit time slot), T slot It represents the duration of one time slot (that is, the duration of a unit time slot) in seconds. mu is the subcarrier spacing indicator. mu=0 represents a subcarrier spacing of 15KHz, and mu=1 represents a subcarrier spacing of 30KHz. d represents the distance between nodes (in meters).

[0087] In one embodiment, the time slot difference in the first scheduling unit is less than or equal to a preset difference threshold, wherein the time slot difference is the difference between an uplink time slot and a downlink time slot associated with the same first service data in the first scheduling unit.

[0088] In this embodiment, the difference threshold is set to avoid excessive data transmission delay, thereby ensuring that the transmission delay of each node in the self-organizing network is within a controllable range.

[0089] In the application, different difference thresholds can be set for different nodes to adapt to different data transmission delay requirements of different nodes.

[0090] In the present application, for any scheduling unit including an uplink time slot corresponding to any node, the scheduling unit may also include a downlink time slot of the corresponding node, so as to support at least one bidirectional communication between two nodes in each scheduling unit.

[0091] Exemplarily, for a service sending node of first service data, the service sending node sends the first service data in an uplink time slot J1 associated with the first service data, and receives ACK / NACK in a downlink time slot J2 associated with the first service data;

[0092] For the service receiving node of the first service data, the service sending node receives the first service data in the downlink time slot J1 associated with the first service data, and sends ACK / NACK in the uplink time slot J2 associated with the first service data;

[0093] In this example, the difference between the time slot J1 and the time slot J2 can be understood as the aforementioned time slot difference.

[0094] See also Figure 6 , Figure 6 is a data transmission device provided in an embodiment of the present application, such as Figure 6 As shown, it is applied to a first node, where the first node is a node in a self-organizing network, and the data transmission device 600 includes:

[0095] A scheduling unit determination module 601 is used to determine a first scheduling unit and a second scheduling unit from a plurality of scheduling units in a scheduling period of the self-organizing network, wherein the number of the first scheduling units matches the data transmission demand of the first node in the scheduling period;

[0096] The data transmission module 602 is configured to perform a setting transmission operation based on the first scheduling unit and the second scheduling unit, wherein the setting transmission operation includes at least one of the following:

[0097] In an uplink time slot of the first scheduling unit, sending first service data to a second node or broadcasting public data to at least one third node;

[0098] receiving, in a downlink timeslot of the first scheduling unit, second service data or service feedback data sent by a fourth node;

[0099] receiving, in a downlink timeslot of the second scheduling unit, third service data or broadcast data sent by a fourth node;

[0100] The second node, the third node and the fourth node are all nodes in the self-organizing network.

[0101] In one embodiment, the number of the first scheduling units is K, K is a positive integer, and K is determined based on demand information indicating the data sending demand of the first node in the scheduling period, wherein the demand information includes the amount of data to be transmitted by the first node in the scheduling period, and the data amount is positively correlated with K.

[0102] In one embodiment, the number of scheduling units included in any scheduling period of the self-organizing network is greater than or equal to the number of nodes included in the self-organizing network, and each node in the self-organizing network has at least one corresponding scheduling unit in each scheduling period, and the scheduling unit corresponding to the node includes the uplink time slot of the node.

[0103] In one embodiment, in the case where the self-organizing network is associated with an uplink service, the uplink time slot in the first scheduling unit is located before the downlink time slot in the first scheduling unit;

[0104] In the case where the self-organizing network is associated with a downlink service, the downlink time slot in the first scheduling unit is located before the uplink time slot in the first scheduling unit.

[0105] In one embodiment, the scheduling cycle of the self-organizing network includes a target scheduling unit, wherein the target scheduling unit is a scheduling unit including a target time slot group, the target time slot group includes adjacent target downlink time slots and target uplink time slots, and the target downlink time slot is located before the target uplink time slot, a guard interval is set at the tail of the target downlink time slot, and / or a guard interval is set at the head of the target uplink time slot.

[0106] In one embodiment, the guard interval is an upward rounded value of the product of the number of OFDM symbols included in the unit time slot, the reciprocal of the duration of the unit time slot, and a reference propagation time, the duration of the unit time slot is determined according to the subcarrier spacing, and the reference propagation time is twice the ratio of the distance between two nodes associated with the target time slot group to the speed of light;

[0107] The OFDM symbol corresponding to the guard interval is located at the tail of the OFDM symbol sequence included in the target downlink time slot, and / or the OFDM symbol corresponding to the guard interval is located at the head of the OFDM symbol sequence included in the target uplink time slot.

[0108] In one embodiment, the time slot difference in the first scheduling unit is less than or equal to a preset difference threshold, wherein the time slot difference is the difference between an uplink time slot and a downlink time slot associated with the same first service data in the first scheduling unit.

[0109] The data transmission device 600 provided in the embodiment of the present application can implement each process in the above-mentioned data transmission method embodiment, and will not be described again here to avoid repetition.

[0110] According to an embodiment of the present application, the present application also provides an electronic device and a readable storage medium.

[0111] Figure 7 A schematic block diagram of an example electronic device 700 that can be used to implement an embodiment of the present application is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workbenches, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present application described and / or required herein.

[0112] like Figure 7 As shown, the device 700 includes a computing unit 701, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 702 or a computer program loaded from a storage unit 708 to a random access memory (RAM) 703. In the RAM 703, various programs and data required for the operation of the device 700 can also be stored. The computing unit 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.

[0113] A number of components in the device 700 are connected to the I / O interface 705, including: an input unit 706, such as a keyboard, a mouse, etc.; an output unit 707, such as various types of displays, speakers, etc.; a storage unit 708, such as a disk, an optical disk, etc.; and a communication unit 709, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 709 allows the device 700 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0114] The computing unit 701 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 701 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSP), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 701 performs the various methods and processes described above, such as data transmission methods. For example, in some embodiments, the data transmission method may be implemented as a computer software program, which is tangibly included in a machine-readable medium, such as a storage unit 708. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 700 via the ROM 702 and / or the communication unit 709. When the computer program is loaded into the RAM 703 and executed by the computing unit 701, one or more steps of the data transmission method described above may be performed. Alternatively, in other embodiments, the computing unit 701 may be configured to execute the data transmission method in any other appropriate manner (eg, by means of firmware).

[0115] Various embodiments of the systems and techniques described above herein may be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0116] The program code for implementing the method of the present application can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, implements the functions / operations specified in the flow chart and / or block diagram. The program code can be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0117] In the context of the present application, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0118] As used herein, the term "machine-readable medium" refers to any computer program product, apparatus, and / or device (e.g., disk, optical disk, memory, programmable logic device (PLD)) for providing machine instructions and / or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal for providing machine instructions and / or data to a programmable processor.

[0119] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0120] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0121] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.

[0122] The present application also provides a computer program product, including computer instructions, which, when executed by a processor, implement the above Figure 1 The various processes of the method embodiment shown can achieve the same technical effect, and will not be described again here to avoid repetition.

[0123] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this application can be executed in parallel, sequentially or in different orders, as long as the expected results of the technical solution disclosed in this application can be achieved, and this document is not limited here.

[0124] The above specific implementations do not constitute a limitation on the protection scope of this application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of this application should be included in the protection scope of this application.

Claims

1. A data transmission method, characterized in that: Applied to a first node, where the first node is a node in a self-organizing network, the method includes: Determine a first scheduling unit and a second scheduling unit among a plurality of scheduling units in a scheduling period of the self-organizing network, wherein the number of the first scheduling units matches the data transmission demand of the first node in the scheduling period; Based on the first scheduling unit and the second scheduling unit, a setting transmission operation is performed, wherein the setting transmission operation includes at least one of the following: In an uplink time slot of the first scheduling unit, sending first service data to a second node or broadcasting public data to at least one third node; receiving, in a downlink timeslot of the first scheduling unit, second service data or service feedback data sent by a second node; receiving, in a downlink timeslot of the second scheduling unit, third service data or broadcast data sent by a fourth node; The second node, the third node and the fourth node are all nodes in the self-organizing network.

2. The method according to claim 1, characterized in that The number of the first scheduling units is K, K is a positive integer, and K is determined based on demand information indicating the data sending demand of the first node in the scheduling period, wherein the demand information includes the amount of data to be transmitted by the first node in the scheduling period, and the data amount is positively correlated with K.

3. The method according to claim 1, characterized in that The number of scheduling units included in any scheduling period of the self-organizing network is greater than or equal to the number of nodes included in the self-organizing network. Each node in the self-organizing network has at least one corresponding scheduling unit in each scheduling period, and the scheduling unit corresponding to the node includes the uplink time slot of the node.

4. The method according to claim 1, characterized in that: In the case where the self-organizing network is associated with an uplink service, the uplink time slot in the first scheduling unit is located before the downlink time slot in the first scheduling unit; in the case where the self-organizing network is associated with a downlink service, the downlink time slot in the first scheduling unit is located before the uplink time slot in the first scheduling unit; and / or, The time slot difference in the first scheduling unit is less than or equal to a preset difference threshold, wherein the time slot difference is the difference between an uplink time slot and a downlink time slot associated with the same first service data in the first scheduling unit.

5. The method according to claim 1, characterized in that The scheduling cycle of the self-organizing network includes a target scheduling unit, wherein the target scheduling unit is a scheduling unit including a target time slot group, the target time slot group includes adjacent target downlink time slots and target uplink time slots, and the target downlink time slot is located before the target uplink time slot, a guard interval is set at the tail of the target downlink time slot, and / or a guard interval is set at the head of the target uplink time slot.

6. The method according to claim 5, characterized in that The guard interval is the rounded-up value of the product of the number of OFDM symbols included in the unit time slot, the reciprocal of the duration of the unit time slot, and the reference propagation time, the duration of the unit time slot is determined according to the subcarrier spacing, and the reference propagation time is twice the ratio of the distance between two nodes associated with the target time slot group and the speed of light; The OFDM symbol corresponding to the guard interval is located at the tail of the OFDM symbol sequence included in the target downlink time slot, and / or the OFDM symbol corresponding to the guard interval is located at the head of the OFDM symbol sequence included in the target uplink time slot.

7. A data transmission device, characterized in that: Applied to a first node, the first node being a node in a self-organizing network, the data transmission device comprising: A scheduling unit determination module, configured to determine a first scheduling unit and a second scheduling unit from a plurality of scheduling units in a scheduling period of the self-organizing network, wherein the number of the first scheduling units matches a data transmission requirement of the first node in the scheduling period; A data transmission module, configured to perform a setting transmission operation based on the first scheduling unit and the second scheduling unit, wherein the setting transmission operation includes at least one of the following: In an uplink time slot of the first scheduling unit, sending first service data to a second node or broadcasting public data to at least one third node; receiving, in a downlink timeslot of the first scheduling unit, second service data or service feedback data sent by a second node; receiving, in a downlink timeslot of the second scheduling unit, third service data or broadcast data sent by a fourth node; The second node, the third node and the fourth node are all nodes in the self-organizing network.

8. An electronic device, characterized in that: The method comprises a processor, a memory, and a computer program stored in the memory and executable on the processor, wherein the computer program implements the steps of the method according to any one of claims 1 to 6 when executed by the processor.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer program product, characterized in that The method comprises computer instructions, which, when executed by a processor, implement the steps of the method according to any one of claims 1 to 6.

Images