Data transmission method and device based on dynamic frame, electronic device and storage medium

Abstract

The present application provides a data transmission method and device based on dynamic frames, an electronic device and a storage medium, which belongs to the field of network communication technology. The method includes: obtaining the target node information of the initial data to be sent; calculating the protection interval length and the backoff time length according to the target node information; obtaining the business data volume of the initial data, and constructing an initial dynamic frame structure according to the protection interval length, the backoff time length and the business data volume; performing format adjustment processing on the initial dynamic frame structure according to a preset modulation and coding mode to obtain a target dynamic frame structure; performing modulation and coding processing on the initial data according to the target dynamic frame structure and the modulation and coding mode to obtain the target data; constructing a transmission frequency hopping pattern according to the target dynamic frame structure, and sending the target data to the target node according to the transmission frequency hopping pattern. The present application aims to make full use of transmission resources and improve the efficiency of data transmission.

Description

Technical Field

[0001] The present application relates to the field of network communication technology, and in particular to a data transmission method and device based on dynamic frames, an electronic device, and a storage medium. Background Art

[0002] In distributed communication networks, electromagnetic wave transmission involves a certain delay. To prevent data sent by a node from crossing into the next time slot and affecting the normal transmission of other nodes, a guard interval (GP) is added at the end of the time slot. The length of the GP must meet the network's maximum coverage radius. When the number of nodes in the network is large, the data transmission time slot is usually designed to be short, on the same order of magnitude as the GP length. This makes the GP longer than the time slot, occupying excessive transmission resources and reducing the efficiency of data transmission within the network. Summary of the Invention

[0003] The main purpose of the embodiments of the present application is to propose a data sending method and device based on dynamic frames, an electronic device and a storage medium, which adaptively determines the structure of the dynamic frame according to the transmission requirements of the data to be sent, reduces the occupation of transmission resources by the protection interval length, thereby making more effective use of transmission resources and improving the efficiency of data transmission.

[0004] To achieve the above objectives, a first aspect of an embodiment of the present application proposes a data transmission method based on a dynamic frame, which is applied to a distributed communication network. The method includes:

[0005] Obtain the target node information of the initial data to be sent;

[0006] Calculate the protection interval length and the backoff time length according to the target node information;

[0007] Acquire the service data volume of the initial data, and construct an initial dynamic frame structure according to the guard interval length, the backoff time length, and the service data volume;

[0008] Performing format adjustment processing on the initial dynamic frame structure according to a preset modulation and coding mode to obtain a target dynamic frame structure;

[0009] Performing modulation and coding processing on the initial data according to the target dynamic frame structure and the modulation and coding mode to obtain target data;

[0010] A transmission frequency hopping pattern is constructed according to the target dynamic frame structure, and the target data is sent to a target node according to the transmission frequency hopping pattern.

[0011] In some embodiments, the target node information includes node distance information, where the node distance information is used to represent the communication distance between the sending node of the initial data and the target node. The step of obtaining the target node information of the initial data to be sent includes:

[0012] Obtaining node coordinate information of the sending node;

[0013] Sending the node coordinate information to the target node;

[0014] Obtain the node distance information fed back by the target node.

[0015] In some embodiments, the target node information further includes priority information, where the priority information is used to characterize the priority of the target node. The step of calculating the guard interval length and the backoff time length based on the target node information includes:

[0016] Calculating the transmission delay and the sending and receiving switching time according to the node distance information;

[0017] Calculating a guard interval length according to the transmission delay and the transmit / receive switching time;

[0018] The backoff time length is calculated according to the priority information.

[0019] In some embodiments, the step of obtaining the service data volume of the initial data and constructing the initial dynamic frame structure according to the guard interval length, the backoff time length, and the service data volume includes:

[0020] Calculating the data volume of the initial data to obtain the service data volume;

[0021] Determine the time slot according to the guard interval length, the backoff time length and the service data volume to obtain the number of main time slots;

[0022] Determine the number of initial sub-time slots according to the preset channel carrying data volume;

[0023] The initial dynamic frame structure is constructed according to the number of main time slots and the number of initial sub-time slots.

[0024] In some embodiments, the step of performing format adjustment processing on the initial dynamic frame structure according to a preset modulation and coding mode to obtain a target dynamic frame structure includes:

[0025] Determining the data block length of a single transmission according to the modulation and coding mode;

[0026] Updating the initial number of sub-time slots according to the data block length to obtain a target number of sub-time slots;

[0027] The initial dynamic frame structure is format-adjusted according to the target number of sub-timeslots to obtain the target dynamic frame structure.

[0028] In some embodiments, the step of performing modulation and coding processing on the initial data according to the target dynamic frame structure and the modulation and coding mode to obtain target data includes:

[0029] Generate a pseudo-random sequence according to the target dynamic frame structure to obtain data header information;

[0030] Performing modulation and coding processing on the initial data according to the modulation and coding mode to obtain coded data;

[0031] The coded data and the data header information are subjected to framing processing according to the target dynamic frame structure to obtain the target data.

[0032] In some embodiments, the step of constructing a transmission frequency hopping pattern according to the target dynamic frame structure and sending the target data to the target node according to the transmission frequency hopping pattern includes:

[0033] Determining a frequency hopping point according to the number of main time slots or the number of sub-time slots;

[0034] Constructing the transmission frequency hopping pattern according to the frequency hopping point and the preset frequency hopping rate;

[0035] The target data is sent to the target node according to the transmission frequency hopping pattern.

[0036] To achieve the above-mentioned purpose, the second aspect of the present application proposes a data transmission device based on a dynamic frame, comprising:

[0037] An information acquisition module is used to obtain the target node information of the initial data to be sent;

[0038] A data calculation module, configured to calculate a protection interval length and a backoff time length according to the target node information;

[0039] A first dynamic frame configuration module is configured to obtain the service data volume of the initial data and construct an initial dynamic frame structure according to the guard interval length, the backoff time length, and the service data volume;

[0040] A second dynamic frame configuration module is configured to perform format adjustment processing on the initial dynamic frame structure according to a preset modulation and coding mode to obtain a target dynamic frame structure;

[0041] a modulation and coding module, configured to perform modulation and coding processing on the initial data according to the target dynamic frame structure and the modulation and coding mode to obtain target data;

[0042] The frequency hopping transmission module is configured to construct a transmission frequency hopping pattern according to the target dynamic frame structure, and send the target data to a target node according to the transmission frequency hopping pattern.

[0043] To achieve the above-mentioned purpose, the third aspect of the present application provides an electronic device, comprising:

[0044] at least one memory;

[0045] at least one processor;

[0046] at least one program;

[0047] The program is stored in the memory, and the processor executes at least one program to implement the method described in the first aspect of the present application.

[0048] To achieve the above-mentioned object, the fourth aspect of the present application provides a storage medium, which is a computer-readable storage medium. The computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to enable a computer to execute:

[0049] As described in the first aspect above.

[0050] The embodiments of the present application propose a data sending method and device based on dynamic frames, an electronic device and a storage medium, which adaptively determine the structure of the dynamic frame according to the transmission requirements of the data to be sent, reduce the occupation of transmission resources by the protection interval length, thereby more fully utilizing the transmission resources and improving the efficiency of data transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0051] Figure 1 is a flow chart of a data transmission method based on a dynamic frame provided in an embodiment of the present application;

[0052] Figure 2 This is a schematic diagram of a dynamic frame format according to an embodiment of the present application;

[0053] Figure 3 yes Figure 1 The flowchart of one embodiment of step S101 is shown;

[0054] Figure 4 yes Figure 1 The flowchart of one embodiment of step S102 is shown;

[0055] Figure 5 yes Figure 1 The flowchart of one embodiment of step S103 is shown;

[0056] Figure 6 yes Figure 1 The flowchart of one embodiment of step S104 is shown;

[0057] Figure 7 yes Figure 1 The flowchart of step S105 is shown as an embodiment;

[0058] Figure 8 yes Figure 1 The flowchart of one embodiment of step S106 is shown;

[0059] Figure 9 This is a schematic diagram of a distributed communication network structure according to an embodiment of the present application;

[0060] Figure 10 This is a module diagram of a data sending device based on dynamic frames provided in an embodiment of the present application;

[0061] Figure 11 This is a schematic diagram of the hardware structure of the electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0062] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0063] It should be noted that although the device schematics illustrate functional module divisions and the flowcharts illustrate logical sequences, in certain circumstances, the steps shown or described may be performed in a sequence that differs from the module divisions in the device or the sequence in the flowcharts. The terms "first," "second," and so on, used in the specification, claims, and drawings, are used to distinguish similar items and are not necessarily used to describe a specific sequence or precedence.

[0064] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art to which this application pertains. The terms used herein are for the purpose of describing the embodiments of this application only and are not intended to limit this application.

[0065] In addition, the described features, structures or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present disclosure. However, those skilled in the art will appreciate that the technical solutions of the present disclosure can be practiced without one or more of the specific details, or other methods, components, devices, steps, etc. can be adopted. In other cases, well-known methods, devices, implementations or operations are not shown or described in detail to avoid blurring various aspects of the present disclosure.

[0066] The block diagrams shown in the accompanying drawings are merely functional entities and do not necessarily correspond to physically separate entities. That is, these functional entities may be implemented in software, in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0067] The flowcharts shown in the accompanying drawings are for illustrative purposes only and do not necessarily include all contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps may be decomposed, while others may be combined or partially combined. Therefore, the actual execution order may vary depending on the actual situation.

[0068] The data transmission method based on dynamic frames of the embodiment of the present application can be applied to the field of distributed network communications. In a distributed network, the TDMA multiple access protocol is usually adopted as the communication protocol, and different nodes use different time slots to send data, which can realize conflict-free transmission and reception of each node in the network. The typical TDMA frame structure in a distributed network is: each superframe (SuperFrame) is composed of multiple frames (Frame), each frame is composed of multiple time slots, and each time slot is composed of multiple burst signals (Burst) and a protection interval (GP). In a certain network, the number of frames in each superframe, the number of time slots in each frame, and the number of burst signals in each time slot are usually fixed, and the length of the protection interval in the time slot is also fixed, all of which are determined based on the maximum application scenario that needs to be met. This mode ensures normal transmission between each node in the network, but leads to a waste of transmission resources, which is specifically reflected in the following aspects:

[0069] Due to the influence of electromagnetic wave transmission delay, in order to prevent the data sent by a node from crossing into the next time slot and affecting the normal transmission of other nodes, it is necessary to add a GP at the end of the time slot for protection. The GP length needs to meet the requirements of the maximum coverage radius. When each node in the network can achieve accurate two-way synchronization, GP = s / c; when each node in the network can only achieve one-way synchronization, GP = 2*s / c, where s is the maximum coverage radius and c is the speed of light. When the coverage radius is 400km, GP = 1.33ms (two-way synchronization) or 2.67ms (one-way synchronization). Considering that the number of nodes in the network may be large, and in addition, there are certain requirements for the delay of service transmission, the time slot length is generally not designed to be too long, usually 4ms to 10ms. Therefore, the relatively long GP leads to low resource utilization.

[0070] For bursty, low-speed services, such as short messages and control commands, only one time slot is required for each transmission. For high-speed services, such as video streaming, multiple time slots may need to be allocated consecutively in each frame to meet transmission requirements. When the same node uses multiple time slots to send services, the GP in the last time slot is mandatory; the GPs in the remaining time slots are useless. For example, an air-to-air topology network has a coverage range of 500 km, where the distance between nodes A and B is 10 km, and the distance between nodes A and C is 400 km. If data transmission between nodes is based on a 500 km protection interval, the GP between nodes A and B will be too long, resulting in low transmission resource utilization.

[0071] In related technologies, in cellular network systems such as LTE / 5G NR, the GP length can be set based on the cell's coverage. The base station provides corresponding instructions in the broadcast message, and the user equipment (UE) can obtain the current network frame format by parsing the cell broadcast. This method can improve the utilization of time slot resources to a certain extent, but it has the following limitations: First, the network is a hub-and-spoke network, and all UEs communicate only with the base station; second, once the network is determined, the frame format is fixed and cannot support dynamic changes. In contrast, in WiFi communication systems, because the CSMA multiple access protocol is used, there is no fixed-length frame format. The frame length of the current transmission can be customized according to the transmission needs, which has greater flexibility. However, there are the following limitations: First, when there are many nodes in the CSMA multiple access protocol in the network, resource conflicts are large, and it cannot have good service QoS capabilities, and resource utilization will be low; second, in the carrier sensing stage, the sensing duration needs to be set, and the granularity of the duration is at least twice the maximum transmission delay. When the network coverage is large, the carrier sensing time interval will cause a large time overhead, which seriously affects resource utilization. Therefore, the CSMA protocol is usually only used in short-distance communication scenarios and is not suitable for long-distance communication scenarios with many nodes (such as distributed communication networks).

[0072] Based on this, the present application proposes a data transmission method and device based on dynamic frames, an electronic device and a storage medium, aiming to fully utilize transmission resources and improve the efficiency of data transmission.

[0073] See also Figure 1 The data transmission method based on dynamic frames in the embodiment of the present application includes but is not limited to steps S101 to S106:

[0074] Step S101, obtaining target node information of initial data to be sent;

[0075] Step S102, calculating the guard interval length and backoff time length according to the target node information;

[0076] Step S103, obtaining the service data volume of the initial data, and constructing an initial dynamic frame structure according to the guard interval length, the backoff time length and the service data volume;

[0077] Step S104, performing format adjustment processing on the initial dynamic frame structure according to a preset modulation and coding mode to obtain a target dynamic frame structure;

[0078] Step S105, performing modulation and coding processing on the initial data according to the target dynamic frame structure and modulation and coding mode to obtain target data;

[0079] Step S106: construct a transmission frequency hopping pattern according to the target dynamic frame structure, and send the target data to the target node according to the transmission frequency hopping pattern.

[0080] See also Figure 2 , Figure 2 This is a schematic diagram of a dynamic frame format according to an embodiment of the present application, wherein:

[0081] Each superframe consists of K dynamic frames. The value of K is not fixed and changes dynamically according to the service transmission situation.

[0082] The i-th dynamic frame consists of Mi main time slots. The length Mi of each dynamic frame can be the same or different and changes dynamically according to the service transmission situation.

[0083] Each slot consists of N micro-slots, and no fixed-length GP is set in the slot.

[0084] Micro-slots are classified into three types: Type 0: used entirely for data transmission; Type 1: consisting of data and NULL (blank), which can serve as the last valid micro-slot in a dynamic frame. The length of the NULL depends on the guard interval; Type 2: an empty micro-slot, generally used for the backoff time of the dynamic frame header and the guard interval of the frame trailer. The granularity of the NULL is 1 / LMicro-slot, where L is an integer that can be determined based on different requirements.

[0085] In steps S101 to S106 shown in the embodiment of the present application, the structure of the dynamic frame is adaptively determined according to the transmission requirements of the data to be sent, and the occupation of the transmission resources by the protection interval length is reduced, thereby making more effective use of the transmission resources and improving the efficiency of data transmission.

[0086] In some embodiments, see Figure 3The target node information includes node distance information, and the node distance information is used to characterize the communication distance between the sending node of the initial data and the target node. Step S101 includes but is not limited to steps S201 to S203:

[0087] Step S201, obtaining node coordinate information of the sending node;

[0088] Step S202, sending node coordinate information to the target node;

[0089] Step S203: Obtain node distance information fed back by the target node.

[0090] In steps S201 to S203 shown in the embodiment of the present application, the latitude and longitude coordinates of the sending node are obtained through the satellite positioning system and broadcast within the network. Other nodes receive the broadcast message, parse it, and calculate the distance value to themselves, thereby obtaining the distance information between the sending node and the target node in the network.

[0091] It is understood that after a node joins the network, it maintains accurate time slot timing for each node in the network through external timing (GPS / BD, PTP, etc.) or RTT timing calibration strategies. In other embodiments, the sending node receives information sent by other nodes, measures the deviation between the reception time and the time slot start time, and obtains the distance between the nodes based on the transmission delay, thereby obtaining node distance information.

[0092] In some embodiments, see Figure 4 The target node information also includes priority information, which is used to characterize the priority of the target node. Step S102 includes but is not limited to steps S301 to S303:

[0093] Step S301, calculating the transmission delay and the transmitting and receiving switching time according to the node distance information;

[0094] Step S302, calculating the guard interval length according to the transmission delay and the transmit / receive switching time;

[0095] Step S303: Calculate the backoff time length according to the priority information.

[0096] In the steps S310 to S303 shown in the embodiment of the present application, before sending data, the node first determines whether the sending mode is unicast, multicast or broadcast, and then obtains the destination node set of this transmission, and obtains the maximum distance sMax of this transmission, the required transmission delay is sMax / c, and the required sending and receiving switching time is T switch , using 1 / LMicro-slot as the unit (i.e. the granularity is 1 / LMicro-slot) to determine the GP length:

[0097] Among them, T micro-slot It is the time of micro-slot.

[0098] At this time, the number of type 2 Micro-slots occupied by GP is:

[0099]

[0100] The NULL length in the type1 Micro-slot is:

[0101] N GP-Null =GP-N type2 *L; where N type2 The length of the type 2 Micro-slot.

[0102] According to the priority information of the transmission, confirm the required backoff time T back , the number of Micro-slots occupied by the backoff time is:

[0103]

[0104] The corresponding backoff time length is: BackOffNum = N type2 *L;

[0105] By setting the backoff time, high-level protocols can be assisted in resource scheduling and management, and in preemptive resource allocation networks, possible resource allocation conflicts and other problems can be reduced.

[0106] In some embodiments, see Figure 5 Step S103 includes but is not limited to steps S401 to S404:

[0107] Step S401, calculating the data volume of the initial data to obtain the business data volume;

[0108] Step S402, determining the time slot according to the guard interval length, the backoff time length and the service data volume to obtain the number of main time slots;

[0109] Step S403, determining the number of initial sub-time slots according to the preset channel carrying data volume;

[0110] Step S404: construct an initial dynamic frame structure according to the number of main time slots and the number of initial sub-time slots.

[0111] In steps S401 to S404 shown in the embodiment of the present application, the appropriate number of slots (main time slots) is selected based on the amount of data to be transmitted by the sending node, the channel conditions, the required GP length and backoff time, etc. To ensure fairness in resource allocation for each node in the network, the number of slots sent in a single time is limited to Q, which can be agreed upon through the initial parameter configuration.

[0112] In some embodiments, assuming that each micro-slot of the current channel can carry Mbits of coded data, and the amount of coded data transmitted this time is Gbits, the number of main time slots required is:

[0113]

[0114] The dynamic frame structure for transmission is further determined based on the above formula, where N is the number of micro-slots in a slot, and one micro-slot is reserved to carry the necessary header information. The upper limit of the number of micro-slots (initial sub-timeslots) that a dynamic frame can carry for transmission data is:

[0115] DataNum=Q*N*L-GPNum-BackOffNum-L.

[0116] In some embodiments, see Figure 6 Step S104 includes but is not limited to steps S501 to S503:

[0117] Step S501, determining the data block length for a single transmission according to the modulation and coding mode;

[0118] Step S502, updating the initial number of sub-time slots according to the data block length to obtain the target number of sub-time slots;

[0119] Step S503 : performing format adjustment processing on the initial dynamic frame structure according to the target number of sub-time slots to obtain a target dynamic frame structure.

[0120] To simplify implementation, the supported modulation and coding sets are generally limited. Only one modulation and coding scheme can be selected for transmission, and each modulation and coding scheme has a fixed packet length and bit rate. When using a dynamic frame structure, the amount of data a frame can carry varies and may not match the modulation and coding scheme, requiring necessary frame format adjustments.

[0121] In steps S501 to S503 shown in the embodiment of the present application, the number of micro-slots carrying data symbols is increased or reduced according to the length of the actual data, thereby determining the final target frame format.

[0122] In some embodiments, each 1 / L Micro-slot can carry N symbols. sym , the modulation order of the modulation coding method is Q, the code rate is R, and the length of the data block transmitted this time is M, then the required symbols are

[0123]

[0124] The number of micro-slots that need to carry data (the number of target sub-time slots) is:

[0125]

[0126] Then the target dynamic frame structure is determined. At this point, the upper limit of the number of Micro-slots carrying the data to be transmitted becomes DataNum′, and the GP length is updated to:

[0127] GPNum'=GPNum+DataNum-DataNum'.

[0128] It should be noted that if the final frame format still cannot completely match the modulation and coding format, necessary data block adjustment or rate matching is required.

[0129] In some embodiments, see Figure 7 Step S105 includes but is not limited to steps S601 to S603:

[0130] Step S601, generating a pseudo-random sequence according to the target dynamic frame structure to obtain data header information;

[0131] Step S602, performing modulation and coding processing on the initial data according to the modulation and coding mode to obtain coded data;

[0132] Step S603: performing framing processing on the coded data and the data header information according to the target dynamic frame structure to obtain target data.

[0133] Steps S601 to S603 shown in the embodiment of the present application generate a pseudo-random sequence as Header (data header) information based on the slot number (SlotNum), backoff length (BackOffNum), GP length (GPNum), destination address (DstID), modulation and coding mode (MCS) and other information determined for this transmission, and place it in Micro-slot1 (the first sub-time slot).

[0134] A typical generation method is to divide the pseudo-random sequence into two parts to carry the above information. The first part is used to indicate the dynamic frame format of this transmission, and the second part is used to indicate the destination address of this transmission and the data modulation and coding method. Specifically:

[0135] PN1(n)=x1(K1*GPNum+K2*BackOffNum+slotNum+n);

[0136] PN2(n)=x2(K3*DstID+MCS+n);

[0137] K1, K2, and K3 are configurable parameters that ensure unique pseudo-random sequences for different SlotNum, GPNum, BackOffNum, DstID, and MCS. Basic pseudo-random sequences x1 and x2 can be generated using M sequences, ZC sequences, Gold sequences, and other methods. The header also requires reference symbols for timing synchronization, which are not detailed here.

[0138] Another typical generation method uses messages to carry parameters. This method combines the parameters into a set of indications, which are independently encoded using a fixed modulation and coding scheme. The receiver then demodulates and parses the indication message to obtain the values ​​of each parameter. Compared to the pseudo-random sequence method, this method offers greater coding gain but increases processing latency. Choosing the appropriate method depends on system design requirements.

[0139] In some embodiments, see Figure 8 , step S106 includes steps S701 to S703:

[0140] Step S701, determining a frequency hopping point according to the number of main time slots or the number of sub-time slots;

[0141] Step S702: constructing a transmission frequency hopping pattern according to the frequency hopping points and the preset frequency hopping rate;

[0142] Step S703: Send the target data to the target node according to the transmission frequency hopping pattern.

[0143] In steps S701 to S703 shown in the embodiment of the present application, cross-time slot conflicts are resolved through frequency hopping, thereby improving the utilization efficiency of transmission resources.

[0144] In a distributed communication network, due to the varying distances between nodes, when node A sends data to node B using a shorter GP, node B can receive the data normally without inter-slot issues. However, for node C, which is farther away from node A, the data will enter the next slot due to transmission delays, potentially causing interference in the next slot. When all nodes in the network operate at a single frequency (i.e., in fixed-frequency mode), conflicts are unavoidable. Interference can only be eliminated through methods such as SIC, but this approach cannot fully address all issues. For example, interference may prevent the transmission of high-order modulated data in the next slot, potentially reducing slot resource utilization. Frequency hopping can address this conflict-free issue. If different slots or micro-slots use different frequencies, even if data sent by node A enters the next slot of node C, node C can discard the data because the destination address is not node C. At the start of the next slot, node C will simply wait to transmit or receive data on the new frequency. Frequency hopping rate requirements vary across different communication systems, necessitating the design of different frequency hopping patterns to meet specific needs. Typically, slot lengths range from 1ms to 10ms. For low- to medium-speed frequency hopping, frequency hopping is performed in slot units, with a hopping rate of 200 to 1000 hops / s. Conflict avoidance is achieved as long as the hopping pattern ensures that adjacent frequencies are different. For high-speed frequency hopping, meaning multiple frequencies within a slot, frequency hopping is performed in micro-slot units.

[0145] For example, assuming the frequency hopping rate is Mhop / s, the dwell time at each frequency point is:

[0146]

[0147] The number of Micro-slots in each slot is:

[0148] Among them, T slot The length of the slot.

[0149] Each slot will work at most K frequency points. The frequency hopping pattern is generated in slots, and each slot has K frequency points. In order to improve the anti-interference ability, the frequency hopping pattern period is usually very long. Assume that at time t, the frequency hopping pattern corresponding to the slot is recorded as [fx1fx2fx3……fxN]. At t+T slotAt each time instant, the frequency-hopping pattern corresponding to each slot is denoted as [fy1fy2fy3…fyN]. To avoid cross-slot conflicts, the frequency-hopping pattern [fx1fx2fx3…fxN] must not overlap with the frequency-hopping pattern [fy1fy2fy3…fyN]. That is, the frequency-hopping patterns corresponding to two consecutive slots must not have the same frequency. If the available frequencies are limited and the frequency-hopping rate is high, the last K1 frequencies in [fx1fx2fx3…fxN] must not overlap with the first K1 frequencies in [fy1fy2fy3…fyN]. K1 can be determined based on the actual network conditions. Assume that the backoff time length of this transmission is K2 micro-slots. If the dynamic frame includes only one slot, only the first K-K2 frequency hopping patterns corresponding to that slot are used for this transmission. If the number of slots in the dynamic frame is greater than 1, only the first K-K2 frequency hopping patterns are used in the first slot of the dynamic frame. In other slots, all K frequency points of the frequency hopping pattern are used.

[0150] In an exemplary embodiment, after receiving the target data, the target node decodes the target data. The specific process is as follows:

[0151] At time t, the target node is stationed at the corresponding frequency waiting to receive data. After receiving the header information, it parses the pseudo-random sequence in the header to obtain the SlotNum, BackOffNum, GPNum, DstID, MCS, and other information for this transmission. Based on this information, it then parses the structure of the dynamic frame transmitted and the corresponding frequency hopping pattern of the dynamic frame. It determines whether the DstID is its own. If not, it abandons the current reception and re-stations at the corresponding frequency waiting for reception in the first slot after the dynamic frame. If so, it receives and demodulates the information of all micro-slots according to the frequency hopping pattern, calculates whether secondary rate matching is required, and then sends the rate-matched data to the decoder for decoding.

[0152] For specific examples, see Figure 9 , Figure 9 This is a schematic diagram of a distributed communication network structure according to an embodiment of the present application. Figure 9 The operating parameters of the communication system shown are:

[0153] 1. Coverage distance: 400km;

[0154] 2. Time slot length: 4ms;

[0155] 3. Frequency hopping rate: 4000 hop / s;

[0156] 4. Micro-slot length: 250us;

[0157] 5. Number of symbols carried by Micro-slot: 512;

[0158] 6. Network capacity: 32;

[0159] 7. Network topology: decentralized distributed network, single-hop network, the distance between nodes 1 to 16 (each sub-network has 16 nodes, some nodes are not shown) is 50 km, the distance between nodes 17 to 32 (some nodes are not shown) is 50 km, and the distance between any node in two sub-networks is 400 km;

[0160] 8. Multiple access mode: TDMA;

[0161] 9. External timing: None;

[0162] 10. Service type: short message, voice, video, etc.

[0163] The data sending process based on dynamic frames is as follows:

[0164] 1) Maintain network timing and distance between nodes

[0165] After joining the network, each node performs two-way timing measurements with the network's timing reference node via RTT, adjusts its own time slot start time, and obtains a unified time within the network. After completing the network joining, it periodically sends broadcast messages on the pre-assigned broadcast channel to indicate that it has successfully joined the network.

[0166] Continuously receive broadcast messages sent by other nodes that have joined the network, measure the delay, convert it into distance information, and maintain the distance information between itself and other nodes in real time.

[0167] 2) Determine the protection interval and backoff time of dynamic frames

[0168] Node 1 has data to transmit, unicast, to node 16. The distance between the two nodes is 40 km, and the electromagnetic wave transmission delay is 133 μs. Assuming the configured granularity L = 4, then GPNum = 3.

[0169] Assume that the service priority of node 1 is low and it is sent in a contention time slot (Note: the time slot type can be agreed upon through initial configuration and is divided into pre-allocated, dynamic application, contention, etc.). Therefore, it needs to back off for a period of time to detect the current time slot. If the back off time is at least 200us, 1 Micro-slot is required, = 4.

[0170] 3) Preliminary determination of dynamic frame format

[0171] Assume that the data packet to be sent by node 1 is 3072 bits long. The available modulation and coding scheme for the current channel is MCS0, with a code rate of R of 1 / 4 and QPSK modulation. The encoded data length is 12288 bits. Each 1 / 4 micro-slot can carry 128 symbols. Using a dynamic frame structure, a slot can carry a maximum of 6784 symbols, and the upper limit of the data bits that can be carried is 3392 bits, which is greater than 3072 bits. Therefore, the number of slots required for this transmission, Q = 1. (If the dynamic frame structure is not used, due to the larger GP length, each slot can only carry 4096 symbols, requiring the use of two slots or a higher modulation and coding scheme for transmission.)

[0172] A slot has 16 micro-slots. Based on the above calculation results, the preliminarily determined frame format for this transmission is: Micro-slot 1 is used for backoff time, Micro-slots 2 through 15 are used for data transmission, and Micro-slot 16 is partially used for data transmission and partially used as a guard interval. The corresponding data carrying limit for this frame format is DataNum = 53.

[0173] 4) Determine the final frame format and perform data processing

[0174] The amount of data transmitted this time is 3072 bits. According to the MCS0 modulation and coding method, 6144 symbols are required, and the required DataNum is 48. Therefore, the dynamic frame structure is adjusted twice, and the new dynamic frame format is: =4, DataNum=48, and GPNum=8.

[0175] Based on the final frame format, determine whether to adjust the coding block. Since mod(48*512, 1 / R) = 0, no secondary rate matching is required. According to the coding block compensation calculation formula, the number of zero padding in the coding block is calculated as zeroNum = 48*128*2 - 3072*4 = 0, indicating that the coding block does not need to be adjusted.

[0176] 5) Header information generation and processing

[0177] The header information is generated using a pseudo-random sequence. The header consists of three parts and occupies a complete micro-slot.

[0178] Part 1: Timing synchronization reference symbol: uses M sequence with a sequence length of 83.33us;

[0179] Part 2: Frame format indication reference symbol: generated using Gold sequence, sequence length is 83.33us, K1=64, K2=4;

[0180] Part 3: Destination node indication reference symbol: generated using different Gold sequences, with a sequence length of 83.33us, K3=16.

[0181] The M sequence primitive polynomial and the Gold sequence formula will not be described in detail here. They can be determined according to the actual needs of the system and can be changed dynamically or fixed.

[0182] 6) Determine the frequency hopping pattern and data transmission

[0183] Each slot has 16 micro-slots, meaning it can operate at a maximum of 16 frequencies, and each time slot can have a maximum of 16 frequency hopping patterns. When node 1 transmits data, the corresponding frequency hopping pattern is f1f2f3…f16. In this transmission, micro-slot 1 is the backoff time, and the GP occupies micro-slots 15 and 16, leaving only 13 valid micro-slots. Therefore, starting from the start of micro-slot 2, data is transmitted in each micro-slot in sequence, following the frequency hopping pattern f1f2f3…f13.

[0184] To achieve this, please refer to Figure 10 , a data sending device based on dynamic frames of the present application includes:

[0185] An information acquisition module is used to obtain the target node information of the initial data to be sent;

[0186] A data calculation module is used to calculate the protection interval length and the backoff time length according to the target node information;

[0187] A first dynamic frame configuration module is used to obtain the service data volume of the initial data and construct an initial dynamic frame structure according to the guard interval length, the backoff time length and the service data volume;

[0188] A second dynamic frame configuration module is used to perform format adjustment processing on the initial dynamic frame structure according to a preset modulation and coding mode to obtain a target dynamic frame structure;

[0189] A modulation and coding module is used to perform modulation and coding processing on the initial data according to the target dynamic frame structure and modulation and coding mode to obtain target data;

[0190] The frequency hopping transmission module is used to construct a transmission frequency hopping pattern according to the target dynamic frame structure and send the target data to the target node according to the transmission frequency hopping pattern.

[0191] The working process of the data sending device based on dynamic frames in the present application is similar to the data sending method based on dynamic frames in the above embodiment, and will not be repeated here.

[0192] An embodiment of the present application further provides an electronic device, including:

[0193] at least one memory;

[0194] at least one processor;

[0195] at least one program;

[0196] The program is stored in the memory, and the processor executes the at least one program to implement the above-mentioned dynamic frame-based data transmission method implemented in this application. The electronic device can be any smart terminal including a mobile phone, a tablet computer, a personal digital assistant (PDA), an in-vehicle computer, etc.

[0197] See also Figure 11 , Figure 11 The hardware structure of an electronic device according to another embodiment is shown. The electronic device includes:

[0198] The processor may be implemented as a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of the present application;

[0199] The memory can be implemented in the form of ROM (Read Only Memory), static storage device, dynamic storage device or RAM (Random Access Memory). The memory can store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory and is called by the processor to execute the data transmission method based on dynamic frames in the embodiments of this application.

[0200] Input / output interface, used to realize information input and output;

[0201] Input / communication interface, used to enable communication between this device and other devices. Communication can be achieved through wired means (such as USB, network cable, etc.) or wireless means (such as mobile network, WiFi, Bluetooth, etc.);

[0202] A bus that transfers information between the various components of a device (e.g., processor, memory, input / output interfaces, and input / communication interfaces);

[0203] The processor, memory, input / output interface and input / communication interface are connected to each other through a bus within the device.

[0204] An embodiment of the present application further provides a storage medium, which is a computer-readable storage medium. The computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to enable a computer to execute the above-mentioned data sending method based on dynamic frames.

[0205] The memory, as a non-transient computer-readable storage medium, can be used to store non-transient software programs and non-transient computer executable programs. In addition, the memory may include a high-speed random access memory and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory may optionally include a memory remotely located relative to the processor, and these remote memories may be connected to the processor via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0206] The embodiments described in the embodiments of this application are intended to more clearly illustrate the technical solutions of the embodiments of this application and do not constitute a limitation on the technical solutions provided by the embodiments of this application. Those skilled in the art will appreciate that with the evolution of technology and the emergence of new application scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0207] Those skilled in the art will understand that the technical solutions shown in the figures do not constitute a limitation on the embodiments of the present application, and may include more or fewer steps than shown in the figures, or a combination of certain steps, or different steps.

[0208] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate and may be located in one place or distributed across multiple network units. Some or all of the modules may be selected based on actual needs to achieve the objectives of this embodiment.

[0209] Those skilled in the art will appreciate that all or some of the steps in the methods, systems, and functional modules / units in the devices disclosed above may be implemented as software, firmware, hardware, or appropriate combinations thereof.

[0210] It should be understood that the terms used in this manner are interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in sequences other than those illustrated or described herein. In addition, the terms "including" and "having," and any variations thereof, are intended to cover non-exclusive inclusions, e.g., a process, method, system, product, or apparatus comprising a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such process, method, product, or apparatus.

[0211] It should be understood that in this application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0212] In the several embodiments provided in this application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0213] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, and may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment as needed.

[0214] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0215] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes multiple instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store programs, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0216] The embodiments of the present application are described in detail above with reference to the accompanying drawings. However, the present application is not limited to the above embodiments. Various modifications can be made within the scope of knowledge possessed by ordinary technicians in the relevant technical field without departing from the purpose of the present application. In addition, the embodiments of the present application and the features of the embodiments can be combined with each other unless there is a conflict.

Claims

1. A data transmission method based on dynamic frames, applied to a distributed communication network, characterized in that: The method comprises: Obtain the target node information of the initial data to be sent; Calculate the protection interval length and the backoff time length according to the target node information; Calculating the data volume of the initial data to obtain the service data volume; Determine the time slot according to the guard interval length, the backoff time length and the service data volume to obtain the number of main time slots; Determine the number of initial sub-time slots according to the preset channel carrying data volume; Constructing an initial dynamic frame structure according to the number of main time slots and the number of initial sub-time slots; Performing format adjustment processing on the initial dynamic frame structure according to a preset modulation and coding mode to obtain a target dynamic frame structure; Performing modulation and coding processing on the initial data according to the target dynamic frame structure and the modulation and coding mode to obtain target data; A transmission frequency hopping pattern is constructed according to the target dynamic frame structure, and the target data is sent to a target node according to the transmission frequency hopping pattern.

2. The method according to claim 1, characterized in that The target node information includes node distance information, and the node distance information is used to represent the communication distance between the sending node of the initial data and the target node. The step of obtaining the target node information of the initial data to be sent includes: Obtaining node coordinate information of the sending node; Sending the node coordinate information to the target node; Obtain the node distance information fed back by the target node.

3. The method according to claim 2, characterized in that The target node information further includes priority information, where the priority information is used to represent the priority of the target node. The step of calculating the guard interval length and the backoff time length according to the target node information includes: Calculating the transmission delay and the sending and receiving switching time according to the node distance information; Calculating a guard interval length according to the transmission delay and the transmit / receive switching time; The backoff time length is calculated according to the priority information.

4. The method according to claim 1, wherein The step of performing format adjustment processing on the initial dynamic frame structure according to a preset modulation and coding mode to obtain a target dynamic frame structure includes: Determining the data block length of a single transmission according to the modulation and coding mode; Updating the initial number of sub-time slots according to the data block length to obtain a target number of sub-time slots; The initial dynamic frame structure is format-adjusted according to the target number of sub-timeslots to obtain the target dynamic frame structure.

5. The method according to any one of claims 1 to 4, characterized in that The step of performing modulation and coding processing on the initial data according to the target dynamic frame structure and the modulation and coding mode to obtain target data includes: Generate a pseudo-random sequence according to the target dynamic frame structure to obtain data header information; Performing modulation and coding processing on the initial data according to the modulation and coding mode to obtain coded data; The coded data and the data header information are subjected to framing processing according to the target dynamic frame structure to obtain the target data.

6. The method according to claim 4, characterized in that The step of constructing a transmission frequency hopping pattern according to the target dynamic frame structure and sending the target data to the target node according to the transmission frequency hopping pattern includes: Determining a frequency hopping point according to the number of main time slots or the number of sub-time slots; Constructing the transmission frequency hopping pattern according to the frequency hopping point and the preset frequency hopping rate; The target data is sent to the target node according to the transmission frequency hopping pattern.

7. A data transmission device based on dynamic frames, characterized in that: include: An information acquisition module is used to obtain the target node information of the initial data to be sent; A data calculation module, configured to calculate a protection interval length and a backoff time length according to the target node information; The first dynamic frame configuration module is configured to: calculate the data volume of the initial data to obtain the service data volume; determine the time slot according to the guard interval length, the backoff time length, and the service data volume to obtain the number of main time slots; determine the number of initial sub-time slots according to the preset channel carrying data volume; and construct an initial dynamic frame structure according to the number of main time slots and the number of initial sub-time slots; A second dynamic frame configuration module is configured to perform format adjustment processing on the initial dynamic frame structure according to a preset modulation and coding mode to obtain a target dynamic frame structure; a modulation and coding module, configured to perform modulation and coding processing on the initial data according to the target dynamic frame structure and the modulation and coding mode to obtain target data; The frequency hopping transmission module is configured to construct a transmission frequency hopping pattern according to the target dynamic frame structure, and send the target data to a target node according to the transmission frequency hopping pattern.

8. An electronic device, characterized in that: include: at least one memory; at least one processor; at least one program; The program is stored in the memory, and the processor executes at least one of the programs to implement: The method according to any one of claims 1 to 6.

9. A storage medium, wherein the storage medium is a computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to cause a computer to execute: The method according to any one of claims 1 to 6.

Images