A dynamic time slot allocation method

Abstract

The embodiment of the application provides a dynamic time slot allocation algorithm, which comprises node networking, when two nodes are in the initial networking moment after the nodes are powered on, a node with a smaller node number is used as a center node, when the center node performs time slot allocation, a binary tree block internal equal distribution method is used for center node time slot allocation based on the minimum sending opportunity and the minimum time slot block allocation principle; time slot adjustment, the node time slot group is fine adjusted according to the node flow demand; node networking, the center node calculates the required time slot according to the flow demand, estimates the time slot group number, uses the Magpie algorithm to calculate, and obtains the time slot group family to be selected by the new networking node; node networking, if the center node is powered off, the center node floods the networking message, the center node is converted into the node with the smallest node number among the remaining nodes, the message is flooded to other nodes, the new center node performs time slot block idle processing on the time slot block used by the networking node according to the time slot configuration table.

Description

Technical Field

[0001] This invention relates to the field of communication technology, and in particular to a dynamic time slot allocation method. Background Technology

[0002] With the development of communication technology, especially in the field of wireless image transmission, time slot allocation algorithms play a crucial role in making video transmission more stable and efficient. Among them, binary tree equal division and heuristic algorithms have played a good role in time slot allocation, but they have problems such as poor adaptability and high time consumption, which urgently need to be solved. Summary of the Invention

[0003] In view of the above-mentioned problems in the prior art, this invention provides a dynamic time slot allocation method. It employs a binary tree even-sharing algorithm for time slot initialization, enabling efficient network construction. For newly joining nodes, the Red-beaked Blue-magpie algorithm is used for time slot allocation, allowing nodes to quickly join the network. The Red-beaked Blue-magpie algorithm combined with the erosion-dilation fitness algorithm dynamically updates the time slot block sequence based on node traffic requirements, and can quickly synchronize the time slot blocks of each node. It can allocate independent time slot block sequences to each node according to the actual number of nodes required in the application, while ensuring that time slot blocks belonging to the same node are evenly distributed, achieving fast and efficient data transmission among multiple nodes.

[0004] This invention provides a dynamic time slot allocation method, comprising:

[0005] When establishing a network of nodes, after the nodes are powered on, the two nodes are in the initial network establishment phase. The node with the smaller node number is used as the central node. When allocating time slots for the central node, the binary tree block equal division method is used to allocate time slots for the central node based on the principle of minimum transmission opportunity and minimum time slot block.

[0006] Time slot adjustments are made, specifically by fine-tuning the node time slot group based on the node's traffic demand.

[0007] When a node joins the network, the central node calculates the required time slots based on traffic demand, estimates the number of time slot groups, uses the Red-beaked Blue Magpie algorithm to calculate, and obtains the time slot group families to be selected for the new node joining the network.

[0008] When a node is decommissioned from the network, if it is not a central node, the decommissioned node will flood the decommissioning message. The central node will then, according to the time slot configuration table, process the time slot blocks used by the decommissioned node to be idle.

[0009] If a central node leaves the network, the central node floods the departure message and transforms the central node into the node with the smallest remaining node number. For other nodes, the message is flooded, and the new central node, according to the time slot configuration table, performs time slot block idle processing on the time slot blocks used by the departing node.

[0010] In some embodiments of the present invention, the method further includes the following when establishing a network at a node:

[0011] After establishing the network at the nodes and using the node with the smaller node number as the central node, the time slot group of the other node is calculated by the central node. M time slot groups are randomly selected from the min P+1 idle time slot pools allocated by the central node. The erosion dilation fitness algorithm is used to calculate the candidate group to obtain the selected time slot group as the determined time slot group of the central node.

[0012] In some embodiments of the present invention, when adjusting time slots, if the number of time slots increases, the following rules are used to increase the time slot allocation for nodes:

[0013] If the time slot block length has not reached the maximum time slot block length, then time slot block expansion is performed;

[0014] The time slot block expansion process involves first expanding the tail of the time slot block. If the tail of the time slot block collides with other time slot blocks during expansion, then the head of the time slot block is expanded. If the head of the time slot block also collides with other time slot blocks, then other time slot blocks are selected for expansion.

[0015] If all existing time slot blocks are of the maximum length and do not meet the micro-time slot requirement, then the Red-beaked Blue Magpie algorithm is used to add new time slot blocks.

[0016] Multiple combinations of time slot groups are generated using random rules. The erosion-expansion fitness algorithm is used to calculate the selected time slot group as the center node.

[0017] In some embodiments of the present invention, when adjusting time slots, if the number of time slots decreases, the following rule is used to increase the time slots allocated to nodes:

[0018] If the time slot block length is not reduced to 2, then time slot block erosion is performed;

[0019] The time slot block is etched by etching the tail of the time slot block. If the length of the time slot block is equal to 2, other time slot blocks are selected for etching.

[0020] If all existing time slot blocks have a length of 2 and exceed the micro-time slot requirement, then delete one of the time slot blocks.

[0021] Multiple combinations of time slot groups are generated. The corrosion expansion fitness algorithm is used to calculate the selected time slot group as the center node.

[0022] In some embodiments of the present invention, the method specifically includes the following when performing node network access:

[0023] When a new node joins the network and floods the traffic demand, the central node calculates the required time slots based on the traffic demand and estimates the number of time slot groups.

[0024] The red-billed blue magpie algorithm was used to calculate 10 undetermined time slot groups, resulting in the time slot group (S). i,j ,L i,j ), i = 1, 2, ..., M, j = 1, 2, ..., K i The time slot group family to be selected for new network nodes;

[0025] The corrosion expansion fitness algorithm is used to calculate the candidate group and obtain the selected time slot group as the determined time slot group for the new network node.

[0026] In some embodiments of the present invention, the method specifically includes:

[0027] Let L be the total number of micro-slots in a time frame, Q be the maximum time slot block length, min P be the minimum transmission opportunity, P be the number of nodes, M be the number of candidate time slot groups, and N be... i ,i=1,2,...,M is the number of micro-time slots required for the flow rate per second counted by the i-th node per unit time. The L micro-time slots are evenly distributed using the binary tree block equal distribution method.

[0028] When building the node network, the binary tree block equal partitioning method is used to allocate the empty time slot blocks.

[0029] When the time slot requirement of a certain node cannot be satisfied by a single time slot block, a time slot pool, i.e. a group of time slot blocks, is allocated. The time slot blocks are determined by the starting point and the size of the time slot blocks. The fitness of the time slot group is calculated using the erosion dilation fitness algorithm, and the maximum fitness is used as the final determined time slot group.

[0030] In some embodiments of the present invention, the method specifically includes: calculating the fitness of the time slot group using a corrosion expansion fitness algorithm, and using the maximum fitness as the final determined time slot group, including:

[0031] Inter-slot interval definition: Node slot block start point S i,j i = 1, 2, ..., M, j = 1, 2, ..., K i ,

[0032] Time slot block size L i,j i = 1, 2, ..., M, j = 1, 2, ..., K i ,

[0033] Where M is the estimated number of time slot groups, and K i If the number of time slot blocks in a certain estimated time slot group is , then the interval BI between the i-th time slot blocks in the j-th group is... i,j The definition is as follows:

[0034]

[0035] Average time interval A between time slots i The definition is as follows:

[0036]

[0037] Inter-slot spacing variance σ i The definition is as follows:

[0038]

[0039] Time slot block fitness i The definition is as follows:

[0040] Fitness i =1 / σ i i = 1, 2, ..., M

[0041] Select the number with the highest fitness from the time slot block fitness. The fitness objective function is:

[0042]

[0043] Fitness was calculated from the predicted time slots in group M. i For each i = 1, 2, ..., M, select the time slot group with the highest fitness as the final selected time slot group.

[0044] Compared with the prior art, the beneficial effect of the dynamic time slot allocation method provided by the embodiments of the present invention is that it can allocate an independent time slot block sequence to each node according to the number of nodes required in the actual application, and the time slot blocks belonging to the same node are evenly distributed in terms of position and length, thereby realizing fast, stable and efficient transmission of multi-node data. Attached Figure Description

[0045] Figure 1 This is an application flowchart of the dynamic time slot allocation method provided in the embodiments of the present invention;

[0046] Figure 2 This is a schematic diagram of the binary tree block equal division method for the dynamic time slot allocation method provided in the embodiment of the present invention. Detailed Implementation

[0047] To enable those skilled in the art to better understand the technical solution of the present invention, the present invention will be described in detail below with reference to the accompanying drawings and specific embodiments.

[0048] Various embodiments and features of this application are described herein with reference to the accompanying drawings.

[0049] These and other features of this application will become apparent from the following description of preferred forms of embodiments given as non-limiting examples, with reference to the accompanying drawings.

[0050] It should also be understood that although this application has been described with reference to some specific examples, those skilled in the art can certainly implement many other equivalent forms of this application, which have the features described in the claims and are therefore all within the scope of protection defined herein.

[0051] The above and other aspects, features and advantages of this application will become more apparent when taken in conjunction with the accompanying drawings and in view of the following detailed description.

[0052] Specific embodiments of this application are described below with reference to the accompanying drawings; however, it should be understood that the claimed embodiments are merely examples of this application, which can be implemented in various ways. Well-known and / or repeated functions and structures are not described in detail to ascertain the true intent based on the user's historical operations, and to avoid unnecessary or redundant details that would obscure this application. Therefore, the specific structural and functional details claimed herein are not intended to be limiting, but merely serve as the basis and representative basis for the claims to teach those skilled in the art to use this application in various ways with substantially any suitable detailed structure.

[0053] This specification may use the phrases “in one embodiment,” “in another embodiment,” “in yet another embodiment,” or “in other embodiments,” all of which may refer to one or more of the same or different embodiments according to this application.

[0054] This invention provides a dynamic time slot allocation method, such as... Figure 1 and Figure 2 As shown, the method includes:

[0055] When establishing a network of nodes, after the nodes are powered on, the two nodes are in the initial network establishment phase. The node with the smaller node number is used as the central node. When allocating time slots for the central node, the binary tree block equal division method is used to allocate time slots for the central node based on the principle of minimum transmission opportunity and minimum time slot block.

[0056] Time slot adjustments are made, specifically by fine-tuning the node time slot group based on the node's traffic demand.

[0057] When a node joins the network, the central node calculates the required time slots based on traffic demand, estimates the number of time slot groups, uses the Red-beaked Blue Magpie algorithm to calculate, and obtains the time slot group families to be selected for the new node joining the network.

[0058] When a node is decommissioned from the network, if it is not a central node, the decommissioned node will flood the decommissioning message. The central node will then, according to the time slot configuration table, process the time slot blocks used by the decommissioned node to be idle.

[0059] If a central node leaves the network, the central node floods the departure message and transforms the central node into the node with the smallest remaining node number. For other nodes, the message is flooded, and the new central node, according to the time slot configuration table, performs time slot block idle processing on the time slot blocks used by the departing node.

[0060] To facilitate understanding of the above technical solutions, the following explanation is provided in conjunction with the accompanying drawings and specific examples:

[0061] The above-mentioned dynamic time slot allocation method includes time slot allocation during node network establishment, node network entry, time slot adjustment, and node network exit. The specific methods are as follows.

[0062] Let L be the total number of micro-slots in a time frame (assumed to be 1000 in this patent), Q be the maximum time slot block length, min P be the minimum transmission opportunity, P be the number of nodes, M be the number of candidate time slot groups, and N be the minimum number of candidate time slot groups. i Let i = 1, 2, ..., M be the number of micro-time slots required for the flow rate per second counted by the i-th node per unit time. The L micro-time slots are evenly distributed using the binary tree block partitioning method.

[0063] Binary tree block partitioning method such as Figure 2 As shown:

[0064] When building the node network, the binary tree block equal partitioning method is used to allocate the empty time slot blocks.

[0065] When the time slot requirement of a node cannot be satisfied by a single time slot block, a "time slot pool," i.e., a group of time slot blocks, can be allocated. The size of a time slot block is determined by its starting point and size. The time slot blocks in the time slot pool can be large or small, and their occurrence times can be arbitrarily distributed. Therefore, the time slot blocks in the pool may be non-uniform. For example, if a node needs 32 microtime slots, 32 can be decomposed into 16+8+4+2. Then, block A (0b0000010000,16) and block B (0b00001000010000,16) can be allocated. Blocks D (0b0000000100,4) and E (0b0000000000,2) are allocated to this node. Of course, there are many other possible time slot block configurations. This patent uses an erosion-dilation fitness algorithm to calculate the fitness of the time slot group, using the highest fitness value as the final determined time slot group. The method is as follows:

[0066] Inter-slot interval definition: Node slot block start point S i,j i = 1, 2, ..., M, j = 1, 2, ..., K i Time slot block size L i,ji = 1, 2, ..., M, j = 1, 2, ..., K i Where M is the estimated number of time slot groups, and K i If the number of time slot blocks in a certain estimated time slot group is , then the interval BI between the i-th time slot blocks in the j-th group is... i,j The definition is as follows:

[0067]

[0068] Average time interval A between time slots i The definition is as follows:

[0069]

[0070] Inter-slot spacing variance σ i The definition is as follows:

[0071]

[0072] Time slot block fitness i The definition is as follows:

[0073] Fitness i =1 / σ i i = 1, 2, ..., M

[0074] Select the number with the highest fitness from the time slot block fitness. The fitness objective function is:

[0075]

[0076] From the M-group of predicted time slots, the Fitness is calculated using the above formula. i For each i = 1, 2, ..., M, select the time slot group with the highest fitness (i.e., the index) as the final selected time slot group.

[0077] In this embodiment, as Figure 1 As shown, this paper introduces the process from several aspects, including node network establishment, time slot adjustment, node entry into the network, and node exit from the network.

[0078] During node network establishment, when two nodes are powered on and in the initial network establishment phase, the node with the smaller node number is used as the central node. When allocating time slots for the central node, a binary tree block-based equal-division method is used based on the principles of minimum transmission opportunity and minimum time slot block size. If min P is 20, then 20 subtrees are selected from the 32 subtrees at level 6 of the binary tree. The left leaf nodes of these 20 subtrees are used as time slot groups. The estimated number of time slot groups is 10. Therefore, the resulting time slot group (S) i,j ,L i,jLet i = 1, 2, ..., M, j = 1, 2, ..., 20 be the time slot groups to be selected as the center node. The erosion dilation fitness algorithm is used to calculate the selected time slot groups as the center nodes.

[0079] The time slot group of another node is calculated by the central node. M time slot groups are randomly selected from the min P+1 idle time slot pools designated by the central node. The erosion dilation fitness algorithm is used to calculate the candidate family and obtain the selected time slot group as the determined time slot group of the central node.

[0080] The allocation of time slots for the two nodes has been completed, and the node network construction is now finished.

[0081] Time slot adjustment

[0082] Fine-tuning the node time slot group based on node traffic demand can be done in two ways:

[0083] (1) Increase in time slots

[0084] The following rules are used to increase the number of time slots allocated to nodes:

[0085] ① If the time slot block length does not reach Q, then time slot block expansion is performed;

[0086] ② The time slot block expansion adopts the following method: first expand the tail of the time slot block. If the tail of the time slot block collides with other time slot blocks during expansion, then the head of the time slot block is expanded. If the head of the time slot block also collides with other time slot blocks, then other time slot blocks are selected for expansion.

[0087] ③ If all existing time slot blocks have a length of Q and do not meet the micro-time slot requirement, then the Red-beaked Blue Magpie algorithm is used to add new time slot blocks.

[0088] According to the above rules, there are multiple combinations of time slot groups that can be generated using random rules. Assuming that 10 time slot groups are generated, the erosion dilation fitness algorithm is used to calculate the candidate family and obtain the determined time slot group as the center node.

[0089] (2) Time slot reduction

[0090] The following rules are used to increase the number of time slots allocated to nodes:

[0091] ①If the time slot block length is not reduced to 2, then time slot block erosion is performed;

[0092] ② The time slot block is etched by etching the tail of the time slot block. If the length of the time slot block is equal to 2, other time slot blocks are selected for etching.

[0093] ③ If all existing time slot blocks have a length of 2 and exceed the micro-time slot requirement, then delete one of the time slot blocks.

[0094] According to the above rules, there are multiple combinations of time slot groups that can be generated. Ten time slot groups are generated. The erosion expansion fitness algorithm is used to calculate the candidate family and obtain the determined time slot group as the center node.

[0095] Nodes joining the network

[0096] The central node calculates the required time slots based on the flooding demand of newly joined nodes, thereby estimating the number of time slot groups. Using the Red-Mouthed Blue Magpie algorithm, 10 undetermined time slot groups are calculated. Therefore, the resulting number of time slot groups (S) i,j ,L i,j Let i = 1, 2, ..., M, j = 1, 2, ..., 20 be the time slot groups to be selected for new network nodes. The erosion dilation fitness algorithm is used to calculate the candidate family and obtain the selected time slot group as the determined time slot group for new network nodes.

[0097] Node decommissioning

[0098] If a non-central node leaves the network, the leaving node floods the network leaving message, and the central node, according to the time slot configuration table, processes the time slot blocks used by the leaving node as idle.

[0099] If a central node leaves the network, the central node floods the departure message and transforms the central node into the node with the smallest remaining node number. For other nodes, the message is flooded, and the new central node, according to the time slot configuration table, performs time slot block idle processing on the time slot blocks used by the departing node.

[0100] As can be seen from the above technical solutions, the dynamic time slot allocation method provided by the above embodiments of the present invention can allocate an independent time slot block sequence to each node according to the number of nodes required in actual applications. At the same time, the positions and lengths of time slot blocks belonging to the same node are evenly distributed, thereby realizing fast, stable and efficient transmission of multi-node data.

[0101] The above embodiments are merely exemplary embodiments of the present invention and are not intended to limit the present invention. The scope of protection of the present invention is defined by the claims. Those skilled in the art can make various modifications or equivalent substitutions to the present invention within its spirit and scope of protection, and such modifications or equivalent substitutions should also be considered to fall within the scope of protection of the present invention.

Claims

1. A dynamic time slot allocation method, characterized in that, include: When establishing a network of nodes, after the nodes are powered on, the two nodes are in the initial network establishment phase. The node with the smaller node number is used as the central node. When allocating time slots for the central node, the binary tree block equal division method is used to allocate time slots for the central node based on the principle of minimum transmission opportunity and minimum time slot block. Time slot adjustments are made, specifically by fine-tuning the node time slot group based on the node's traffic demand. When a node joins the network, the central node calculates the required time slots based on traffic demand, estimates the number of time slot groups, uses the Red-beaked Blue Magpie algorithm to calculate, and obtains the time slot group families to be selected for the new node joining the network. When a node is decommissioned from the network, if it is not a central node, the decommissioned node will flood the decommissioning message. The central node will then, according to the time slot configuration table, process the time slot blocks used by the decommissioned node to be idle. If a central node leaves the network, the central node floods the departure message and transforms the central node into the node with the smallest remaining node number. For other nodes, the message is flooded, and the new central node, according to the time slot configuration table, performs time slot block idle processing on the time slot blocks used by the departing node.

2. The dynamic time slot allocation method according to claim 1, characterized in that, When establishing a network at a node, the method further includes: After establishing the network at the nodes and using the node with the smaller node number as the central node, the time slot group of the other node is calculated by the central node. M time slot groups are randomly selected from the min P+1 idle time slot pools allocated by the central node. The erosion dilation fitness algorithm is used to calculate the candidate group to obtain the selected time slot group as the determined time slot group of the central node.

3. The dynamic time slot allocation method according to claim 2, characterized in that, When adjusting time slots, if a time slot is increased, the following rules are used to increase the time slot allocation for nodes: If the time slot block length has not reached the maximum time slot block length, then time slot block expansion is performed; The time slot block expansion process involves first expanding the tail of the time slot block. If the tail of the time slot block collides with other time slot blocks during expansion, then the head of the time slot block is expanded. If the head of the time slot block also collides with other time slot blocks, then other time slot blocks are selected for expansion. If all existing time slot blocks are of the maximum length and do not meet the micro-time slot requirement, then the Red-beaked Blue Magpie algorithm is used to add new time slot blocks. Multiple combinations of time slot groups are generated using random rules. The erosion-expansion fitness algorithm is used to calculate the selected time slot group as the center node.

4. The dynamic time slot allocation method according to claim 3, characterized in that, When adjusting time slots, if the number of time slots decreases, the following rules are used to increase the number of time slots allocated to nodes: If the time slot block length is not reduced to 2, then time slot block erosion is performed; The time slot block is etched by etching the tail of the time slot block. If the length of the time slot block is equal to 2, other time slot blocks are selected for etching. If all existing time slot blocks have a length of 2 and exceed the micro-time slot requirement, then delete one of the time slot blocks. Multiple combinations of time slot groups are generated. The corrosion expansion fitness algorithm is used to calculate the selected time slot group as the center node.

5. The dynamic time slot allocation method according to claim 4, characterized in that, When a node joins the network, the method specifically includes: When a new node joins the network and floods the traffic demand, the central node calculates the required time slots based on the traffic demand and estimates the number of time slot groups. The red-billed blue magpie algorithm was used to calculate 10 undetermined time slot groups, resulting in the time slot group (S). i,j ,L i,j ), i = 1, 2, ..., M, j = 1, 2, ..., K i The time slot group family to be selected for new network nodes; The corrosion expansion fitness algorithm is used to calculate the candidate group and obtain the selected time slot group as the determined time slot group for the new network node.

6. The dynamic time slot allocation method according to claim 5, characterized in that, The method specifically includes: Let L be the total number of micro-slots in a time frame, Q be the maximum time slot block length, min P be the minimum transmission opportunity, P be the number of nodes, M be the number of candidate time slot groups, and N be... i ,i=1,2,...,M is the number of micro-time slots required for the flow rate per second counted by the i-th node per unit time. The L micro-time slots are evenly distributed using the binary tree block equal distribution method. When building the node network, the binary tree block equal partitioning method is used to allocate the empty time slot blocks. When the time slot requirement of a certain node cannot be satisfied by a single time slot block, a time slot pool, i.e. a group of time slot blocks, is allocated. The time slot blocks are determined by the starting point and the size of the time slot blocks. The fitness of the time slot group is calculated using the erosion dilation fitness algorithm, and the maximum fitness is used as the final determined time slot group.

7. The dynamic time slot allocation method according to claim 6, characterized in that, The method specifically includes: calculating the fitness of time slot groups using a corrosion expansion fitness algorithm, and using the maximum fitness as the final determined time slot group, including: Inter-slot interval definition: Node slot block start point S i,j i = 1, 2, ..., M, j = 1, 2, ..., K i , Time slot block size L i,j i = 1, 2, ..., M, j = 1, 2, ..., K i , Where M is the estimated number of time slot groups, and K i If the number of time slot blocks in a certain estimated time slot group is , then the interval BI between the i-th time slot blocks in the j-th group is... i,j The definition is as follows: Average time interval A between time slots i The definition is as follows: Inter-slot spacing variance σ i The definition is as follows: Time slot block fitness i The definition is as follows: Fitness i =1 / σ i ,i=1,2,...,M Select the number with the highest fitness from the time slot block fitness. The fitness objective function is: Fitness was calculated from the predicted time slots in group M. i For each i = 1, 2, ..., M, select the time slot group with the highest fitness as the final selected time slot group.

Images