TDMA time slot allocation efficient code allocation method and system based on tree structure

Abstract

The invention relates to a TDMA time slot allocation efficient coding allocation method and system based on a tree structure, and the method comprises the following steps: constructing the tree structure, sequentially dividing time slots in a time frame through the tree structure, finally obtaining a plurality of time slot groups, and enabling the tree structure and information finally represented by the tree structure to be a time slot group strategy, encoding the time slot group strategy by adopting a group of binary data; when a node accesses a network, a uniform time slot group strategy of the whole network is obtained by analyzing binary coded data of the time slot group strategy, and then one or more time slot groups in the time slot group strategy are distributed to the node according to a certain mechanism to complete link access; during operation, one or more time slot groups are dynamically distributed or released according to network data transmission requirements, so that dynamic distribution of network bandwidth resources is realized; through the scheme of the invention, a mechanism and a representation method for dividing the TDMA time slot group are realized, and capability support is provided for the universality, the flexibility and the expandability of equipment.

Description

Technical Field

[0001] The present invention relates to the technical fields of wireless communication and software radio technology. More specifically, it relates to an efficient coding allocation method and system for TDMA time slot allocation based on a tree structure. Background Art

[0002] TDMA (Time Division Multiple Access) is a common channel multiple access mechanism in wireless mobile communication network systems. Each node in the network first obtains precise clock synchronization through a wireless link or an external clock system, and then dynamically allocates different time slots to each node, so that each node in the network obtains time slot resources for data transmission; each node transmits in the time slot allocated to itself and receives in other time slots, achieving the ability of multi-node two-way networking communication macroscopically.

[0003] Currently, mobile network orthogonal frequency division multiple access (OFDMA) and single carrier frequency division multiple access (SC-FDMA) technologies represented by 4G / 5G divide wireless resources into time-frequency blocks (Resource Block, RB), and each RB corresponds to specific time slot and frequency resources. Each node adapts to different service requirements by adjusting time slot allocation, and its mechanism is not applicable to ad hoc distributed self-organizing networks. Common distributed self-organizing networks mostly adopt a competition-based time slot allocation strategy, and each node needs to randomly apply for and negotiate resources by competing for time slots.

[0004] The multiple access mechanisms represented by 4G / 5G mainly target resource allocation in the point-to-point two-way link between "base station - terminal", and are not applicable to ad hoc self-organizing networks. Although the competitive strategy can achieve negotiation allocation when large-scale nodes are networked, as the number of nodes increases, the probability of competition collisions increases, and the network efficiency will be greatly affected. And the existing static planning pre-allocation schemes cannot achieve high-dynamic situations such as dynamic joining and leaving of nodes. Therefore, the dynamic programming scheme is the preferred scheme for realizing distributed multiple access. In a large-scale dense distributed self-organizing network, the bandwidth resources between nodes mainly rely on time slot allocation for adjustment, and it needs to consider the time slot allocation of all nodes in the entire network. When the number of nodes is large, the quantity used to represent time slot division and allocation will increase sharply, and the time slot allocation data will occupy more bandwidth, which is one of the existing difficulties of the dynamic programming scheme. An efficient coding allocation method and system for TDMA time slot allocation based on a tree structure that can better solve this difficulty are needed. Summary of the Invention

[0005] The technical problem to be solved by the present invention is to provide an efficient coding allocation method for TDMA time slot allocation based on a tree structure in view of the above-mentioned defects of the prior art, and also provide an efficient coding allocation system for TDMA time slot allocation based on a tree structure.

[0006] The technical solution adopted by the present invention to solve its technical problem is: A tree-structured TDMA time slot allocation efficient coding allocation method is constructed, wherein the method comprises the following steps: Construct a tree structure, and define a set of allocation primitives for time slot allocation for each node of the tree structure; divide the time slots in a time frame in sequence through the tree structure, and finally obtain multiple time slot groups, and allocate a QoS type to each time slot group; The tree structure and the information it ultimately represents are the time slot group strategy, which is encoded using a set of binary data and used for transmission in the network; When each node in the network accesses, it first obtains the unified time slot group strategy of the whole network by parsing the binary coded data of the time slot group strategy, and then allocates one or more time slot groups in the time slot group strategy to itself according to a certain mechanism to complete the link access; During operation, one or more time slot groups are dynamically allocated or released according to the network data transmission requirements to achieve dynamic allocation of network bandwidth resources.

[0007] The tree-structure-based TDMA time slot allocation efficient coding allocation method of the present invention, wherein the tree structure is divided using the rule: The tree structure consists of a unique root node and multiple child nodes linked to each other. The root node is a set containing all time slots. The plurality of child nodes divide the set in turn, and after the division, each child node obtains a subset of the set; In the tree structure, the grandchild nodes further divide the subsets divided by their corresponding parent nodes, and continue to do so until the leaf nodes, obtaining a time slot group.

[0008] The tree-structure-based TDMA time slot allocation efficient coding allocation method of the present invention, wherein the division of the tree structure further comprises: Obtain the number of network nodes, physical layer design parameters, and service transmission requirements; The acquired data is used as the basis for dividing all time slots in the time frame.

[0009] The tree-structured TDMA time slot allocation efficient coding allocation method of the present invention, wherein the set S consisting of all time slots in a time frame is {ts 0 ,ts 1 ...ts N} and the partitioned subset S i (i=0,1,...,gn) and S j (j=0,1,...,gn) satisfies the following relationship: 。

[0010] The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to the present invention, wherein the root node includes two attributes, name1 and tslot, where name1 represents the name of the time slot group policy, and tslot represents the total number of time slots included in one time frame and the millisecond length of the time slots; The child node includes three attributes, name2, allocation primitive, and QoS type, where name2 represents the name of the child node, the allocation primitive represents how to divide the time slots, and the QoS type describes the QoS type of the child node and all its child nodes.

[0011] The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to the present invention, wherein the allocation primitive includes a comb primitive and a divide primitive, where the comb primitive carries two parameters, v1 and v2, where v1 represents the starting time slot number allocated to the child node, and v2 represents the number of intervals; when v1 is -1, it means all the remaining time slots in the current allocation, and at this time the v2 value is invalid; the divide primitive includes a parameter n, which means equally dividing a time slot group into n groups of time slots.

[0012] The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to the present invention, wherein the encoding of the time slot group policy using a set of binary data includes: Each node is represented by 4 bytes: byte 0, byte 1, byte 2, and byte 3; Byte 0 includes a primitive flag, QoS type, and byte ID; Byte 1 includes primitive parameter 1; Byte 2 includes primitive parameter 2; Byte 3 includes the ID of the first child node and the ID of the next sibling node.

[0013] The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to the present invention, wherein the primitive flag field: 0 represents the comb primitive, and 1 represents the divide primitive; The node ID is the unique identification number of each node and cannot be repeated; The QoS type includes 4 types from 0 to 3, where type 0 is the automatic type, and the node independently determines the QoS type of this time slot according to the current transmission requirements, and the other types are for specified type transmissions; Primitive parameter 1 and primitive parameter 2 are multiplexing fields. For the comb primitive, parameter 1 is the starting time slot sequence number, and the parameter is the incremental step number; for the divide primitive, parameter 1 is the equal division quantity, and parameter 2 is invalid; The first child node ID is the node ID of the first child node of this node; if there is no child node, fill in 0xF; The next node ID at the same level is the node ID of the next node at the same level as this node. If there is no next node, fill in 0xF.

[0014] The tree-structure-based TDMA time slot allocation efficient coding allocation method of the present invention further comprises adopting text representation for the time slot group strategy: The tree structure is represented by nested curly braces, with one line of text for each node.

[0015] A tree-structure-based TDMA time slot allocation efficient coding allocation system is applied to the tree-structure-based TDMA time slot allocation efficient coding allocation method as described above, wherein the system includes a tree structure construction unit and a network module; The tree structure construction unit is used to construct a tree structure, define a set of allocation primitives for time slot allocation for each node of the tree structure; divide the time slots in a time frame in sequence through the tree structure, and finally obtain multiple time slot groups, and allocate a QoS type to each time slot group; the tree structure and the information finally represented by it are the time slot group strategy, and the time slot group strategy is encoded by a set of binary data and used for transmission in the network; The network module is used to, when each node in the network accesses, first obtain a unified time slot group strategy for the entire network by parsing the binary coded data of the time slot group strategy, and then allocate one or more time slot groups in the time slot group strategy to itself according to a certain mechanism to complete link access; during operation, dynamically allocate or release one or more time slot groups according to the network data transmission requirements to realize dynamic allocation of network bandwidth resources.

[0016] The beneficial effects of the present invention are as follows: the present invention realizes an efficient coding and allocation method for TDMA time slot allocation based on a tree structure, and realizes a mechanism and a representation method for TDMA time slot group division by creating a tree data structure and its text representation and binary encoding method. In particular, its binary representation method compresses the data length compared with the traditional array representation method. It has universality, great flexibility and high efficiency, and can realize flexible access strategies and dynamic bandwidth allocation in large-scale distributed networking scenarios, providing good adaptability and scalability for link access control software to flexibly support various physical transmission and business demand scenarios. In most scenarios, only the configuration needs to be changed without rewriting the program, providing capability support for the versatility, flexibility and scalability of the equipment. Brief Description of the Drawings

[0017] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the present invention will be further described below in conjunction with the accompanying drawings and embodiments. The accompanying drawings in the following description are only partial embodiments of the present invention. For those of ordinary skill in the art, without creative efforts, other drawings can be obtained based on these drawings: Figure 1 is a flowchart of an efficient coding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention; Figure 2 is a schematic diagram of the tree structure of an efficient coding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention; Figure 3 is the time slot division process of an efficient coding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention and its corresponding relationship with the tree structure; Figure 4 is a schematic diagram of the text representation of the time slot group strategy of an efficient coding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention; Figure 5 is a schematic diagram of the binary data representation of an efficient coding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention; Figure 6 is a schematic block diagram of the principle of an efficient coding and allocation system for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention. Detailed Description of the Invention

[0018] To make the objectives, technical solutions, and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below. Obviously, the described embodiments are partial embodiments of the present invention, rather than all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

[0019] The efficient coding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention, as Figure 1 shown, and referring to Figures 2-5 simultaneously, includes the following steps: S01: Construct a tree structure, define a set of allocation primitives for time slot allocation for each node of the tree structure; sequentially divide the time slots within a time frame through the tree structure to finally obtain multiple time slot groups, and assign a QoS type to each time slot group; S02: The tree structure and the information it finally represents are the time slot group strategy, and a set of binary data is used to encode the time slot group strategy for transmission in the network; S03: When each node in the network accesses, it first obtains the unified time slot group strategy of the whole network by parsing the binary coded data of the time slot group strategy, and then allocates one or more time slot groups in the time slot group strategy to itself according to a certain mechanism to complete the link access; S04: During operation, dynamically allocate or release one or more time slot groups according to network data transmission requirements to achieve dynamic allocation of network bandwidth resources; The present invention realizes a tree-structure-based TDMA time slot allocation efficient coding and allocation method. By creating a tree data structure and its text representation and binary encoding method, the mechanism and representation method of TDMA time slot group division are realized. In particular, its binary representation method compresses the data length compared with the traditional array representation method. It has universality, great flexibility and high efficiency. In particular, it can realize flexible access strategies and dynamic bandwidth allocation in large-scale distributed networking scenarios, and provides good adaptability and scalability for link access control software to flexibly support various physical transmission and business demand scenarios. In most scenarios, only configuration needs to be changed without rewriting the program, which provides capability support for the versatility, flexibility and scalability of the equipment.

[0020] The specific instructions are as follows: In a TDMA network, the basic unit for receiving and sending each wireless signal data frame is called a time slot. A time slot is generally about 0.5~10ms, during which a complete transmission of a physical layer data frame can be completed. A cycle consisting of multiple time slots is called a time frame. A time frame contains multiple time slots. All nodes in the network can achieve a round of data transmission and exchange within a time frame. By allocating each time slot in the time frame to each node in the network, each node sends data in the time slot allocated to itself and receives data sent by other nodes in other time slots. In this way, each node has the opportunity to send data, and ultimately realizes network data transmission, which is TDMA multiple access. Time slot group strategy: The set of all time slots in a time frame is S={ts 0 ,ts 1 ...ts N} and the partitioned subset S i (i=0,1,...,gn) and S j (j=0,1,...,gn) satisfies the following relationship: .

[0021] A tree structure is constructed to fully describe a time slot group policy. The tree structure is composed of a unique root node (rootnode) and multiple child nodes (childnode) that are linked to each other to form a tree structure.

[0022] The root node contains two attributes, name and tslot. Here, name represents the name of the time slot group policy, and tslot describes the total number of time slots included in one time frame and the total number of time slots included in one second. Other nodes contain three attributes, name, allocation primitive, and QoS type. Here, name represents the name of the node, the allocation primitive indicates how to perform time slot division, and the QoS type describes the QoS type of the node and all its child nodes (such as low speed and high reliability or high speed and large bandwidth, etc.). The allocation primitive includes two types, comb and divide. The comb primitive carries two parameters, v1 and v2. Here, v1 represents the starting time slot number allocated to the node, and v2 represents the number of intervals. When v1 is -1, it means all the remaining time slots in the current allocation, and at this time, the v2 value is invalid. For example, comb(0, 2) means starting from the 0th time slot, getting a division every 2 time slots (that is, with an interval of 1 time slot); comb(-1, 0) means all the remaining time slots in the current division. Divide contains one parameter, n, that is, equally dividing a time slot group into n groups of time slots.

[0023] The division rule of the tree structure is: the root node is the set containing all time slots, that is, S = {ts0, ts1,... tsN}; all its child nodes divide this set in turn, and after division, each child node gets a subset of this set; its grandchild nodes (the child nodes of the child nodes) further divide the subset divided by their corresponding parent nodes, and so on until the leaf nodes (that is, the nodes without child nodes), then a time slot group is obtained.

[0024] A specific example is as follows: A networking UAV measurement and control system with 1 ground station and 4 UAVs. The physical layer time slot length is 5 ms, and one time frame contains 80 time slots (numbered 0, 1, 2,..., 79). It includes two QoS transmission waveforms, 500 Kbps low speed and high reliability and 8 Mbps large bandwidth. The service requirements are as follows: 1. 40 time slots are divided for large bandwidth video transmission, and during operation, all of them can be allocated to 1 UAV for transmitting 4 Mbps real-time video, or allocated to 2 UAVs / 2 Mbps per UAV video transmission, or allocated to 4 UAVs / 1 Mbps per UAV video transmission; 2. The ground station allocates 4 high-reliability time slots for the uplink telemetry transmission of 4 UAVs; 3. Each UAV is allocated 9 high-reliability time slots for downlink remote control and inter-UAV data transmission; 4. Each time slot group should be distributed as evenly as possible in a cross manner to reduce transmission delay.

[0025] The tree structure is as Figure 2 shown; The division method is as follows: First, the root node divides the entire set of time slots into two subsets: comb(0,2) and comb(1,2). According to the above primitive definition, comb(0,2) results in the time slot subset S1 = {0, 2, 4, …, 78}; comb(1,2) results in the time slot subset S2 = {1, 3, 5, …, 79}.

[0026] Furthermore, S1 is further divided. For comb(0,10) on the S1 subset, with the starting element number 0 and an interval of 10, we get S11 = {0, 20, 40, 60}; for comb(-1,0), we get all the elements of the S1 set except S11, that is, S12 = {2, 4, 6, 8, …, 18, 22, 24, …, 38, 42, 44, …, 58, 62, …, 78}; Continuing the division with divide(4), we obtain four leaf nodes: S121 = {2, 10, 18, 28, 36, 46, 54, 64, 72}; S122 = {4, 12, 22, 30, 38, 48, 56, 66, 74}; S123 = {6, 14, 24, 32, 42, 50, 58, 68, 76}; S124 = {8, 16, 26, 34, 44, 52, 62, 70, 78}.

[0027] Performing a further division of S2 with divide(4) gives: S21 = {1, 9, 17, …, 73}; S22 = {3, 11, 19, …, 75}; S23 = {5, 13, 21, …, 77}; S24 = {7, 15, 23, …, 79}; At this point, a total of the following 9 time slot groups are obtained: Group0: {0, 20, 40, 60} Group1: {2, 10, 18, 28, 36, 46, 54, 64, 72} Group2: {4, 12, 22, 30, 38, 48, 56, 66, 74} Group3: {6, 14, 24, 32, 42, 50, 58, 68, 76} Group4: {8, 16, 26, 34, 44, 52, 62, 70, 78} Group5: {1, 9, 17, 25, 33, 41, 49, 57, 65, 73} Group6: {3, 11, 19, 27, 35, 43, 51, 59, 67, 75} Group7: {5, 13, 21, 29, 37, 45, 53, 61, 69, 77} Group8: {7, 15, 23, 31, 39, 47, 55, 63, 71, 79}; The above partitioning process and its corresponding relationship with the tree structure are shown in Figure 3 .

[0028] This time slot group strategy can meet all of the above requirements. Among the 9 time slot groups obtained by partitioning according to this strategy, each time slot group corresponds to a logical transmission link and is respectively used by different nodes to transmit service data of different QoS types.

[0029] In specific use, the ground station node allocates time slot group Group0 to transmit the uplink remote control commands for 4 aircraft. After each aircraft accesses the network, it is sequentially allocated one of the time slot groups Group1, Group2, Group3, and Group4 to transmit downlink telemetry data and inter-aircraft collaboration data. When an aircraft withdraws from the network, the time slot group that has been allocated to this aircraft will be recycled (de-allocated). When subsequent aircraft need to access the network, the recycled time slot group can be allocated to the newly accessed aircraft so that it can join the network for communication. According to the video transmission requirements, time slot groups Group5, Group6, Group7, and Group8 can be allocated to 1, 2, or 4 aircraft to achieve video data transmission with different numbers of channels and transmission rates. It is also possible to recycle (de-allocate) the corresponding video transmission time slot groups according to the usage situation, stop the current video transmission, and re-allocate.

[0030] The text representation method of the time slot group strategy is as Figure 4 shown. Each node is represented by one line of text, and the tree structure is represented in a nested curly brace manner; Binary data representation method: Each node is represented by 4 bytes. The specific format is as Figure 4 shown. The primitive flag field: 0 represents the comb primitive, and 1 represents the divide primitive; The node ID is the unique identification number of each node and cannot be repeated; The QoS type can represent up to 4 types from 0 to 3. Among them, type 0 is automatic, that is, the node independently determines the QoS type of this time slot according to the current transmission requirements; the others are specified type transmissions; The primitive parameter 1 and primitive parameter 2 are multiplexing fields. For the comb primitive, parameter 1 is the starting time slot sequence number, and the parameter is the increment step number; for the divide primitive, parameter 1 is the equal division quantity, and parameter 2 is invalid; The ID of the first child node is the node ID of the first child node of this node; fill 0xF when there is no child node; The next node ID at the same level is the node ID of the next node at the same level as this node. If there is no next node, fill in 0xF.

[0031] As shown in the above example, there are 7 nodes in total, and the node IDs are 0 to 6 respectively. By correctly embedding the first child node and the next node ID at the same level according to the tree structure, a tree data structure representation can be formed. This representation is very efficient and only 28 bytes are needed to implement the complete time slot group policy representation.

[0032] A tree-structured TDMA time slot allocation efficient coding allocation system is applied to the tree-structured TDMA time slot allocation efficient coding allocation method as described above. Figure 6 As shown, the system includes a tree structure building unit 10 and a network module 11; The tree structure construction unit 10 is used to construct a tree structure, define a set of allocation primitives for time slot allocation for each node of the tree structure; divide the time slots in a time frame in sequence through the tree structure, and finally obtain multiple time slot groups, and allocate a QoS type to each time slot group; the tree structure and the information finally represented by it are the time slot group strategy, and the time slot group strategy is encoded by a set of binary data and used for transmission in the network; The network module 11 is used for, when each node in the network accesses, firstly to obtain a unified time slot group strategy for the whole network by parsing the binary coded data of the time slot group strategy, and then to allocate one or more time slot groups in the time slot group strategy to itself according to a certain mechanism to complete link access; during operation, dynamically allocate or release one or more time slot groups according to the network data transmission demand to realize dynamic allocation of network bandwidth resources; The present invention realizes the mechanism and representation method of TDMA time slot group division by creating a tree data structure and its text representation and binary encoding method. In particular, its binary representation method compresses the data length compared with the traditional array representation method. It has universality, great flexibility and high efficiency. In particular, it can realize flexible access strategies and dynamic bandwidth allocation in large-scale distributed networking scenarios, and provides good adaptability and scalability for link access control software to flexibly support various physical transmission and business demand scenarios. In most scenarios, only the configuration needs to be changed without rewriting the program, which provides capability support for the versatility, flexibility and scalability of the equipment.

[0033] It should be understood that those skilled in the art can make improvements or changes based on the above description, and all these improvements and changes should fall within the scope of protection of the appended claims of the present invention.

Claims

1. A tree-structured TDMA time slot allocation efficient coding allocation method, characterized in that: The method comprises the following steps: Construct a tree structure, and define a set of allocation primitives for time slot allocation for each node of the tree structure; divide the time slots in a time frame in sequence through the tree structure, and finally obtain multiple time slot groups, and allocate a QoS type to each time slot group; The tree structure and the information it ultimately represents are the time slot group strategy, which is encoded using a set of binary data and used for transmission in the network; When each node in the network accesses, it first obtains the unified time slot group strategy of the entire network by parsing the binary coded data of the time slot group strategy, and then allocates one or more time slot groups in the time slot group strategy to itself according to a certain mechanism to complete the link access; During operation, one or more time slot groups are dynamically allocated or released according to the network data transmission requirements to achieve dynamic allocation of network bandwidth resources.

2. The tree-structured TDMA time slot allocation efficient coding allocation method according to claim 1, characterized in that: The tree structure is divided according to the following rules: The tree structure consists of a unique root node and multiple child nodes linked to each other. The root node is a set containing all time slots. The plurality of child nodes divide the set in turn, and after the division, each child node obtains a subset of the set; In the tree structure, the grandchild nodes further divide the subsets divided by their corresponding parent nodes, and continue to do so until the leaf nodes, obtaining a time slot group.

3. The tree-structured TDMA time slot allocation efficient coding allocation method according to claim 2, characterized in that: The division of the tree structure also includes: Obtain the number of network nodes, physical layer design parameters, and service transmission requirements; The acquired data is used as the basis for dividing all time slots in the time frame.

4. The tree-structured TDMA time slot allocation efficient coding allocation method according to claim 2, characterized in that: The set S of all time slots in a time frame is {ts0, ts1 ... ts N } and the partitioned subset S i (i=0,1,...,gn) and S j (j=0,1,...,gn) satisfies the following relationship: .

5. The tree-structured TDMA time slot allocation efficient coding allocation method according to claim 2, characterized in that: The root node includes two attributes, name1 and tslot, where name1 represents the name of the time slot group policy, and tslot represents the total number of time slots contained in a time frame and the millisecond length of the time slot; The child node contains three attributes: name2, allocation primitive and QoS type, where name2 represents the name of the child node, allocation primitive represents how to divide the time slot, and QoS type describes the QoS type of the child node and all its child nodes.

6. The tree-structured TDMA time slot allocation efficient coding allocation method according to claim 5, characterized in that: The allocation primitives include comb primitive and divide primitive, wherein the comb primitive carries two parameters v1 and v2, wherein v1 indicates the starting time slot number of the child node allocation, and v2 indicates the number of intervals; when v1 is -1, it indicates that all the remaining time slots are currently allocated, and the v2 value is invalid at this time; the divide primitive contains a parameter n, indicating that a time slot group is allocated into n groups of time slots.

7. The tree-structured TDMA time slot allocation efficient coding allocation method according to claim 6, characterized in that: The time slot group strategy is encoded using a set of binary data, including: Each node is represented by 4 bytes: byte 0, byte 1, byte 2, and byte 3; Byte 0 contains the primitive tag, QoS type and byte ID; Byte 1 contains primitive parameter 1; Byte 2 contains primitive parameter 2; Byte 3 contains the first child node ID and the next node ID at the same level.

8. The tree-structured TDMA time slot allocation efficient coding allocation method according to claim 7, characterized in that: The primitive tag field: 0 represents the comb primitive, 1 represents the divide primitive; Node ID is a unique identification number for each node and cannot be repeated; QoS types include 0~3, a total of 4 types, of which type 0 is automatic type, and the node independently determines the QoS type of the time slot according to the current transmission demand, and other types are specified type transmission; Primitive parameter 1 and primitive parameter 2 are multiplexing fields. For the comb primitive, parameter 1 is the starting time slot number and parameter 2 is the incremental step number. For the divide primitive, parameter 1 is the number of equal divisions and parameter 2 is invalid. The first child node ID is the node ID of the first child node of this node; if there is no child node, fill in 0xF; The next node ID at the same level is the node ID of the next node at the same level as this node. If there is no next node, fill in 0xF.

9. The tree-structured TDMA time slot allocation efficient coding allocation method according to claim 1, characterized in that: The method further includes employing a textual representation of the time slot group policy: The tree structure is represented by nested curly braces, with one line of text for each node.

10. A tree-structured TDMA time slot allocation efficient coding allocation system, applied to the tree-structured TDMA time slot allocation efficient coding allocation method according to any one of claims 1 to 9, characterized in that: The system includes a tree structure building unit and a network module; The tree structure construction unit is used to construct a tree structure, define a set of allocation primitives for time slot allocation for each node of the tree structure; divide the time slots in a time frame in sequence through the tree structure, and finally obtain multiple time slot groups, and allocate a QoS type to each time slot group; the tree structure and the information finally represented by it are the time slot group strategy, and the time slot group strategy is encoded by a set of binary data and used for transmission in the network; The network module is used to, when each node in the network accesses, first obtain a unified time slot group strategy for the entire network by parsing the binary coded data of the time slot group strategy, and then allocate one or more time slot groups in the time slot group strategy to itself according to a certain mechanism to complete link access; during operation, dynamically allocate or release one or more time slot groups according to the network data transmission requirements to realize dynamic allocation of network bandwidth resources.

Images