Time slot allocation method and device for dynamic TDMA protocol, and storage medium

Abstract

The invention relates to a time slot allocation method and device of a dynamic TDMA protocol and a storage medium. The method comprises the following steps: carrying out time slot allocation on a network allocation frame in a broadcast time slot according to the priority size of node packet sending, resending a time slot request frame in an arbitration time slot when a certain node applies for sending high-priority data, and after a plurality of nodes send the time slot request frame in the arbitration time slot, sending the time slot request frame in the arbitration time slot. And the main node calculates to obtain an arbitration value corresponding to each node according to the weight corresponding to the priority category of each data to be sent and the weight of the number of frames to be sent, and inserts the new time slot allocation table into the next stage according to the arbitration values from large to small to continue to send the data. By adopting the method, when temporary high-priority data is inserted, high-priority emergencies can be responded in time.

Description

Technical Field

[0001] The present application relates to the technical field of wireless ad hoc networks, and in particular to a time slot allocation method, device and storage medium for a dynamic TDMA protocol. Background Art

[0002] A wireless self-organizing network refers to a distributed, multi-hop, peer-to-peer communication network with no central control nodes, which is composed of several nodes with wireless transceivers. Nodes can join or leave the network without sending any information, and will not paralyze the entire network. With the rapid development of wireless communication technology, in wireless communication, commonly used networks include mobile communication networks such as Ad hoc and MESH. In wireless self-organizing networks, temporary networks need to be established anytime and anywhere, and there is no central node. In order to achieve the orderly operation of wireless networks, channel access technology is an inevitable key technology. Commonly used channel access technologies include FDMA, CDMA, TDMA, etc. The difference between wired LAN and wireless LAN protocols lies in the packet header control of the MAC and PHY layers, and the upper layer services they need to carry are completely consistent. The TDMA-based Low-MAC protocol described in this solution is mainly to solve the current problem of physical layer air interface transmission and reception conflicts. Channel access technology belongs to the field of Low-Mac.

[0003] However, the TDMA access method divides time into non-overlapping time frames, and the time frames are divided into small time slots. The time slot allocation problem refers to the allocation of time slots for each node or link in the network. According to the way nodes in the network obtain channel resources, TDMA is a non-competitive type. The non-competitive time division multiple access (TDMA) scheme can ensure that nodes in the network transmit various types of data in a timely and reliable manner. The traditional TDMA mechanism divides the channel time into time frames of fixed length, and each time frame is further divided into several slots. Each node reserves, confirms or parses the slot allocated by the central node according to the MAC protocol details, and transmits messages when the obtained slot arrives. The two main conflicts considered in the design of the TDMA-MAC protocol are access conflicts and integration conflicts. The existing patent with application number 202311409485.5 has a priority in the node network. The node will have a pre-specified control node, which will manage the resource allocation of each node in the network. The protocol divides data packets into different priority levels and provides different priority processing when accessing the channel; the waiting time for higher priority packets is shorter, that is, low priority requests need to wait for at least 2 time slots, medium priority requests need to wait for at least 1 time slot, and high priority requests do not need to wait, but there is an abnormal state in wireless communication at any time, that is, each node has the possibility of sending 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, there are no time slots available. Summary of the invention

[0004] Based on this, it is necessary to provide a time slot allocation method, device and storage medium of a dynamic TDMA protocol that can respond to high-priority emergency events in a timely manner when temporary high-priority data is inserted to address the above technical problems.

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

[0006] The TDMA frame structure is divided into three levels of frame formats: time slot, time frame and superframe, where each time frame consists of three unequal-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 for the master node to send a network announcement frame. The second stage occupies multiple micro-time slots, including the time for other nodes except this node to send time slot request frames. The third stage occupies one micro-time slot, and 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, the subsequent time frames are composed of service time slots, excluding broadcast time slots. Arbitration time slots are added after a period of time in the service time slots, and the subsequent time slots are reallocated until the time frame ends, and then the broadcast time slots are re-entered, and the cycle continues;

[0009] The network allocation frame in the broadcast time slot allocates time slots according to the priority of the node's packet transmission. When a node applies to send high-priority data, it resends the time slot request frame in the arbitration time slot. After multiple nodes have sent time slot request frames in the arbitration time slot, the master node calculates the corresponding arbitration value for each node according to the weight corresponding to each priority category of the data to be sent and the weight of the number of frames to be sent. According to the arbitration value, the new time slot allocation table is inserted into the next stage from large to small to continue sending data.

[0010] In one embodiment, the number of time slots N in a time frame slot It is defined as dynamic and not fixed, and is allocated according to the node applied for. Its duration is defined as T frame There are at most 3 stages in the time frame, and an arbitration time slot is inserted between each stage, which can interrupt the current time slot allocation table to send new high-priority data frames.

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

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

[0013] In one of the embodiments, the time slot request frame includes a fixed field, a MAC header field and a data field; the MAC header field includes a 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 of the embodiments, the network allocation frame includes a fixed field, a MAC header field and a data field; the MAC header field includes a frame type, local node ID information and local time; and the data field includes a time slot allocation table.

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

[0016] In one embodiment, the master node calculates the arbitration value corresponding to 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 corresponding arbitration value of each node according to the weight corresponding to each priority and the weight of the number of frames to be sent.

[0018]

[0019] Among them, P0 is the number of priorities, that is, the weight corresponding to the priority, priority 0 is the highest priority, and priority P0-1 is the lowest priority; Th i is the threshold of priority i, Th min is the lowest priority threshold; r j is the proportion of priority j services to the total services, that is, the weight of the number of frames to be sent.

[0020] A computer device comprises a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0021] The TDMA frame structure is divided into three levels of frame formats: time slot, time frame and superframe, where each time frame consists of three unequal-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 for the master node to send a network announcement frame. The second stage occupies multiple micro-time slots, including the time for other nodes except this node to send time slot request frames. The third stage occupies one micro-time slot, and 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, the subsequent time frames are composed of service time slots, excluding broadcast time slots. Arbitration time slots are added after a period of time in the service time slots, and the subsequent time slots are reallocated until the time frame ends, and then the broadcast time slots are re-entered, and the cycle continues;

[0024] The network allocation frame in the broadcast time slot allocates time slots according to the priority of the node's packet transmission. When a node applies to send high-priority data, it resends the time slot request frame in the arbitration time slot. After multiple nodes have sent time slot request frames in the arbitration time slot, the master node calculates the corresponding arbitration value for each node according to the weight corresponding to each priority category of the data to be sent and the weight of the number of frames to be sent. According to the arbitration value, the new time slot allocation table is inserted into the next stage from large to small to continue sending data.

[0025] A computer-readable storage medium stores a computer program, which, when executed by a processor, implements the following steps:

[0026] The TDMA frame structure is divided into three levels of frame formats: time slot, time frame and superframe, where each time frame consists of three unequal-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 for the master node to send a network announcement frame. The second stage occupies multiple micro-time slots, including the time for other nodes except this node to send time slot request frames. The third stage occupies one micro-time slot, and 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, the subsequent time frames are composed of service time slots, excluding broadcast time slots. Arbitration time slots are added after a period of time in the service time slots, and the subsequent time slots are reallocated until the time frame ends, and then the broadcast time slots are re-entered, and the cycle continues;

[0029] The network allocation frame in the broadcast time slot allocates time slots according to the priority of the node's packet transmission. When a node applies to send high-priority data, it resends the time slot request frame in the arbitration time slot. After multiple nodes have sent time slot request frames in the arbitration time slot, the master node calculates the corresponding arbitration value for each node according to the weight corresponding to each priority category of the data to be sent and the weight of the number of frames to be sent. According to the arbitration value, the new time slot allocation table is inserted into the next stage from large to small to continue sending data.

[0030] The above-mentioned time slot allocation method, device and storage medium of a dynamic TDMA protocol, the present application divides the TDMA structure into multiple levels, including time slots, time frames and superframes. Each time frame consists of 3 time slots of unequal length, and every 4 time frames constitute a superframe. The first time frame contains a network announcement frame, a time slot request frame and a network allocation frame to ensure that each node in the network is synchronized and time slots are allocated on demand. Subsequent time frames are mainly used for business data transmission between nodes, and arbitration time slots are regularly inserted to redistribute time slots. The allocation of time slots is determined by the priority of the data and the weighted ratio of the queue of frames to be sent. When a node requests a time slot, it will calculate a comprehensive arbitration value based on the priority and number of frames of the data to be sent, and the master node determines the time slot allocation arrangement table for each node based on the size of these arbitration values. In this way, through the weighted summation of the priority and frame number queues, the needs of the nodes can be more accurately reflected, ensuring that high-priority data can be transmitted in time, while low-priority data is queued according to resource conditions. This weighted allocation mechanism solves the response problem when temporary high-priority data is inserted. When there is urgent high-priority data to be sent, the node can resend the time slot request frame in the arbitration time slot, and the master node can reallocate the time slot for these urgent data in time according to the current network load and priority weight. Through this dynamic allocation process, the system can ensure that high-priority data can be responded to in time and handle emergency events. At the same time, the time slot allocation is based on the dynamic adjustment of the business data volume. Each node submits an application to the master node through a time slot request frame according to its current transmission needs and priorities. The master node dynamically adjusts the time slot allocation based on these applications, so that each node can obtain appropriate communication resources according to actual needs. This dynamic negotiation mechanism can not only improve the communication efficiency of the MAC layer, but also ensure the efficient use of network resources when the load changes. Through this dynamic negotiation and weighted allocation mechanism, the system can flexibly allocate time slots between different nodes to ensure the fairness and efficiency of the network. The efficiency of the MAC protocol is improved, especially when facing temporary bursts of high-priority data, the system can quickly adjust the time slot allocation, handle emergency events in time, and avoid delays. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Figure 1 A schematic flow chart of a time slot allocation method of a dynamic TDMA protocol in one embodiment;

[0032] Figure 2 A schematic diagram of a TDMA three-level frame structure in an embodiment;

[0033] Figure 3 A schematic diagram of a MAC TDMA frame structure in an embodiment;

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

[0035] Figure 5 A schematic diagram of a protocol establishment scheme in an embodiment;

[0036] Figure 6 A schematic diagram of a time slot allocation scheme in one embodiment;

[0037] Figure 7 A diagram showing a broadcast frame structure in one embodiment;

[0038] Figure 8 A diagram showing a structure of a time slot request frame in one embodiment;

[0039] Fig. 9 A diagram of a network allocation frame structure in one embodiment;

[0040] Fig.10 A data frame structure diagram in one embodiment;

[0041] Fig.11 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0042] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

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

[0044] Step 102, dividing the TDMA frame structure into three-level frame formats of time slot, time frame and super frame, wherein each time frame is composed of three unequal-length time slots, and every four time frames form a super frame.

[0045] The present application divides the TDMA frame structure into three levels of frame formats: slot, TFrame and Supframe, where the slot is further divided into short-slots with a number of nodes. Figure 2 As shown in the figure. The entire time system is designed so that each time frame consists of three time slots of unequal length, and every four time frames form a superframe. Multiple time frames form a superframe, and the number of time frames contained in a superframe is N. 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 It is defined as dynamic and not fixed, and is allocated according to the node applied for. Its duration is defined as T frameThere are at most 3 stages in the 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. A time slot consists of a frame of data. For details, see Figure 4 .

[0046] Step 104, divide the first time slot of the time frame into three stages. The first stage is for the master node to send a network announcement frame. The second stage occupies multiple micro time slots, which includes the time for other nodes except this node to send time slot request frames. The third stage occupies one micro time slot, and 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 in the figure, the first time slot of the time frame is divided into three stages. The first stage is for the master node to send a network announcement frame. The second stage occupies N micro time slots, including the time for other nodes (time slot request frames) to send network access request frames except this node. The third stage occupies one micro time slot, mainly for the master node to send a network allocation frame. After that, each node occupies other time slots according to the network allocation frame sent by the master node.

[0048] Step 106, after the first time frame ends, the subsequent time frames are composed of business time slots, excluding broadcast time slots. Arbitration time slots are added at intervals in the business time slots, and subsequent time slots are reallocated until the time frame ends, and then the broadcast time slot is re-entered, and the cycle continues.

[0049] After the first time frame ends, all subsequent time frames are composed of business time slots and do not include broadcast time slots. After 5 time frames, it re-enters the broadcast time slot, and then goes on and on. Arbitration time slots (Arbi-Slot) will be added to the business time slot at intervals 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 mainly used for business communications. With the introduction of arbitration time slots, time slot allocation is dynamically adjusted and optimized to ensure that node resource allocation in the network is adjusted at any time according to priority and data volume. The time slot allocation mechanism continues to operate in the superframe structure in a reciprocating manner.

[0050] The contents of step 102 to step 106 are the preliminary time slot allocation scheme, that is, the allocation principle when allocating time slots for the first time. The response to high-priority data insertion is mainly the second time slot allocation. The first time slot allocation is to ensure that all nodes can communicate normally in the initial stage when high-priority data is inserted for the second time, and all nodes can know the time point of the second time slot allocation, so as to ensure that all nodes can send their own high-priority data insertion requests at the corresponding time point.

[0051] Step 108, the network allocation frame in the broadcast time slot allocates time slots according to the priority of the node's packet transmission. When a node applies to send high-priority data, the time slot request frame is resent in the arbitration time slot. After multiple nodes have sent time slot request frames in the arbitration time slot, the master node calculates the corresponding arbitration value for each node according to the weight corresponding to each priority category of the data to be sent and the weight of the number of frames to be sent, and inserts the new time slot allocation table from large to small according to the arbitration value to continue sending data in the next stage.

[0052] The time slot allocation scheme has two different allocation methods in two stages. The first stage is to allocate time slots in the network allocation frame in the broadcast time slot. The second stage is when a node has a high-priority emergency event, it will add a high-priority data frame in the arbitration stage (Arbi-slot).

[0053] In the first stage, time slot allocation is mainly based on priority. The principle is as follows: In this scheme, there are 8 major categories and 255 minor categories for priority allocation. A value of 255 means no data is sent, and the priority of all time slot nodes determines the time slot allocation scheme of this stage. Figure 6 :If there are 3 nodes, namely A1 / A8 / A5, A1 wants to send two packets, and the priority values ​​are 12 and 25 respectively; A8 wants to send two packets, and the priority values ​​are 31 and 15 respectively; A8 wants to send one packet, and the priority is 121, then the time slot allocation is 12->15->25->31->121. When the priority exceeds 31, an arbitration is performed to see if there is any data with a new priority added. The data frame priority table is shown in Table 1:

[0054] Table 1

[0055]

[0056] In the second stage, time slot allocation is mainly allocated through priority and the number of frames to be sent through different weights. Only when a node has a data frame with priority 0 / 1, will the time slot request frame be resent in the arbitration frame. After multiple nodes send time slot request frames in the arbitration frame stage, the master node will correspond to a weight p% for each priority category. At the same time, the number of frames to be sent also has a weight of q%. The corresponding arbitration value of each node is obtained through corresponding calculations, and the new time slot allocation table is inserted into the next stage from large to small according to the value. If no node applies to send high-priority data in the arbitration stage, it will continue to be sent according to the previous time slot allocation table. This application uses the overall time slot division method, based on the data priority and the frame number queue has its own weighted ratio. The weighted sum of the frame number queue and the priority can more accurately derive the time slot allocation arrangement table, ensuring that each node can send data, so that high-priority data can respond in time, solving the problem of temporary high-priority data insertion, and being able to respond to high-priority emergencies in time. Time slots can be dynamically allocated, divided based on the amount of business data, and the nodes can dynamically negotiate to ensure the efficiency of the mac protocol.

[0057] In the above-mentioned time slot allocation method of a dynamic TDMA protocol, the present application divides the TDMA structure into multiple levels, including time slots, time frames and superframes. Each time frame consists of 3 time slots of unequal length, and every 4 time frames form a superframe. The first time frame contains a network announcement frame, a time slot request frame and a network allocation frame to ensure that each node in the network is synchronized and time slots are allocated on demand. Subsequent time frames are mainly used for business data transmission between nodes, and arbitration time slots are regularly inserted to redistribute time slots. The allocation of time slots is determined by the priority of the data and the weighted ratio of the queue of frames to be sent. When a node requests a time slot, it will calculate a comprehensive arbitration value based on the priority and number of frames of the data to be sent. The master node determines the time slot allocation arrangement table for each node based on the size of these arbitration values. In this way, the weighted summation of the priority and frame number queues can more accurately reflect the needs of the nodes, ensuring that high-priority data can be transmitted in time, while low-priority data is queued according to resource conditions. This weighted allocation mechanism solves the response problem when temporary high-priority data is inserted. When there is urgent high-priority data to be sent, the node can resend the time slot request frame in the arbitration time slot, and the master node can reallocate the time slot for these urgent data in time according to the current network load and priority weight. Through this dynamic allocation process, the system can ensure that high-priority data can be responded to in time and handle emergency events. At the same time, the time slot allocation is based on the dynamic adjustment of the business data volume. Each node submits an application to the master node through a time slot request frame according to its current transmission needs and priorities. The master node dynamically adjusts the time slot allocation based on these applications, so that each node can obtain appropriate communication resources according to actual needs. This dynamic negotiation mechanism can not only improve the communication efficiency of the MAC layer, but also ensure the efficient use of network resources when the load changes. Through this dynamic negotiation and weighted allocation mechanism, the system can flexibly allocate time slots between different nodes to ensure the fairness and efficiency of the network. The efficiency of the MAC protocol is improved, especially when facing temporary bursts of high-priority data, the system can quickly adjust the time slot allocation, handle emergency events in time, and avoid delays.

[0058] In one embodiment, the number of time slots N in a time frame slot It is defined as dynamic and not fixed, and is allocated according to the node applied for. Its duration is defined as T frame There are at most 3 stages in the time frame, and an arbitration time slot is inserted between each stage, which can interrupt the current time slot allocation table to send new high-priority data frames.

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

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

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

[0062] Network announcement frames are used to help devices (nodes) in the network discover each other's existence, especially in scenarios where they dynamically join or leave the network. Through broadcasting, other devices in the network can quickly perceive the addition of new nodes or devices. They are used to synchronize network status or configuration information among devices in the network, ensuring that all nodes maintain a consistent network status, especially when the network topology or configuration changes. They can also be used to maintain the topology of the network. In self-organizing networks (such as wireless ad hoc networks), announcement frames help devices regularly update their neighbor node information in order to dynamically adjust the communication path.

[0063] In one of the embodiments, the time slot request frame includes a fixed field, a MAC header field and a data field; the MAC header field includes a 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 ID information of the forwarding node is the ID information of the node that needs to be forwarded through this node; the ID information of the destination node: that is, the ID number that this node wants to send to the destination node; the frame priority information table: Byte1-8 corresponds to the priority of the next 1-8 data frames to be sent, and if there are less than 8, you can fill 255 in this byte; the single-hop node table: Byte1-8 corresponds to 1-8 nodes, and the corresponding node IDs are solved in turn, which means that the single-hop node table is in it.

[0065] In a network with time slot allocation, each node can only transmit data if it obtains a time slot. The node sends a request to the network scheduler (such as a base station, controller, or centralized management device) by sending a time slot request frame, indicating that it wants to obtain one or more time slots for data transmission. This is the first step in the time slot allocation process. The time slot allocation process is made flexible by using a time slot request frame. When the network load or the transmission requirements of the node change, the node can dynamically apply for or adjust the time slot resources through the time slot request frame. For example, the node may need more time slots due to an increase in the amount of data, or release the time slot resources after the data transmission is completed. And coordinate and allocate time slots of different nodes based on the priority of the request, network status and other information to ensure that the transmission process is conflict-free. Then when a node completes its data transmission task, it can release the previously allocated time slot by sending a time slot request frame again, or notify the scheduler that the time slot is no longer needed. This helps the network scheduler to reallocate time slots to other nodes in need, thereby improving resource utilization.

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

[0067] In a specific embodiment, the structure of the network allocation frame is as follows: Fig. 9 As shown, the time slot allocation table is included: Byte 1-N respectively corresponds to which node 1-N time slots belong to send, each node is represented by a Byte, and the time slot allocation is performed according to the time slot allocation table.

[0068] In one of the embodiments, the data frame includes a fixed field, a MAC header field and a data field; the MAC header field includes a frame type, local node ID information and status flag information; the data field includes a service data segment; the status flag information indicates whether there are 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: Fig.10 As shown, it includes the status flag information: whether there are nodes around this node that need to send high-priority data. 1-16Byte means that up to 16 node applications are supported.

[0070] In one embodiment, the master node calculates the arbitration value corresponding to 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 corresponding arbitration value of each node according to the weight corresponding to each priority and the weight of the number of frames to be sent.

[0072]

[0073] Among them, P0 is the number of priorities, that is, the weight corresponding to the priority, priority 0 is the highest priority, and priority P0-1 is the lowest priority; Th i is the threshold of priority i, TH min is the lowest priority threshold; r j is the proportion of priority j services to the total services, that is, the weight of the number of frames to be sent.

[0074] In a specific embodiment, during the communication process, there is a certain relationship between the priority of the high priority and the number of data frames. The higher the priority, the lower the data volume. Due to the low data volume, a threshold is formed by the priority and the number of data frames. The size of the threshold determines the arbitration value of the transmission. Therefore, the threshold set for each priority data packet is positively correlated with its priority, that is, the higher the priority, the larger the threshold. Moreover, the setting of the threshold has a certain relationship with the proportion of the corresponding priority service. The lower the proportion, the larger the threshold. In addition, in order to ensure the probability of successful transmission of the highest priority packet, the maximum value of the priority data packet threshold can be set to

[0075]

[0076] Where: P0 is the number of priorities, that is, priority 0 is the highest priority, and priority P0-1 is the lowest priority; Th i is the threshold of priority i, TH min is the lowest priority threshold; r j is the proportion of priority j services to the total services. By using the above method to set the maximum value of each priority data packet threshold, the channel occupancy rate can be controlled within the corresponding priority data packet threshold range, ensuring the transmission efficiency and reliability of high priority packets. The remaining priority data packet threshold setting methods are as follows:

[0077]

[0078] It should be understood that although Figure 1 The steps in the flowchart are shown in sequence as indicated by the arrows, but these steps are not necessarily executed in the order indicated by the arrows. Unless otherwise specified in this document, there is no strict order restriction for the execution of these steps, and these steps can be executed in other orders. Moreover, Figure 1 At least part of the steps may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed 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 part of the sub-steps or stages of other steps.

[0079] In one embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as follows: Fig.11 As shown. The computer device includes a processor, a memory, a network interface, a display screen and an input device connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a time slot allocation method of a dynamic TDMA protocol is implemented. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covering the display screen, or a button, trackball or touchpad set on the computer device housing, or an external keyboard, touchpad or mouse, etc.

[0080] Those skilled in the art will understand that Fig.11 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0081] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database 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. As an illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).

[0082] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, 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 above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A time slot allocation method for a dynamic TDMA protocol, characterized in that: The method comprises: The TDMA frame structure is divided into three levels of frame formats: time slot, time frame and superframe, where each time frame consists of three unequal-length time slots and every four time frames form a superframe; The first time slot of the time frame is divided into three stages. The first stage is for the master node to send a network announcement frame. The second stage occupies multiple micro-time slots, including the time for other nodes except this node to send time slot request frames. The third stage occupies one micro-time slot, and 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, the subsequent time frames are composed of service time slots, excluding broadcast time slots. Arbitration time slots are added after a period of time in the service time slots, and the subsequent time slots are reallocated until the time frame ends, and then the broadcast time slots are re-entered, and the cycle continues; The network allocation frame in the broadcast time slot allocates time slots according to the priority of the node's packet transmission. When a node applies to send high-priority data, it resends the 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 corresponding to the priority of each data to be sent and the weight of the number of frames to be sent. According to the arbitration value, the new time slot allocation table is inserted into the next stage from large to small to continue sending data.

2. The method according to claim 1, characterized in that: The number of time slots N of the time frame slot It is defined as dynamic and not fixed, and is allocated according to the node applied for. Its duration is defined as T frame There are at most 3 stages in the time frame, and an arbitration time slot is inserted between each stage, which can interrupt the current time slot allocation table to send new high-priority data frames.

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

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

5. The method according to claim 1, characterized in that The time slot request frame includes a fixed field, a MAC header field and a data field; the MAC header field includes a 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 a fixed field, a MAC header field and a data field; the MAC header field includes a frame type, local node ID information and local time; and the data field includes a time slot allocation table.

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

8. The method according to claim 1, characterized in that The master node calculates the corresponding 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: The master node calculates the corresponding arbitration value of each node according to the weight corresponding to each priority and the weight of the number of frames to be sent. Among them, P0 is the number of priorities, that is, the weight corresponding to the priority, priority 0 is the highest priority, and priority P0-1 is the lowest priority; Th i is the threshold of priority i, Th min is the lowest priority threshold; r j is the proportion of priority j services to the total services, that is, the weight of the number of frames to be sent.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 8 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 8 are implemented.

Images