Dynamic time slot allocation algorithm

Abstract

The embodiment of the invention provides a dynamic time slot allocation algorithm, which comprises the following steps of: establishing a network by nodes, when the nodes are started, two nodes are at the initial network establishment moment, and a node with a smaller node number is used as a central node; based on the minimum sending opportunity and the minimum time slot block as the distribution principle, center node time slot distribution is carried out by adopting a binary tree in-block equipartition method; time slot adjustment: performing fine adjustment on the node time slot group according to the node flow demand; the nodes access the network, the central node calculates the required time slots according to the traffic demand, pre-estimates the number of time slot groups, and calculates by using a Red-Take-Blue-Take algorithm to obtain a to-be-selected time slot group family of a new network access node; and if the central node quits the network, the central node floods a network quitting message, converts the central node into a node with the minimum residual node number, and floods messages for other nodes, and the new central node performs time slot block idle processing on the time slot block used by the network quitting node according to the time slot configuration table.

Description

Technical Field

[0001] The invention relates to the technical field of communication technology, in particular to a dynamic time slot allocation algorithm. Background Art

[0002] With the development of communication technology, especially in the field of wireless image transmission, time slot allocation algorithm plays a vital role in making video more stable and efficient in wireless transmission. Among them, binary tree equal division method and heuristic algorithm play a better role in time slot allocation, but there are problems of poor adaptability and high time consumption, which need to be solved urgently. Summary of the invention

[0003] In view of the above problems existing in the prior art, an embodiment of the present invention provides a dynamic time slot allocation algorithm, which uses a binary tree equal division algorithm to initialize the time slot, can efficiently form a network, and uses a red-billed blue magpie algorithm to allocate time slots for new network nodes, so that the nodes to be networked can quickly enter the network. The red-billed blue magpie algorithm is used in combination with the corrosion expansion fitness algorithm to dynamically update the time slot block sequence according to the node traffic demand, and the time slot block synchronization of each node can be quickly achieved. According to the number of nodes required in actual applications, each node can be allocated a mutually independent time slot block sequence, and the time slot blocks belonging to the same node are evenly distributed, so as to achieve fast and efficient transmission of multi-node data.

[0004] An embodiment of the present invention provides a dynamic time slot allocation algorithm, including:

[0005] When the nodes are powered on, the two nodes are in the initial networking stage. The node with the smaller node number is used as the central node. When allocating time slots as the central node, the binary tree block equal division method is used to allocate time slots to the central node based on the minimum transmission opportunity and the minimum time slot block as the allocation principle.

[0006] Perform time slot adjustment, specifically fine-tuning the node time slot group according to the node traffic demand;

[0007] When a node joins the network, the central node calculates the required time slots based on the traffic demand, estimates the number of time slot groups, uses the red-billed blue magpie algorithm to calculate, and obtains the time slot group family to be selected by the new node.

[0008] The node is de-networked. If the node is not a central node, the de-networked node floods the de-networked message. The central node idles the time slot block used by the de-networked node according to the time slot configuration table.

[0009] If the central node is disconnected from the network, the central node floods the network disconnection message, converts the central node to the node with the smallest node number among the remaining nodes, and floods the message to other nodes. The new central node performs time slot block idle processing on the time slot block used by the disconnected node according to the time slot configuration table.

[0010] In some embodiments of the present invention, when the nodes are networking, the algorithm further includes:

[0011] After the node network is established and the node with a smaller node number is used as the central node, the time slot group of another node is calculated by the central node, and M groups of time slot groups are randomly obtained from the min P+1 idle time slot pool defined by the central node. The corrosion expansion fitness algorithm is used to calculate the selected family, and the selected time slot group is obtained as the determined time slot group of the central node.

[0012] In some embodiments of the present invention, when adjusting the time slot, if the time slot is increased, the following rule is used to increase the node allocation time slot:

[0013] If the time slot block length does not reach the maximum time slot block length, the time slot block is expanded;

[0014] The expansion of the time slot block adopts the method of expanding the tail of the time slot block first. If the tail of the time slot block collides with other time slot blocks during expansion, the head of the time slot block will be expanded. If the head of the time slot block also collides with other time slot blocks, other time slot blocks will be selected for expansion.

[0015] If the length of all existing time slot blocks is the maximum time slot block length and the micro-time slot demand is not met, the red-billed blue magpie algorithm is used to add new time slot blocks.

[0016] According to the above rules, a variety of combinations of time slot groups are generated using random rules, and the corrosion expansion fitness algorithm is used to calculate the selected family to obtain the selected time slot group as the determined time slot group of the central node.

[0017] In some embodiments of the present invention, when adjusting the time slot, if the time slot is reduced, the following rule is used to increase the node allocation time slot:

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

[0019] The time slot block erosion is performed by corroding 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 erosion;

[0020] If the length of all existing time slot blocks is 2 and exceeds the required number of mini-time slots, one of the time slot blocks is deleted.

[0021] According to the above rules, multiple combinations of time slot groups are generated, and the corrosion expansion fitness algorithm is used to calculate the selected family to obtain the determined time slot group as the central node.

[0022] In some embodiments of the present invention, when a node joins a network, the method specifically includes:

[0023] The new nodes flood the traffic demand, and 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 is used to calculate the 10 time slot groups to be determined, and the obtained time slot groups (S i,j ,L i,j ),i=1,2,...,M,j=1,2,...,20 is the time slot group to be selected by the new node;

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

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

[0027] Let L be the total number of mini-slots in the 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 slot groups to be selected, N be i ,i=1,2,...,M is the number of micro-time slots required for the traffic per second counted by the i-th node per unit time, and the L micro-time slots are evenly allocated to the time slot blocks using the binary tree intra-block equal division method;

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

[0029] When the time slot demand of a node cannot be met by a time slot block, a time slot pool is allocated, that is, a group of time slot blocks. The time slot block is determined by the starting point and the time slot block size. The corrosion and expansion fitness algorithm is used to calculate the adaptability of the time slot group, and the maximum adaptability is used as the final determined time slot group.

[0030] In some embodiments of the present invention, the algorithm specifically includes: the use of the corrosion expansion fitness algorithm to calculate the adaptability of the time slot group, and taking the maximum adaptability as the final determined time slot group, including:

[0031] Definition of the interval between time slot blocks: Node time slot block starting point S i,j ,i=1,2,...,M,j=1,2,...,K i ,

[0032] 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, K i is the number of time slot blocks in a certain estimated time slot group, then the interval BI between the i-th time slot blocks in the j-th group is i,j is defined as follows:

[0034]

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

[0036]

[0037] The variance of the interval between time slot blocks is σ 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 that maximizes the fitness from the time slot block fitness, and the fitness objective function is:

[0042]

[0043] From the M groups of estimated time slots, the Fitness is calculated by the above formula i ,i=1,2,...,M, and select the time slot group with the largest fitness as the final selected time slot group.

[0044] Compared with the prior art, the beneficial effect of the dynamic time slot allocation algorithm provided by the embodiment of the present invention is that it can allocate a mutually independent time slot block sequence to each node according to the number of nodes required in actual applications, and at the same time, the position and length of the time slot blocks belonging to the same node are evenly distributed, thereby realizing fast, stable and efficient transmission of multi-node data. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] Figure 1 An application flow chart of a dynamic time slot allocation algorithm provided by an embodiment of the present invention;

[0046] Figure 2 A schematic diagram of the binary tree block equal division method of the dynamic time slot allocation algorithm provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0047] In order to enable those skilled in the art to better understand the technical solution of the present invention, the present invention is described in detail below in conjunction with the accompanying drawings and specific implementation methods.

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

[0049] These and other characteristics of the present application will become apparent from the following description of a preferred form of embodiment given as a non-limiting example with reference to the accompanying drawings.

[0050] It should also be understood that, although the present application has been described with reference to some specific examples, those skilled in the art will be able to realize many other equivalent forms of the present application that have the features described in the claims and are therefore within the scope of protection defined thereby.

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

[0052] Specific embodiments of the present application are described hereinafter with reference to the accompanying drawings; however, it should be understood that the embodiments applied for are merely examples of the present application, which may be implemented in a variety of ways. Well-known and / or repeated functions and structures are not described in detail to determine the true intent based on the user's historical operations and to avoid unnecessary or redundant details that make the present application unclear. Therefore, the specific structural and functional details applied for herein are not intended to be limiting, but are merely used as the basis and representative basis for the claims to teach those skilled in the art to use the present application in a variety of 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 the present application.

[0054] The embodiment of the present invention provides a dynamic time slot allocation algorithm, such as Figure 1 and Figure 2 As shown, the algorithm includes:

[0055] When the nodes are powered on, the two nodes are in the initial networking stage. The node with the smaller node number is used as the central node. When allocating time slots as the central node, the binary tree block equal division method is used to allocate time slots to the central node based on the minimum transmission opportunity and the minimum time slot block as the allocation principle.

[0056] Perform time slot adjustment, specifically fine-tuning the node time slot group according to the node traffic demand;

[0057] When a node joins the network, the central node calculates the required time slots based on the traffic demand, estimates the number of time slot groups, uses the red-billed blue magpie algorithm to calculate, and obtains the time slot group family to be selected by the new node.

[0058] The node is de-networked. If the node is not a central node, the de-networked node floods the de-networked message. The central node idles the time slot block used by the de-networked node according to the time slot configuration table.

[0059] If the central node is disconnected from the network, the central node floods the network disconnection message, converts the central node to the node with the smallest node number among the remaining nodes, and floods the message to other nodes. The new central node performs time slot block idle processing on the time slot block used by the disconnected node according to the time slot configuration table.

[0060] To facilitate understanding of the above technical solution, the following is an explanation in conjunction with the accompanying drawings and specific examples, as follows:

[0061] The above dynamic time slot allocation algorithm includes the time slot allocation when nodes are established, nodes are added to the network, time slots are adjusted, and nodes are removed from the network. The specific method is as follows:

[0062] Assume L is the total number of microslots in the time frame (assumed to be 1000 in this patent), Q is the maximum time slot block length, min P is the minimum transmission opportunity, P is the number of nodes, M is the number of time slot groups to be selected, N is the maximum time slot block length, min P is the minimum transmission opportunity, min P is the number of nodes, M is the number of time slot groups to be selected, and N is the maximum time slot block length. i ,i=1,2,...,M is the number of micro-time slots required for the traffic per second counted by the i-th node per unit time, and the L micro-time slots are evenly allocated to the time slot blocks using the binary tree intra-block equal division method.

[0063] The binary tree block equal division method is as follows Figure 2 As shown:

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

[0065] When the time slot demand of a certain node cannot be met by a time slot block, a "time slot pool" can be allocated, that is, a group of time slot blocks. The time slot block is determined by the starting point and the time slot block size. The time slot blocks in the time slot pool can be large or small, and the appearance time can be arbitrarily distributed. Therefore, the time slot blocks may be uneven. For example, a node needs 32 micro time slots, and 32 can be decomposed into 16+8+4+2. Then block A (0b0000010000, 16), block B (0b0000 001000,8), D block (0b0000000100,4) and E block (0b0000000000,2) are allocated to the node for use. Of course, there are many other possible time slot block configurations. How to screen the many possible time slot block configurations to obtain the time slot group with the most uniform distribution and meeting the traffic demand? This patent uses the corrosion expansion fitness algorithm to calculate the adaptability of the time slot group, and takes the maximum adaptability as the final determined time slot group. The method is as follows:

[0066] Definition of the interval between time slot blocks: Node time slot block starting point S i,j ,i=1,2,...,M,j=1,2,...,L i , time slot block size L i,j,i=1,2,...,M,j=1,2,...,L i , where M is the estimated number of time slot groups, K i is the number of time slot blocks in a certain estimated time slot group, then the interval BI between the i-th time slot blocks in the j-th group is i,j is defined as follows:

[0067]

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

[0069]

[0070] The variance of the interval between time slot blocks is σ 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 that maximizes the fitness from the time slot block fitness, and the fitness objective function is:

[0075]

[0076] From the M groups of estimated time slots, the Fitness is calculated by the above formula i ,i=1,2,...,M, select the time slot group with the largest fitness (i.e., the serial number is Index) as the final selected time slot group.

[0077] In this embodiment, if Figure 1 As shown in the figure, it introduces several aspects including node network construction, time slot adjustment, node network entry and node network exit;

[0078] When the node is networked, after the node is powered on, the two nodes are in the initial network construction moment. The node with the smaller node number is used as the central node. When the central node is used for time slot allocation, the binary tree block equal division method is used to allocate the central node time slot based on the minimum transmission opportunity and the minimum time slot block. If min P is 20, 20 subtrees are selected from the 32 subtrees in the 6th layer of the binary tree, and the left leaf nodes of the 20 subtrees are used as the time slot group. The estimated number of time slot groups is 10, so the obtained time slot group (S i,j ,L i,j), i = 1, 2, ..., M, j = 1, 2, ..., 20 is the time slot group family to be selected as the central node. The corrosion expansion fitness algorithm is used to calculate the selected family, and the selected time slot group is obtained as the determined time slot group of the central node.

[0079] The time slot group of another node is calculated by the central node, and M groups of time slot groups are randomly obtained from the min P+1 idle time slot pool defined by the central node. The corrosion and expansion fitness algorithm is used to calculate the selected family, and the selected time slot group is obtained as the determined time slot group of the central node.

[0080] Finally, the allocation of time slot groups for the two nodes to build the network has been completed, and the node network is completed.

[0081] Time slot adjustment

[0082] There are two possible ways to fine-tune the node time slot group based on the node traffic demand:

[0083] (1) Increased time slots

[0084] The following rules are used to increase the node allocation time slot:

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

[0086] ② The expansion of the time slot block adopts the method of expanding the tail of the time slot block first. If the tail of the time slot block collides with other time slot blocks during expansion, the head of the time slot block will be expanded. If the head of the time slot block also collides with other time slot blocks, other time slot blocks will be selected for expansion;

[0087] ③ If the length of all existing time slot blocks is Q and the micro-time slot demand is not met, the red-billed blue magpie algorithm is used to add new time slot blocks.

[0088] According to the above rules, there are many combinations of time slot groups that can be generated using random rules. Assuming that 10 time slot groups are generated, the corrosion expansion fitness algorithm is used to calculate the selected family, and the selected time slot group is obtained as the determined time slot group of the central node.

[0089] (2) Time slot reduction

[0090] The following rules are used to increase the node allocation time slot:

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

[0092] ② The time slot block is corroded by corroding 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 corrosion;

[0093] ③ If the length of all existing time slot blocks is 2 and exceeds the required number of micro time slots, delete one of the time slot blocks.

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

[0095] Node access

[0096] The new node floods the traffic demand. The central node calculates the required time slots according to the traffic demand, and estimates the number of time slot groups. The red-billed blue magpie algorithm is used to calculate 10 groups of time slots to be determined. The obtained time slot group (S i,j ,L i,j ), i = 1, 2, ..., M, j = 1, 2, ..., 20 is the time slot group family to be selected by the new network node. The corrosion expansion fitness algorithm is used to calculate the selected family, and the selected time slot group is obtained as the determined time slot group of the new network node.

[0097] Node de-networking

[0098] If the node is not the central node, the node will flood the network exit message, and the central node will perform time slot block idle processing on the time slot block used by the node according to the time slot configuration table.

[0099] If the central node is disconnected from the network, the central node floods the network disconnection message, converts the central node to the node with the smallest node number among the remaining nodes, and floods the message to other nodes. The new central node performs time slot block idle processing on the time slot block used by the disconnected node according to the time slot configuration table.

[0100] It can be seen from the above technical solution that the dynamic time slot allocation algorithm provided by the above embodiment of the present invention can allocate a mutually independent time slot block sequence to each node according to the node quantity requirement in the actual application according to the above time slot allocation method. At the same time, the position and length of the 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 only exemplary embodiments of the present invention and are not intended to limit the present invention. The protection scope of the present invention is defined by the claims. Those skilled in the art may make various modifications or equivalent substitutions to the present invention within the essence and protection scope of the present invention, and such modifications or equivalent substitutions shall also be deemed to fall within the protection scope of the present invention.

Claims

1. A dynamic time slot allocation algorithm, characterized in that: include: When the nodes are powered on, the two nodes are in the initial networking stage. The node with the smaller node number is used as the central node. When allocating time slots as the central node, the binary tree block equal division method is used to allocate time slots to the central node based on the minimum transmission opportunity and the minimum time slot block as the allocation principle. Perform time slot adjustment, specifically fine-tuning the node time slot group according to the node traffic demand; When a node joins the network, the central node calculates the required time slots based on the traffic demand, estimates the number of time slot groups, uses the red-billed blue magpie algorithm to calculate, and obtains the time slot group family to be selected by the new node. The node is de-networked. If the node is not a central node, the de-networked node floods the de-networked message. The central node idles the time slot block used by the de-networked node according to the time slot configuration table. If the central node is disconnected from the network, the central node floods the network disconnection message, converts the central node to the node with the smallest node number among the remaining nodes, and floods the message to other nodes. The new central node performs time slot block idle processing on the time slot block used by the disconnected node according to the time slot configuration table.

2. The dynamic time slot allocation algorithm according to claim 1, characterized in that: When the nodes are networking, the algorithm also includes: After the node network is established and the node with a smaller node number is used as the central node, the time slot group of another node is calculated by the central node, and M groups of time slot groups are randomly obtained from the min P+1 idle time slot pool defined by the central node. The corrosion expansion fitness algorithm is used to calculate the selected family, and the selected time slot group is obtained as the determined time slot group of the central node.

3. The dynamic time slot allocation algorithm according to claim 2, characterized in that: When adjusting the time slot, if the time slot increases, the following rules are used to increase the node allocation time slot: If the time slot block length does not reach the maximum time slot block length, the time slot block is expanded; The expansion of the time slot block adopts the method of expanding the tail of the time slot block first. If the tail of the time slot block collides with other time slot blocks during expansion, the head of the time slot block will be expanded. If the head of the time slot block also collides with other time slot blocks, other time slot blocks will be selected for expansion. If the length of all existing time slot blocks is the maximum time slot block length and the micro-time slot demand is not met, the red-billed blue magpie algorithm is used to add new time slot blocks. According to the above rules, a variety of combinations of time slot groups are generated using random rules, and the corrosion expansion fitness algorithm is used to calculate the selected family to obtain the selected time slot group as the determined time slot group of the central node.

4. The dynamic time slot allocation algorithm according to claim 3, characterized in that: When adjusting the time slot, if the time slot is reduced, the following rules are used to increase the node allocation time slot: If the time slot block length is not reduced to 2, the time slot block is eroded; The time slot block erosion is performed by corroding 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 erosion; If the length of all existing time slot blocks is 2 and exceeds the required number of mini-time slots, one of the time slot blocks is deleted. According to the above rules, multiple combinations of time slot groups are generated, and the corrosion expansion fitness algorithm is used to calculate the selected family to obtain the determined time slot group as the central node.

5. The dynamic time slot allocation algorithm according to claim 4, characterized in that: When a node is connected to the network, the method specifically includes: The new nodes flood the traffic demand, and 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 is used to calculate the 10 time slot groups to be determined, and the obtained time slot groups (S i,j ,L i,j ),i=1,2,...,M,j=1,2,...,20 is the time slot group to be selected by the new node; The corrosion expansion fitness algorithm is used to calculate the candidate group, and the selected time slot group is obtained as the determined time slot group of the new network node.

6. The dynamic time slot allocation algorithm according to claim 5, characterized in that: The algorithm specifically includes: Let L be the total number of mini-slots in the 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 slot groups to be selected, N be i ,i=1,2,...,M is the number of micro-time slots required for the traffic per second counted by the i-th node per unit time, and the L micro-time slots are evenly allocated to the time slot blocks using the binary tree intra-block equal division method; When building a node network, the binary tree block equal division method is used to allocate empty time slot blocks. When the time slot demand of a node cannot be met by a time slot block, a time slot pool is allocated, that is, a group of time slot blocks. The time slot block is determined by the starting point and the time slot block size. The corrosion and expansion fitness algorithm is used to calculate the adaptability of the time slot group, and the maximum adaptability is used as the final determined time slot group.

7. The dynamic time slot allocation algorithm according to claim 6, characterized in that: The algorithm specifically includes: using the corrosion expansion fitness algorithm to calculate the adaptability of the time slot group, and taking the maximum adaptability as the final determined time slot group, including: Definition of the interval between time slot blocks: Node time slot block starting point S i,j ,i=1,2,...,M,j=1,2,...,K i , 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, K i is the number of time slot blocks in a certain estimated time slot group, then the interval BI between the i-th time slot blocks in the j-th group is i,j is defined as follows: Average interval between time slot blocks A i The definition is as follows: The variance of the interval between time slot blocks is σ 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 that maximizes the fitness from the time slot block fitness, and the fitness objective function is: From the M groups of estimated time slots, the Fitness is calculated by the above formula i ,i=1,2,...,M, and select the time slot group with the largest fitness as the final selected time slot group.

Images