Efficient Coding Allocation Method and System for TDMA Time Slot Allocation Based on Tree Structure

Abstract

The invention relates to a tree-structure-based TDMA time slot allocation efficient coding allocation method and system, comprising the following steps: constructing a tree structure, dividing time slots in a time frame in sequence through the tree structure, and finally obtaining a plurality of time slot groups, 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 group of binary data; when a node accesses a network, it first obtains a unified time slot group strategy for 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 link access; during operation, one or more time slot groups are dynamically allocated or released according to network data transmission requirements to realize dynamic allocation of network bandwidth resources; through the scheme of the present application, the mechanism and representation method of TDMA time slot group division are realized, and capability support is provided for the versatility, flexibility and scalability of equipment.

Description

Technical Field

[0001] The present invention relates to the technical field 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 can obtain 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 focus on resource allocation in the point-to-point two-way link between the "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 collision 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 exiting 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 number 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. There is a need for an efficient coding allocation method and system for TDMA time slot allocation based on a tree structure that can better solve this difficulty. 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 the technical problem is:

[0007] A tree-structured TDMA time slot allocation efficient coding allocation method is constructed, wherein the method comprises the following steps:

[0008] 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;

[0009] 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;

[0010] 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;

[0011] 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.

[0012] 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:

[0013] 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.

[0014] The plurality of child nodes divide the set in turn, and after the division, each child node obtains a subset of the set;

[0015] 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.

[0016] 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:

[0017] Obtain the number of network nodes, physical layer design parameters, and service transmission requirements;

[0018] The acquired data is used as the basis for dividing all time slots in the time frame.

[0019] The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to the present invention, wherein the set S = {ts0, ts1... ts N} composed of all time slots within a time frame and the divided subsets S i (i = 0, 1,..., gn) and S j (j = 0, 1,..., gn) satisfy the following relationships: .

[0020] 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 contains two attributes, name1 and tslot. Among them, name1 represents the name of the time slot group policy, and tslot represents the total number of time slots contained within a time frame and the millisecond length of the time slots;

[0021] The child node contains three attributes, name2, allocation primitive, and QoS type. Among them, name2 represents the name of the child node, the allocation primitive represents how to perform time slot division, and the QoS type describes the QoS type of the child node and all its child nodes.

[0022] 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. Among them, the comb primitive carries two parameters, v1 and v2. Among them, 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 for the current allocation, and at this time, the v2 value is invalid; the divide primitive contains a parameter n, indicating that a time slot group is equally divided into n groups of time slots.

[0023] 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:

[0024] Each node is represented by 4 bytes: byte 0, byte 1, byte 2, and byte 3;

[0025] Byte 0 contains a primitive flag, QoS type, and byte ID;

[0026] Byte 1 contains primitive parameter 1;

[0027] Byte 2 contains primitive parameter 2;

[0028] Byte 3 contains the ID of the first child node and the ID of the next node at the same level.

[0029] 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;

[0030] Node ID is a unique identification number for each node and cannot be repeated;

[0031] 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;

[0032] Primitive parameter 1 and primitive parameter 2 are multiplexing fields. For the comb primitive, parameter 1 is the starting time slot number and the parameter is the incremental step number. For the divide primitive, parameter 1 is the number of equal divisions and parameter 2 is invalid.

[0033] 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;

[0034] 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.

[0035] 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:

[0036] The tree structure is represented by nested curly braces, with one line of text for each node.

[0037] 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;

[0038] 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;

[0039] 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.

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

[0041] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will further illustrate the present invention 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:

[0042] Figure 1 It is a flowchart of an efficient encoding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention;

[0043] Figure 2 It is a schematic diagram of the tree structure of an efficient encoding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention;

[0044] Figure 3 It is the time slot division process of an efficient encoding 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;

[0045] Figure 4 It is a schematic diagram of the text representation of the time slot group strategy of an efficient encoding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention;

[0046] Figure 5 It is a schematic diagram of the binary data representation of an efficient encoding and allocation method for TDMA time slot allocation based on a tree structure in a preferred embodiment of the present invention;

[0047] Figure 6 It is a schematic block diagram of the principle of an efficient encoding 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

[0048] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the following will be described clearly and completely in combination with the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are partial embodiments of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work belong to the protection scope of the present invention.

[0049] The tree-structured TDMA time slot allocation efficient coding allocation method of the preferred embodiment of the present invention is as follows: Figure 1 See also Figures 2 - 5 , including the following steps:

[0050] S01: 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;

[0051] S02: 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;

[0052] 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;

[0053] 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;

[0054] 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.

[0055] The specific instructions are as follows:

[0056] In a TDMA network, the basic unit for receiving and transmitting each wireless signal data frame is called a time slot (TimeSlot). Generally, a time slot is about 0.5 - 10 ms. Within this time, the complete transmission of a physical layer data frame can be completed. The cycle composed of multiple time slots is called a time frame (TimeFrame). A time frame contains multiple time slots, and all nodes in the network can achieve a round of data transmission and exchange within one time frame. By allocating each time slot within the time frame to each node in the network, each node sends data within the time slot allocated to itself and receives the data sent by other nodes in other time slots. In this way, each node has the opportunity to send data, and finally, the networking data transmission is achieved, which is TDMA multiple access;

[0057] Time slot group strategy: The set S = {ts0, ts1...ts N} composed of all time slots within one time frame and the divided subsets S i (i = 0, 1,..., gn) and S j (j = 0, 1,..., gn) satisfy the following relationships: .

[0058] Construct a tree structure to completely describe a time slot group strategy. This tree structure is formed by a unique root node (rootnode) and its multiple child nodes (childnode) linked to each other to form a tree structure.

[0059] The root node contains two attributes, name and tslot. Among them, name represents the name of this time slot group strategy, and tslot describes the total number of time slots contained in one time frame and the total number of time slots contained within one second;

[0060] Other nodes contain three attributes, name, allocation primitive, and QoS type. Among them, 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 this 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. Among them, the comb primitive carries two parameters, v1 and v2. Among them, v1 represents the starting time slot number allocated to this node, and v2 represents the interval quantity; 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, and getting a division every 2 (i.e., with an interval of 1) time slots; comb(-1, 0) means all the remaining time slots in the current division. Divide contains a parameter n, that is, equally dividing a time slot group into n groups of time slots.

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

[0062] A specific example is as follows:

[0063] A networking UAV measurement and control system with 1 ground station and 4 UAVs, the physical layer time slot length is 5 ms, and a time frame contains 80 time slots (numbered 0, 1, 2,..., 79). It includes two QoS transmission waveforms: 500 Kbps low-speed high-reliability and 8 Mbps large bandwidth. The service requirements are as follows:

[0064] 1. 40 time slots are divided for large-bandwidth video transmission, and during operation, they can be allotted to 1 UAV for 4 Mbps real-time video transmission, or allotted to 2 UAVs / 2 Mbps per UAV video transmission, or allotted to 4 UAVs / 1 Mbps per UAV video transmission;

[0065] 2. The ground station allocates 4 high-reliability time slots for the uplink telemetry transmission of 4 UAVs;

[0066] 3. Each UAV is allocated 9 high-reliability time slots for downlink remote control and inter-UAV data transmission;

[0067] 4. Each time slot group should be as evenly distributed in a cross-manner as possible to reduce the transmission delay.

[0068] The tree structure is as Figure 2 shown;

[0069] The partitioning is carried out in the following way:

[0070] First, the root node partitions the entire time slot set twice: comb(0, 2) and comb(1, 2). According to the above primitive definition, comb(0, 2) gets the time slot subset S1 = {0, 2, 4,…, 78}; comb(1, 2) gets the time slot subset S2 = {1, 3, 5,…, 79}.

[0071] Further, S1 is continuously partitioned. comb(0, 10) means for the S1 subset, the starting element number is 0, and the interval is 10, then S11 = {0, 20, 40, 60} is obtained; comb(-1, 0) gets 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};

[0072] Continue to divide (4), and then four leaf nodes are obtained:

[0073] S121 = {2, 10, 18, 28, 36, 46, 54, 64, 72};

[0074] S122 = {4, 12, 22, 30, 38, 48, 56, 66, 74};

[0075] S123 = {6, 14, 24, 32, 42, 50, 58, 68, 76};

[0076] S124 = {8, 16, 26, 34, 44, 52, 62, 70, 78}.

[0077] Further divide S2 by divide(4), and then we get: S21 = {1, 9, 17,..., 73}; S22 = {3, 11, 19,..., 75}; S23 = {5, 13, 21,..., 77}; S24 = {7, 15, 23,..., 79};

[0078] So far, a total of the following 9 time slot groups have been obtained:

[0079] Group0: {0, 20, 40, 60}

[0080] Group1: {2, 10, 18, 28, 36, 46, 54, 64, 72}

[0081] Group2: {4, 12, 22, 30, 38, 48, 56, 66, 74}

[0082] Group3: {6, 14, 24, 32, 42, 50, 58, 68, 76}

[0083] Group4: {8, 16, 26, 34, 44, 52, 62, 70, 78}

[0084] Group5: {1, 9, 17, 25, 33, 41, 49, 57, 65, 73}

[0085] Group6: {3, 11, 19, 27, 35, 43, 51, 59, 67, 75}

[0086] Group7: {5, 13, 21, 29, 37, 45, 53, 61, 69, 77}

[0087] Group8: {7, 15, 23, 31, 39, 47, 55, 63, 71, 79};

[0088] The above division process and its corresponding relationship with the tree structure are shown in Figure 3 。

[0089] The time slot group policy can meet all the above requirements. Among the 9 time slot groups obtained by division according to this policy, each time slot group corresponds to a logical transmission link, which is respectively used by different nodes to transmit service data of different QoS types.

[0090] In specific use, the ground station node allocates time slot group Group0 to transmit the uplink remote control instructions 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 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 to enable it to 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.

[0091] The text representation method of the time slot group policy 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;

[0092] The binary data representation method: Each node is represented by 4 bytes, and the specific format is as Figure 4 shown. The primitive flag field: 0 represents the comb primitive, and 1 represents the divide primitive;

[0093] The node ID is the unique identification number of each node and cannot be repeated;

[0094] 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;

[0095] 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;

[0096] 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;

[0097] The ID of the next node at the same level is the node ID of the next node at the same level of this node. Fill 0xF when there is no next node.

[0098] 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.

[0099] 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;

[0100] 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;

[0101] 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;

[0102] 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.

[0103] 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. An efficient coding allocation method for TDMA time slot allocation based on a tree structure, characterized in that The method includes 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; sequentially divide the time slots within a time frame through the tree structure, finally obtain multiple time slot groups, and allocate a QoS type to each time slot group; The tree structure and the information it finally represents are the time slot group policy, and a set of binary data is used to encode the time slot group policy and is used for transmission in the network; When each node in the network accesses, it first obtains the unified time slot group policy for the whole network by parsing the binary encoded data of the time slot group policy, and then allocates one or more time slot groups in the time slot group policy to itself according to a certain mechanism to complete 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 efficient coding allocation method for TDMA time slot allocation based on a tree structure according to claim 1, wherein The division of the tree structure adopts the following rules: The tree structure is formed by linking a unique root node and multiple child nodes. The root node is a set containing all time slots; Multiple child nodes sequentially divide the set, and each child node obtains a subset of the set after division; The grandchild nodes in the tree structure further divide the subset divided by their corresponding parent nodes, and so on until the leaf nodes, and a time slot group is obtained.

3. The efficient coding allocation method for TDMA time slot allocation based on a tree structure according to claim 2, characterized in that, The division of the tree structure further includes: Obtain the number of network nodes, physical layer design parameters, and service transmission requirements; Use the obtained data as the basis for dividing all time slots in the time frame.

4. The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to claim 2, characterized in that The set S = {ts0, ts1... ts N} composed of all time slots within a time frame and the partitioned subsets S i ， i = 0, 1,..., gn and S j , j = 0, 1,..., gn, satisfy the following relationship: 。 5. The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to claim 2, wherein The root node contains two attributes, name1 and tslot. Among them, 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 slots; The child node contains three attributes, name2, allocation primitive, and QoS type. Among them, 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 types of the child node and all its child nodes.

6. The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to claim 5, characterized in that, The allocation primitive includes a comb primitive and a divide primitive. Among them, the comb primitive carries two parameters, v1 and v2. Among them, 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 contains a parameter n, indicating that a time slot group is equally divided into n groups of time slots.

7. The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to claim 6, characterized in that The encoding of the time slot group policy with a set of binary data includes: Each node is represented by 4 bytes: byte 0, byte 1, byte 2, and byte 3; Byte 0 contains a primitive flag, a QoS type, and a byte ID; Byte 1 contains primitive parameter 1; Byte 2 contains primitive parameter 2; Byte 3 contains the ID of the first child node and the ID of the next node at the same level.

8. The efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to claim 7, characterized in that, 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. Among them, type 0 is the automatic type, and the node autonomously determines the QoS type of this time slot according to the current transmission requirements, and the other types are for 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 the parameter 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 efficient coding and allocation method for TDMA time slot allocation based on a tree structure according to claim 1, wherein 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. An efficient coding allocation system for TDMA time slot allocation based on a tree structure, which is applied to the efficient coding allocation method for TDMA time slot allocation based on a tree structure as described in any one of claims 1-9, and is 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