A time slot allocation method, device and storage medium of a dynamic TDMA protocol

Abstract

The application relates to a time slot allocation method, equipment and storage medium of a dynamic TDMA protocol. The method comprises the following steps: allocating time slots according to the priority of a node packet in a network allocation frame in a broadcast time slot; when a node applies to send high-priority data, a time slot request frame is re-sent in an arbitration time slot; after a plurality of nodes send time slot request frames in the arbitration time slot, a main node calculates a corresponding arbitration value of each node according to the weight corresponding to each to-be-sent data priority category and the weight of the to-be-sent frame number; and a new time slot allocation table is inserted into a next stage according to the arbitration value from large to small to continue to send data. The method can respond to an emergency event of high priority in time when temporary high-priority data is inserted.

Description

Technical Field

[0001] This application relates to the field of wireless ad hoc network technology, and in particular to a time slot allocation method, device and storage medium for a dynamic TDMA protocol. Background Technology

[0002] Wireless ad hoc networks (WANs) are distributed, multi-hop, peer-to-peer communication networks composed of several nodes equipped with wireless transceivers. Nodes can join or leave the network independently without sending any information, and this does not paralyze the entire network. With the rapid development of wireless communication technology, commonly used networks include Ad hoc and MESH mobile communication networks. In WANs, temporary networks need to be established anytime and anywhere, and there is no central node. To ensure the orderly operation of the wireless network, channel access technology is an unavoidable key technology. Commonly used channel access technologies include FDMA, CDMA, and TDMA. The difference between wired LAN and wireless LAN protocols lies in the packet header control of the MAC and PHY layers; the upper-layer services they need to carry are completely identical. The TDMA-based Low-MAC protocol described in this solution mainly aims to solve the problem of current physical layer air interface transmit / receive conflicts. Channel access technology belongs to the Low-MAC domain.

[0003] However, TDMA access divides time into non-overlapping time frames, and time frames into tiny time slots. The time slot allocation problem refers to allocating time slots to each node or link in the network within each time slot. Based on how nodes in the network acquire channel resources, TDMA is a contention-free type. Contention-free Time Division Multiple Access (TDMA) schemes ensure timely and reliable transmission of various data by nodes in the network. Traditional TDMA mechanisms divide channel time into fixed-length time frames, and each time frame is further divided into several slots. Each node reserves, confirms, or resolves the slot allocated by the central node according to the MAC protocol details. Message transmission occurs when the acquired slot arrives. The two main conflicts considered in the design of the TDMA-MAC protocol are access conflicts and integration conflicts. The existing patent application number 202311409485.5 describes a priority system in a node network. Each node has a pre-designated control node that manages the resource allocation for each node in the network. The protocol divides data packets into different priority levels and provides different priority processing when accessing the channel. Higher priority packets have shorter waiting times, meaning low-priority requests need to wait at least two time slots, medium-priority requests need to wait at least one time slot, and high-priority requests do not need to wait. However, wireless communication has a state of constant abnormality, meaning that each node may send a large amount of high-priority data at any time. High-priority nodes can obtain service time slots first, but when high-priority data arrives, no time slots are available. Summary of the Invention

[0004] Therefore, it is necessary to provide a time slot allocation method, device, and storage medium for a dynamic TDMA protocol that can respond promptly to high-priority emergency events during temporary high-priority data insertion, in order to address the above-mentioned technical problems.

[0005] A time slot allocation method for a dynamic TDMA protocol, the method comprising:

[0006] The TDMA frame structure is divided into a three-level frame format: time slot, time frame, and superframe. Each time frame consists of three non-uniform length time slots, and every four time frames form a superframe.

[0007] The first time slot of the time frame is divided into three stages. The first stage is when the master node sends a network announcement frame. The second stage occupies multiple micro-time slots and includes the time for other nodes to send time slot request frames. The third stage occupies one micro-time slot and is when the master node sends a network allocation frame. After that, each node occupies other time slots according to the network allocation frame sent by the master node.

[0008] After the first time frame ends, all subsequent time frames consist of service time slots and do not include broadcast time slots. Arbitration time slots are added to the service time slots at intervals to redistribute subsequent time slots until the time frame ends. Then, the time slots are re-entered into broadcast time slots, and the cycle repeats.

[0009] In the broadcast time slot, the network allocation frame allocates time slots according to the priority of the packets sent by the nodes. When a node requests to send high-priority data, it retransmits a time slot request frame in the arbitration time slot. After multiple nodes send time slot request frames in the arbitration time slot, the master node calculates the corresponding arbitration value for each node according to the weight of each data priority category to be sent and the weight of the number of frames to be sent. Based on the arbitration values ​​from largest to smallest, the new time slot allocation table is inserted into the next stage to continue sending data.

[0010] In one embodiment, the number of time slots N of the time frame slot Defined as dynamic and not fixed, allocated according to the requesting node, its duration is defined as T. frame There are a maximum of 3 stages in a time frame. An arbitration time slot is inserted between each stage, which can interrupt the current time slot allocation table and be used to send new high-priority data frames.

[0011] In one embodiment, the time slot includes a switching time, a synchronization header, a signaling segment, a data segment, and a protection interval.

[0012] In one embodiment, the network announcement frame includes fixed fields, a MAC header field, and a data field; the MAC header field includes the frame type and local node ID information; the data field includes the local time and a time slot request table; the local node ID information indicates the sequence number of the local node; the local time indicates the time when the local node sends an enable signal to the physical layer; and the time slot request table indicates which nodes can send time slot request frames in later stages.

[0013] In one embodiment, the time slot request frame includes fixed fields, a MAC header field, and a data field; the MAC header field includes frame type, local node ID information, destination node ID information, and local time; the data field includes a frame priority information table and a single-hop node table.

[0014] In one embodiment, the network allocation frame includes a fixed field, a MAC header field, and a data field; the MAC header field includes the frame type, local node ID information, and local time; the data field includes a time slot allocation table.

[0015] In one embodiment, the data frame includes fixed fields, a MAC header field, and a data field; the MAC header field includes frame type, local node ID information, and status flag information; the data field includes service data segments; and the status flag information indicates whether there are any nodes around the local node that need to send high-priority data.

[0016] In one embodiment, the master node calculates the arbitration value for each node according to the weight corresponding to each priority and the weight of the number of frames to be sent, including:

[0017] The master node calculates the arbitration value for each node based on the weight corresponding to each priority level and the weight of the number of frames to be sent.

[0018]

[0019] Where P0 is the number of priorities, i.e., the weight corresponding to each priority, with priority 0 being the highest priority and priority P0-1 being the lowest priority; Th i Th is the threshold for priority i. min The threshold with the lowest priority; r j This represents the proportion of the total traffic to priority j services, i.e., the weight of the number of frames to be sent.

[0020] A computer device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program performing the following steps:

[0021] The TDMA frame structure is divided into a three-level frame format: time slot, time frame, and superframe. Each time frame consists of three non-uniform length time slots, and every four time frames form a superframe.

[0022] The first time slot of the time frame is divided into three stages. The first stage is when the master node sends a network announcement frame. The second stage occupies multiple micro-time slots and includes the time for other nodes to send time slot request frames. The third stage occupies one micro-time slot and is when the master node sends a network allocation frame. After that, each node occupies other time slots according to the network allocation frame sent by the master node.

[0023] After the first time frame ends, all subsequent time frames consist of service time slots and do not include broadcast time slots. Arbitration time slots are added to the service time slots at intervals to redistribute subsequent time slots until the time frame ends. Then, the time slots are re-entered into broadcast time slots, and the cycle repeats.

[0024] In the broadcast time slot, the network allocation frame allocates time slots according to the priority of the packets sent by the nodes. When a node requests to send high-priority data, it retransmits a time slot request frame in the arbitration time slot. After multiple nodes send time slot request frames in the arbitration time slot, the master node calculates the corresponding arbitration value for each node according to the weight of each data priority category to be sent and the weight of the number of frames to be sent. Based on the arbitration values ​​from largest to smallest, the new time slot allocation table is inserted into the next stage to continue sending data.

[0025] A computer-readable storage medium having a computer program stored thereon, the computer program performing the following steps when executed by a processor:

[0026] The TDMA frame structure is divided into a three-level frame format: time slot, time frame, and superframe. Each time frame consists of three non-uniform length time slots, and every four time frames form a superframe.

[0027] The first time slot of the time frame is divided into three stages. The first stage is when the master node sends a network announcement frame. The second stage occupies multiple micro-time slots and includes the time for other nodes to send time slot request frames. The third stage occupies one micro-time slot and is when the master node sends a network allocation frame. After that, each node occupies other time slots according to the network allocation frame sent by the master node.

[0028] After the first time frame ends, all subsequent time frames consist of service time slots and do not include broadcast time slots. Arbitration time slots are added to the service time slots at intervals to redistribute subsequent time slots until the time frame ends. Then, the time slots are re-entered into broadcast time slots, and the cycle repeats.

[0029] In the broadcast time slot, the network allocation frame allocates time slots according to the priority of the packets sent by the nodes. When a node requests to send high-priority data, it retransmits a time slot request frame in the arbitration time slot. After multiple nodes send time slot request frames in the arbitration time slot, the master node calculates the corresponding arbitration value for each node according to the weight of each data priority category to be sent and the weight of the number of frames to be sent. Based on the arbitration values ​​from largest to smallest, the new time slot allocation table is inserted into the next stage to continue sending data.

[0030] The aforementioned dynamic TDMA protocol's time slot allocation method, device, and storage medium, in this application, divides the TDMA structure into multiple layers, including time slots, time frames, and superframes. Each time frame consists of three non-equal-length time slots, and every four time frames form a superframe. The first time frame includes a network announcement frame, a time slot request frame, and a network allocation frame to ensure synchronization among nodes in the network and time slot allocation on demand. Subsequent time frames are mainly used for inter-node business data transmission, and arbitration time slots are periodically inserted for time slot reallocation. Time slot allocation is determined by the data priority and the weighted ratio of the queue of frames to be sent. When a node requests a time slot, it calculates a comprehensive arbitration value based on the priority and number of frames of its data to be sent. The master node determines the time slot allocation queue for each node based on the magnitude of these arbitration values. In this way, by weighted summing of priority and frame queue, the needs of nodes can be more accurately reflected, ensuring that high-priority data can be transmitted in a timely manner, while low-priority data is queued according to resource availability. This weighted allocation mechanism solves the response problem when temporary high-priority data is inserted. When urgent, high-priority data needs to be transmitted, nodes can resend a time slot request frame in the arbitration time slot. The master node then promptly reallocates time slots for this urgent data based on the current network load and priority weights. This dynamic allocation process ensures that high-priority data receives timely responses and handles urgent events. Simultaneously, time slot allocation is dynamically adjusted based on the volume of service data. Each node submits a time slot request frame to the master node based on its current transmission needs and priorities. The master node dynamically adjusts time slot allocation according to these requests, ensuring that each node receives appropriate communication resources based on its actual needs. This dynamic negotiation mechanism not only improves the communication efficiency of the MAC layer but also guarantees efficient utilization of network resources when the load changes. Through this dynamic negotiation and weighted allocation mechanism, the system can flexibly allocate time slots among different nodes, ensuring network fairness and efficiency. The efficiency of the MAC protocol is improved, especially when facing sudden bursts of high-priority data; the system can quickly adjust time slot allocation, handle urgent events promptly, and avoid delays. Attached Figure Description

[0031] Figure 1 This is a flowchart illustrating a time slot allocation method for a dynamic TDMA protocol in one embodiment.

[0032] Figure 2 This is a schematic diagram of a three-level frame structure for TDMA in one embodiment;

[0033] Figure 3 This is a schematic diagram of the MAC TDMA time frame structure in one embodiment;

[0034] Figure 4 This is a schematic diagram illustrating the composition of a time slot in another embodiment;

[0035] Figure 5 This is a schematic diagram illustrating the protocol establishment scheme in one embodiment;

[0036] Figure 6 This is a schematic diagram illustrating the time slot allocation scheme in one embodiment;

[0037] Figure 7 This is a diagram of the broadcast frame structure in one embodiment;

[0038] Figure 8 Here is a diagram of the time slot request frame structure in one embodiment;

[0039] Figure 9 A network allocation frame structure diagram for one embodiment;

[0040] Figure 10 Here is a data frame structure diagram from one embodiment;

[0041] Figure 11 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation

[0042] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0043] In one embodiment, such as Figure 1 As shown, a time slot allocation method for a dynamic TDMA protocol is provided, including the following steps:

[0044] Step 102: Divide the TDMA frame structure into a three-level frame format: time slot, time frame, and superframe. Each time frame consists of three non-equal length time slots, and every four time frames form a superframe.

[0045] This application divides the TDMA frame structure into a three-level frame format: slot, time frame (TFrame), and superframe (Supframe). Each slot is further divided into several short-slots, such as... Figure 2 As shown. The entire timing system is designed so that each time frame consists of 3 non-uniform length time slots, and every 4 time frames form a superframe. Multiple time frames form a superframe, and the number of time frames N contained in a superframe is... tframe Defined as a fixed 64, its time is defined as T. supframe For ease of implementation, the time frame structure is as follows: Figure 3 As shown, the number of time slots N slot Defined as dynamic and not fixed, allocated according to the requesting node, its duration is defined as T. frameA time frame can have a maximum of three stages, with an arbitration time slot inserted between each stage. This allows the current time slot allocation table to be interrupted, enabling the transmission of new high-priority data frames. A time slot consists of one data frame; see [link to details]. Figure 4 .

[0046] Step 104: Divide the first time slot of the time frame into three stages. The first stage is when the master node sends a network announcement frame. The second stage occupies multiple micro-time slots and includes the time for other nodes to send time slot request frames. The third stage occupies one micro-time slot and is when the master node sends a network allocation frame. After that, each node occupies other time slots according to the network allocation frame sent by the master node.

[0047] like Figure 5 As shown, the first time slot of the time frame is divided into three stages. The first stage is when the master node sends a network announcement frame. The second stage occupies N micro-time slots and includes the time for other nodes (time slot request frames) to send network access request frames. The third stage occupies one micro-time slot and is mainly for the master node to send a network allocation frame. After that, each node occupies the other time slots according to the network allocation frame sent by the master node.

[0048] Step 106: After the first time frame ends, all subsequent time frames consist of service time slots and do not include broadcast time slots. Arbitration time slots are added to the service time slots at intervals to redistribute subsequent time slots until the time frame ends. Then, the time frame re-enters the broadcast time slots, and the cycle repeats.

[0049] After the first time frame ends, subsequent time frames consist entirely of service time slots, excluding broadcast time slots. After five time frames, the system re-enters the broadcast time slot, and this cycle repeats. Arbitration time slots (Arbi-Slots) are added periodically within service time slots to reallocate subsequent time slots until the end of the time frame. In each superframe, the first time frame always contains a broadcast time slot to coordinate the initial allocation of time slots. Subsequent time frames are primarily used for service communication. With the introduction of arbitration time slots, time slot allocation is dynamically adjusted and optimized, ensuring that node resource allocation in the network is constantly adjusted based on priority and data volume. This cycle repeats continuously within the superframe structure.

[0050] Steps 102 to 106 describe the initial time slot allocation scheme, which is the allocation principle during the first time slot allocation. The response to high-priority data insertion primarily involves the second time slot allocation. The first time slot allocation, in order to ensure normal communication among all nodes in the initial stage, guarantees that all nodes will know the timing of the second time slot allocation when high-priority data insertion occurs, ensuring that all nodes can send their high-priority data insertion requests at the corresponding time.

[0051] Step 108: In the broadcast time slot, the network allocation frame allocates time slots according to the priority of the packets sent by the nodes. When a node requests to send high-priority data, it retransmits a time slot request frame in the arbitration time slot. After multiple nodes send time slot request frames in the arbitration time slot, the master node calculates the corresponding arbitration value for each node according to the weight of each data priority category and the weight of the number of frames to be sent. Based on the arbitration values ​​from largest to smallest, the new time slot allocation table is inserted into the next stage to continue sending data.

[0052] The time slot allocation scheme has two different allocation methods in two phases. The first phase is to allocate time slots by allocating frames in the network within the broadcast time slots. The second phase is when a node has a high-priority urgent event, a high-priority data frame will be added during the arbitration phase (Arbi-slot).

[0053] In the first phase, time slot allocation is primarily based on priority, as follows: This scheme has 8 major priority categories and 255 minor categories, where a value of 255 indicates no data transmission. The priority of packets sent by all time slot nodes determines the time slot allocation scheme for this phase. Figure 6 If there are three nodes, A1, A8, and A5, where A1 needs to send two packets with priorities of 12 and 25 respectively; A8 needs to send two packets with priorities of 31 and 15 respectively; and A8 needs to send one packet with a priority of 121, then the time slot allocation is 12->15->25->31->121. When the priority exceeds 31, arbitration is performed to see if any data with a newly added priority is added. The data frame priority table is shown in Table 1.

[0054] Table 1

[0055]

[0056] In the second phase, time slot allocation is primarily determined by different weights based on priority and the number of frames to be sent. A time slot request frame is only retransmitted in the arbitration frame when a node receives a data frame with priority 0 / 1. After multiple nodes send time slot request frames in the arbitration phase, the master node assigns a weight p% to each priority category. Simultaneously, the number of frames to be sent also has a weight q%. Through calculation, each node's arbitration value is determined, and a new time slot allocation table is inserted into the next phase based on these values, from largest to smallest. If no node requests to send high-priority data during the arbitration phase, transmission continues according to the previous time slot allocation table. This application utilizes an overall time slot division method, with weighted proportions for data priority and frame queues. The weighted sum of frame queues and priorities yields a more accurate time slot allocation table, ensuring that each node can send data and enabling timely responses to high-priority data. This solves the problem of timely response to urgent high-priority events when temporary high-priority data is inserted, allowing for dynamic time slot allocation based on business data volume and dynamic negotiation between nodes, ensuring MAC protocol efficiency.

[0057] In the aforementioned dynamic TDMA protocol time slot allocation method, this application divides the TDMA structure into multiple layers, including time slots, time frames, and superframes. Each time frame consists of three time slots of unequal length, and every four time frames form a superframe. The first time frame includes a network announcement frame, a time slot request frame, and a network allocation frame to ensure that nodes in the network are synchronized and time slots are allocated on demand. Subsequent time frames are mainly used for inter-node service data transmission, and arbitration time slots are periodically inserted for time slot reallocation. Time slot allocation is determined by the data priority and the weighted ratio of the queue of frames to be sent. When a node requests a time slot, it calculates a comprehensive arbitration value based on the priority and number of frames of its data to be sent. The master node determines the time slot allocation queue for each node based on the magnitude of these arbitration values. In this way, by weighted summing of priority and frame queue, the needs of nodes can be more accurately reflected, ensuring that high-priority data can be transmitted in a timely manner, while low-priority data is queued according to resource availability. This weighted allocation mechanism solves the response problem when temporary high-priority data is inserted. When urgent, high-priority data needs to be transmitted, nodes can resend a time slot request frame in the arbitration time slot. The master node then promptly reallocates time slots for this urgent data based on the current network load and priority weights. This dynamic allocation process ensures that high-priority data receives timely responses and handles urgent events. Simultaneously, time slot allocation is dynamically adjusted based on the volume of service data. Each node submits a time slot request frame to the master node based on its current transmission needs and priorities. The master node dynamically adjusts time slot allocation according to these requests, ensuring that each node receives appropriate communication resources based on its actual needs. This dynamic negotiation mechanism not only improves the communication efficiency of the MAC layer but also guarantees efficient utilization of network resources when the load changes. Through this dynamic negotiation and weighted allocation mechanism, the system can flexibly allocate time slots among different nodes, ensuring network fairness and efficiency. The efficiency of the MAC protocol is improved, especially when facing sudden bursts of high-priority data; the system can quickly adjust time slot allocation, handle urgent events promptly, and avoid delays.

[0058] In one embodiment, the number of time slots N of the time frame slot Defined as dynamic and not fixed, allocated according to the requesting node, its duration is defined as T. frame There are a maximum of 3 stages in a time frame. An arbitration time slot is inserted between each stage, which can interrupt the current time slot allocation table and be used to send new high-priority data frames.

[0059] In one embodiment, the time slot includes a switching time, a synchronization header, a signaling segment, a data segment, and a protection interval.

[0060] In one embodiment, the network announcement frame includes fixed fields, a MAC header field, and a data field; the MAC header field includes the frame type and local node ID information; the data field includes the local time and a time slot request table; the local node ID information indicates the sequence number of the local node; the local time indicates the time when the local node sends an enable signal to the physical layer; and the time slot request table indicates which nodes can send time slot request frames in later stages.

[0061] In a specific embodiment, the structure of the network announcement frame is as follows: Figure 7 As shown, the fixed fields are fixed data fields. The local node ID is the sequence number of this node, and the local time is the time when this node sends the enable signal to the physical layer. The time slot request table shows which nodes can send time slot request frames in later stages.

[0062] Network announcement frames help devices (nodes) in a network discover each other's presence, especially in scenarios where devices dynamically join or leave the network. Through broadcasting, other devices in the network can quickly detect the addition of a new node or device. This allows devices in the network to synchronize network status or configuration information, ensuring that all nodes maintain a consistent network state. It is particularly useful for maintaining the network topology when changes occur, especially in ad-hoc networks (such as wireless ad-hoc networks). Announcement frames help devices periodically update their neighbor node information to dynamically adjust communication paths.

[0063] In one embodiment, the time slot request frame includes fixed fields, a MAC header field, and a data field; the MAC header field includes frame type, local node ID information, destination node ID information, and local time; the data field includes a frame priority information table and a single-hop node table.

[0064] In a specific embodiment, the structure of the time slot request frame is as follows: Figure 8 As shown, the forwarding node ID information is the ID information of the node that needs to be forwarded through this node; the destination node ID information is the ID number that this node needs to send to the destination node; the frame priority information table: Bytes 1-8 correspond to the priority of the next 1-8 data frames to be sent. If there are fewer than 8, 255 can be filled in this byte; the single-hop node table: Bytes 1-8 correspond to the 1-8 nodes respectively. Deciphering the corresponding node IDs in sequence indicates that the single-hop node table is in there.

[0065] In a time-slot-allocated network, each node can only transmit data if it obtains a time slot. A node sends a time slot request frame to the network scheduler (such as a base station, controller, or centralized management device), indicating its desire to obtain one or more time slots for data transmission. This is the first step in the time slot allocation process. The use of time slot request frames makes the time slot allocation process flexible. When network load or node transmission needs change, nodes can dynamically request or adjust time slot resources through time slot request frames. For example, a node may need more time slots due to increased data volume, or release time slot resources after data transmission is complete. The time slots of different nodes are coordinated and allocated based on request priority, network status, and other information to ensure conflict-free transmission. Then, when a node completes its data transmission task, it can release previously allocated time slots by sending another time slot request frame, or notify the scheduler that it no longer needs time slots. This helps the network scheduler reallocate time slots to other nodes with needs, thereby improving resource utilization.

[0066] In one embodiment, the network allocation frame includes a fixed field, a MAC header field, and a data field; the MAC header field includes the frame type, local node ID information, and local time; the data field includes a time slot allocation table.

[0067] In a specific embodiment, the structure of the network allocation frame is as follows: Figure 9 As shown, this includes a time slot allocation table: Bytes 1-N correspond to which node sends the 1-N time slots respectively. Each node is represented by one Byte, and time slots are allocated according to the time slot allocation table.

[0068] In one embodiment, the data frame includes fixed fields, a MAC header field, and a data field; the MAC header field includes frame type, local node ID information, and status flag information; the data field includes service data segments; and the status flag information indicates whether there are any nodes around the local node that need to send high-priority data.

[0069] In a specific embodiment, the structure of the data frame is as follows: Figure 10 As shown, this includes status flags indicating whether there are any surrounding nodes that need to send high-priority data. Bytes 1-16 indicate that a maximum of 16 nodes can request data.

[0070] In one embodiment, the master node calculates the arbitration value for each node according to the weight corresponding to each priority and the weight of the number of frames to be sent, including:

[0071] The master node calculates the arbitration value for each node based on the weight corresponding to each priority level and the weight of the number of frames to be sent.

[0072]

[0073] Where P0 is the number of priorities, i.e., the weight corresponding to each priority, with priority 0 being the highest priority and priority P0-1 being the lowest priority; Th i Th is the threshold for priority i. min The threshold for the lowest priority; r j This represents the proportion of the total traffic to priority j services, i.e., the weight of the number of frames to be sent.

[0074] In a specific embodiment, during communication, there is a certain relationship between the priority of higher-priority packets and the number of data frames. Higher priority packets have lower data volumes. Due to the lower data volume, a threshold is formed by the priority and the number of data frames. The size of this threshold determines the arbitration value for transmission. Therefore, it is reasonable to ensure that the threshold set for each priority data packet is positively correlated with its priority; that is, the higher the priority, the larger the threshold. Furthermore, the threshold setting is related to the proportion of the corresponding priority service; the lower the proportion, the larger the threshold. Additionally, to ensure the successful transmission probability of the highest-priority group, the maximum value of the priority data packet threshold can be set to...

[0075]

[0076] In the formula: P0 represents the number of priorities, where priority 0 is the highest priority and priority P0-1 is the lowest priority; Th i Th is the threshold for priority i. min The threshold with the lowest priority; r j This represents the proportion of total traffic for priority j services. By setting the maximum threshold for each priority data packet using the method described above, channel occupancy can be controlled within the corresponding priority data packet threshold range, ensuring the efficient and reliable transmission of high-priority packets. The methods for setting the thresholds for other priority data packets are as follows:

[0077]

[0078] It should be understood that, although Figure 1 The steps in the flowchart are shown sequentially as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order in which these steps are executed, and they can be performed in other orders. Figure 1 At least some of the steps in the process may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequential, but can be executed in turn or alternately with other steps or at least some of the sub-steps or stages of other steps.

[0079] In one embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as follows: Figure 11 As shown, the computer device includes a processor, memory, network interface, display screen, and input devices connected via a system bus. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The network interface is used for communication with external terminals via a network connection. When the computer program is executed by the processor, it implements a time slot allocation method based on a dynamic TDMA protocol. The display screen can be an LCD screen or an e-ink display screen. The input devices can be a touch layer covering the display screen, buttons, a trackball, or a touchpad mounted on the computer device casing, or an external keyboard, touchpad, or mouse.

[0080] Those skilled in the art will understand that Figure 11 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0081] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0082] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0083] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the invention patent. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this patent application should be determined by the appended claims.

Claims

1. A time slot allocation method for a dynamic TDMA protocol, characterized in that, The method includes: The TDMA frame structure is divided into a three-level frame format: time slot, time frame, and superframe. Each time frame consists of three non-uniform length time slots, and every four time frames form a superframe. The first time slot of the first time frame is divided into three stages. The first stage is when the master node sends a network announcement frame. The second stage occupies multiple micro-time slots and includes the time for other nodes to send time slot request frames. The third stage occupies one micro-time slot and is when the master node sends a network allocation frame. After that, each node occupies other time slots according to the network allocation frame sent by the master node. After the first time frame ends, all subsequent time frames consist of service time slots and do not include broadcast time slots. Arbitration time slots are added to the service time slots at intervals to redistribute subsequent time slots until the time frame ends. Then, the time slots are re-entered into broadcast time slots, and the cycle repeats. In the broadcast time slot, the network allocation frame allocates time slots according to the priority of the packets sent by the nodes. When a node requests to send high-priority data, it retransmits a time slot request frame in the arbitration time slot. After multiple nodes send time slot request frames in the arbitration time slot, the master node calculates the corresponding arbitration value for each node according to the weight of the priority of each data to be sent and the weight of the number of frames to be sent. Based on the arbitration values ​​from largest to smallest, the new time slot allocation table is inserted into the next stage to continue sending data. The master node calculates the arbitration value for each node based on the weight corresponding to each priority level and the weight of the number of frames to be sent, including: The master node calculates the arbitration value for each node based on the weight corresponding to each priority level and the weight of the number of frames to be sent. in, The number of priorities represents the weight of each priority, with priority 0 being the highest. Lowest priority; Priority The threshold, The threshold with the lowest priority; This represents the proportion of the total traffic to priority j services, i.e., the weight of the number of frames to be sent.

2. The method according to claim 1, characterized in that, The number of time slots in the time frame Defined as dynamic and not fixed, allocated according to the requesting node, its duration is defined as... There are a maximum of 3 stages in a time frame. An arbitration time slot is inserted between each stage, which can interrupt the current time slot allocation table and be used to send new high-priority data frames.

3. The method according to claim 1, characterized in that, The time slot includes switching time, synchronization header, signaling segment, data segment, and protection interval.

4. The method according to claim 1, characterized in that, The network announcement frame includes fixed fields, a MAC header field, and a data field; the MAC header field includes the frame type and the local node ID information; the data field includes the local time and a time slot request table; the local node ID information indicates the sequence number of the local node; the local time indicates the time when the local node sends the enable signal to the physical layer; the time slot request table indicates which nodes can send time slot request frames in later stages.

5. The method according to claim 1, characterized in that, The time slot request frame includes fixed fields, a MAC header field, and data fields; the MAC header field includes frame type, local node ID information, destination node ID information, and local time; the data field includes a frame priority information table and a single-hop node table.

6. The method according to claim 1, characterized in that, The network allocation frame includes fixed fields, a MAC header field, and a data field; the MAC header field includes frame type, local node ID information, and local time; the data field includes a time slot allocation table.

7. The method according to claim 2, characterized in that, The data frame includes fixed fields, a MAC header field, and a data field; the MAC header field includes frame type, local node ID information, and status flag information; the data field includes service data segments; the status flag information indicates whether there are any nodes around this node that need to send high-priority data.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 7.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 7.

Images