Time slot dynamic allocation method, device and storage medium based on TDMA networking mode

Abstract

The invention discloses a time slot dynamic allocation method, device and storage medium based on TDMA networking mode, including setting subnodes and central nodes in a TDMA networking system; setting shared time slots and communication time slots in a cycle; initializing the node identity identifier and time slot sequence stored in the central node to 0 after the central node is turned on; after all subnodes in the network are turned on and synchronized with the central node time, randomly selecting a shared time slot from multiple shared time slots to send network application information to the central node, and communicating by relying on the time slot sequence obtained by the central node; after all subnodes in the network are turned on or the number of time sequences of all nodes in the network changes, triggering a re-entry process, and communicating according to the newly allocated time slot sequence. The invention enables each node in the TDMA network to select different numbers of time slots according to different services during the working process, and any node does not affect the normal operation of other nodes during the process of re-applying for time slots.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a time slot dynamic allocation method, device and storage medium based on a TDMA networking mode. Background Art

[0002] TDMA (Time Division Multiple Access) is a multiple access technology used in communication networks. It divides time into several time slots so that multiple users on the same frequency channel can send and receive data in different time slots. Each user device communicates in a predetermined time slot sequence to achieve non-interference communication between multiple users.

[0003] In the existing TDMA networking system, each node communicates according to a predetermined time slot sequence. The number of time slots and the time slot sequence cannot be dynamically modified during operation. If the number of time slots of a certain node needs to be modified, the number of time slots of all nodes needs to be replanned.

[0004] In addition, in the existing TDMA networking system, each node is given a fixed number of time slots according to a certain strategy. Under the premise of not exceeding the total number of time slots, the number of time slots cannot be allocated arbitrarily, which affects data transmission.

[0005] In view of this, it is necessary to provide a new technical solution to solve the above problems. Summary of the invention

[0006] In order to solve the above technical problems, the present application provides a method, device and storage medium for dynamic time slot allocation based on TDMA networking, which can enable each node in the TDMA network to select a different number of time slots according to different services during the working process, and any node will not affect the normal operation of other nodes when reapplying for time slots.

[0007] A method for dynamically allocating time slots based on a TDMA networking mode, comprising:

[0008] In a TDMA networking system, a plurality of sub-nodes and a central node storing a node identity identifier and a time slot sequence corresponding to the node identity identifier are set;

[0009] One second is used as a cycle, and multiple shared time slots and several communication time slots are set in each cycle;

[0010] After the central node is powered on, the node identifier and time slot sequence stored inside it are initialized to 0;

[0011] After all sub-nodes in the network are powered on and synchronized with the central node, they randomly select a shared time slot from multiple shared time slots to send network access application information to the central node, and communicate based on the time slot sequence obtained by the central node;

[0012] When all sub-nodes in the network are powered on or the number of time slots of all nodes in the network changes, the re-entry process is triggered, and all sub-nodes in the network communicate according to the time slot sequence newly allocated by the central node.

[0013] Preferably, in the central node, the node identity identifier and the time slot sequence corresponding to the node identity identifier are stored in the form of a time slot sequence table.

[0014] Preferably, after the central node is powered on and the node identifier and the time slot sequence stored therein are initialized to 0, the central node further comprises:

[0015] In the time slot sequence table, a member with an identity identifier of 0 is selected in order as its own identity identifier, its own time slot sequence is calculated and filled into the time slot sequence table, and the calculated time slot sequence is corresponded or associated with the identity identifier.

[0016] Preferably, after the number of time slots of the central node in the network changes, a re-entry process is triggered, including:

[0017] The central node searches for its own identity identifier in the time slot sequence table stored therein, clears the time slot sequence corresponding to its identity identifier, recalculates its own time slot sequence and fills it into the time slot sequence table, and corresponds or associates the calculated time slot sequence with the identity identifier.

[0018] Preferably, after all sub-nodes in the network are powered on or the number of timings of all sub-nodes in the network changes, a re-entry process is triggered, including:

[0019] Each sub-node sends network access application information including identity identifier and time slot number via radio;

[0020] After receiving the network access application information from the child node, the central node searches for the identity identifier of the child node in the time slot sequence table;

[0021] Determine the identity identifier of the child node in the time slot sequence table, clear the time slot sequence corresponding to the identity identifier, recalculate the time slot sequence of the child node and fill it into the time slot sequence table;

[0022] The central node sends the corresponding time slot sequence to the corresponding child node via radio;

[0023] After receiving the time slot sequence newly allocated by the central node, each sub-node communicates according to the newly allocated time slot sequence.

[0024] Preferably, when determining the identity identifier of the child node in the time slot sequence table, if the identity identifier corresponding to the child node is found in the time slot sequence table, it is used as the identity identifier of the child node; if the identity identifier of the child node is not found in the time slot sequence table, a member with an identity identifier of 0 is selected in sequence in the time slot sequence table and filled as the identity identifier of the child node.

[0025] Preferably, when recalculating the time slot sequence of the central node or each sub-node, first check the time slot sequence table to obtain unoccupied time slot sequences, and calculate the time slot sequence of the central node or each sub-node in the unoccupied time slot sequences.

[0026] Preferably, the time slot sequence algorithm for calculating the time slot sequence of the central node or each sub-node in the unoccupied time slot sequence includes:

[0027] The interval between time slots is calculated based on the total number of time slots in the entire network and the number of time slots requested by the node;

[0028] Calculate the index of each time slot according to the time interval;

[0029] The calculated index of each time slot is arranged in order to its allocated time slot table to obtain a time slot sequence of the corresponding time slot.

[0030] According to another aspect of the present application, a computing device is also provided, including: a processor and a memory storing a computer program, wherein when the computer program is executed by the processor, the method for dynamically allocating time slots based on the TDMA networking mode is executed.

[0031] According to another aspect of the present application, a computer-readable storage medium is provided, on which computer instructions are stored. When the instructions are executed on a computer, the computer executes the method for dynamically allocating time slots based on the TDMA networking mode.

[0032] Compared with the prior art, this application has at least the following beneficial effects:

[0033] 1. Each node in the TDMA network of the present invention can select different numbers of time slots according to different services during the working process, and any node will not affect the normal operation of other nodes during the process of re-applying for time slots, which greatly improves the communication effect.

[0034] 2. Under the premise of not exceeding the total number of time slots, each node can apply for any number of time slots as needed, and the present invention has good adaptability. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Hereinafter, some specific embodiments of the present invention will be described in detail in an exemplary and non-limiting manner with reference to the accompanying drawings. The same reference numerals in the accompanying drawings indicate the same or similar components or parts. It should be understood by those skilled in the art that these drawings are not necessarily drawn to scale. In the accompanying drawings:

[0036] Figure 1 It is a schematic diagram of the overall process of the present invention;

[0037] Figure 2 A schematic diagram of time slot allocation in each cycle of the present invention. DETAILED DESCRIPTION

[0038] In order to make the purpose, technical solution and advantages of the present application clearer, the technical solution of the present application will be clearly and completely described below in combination with the specific embodiments of the present application and the corresponding drawings. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present application.

[0039] like Figure 1 As shown, a method for dynamically allocating time slots based on a TDMA networking mode includes:

[0040] Step S1: In a TDMA networking system, a plurality of sub-nodes and a central node storing a node identity identifier and a time slot sequence corresponding to the node identity identifier are set.

[0041] Specifically, the central node is responsible for allocating time slots in the entire network. In the central node, the node identity identifier and the time slot sequence corresponding to the node identity identifier are stored in the form of a time slot sequence table.

[0042] In this embodiment, the central node stores the time slot sequences of all nodes in the network including the central node and the sub-nodes in a time slot sequence table named slot_table. The storage format is as follows:

[0043] slot_table {

[0044] ID1,slot1[m];

[0045] ID2, slot2[m];

[0046] ID3, slot3[m];

[0047] …

[0048] ID N ,slot N [m];

[0049] }

[0050] Where ID N , represents the unique identity of the Nth node in the network; slot N [m] represents the time slot sequence of the Nth node in the network; m represents the length of each time slot sequence.

[0051] Step S2: Taking 1 second as a cycle, multiple shared time slots and several communication time slots are set in each cycle.

[0052] Specifically, this scheme takes 1 second as a cycle, divides 1 second into N time slices, and each time slice is 1 time slot. Figure 2 As shown in the figure, S(0), S(1), S(2), and S(3) are shared time slots by all nodes in the network and are used for network access application. Except for the central node, each node randomly selects a time slot from the shared time slots to send network access application information after it is powered on and synchronized with the central node.

[0053] Step S3: After the central node is powered on, the node identifier and time slot sequence stored inside the central node are initialized to 0.

[0054] Furthermore, after the central node is powered on, the node identifier and the time slot sequence stored therein are initialized to 0, and the following steps are further included:

[0055] In the time slot sequence table, a member with an identity identifier of 0 is selected in order as its own identity identifier, its own time slot sequence is calculated and filled into the time slot sequence table, and the calculated time slot sequence is corresponded or associated with the identity identifier.

[0056] Step S4: After all sub-nodes in the network are powered on and synchronized with the central node, a shared time slot is randomly selected from multiple shared time slots to send network access application information to the central node, and communication is performed based on the time slot sequence obtained by the central node.

[0057] Step S5: After all sub-nodes in the network are powered on or the number of time slots of all nodes in the network changes, the re-entry process is triggered, and all sub-nodes in the network communicate according to the time slot sequence newly allocated by the central node.

[0058] Specifically, when the number of time slots of the central node in the network changes, the re-entry process is triggered, including:

[0059] The central node searches for its own identity identifier in the time slot sequence table stored therein, clears the time slot sequence corresponding to its identity identifier, recalculates its own time slot sequence and fills it into the time slot sequence table, and corresponds or associates the calculated time slot sequence with the identity identifier.

[0060] After all sub-nodes in the network are powered on or the number of timings of all sub-nodes in the network changes, the re-entry process is triggered, including:

[0061] Each sub-node sends network access application information including identity identifier and time slot number via radio;

[0062] After receiving the network access application information from the child node, the central node searches for the identity identifier of the child node in the time slot sequence table;

[0063] Determine the identity identifier of the child node in the time slot sequence table, clear the time slot sequence corresponding to the identity identifier, recalculate the time slot sequence of the child node and fill it into the time slot sequence table;

[0064] The central node sends the corresponding time slot sequence to the corresponding child node via radio;

[0065] After receiving the time slot sequence newly allocated by the central node, each sub-node communicates according to the newly allocated time slot sequence.

[0066] In determining the identity identifier of the child node in the time slot sequence table, if the identity identifier corresponding to the child node is found in the time slot sequence table, use it as the identity identifier of the child node; if the identity identifier of the child node is not found in the time slot sequence table, select a member with an identity identifier of 0 in the time slot sequence table in sequence and fill it as the identity identifier of the child node.

[0067] When recalculating the time slot sequence of the central node or each sub-node, first check the time slot sequence table to obtain the unoccupied time slot sequence, and calculate the time slot sequence of the central node or each sub-node in the unoccupied time slot sequence.

[0068] Specifically, the time slot sequence algorithm for calculating the time slot sequence of the central node or each sub-node in the unoccupied time slot sequence includes:

[0069] The interval between time slots is calculated based on the total number of time slots in the entire network and the number of time slots requested by the node;

[0070] Calculate the index of each time slot according to the time interval;

[0071] The calculated index of each time slot is arranged in order to its allocated time slot table to obtain a time slot sequence of the corresponding time slot.

[0072] Assume that the number of time slots requested by the node is slot_num (slot_num≥1); the total number of time slots in the entire network is N_TOTAL (slot_num≥1), then the interval between time slots is;

[0073] ;

[0074] In the formula, d represents the interval between time slots;

[0075] The expression for the index of each time slot is:

[0076] ;

[0077] in, represents the index of each time slot; round function represents the function that rounds the decimal to an integer; k represents the kth element in each time slot sequence, k=0,1,2,3,…, slot_num–1.

[0078] The time slot sequence assigned to the Nth node in the network is:

[0079] slot N [m] = { j 0, j 1, j 2, j 3, …… slot_num – 1};

[0080] The value range of m is the total number of time slots in the entire network. N [m] represents the time slot sequence allocated to the Nth node in the network. When the number of elements in the sequence is less than m, it is filled with 0.

[0081] If the index of each time slot has appeared in other time slot sequences in the time slot sequence table, it is increased by 1 until the index of each time slot does not conflict with other time slot sequences in the time slot sequence table.

[0082] The index of each time slot is calculated as:

[0083] ;

[0084] In the formula, is the index of the previous time slot that conflicts with other time slot sequences in the time slot sequence table.

[0085] It should be noted that the terms used herein are only for describing specific embodiments and are not intended to limit the exemplary embodiments according to the present application. As used herein, unless the context clearly indicates otherwise, the singular form is also intended to include the plural form. In addition, it should be understood that when the terms "comprise" and / or "include" are used in this specification, it indicates the presence of features, steps, operations, devices, components and / or combinations thereof.

[0086] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the numbers used in this way can be interchanged where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein.

[0087] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for dynamically allocating time slots based on TDMA networking, characterized in that: include: In a TDMA networking system, a plurality of sub-nodes and a central node storing a node identity identifier and a time slot sequence corresponding to the node identity identifier are set; One second is used as a cycle, and multiple shared time slots and several communication time slots are set in each cycle; After the central node is powered on, the node identifier and time slot sequence stored inside it are initialized to 0; After all sub-nodes in the network are powered on and synchronized with the central node, they randomly select a shared time slot from multiple shared time slots to send network access application information to the central node, and communicate based on the time slot sequence obtained by the central node; When all sub-nodes in the network are powered on or the number of time slots of all nodes in the network changes, the re-entry process is triggered, and all sub-nodes in the network communicate according to the time slot sequence newly allocated by the central node; When the number of time slots of the central node in the network changes, the re-entry process is triggered, including: The central node searches for its own identity identifier in the time slot sequence table stored therein, clears the time slot sequence corresponding to its identity identifier, recalculates its own time slot sequence and fills it into the time slot sequence table, and corresponds or associates the calculated time slot sequence with the identity identifier; After all sub-nodes in the network are powered on or the number of timings of all sub-nodes in the network changes, the re-entry process is triggered, including: Each sub-node sends network access application information including identity identifier and time slot number via radio; After receiving the network access application information from the child node, the central node searches for the identity identifier of the child node in the time slot sequence table; Determine the identity identifier of the child node in the time slot sequence table, clear the time slot sequence corresponding to the identity identifier, recalculate the time slot sequence of the child node and fill it into the time slot sequence table; The central node sends the corresponding time slot sequence to the corresponding child node via radio; After receiving the time slot sequence newly allocated by the central node, each sub-node communicates according to the newly allocated time slot sequence.

2. The method for dynamic time slot allocation according to claim 1, characterized in that: In the central node, the node identifier and the time slot sequence corresponding to the node identifier are stored in the form of a time slot sequence table.

3. The method for dynamic time slot allocation as claimed in claim 2, characterized in that: After the central node is powered on, the node identifier and the time slot sequence stored in the central node are initialized to 0, and the process further includes: In the time slot sequence table, a member with an identity identifier of 0 is selected in order as its own identity identifier, its own time slot sequence is calculated and filled into the time slot sequence table, and the calculated time slot sequence is corresponded or associated with the identity identifier.

4. The method for dynamic time slot allocation as claimed in claim 3, characterized in that: In determining the identity identifier of the child node in the time slot sequence table, if the identity identifier corresponding to the child node is found in the time slot sequence table, use it as the identity identifier of the child node; if the identity identifier of the child node is not found in the time slot sequence table, select a member with an identity identifier of 0 in the time slot sequence table in sequence and fill it as the identity identifier of the child node.

5. The method for dynamic time slot allocation according to claim 3 or 4, characterized in that: When recalculating the time slot sequence of the central node or each sub-node, first check the time slot sequence table to obtain the unoccupied time slot sequence, and calculate the time slot sequence of the central node or each sub-node in the unoccupied time slot sequence.

6. The method for dynamic time slot allocation as claimed in claim 5, characterized in that: The time slot sequence algorithm for calculating the time slot sequence of the central node or each sub-node in the unoccupied time slot sequence includes: The interval between time slots is calculated based on the total number of time slots in the entire network and the number of time slots requested by the node; Calculate the index of each time slot according to the time interval; The calculated index of each time slot is arranged in order to its allocated time slot table to obtain a time slot sequence of the corresponding time slot.

7. A computing device, characterized in that include: A processor and a memory storing a computer program, wherein when the computer program is executed by the processor, the method for dynamically allocating time slots based on the TDMA networking mode as described in any one of claims 1 to 6 is executed.

8. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and when the instructions are executed on a computer, the computer executes the method for dynamically allocating time slots based on a TDMA networking mode as claimed in any one of claims 1 to 6.

Images