Dynamic time slot allocation method for mesh network and mesh network

Abstract

The application provides a dynamic time slot allocation method for a MESH network and the MESH network, which comprises the following steps: a current time slot occupation node acquires time slot occupation records of each adjacent node in the network; the occupation node adaptively determines the duration of the current time slot according to the data volume of the data to be sent by the occupation node, and selects a target node from each adjacent node in combination with the time slot occupation records; the occupation node sends the data to the target node in the current time slot, and carries time slot occupation right assignment information in the data frame or control signaling of the current time slot, and assigns the time slot occupation right of the next time slot to the target node; after the current time slot ends, the target node switches to a new occupation node; the new occupation node acquires the updated time slot occupation records maintained locally, adaptively determines the duration of the next time slot, selects a target node of the next hop, and distributes the time slot occupation right among the nodes and transmits the time slot occupation right hop by hop.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, and particularly to a dynamic time slot allocation method for MESH networks and MESH networks. Background Technology

[0002] In mesh networks (especially UAV mesh networks), the rational allocation of time slot resources is a core element in ensuring communication quality and transmission efficiency. Existing technologies have proposed various time slot allocation schemes, mainly including centralized allocation mechanisms at central nodes, allocation strategies based on service levels, and various dynamic time slot allocation algorithms based on TDMA.

[0003] The centralized allocation mechanism, where a central node collects and allocates time slots from all child nodes, is suitable for scenarios with a small number of nodes and a relatively stable topology. However, it suffers from a single point of failure risk; if the central node fails, the entire network's time slot allocation will be paralyzed. Furthermore, as the network scales up, the computational and communication burden on the central node increases dramatically, severely limiting its scalability. In addition, this mechanism lacks flexibility, making it difficult to adapt to dynamic topology changes and sudden business demands; when nodes temporarily increase their data volume, they must reapply, and the response latency cannot meet real-time requirements.

[0004] The service-based allocation mechanism allocates different numbers of time slots to different services based on their priority and importance. However, the standards for classifying service levels are difficult to define clearly and uniformly. Furthermore, unreasonable level classification can lead to high-priority services over-consuming resources, while low-priority services cannot obtain sufficient time slots, thus affecting network fairness and overall performance.

[0005] Regarding TDMA-based time slot allocation algorithms, existing technologies have developed various variants, including dynamic TDMA protocols, fixed-dynamic combined TDMA protocols, low-latency time slot allocation algorithms, and dynamic time slot allocation algorithms, which optimize channel utilization, end-to-end latency, and spatial multiplexing to varying degrees. However, these algorithms generally suffer from excessively high computational complexity, posing a severe challenge to the limited computing resources and energy of UAV nodes. The problems of hidden and exposed terminals are still difficult to completely eliminate in real-world dynamic environments. Furthermore, some algorithms lack adaptability to rapid changes in network topology, failing to adjust strategies in a timely manner when nodes frequently join or leave the network, leading to resource waste or transmission interruptions.

[0006] In terms of auxiliary technologies, the GPS-based networking mode can achieve accurate time slot synchronization, but it is highly dependent on the quality of GPS signals. When the signal is interfered with or blocked, the synchronization accuracy decreases, which directly affects the accuracy of time slot allocation. The adaptive time slot allocation algorithm can dynamically adjust the strategy according to the real-time network status, but the algorithm is highly complex, and network status perception and rapid decision-making still face many challenges. Its stability and reliability also need further verification. Summary of the Invention

[0007] In order to overcome the shortcomings of the prior art, this invention provides a dynamic time slot allocation method for MESH networks and a MESH network.

[0008] To achieve the above objectives, a first aspect of the present invention provides a dynamic time slot allocation method for MESH networks, comprising: The node currently occupying the time slot obtains the time slot occupancy records of each neighboring node in the network. The time slot occupancy records are used to identify the amount of time slot resources occupied by each neighboring node. The occupying node adaptively determines the duration of the current time slot based on the amount of data it has to send, and selects the target node from each of its neighboring nodes in combination with the time slot occupancy record; The occupying node sends data to the target node within the current time slot and carries the time slot occupancy right assignment information in the data frame or control signaling of the current time slot, assigning the time slot occupancy right of the next time slot to the target node; After the current time slot ends, the target node switches to the new occupying node. The new occupying node obtains the updated time slot occupancy record maintained locally, adaptively determines the duration of the next time slot based on the amount of data to be sent, and selects the target node for the next hop in combination with the updated time slot occupancy record, and distributes the time slot occupancy right among the nodes hop by hop.

[0009] According to an embodiment of the first aspect of the present invention, each node updates its locally maintained time slot occupancy record in the following manner: Monitor the current channel and identify whether each adjacent node is occupying a time slot through physical layer carrier sensing. When any adjacent node is detected to be occupying the current time slot, obtain the node identifier of the adjacent node and record the occupancy parameters of the adjacent node in the current time slot; Based on the occupancy parameters, the entries corresponding to the node identifiers in the locally maintained time slot occupancy records are cumulatively updated to count the amount of time slot resources occupied by the adjacent node.

[0010] According to an embodiment of the first aspect of the present invention, the time slot resource quantity includes the cumulative value of the number of time slots occupied by each adjacent node, and the cumulative update of the entry corresponding to the node identifier includes: Maintain an independent time slot occupancy counter for each adjacent node; Once the node identifier of the neighboring node occupying the current time slot is obtained, an increment operation is performed on the time slot occupancy counter corresponding to the neighboring node to indicate that the neighboring node's occupation of the current time slot has been included in the locally maintained time slot occupancy record.

[0011] According to an embodiment of the first aspect of the present invention, the amount of time slot resources includes the cumulative value of the time slot duration occupied by each adjacent node, and the occupation parameter includes at least the continuous occupation duration of the adjacent node when it starts to occupy the time slot.

[0012] According to an embodiment of the first aspect of the present invention, each time slot includes at least one transmission time period of variable duration and at least one response time period of fixed duration. The occupying node calculates the required transmission duration based on the amount of data to be transmitted and adjusts the duration of the transmission time period to ensure that it is not less than the transmission duration.

[0013] According to an embodiment of the first aspect of the present invention, the duration of the transmission time period is limited to a preset minimum threshold and a maximum threshold; when the transmission duration of the data to be transmitted exceeds the maximum threshold, the occupying node will group the data to be transmitted, send part of the data to the target node in the current time slot, and the remaining data will be used as the directed data to be transmitted.

[0014] According to an embodiment of the first aspect of the present invention, selecting a target node from each adjacent node by combining the occupancy node with the time slot occupancy record includes: Determine if the node holding the data has cached data to be sent; if so, determine the destination node of the data as the target node. If not, then iterate through the updated timeslot occupancy records maintained locally, and determine the target node from among the neighboring nodes with the least amount of occupied timeslot resources.

[0015] According to an embodiment of the first aspect of the present invention, after the occupying node sends data to the target node in the current time slot, the method further includes: Listen for the response signal returned by the target node within the response time of the current time slot; If an acknowledgment signal is received and the parsing result is an acknowledgment signal; or, if no acknowledgment signal is received but a valid data frame sent by the target node is received, then the data transmission of the current time slot is determined to be successful, the current time slot is terminated, and it is confirmed that the time slot occupancy right has been transferred to the target node. Otherwise, the pre-defined time slot exception handling procedure will be triggered.

[0016] According to an embodiment of the first aspect of the present invention, the predetermined time slot anomaly handling procedure includes: If an acknowledgment signal is received and the parsing result is a non-acknowledgment acknowledgment signal, the data will be retransmitted in the current time slot and the acknowledgment signal will be listened for again. If no response signal or valid data frame is received within the response time, the occupying node ends the current time slot and selects a new target node according to the time slot occupancy record, and then sends data and assigns time slot occupancy rights in the next time slot.

[0017] A second aspect of the present invention also provides a MESH network, which includes multiple network nodes, each of which includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described dynamic time slot allocation method for MESH networks.

[0018] In summary, the MESH network dynamic time slot allocation method provided by this invention achieves fully distributed dynamic allocation of time slot resources. The currently occupying node, based on its locally maintained neighboring node time slot occupancy records, directly assigns the next time slot occupancy right to the target node within the transmitted data frame or control signaling. This process is completed only between the sending and receiving nodes, without negotiation with a third party or transmission of the time slot occupancy table across the entire network. This greatly simplifies the allocation process under fast dynamic topology, significantly reduces data overhead, and makes node additions and removals more flexible and rapid. Correspondingly, the distributed transmission of time slot occupancy rights among nodes in a hop-by-hop manner ensures that each node has an equal opportunity to transmit, eliminating the need for a central control node and fundamentally eliminating the risk of congestion or failure at the central node. Furthermore, this transmission mechanism relies solely on physical layer carrier sensing, without requiring high-precision external synchronization such as GPS. Based on this, the occupying node adaptively determines the duration of the current time slot according to the amount of data it needs to transmit, flexibly responding to burst traffic while effectively avoiding resource idleness caused by fixed time slot allocation, thus optimizing channel utilization.

[0019] Furthermore, at the target node scheduling level: the occupying node makes autonomous decisions based on local data needs and time slot occupancy records, enabling flexible and differentiated scheduling without requiring additional coordination between nodes throughout the process. Moreover, an embedded acknowledgment mechanism within the data frame allows for real-time awareness of the next-hop link status during transmission, facilitating timely network change monitoring. The dynamic time slot allocation method for MESH networks provided by this invention requires only simple counting and judgment to operate, exhibiting extremely low computational complexity while effectively ensuring the efficiency, robustness, and adaptability of time slot allocation, comprehensively improving the transmission performance and stability of MESH networks in dynamic environments.

[0020] To make the above and other objects, features and advantages of the present invention more apparent and understandable, preferred embodiments are described below in detail with reference to the accompanying drawings. Attached Figure Description

[0021] Figure 1 The diagram shows a flowchart of a dynamic time slot allocation method for MESH networks provided in an embodiment of the present invention.

[0022] Figure 2 The diagram shows a flowchart of each node updating the locally maintained timeslot occupancy record.

[0023] Figure 3The diagram shows the distribution of nodes within the MESH network.

[0024] Figures 4a to 4f for Figure 3 The diagram shows how each node updates its locally maintained time slot occupancy records.

[0025] Figure 5 As shown Figure 1 The flowchart for selecting the target node from each adjacent node by combining the occupied node with the time slot occupancy record in step S20.

[0026] Figure 6 The diagram shows the response mechanism after the occupying node sends data to the target node in the current time slot. Detailed Implementation

[0027] In existing MESH network time slot resource allocation schemes, the centralized allocation mechanism with a central node suffers from high single-node failure risk, severely limited scalability, and insufficient mechanism flexibility. Service-level-based allocation mechanisms, on the other hand, suffer from unclear service level classifications and poor network fairness due to excessive resource consumption by high-priority nodes. Furthermore, TDMA-based time slot allocation algorithms generally suffer from excessively high computational complexity, making them difficult to deploy on resource-constrained nodes such as drones, and the difficulty in effectively addressing hidden terminals caused by the mobility of drones and the complexity of the environment.

[0028] In view of this, this embodiment provides a dynamic time slot allocation method for MESH networks that eliminates the need for inter-node coordination, minimizes data overhead, provides flexible and fair scheduling, and effectively addresses the hidden terminal problem. For example... Figure 1 As shown, the method includes: The node occupying the current time slot obtains the time slot occupancy records of each neighboring node in the network. The time slot occupancy records are used to identify the amount of time slot resources already occupied by each neighboring node (step S10). The occupying node adaptively determines the duration of the current time slot based on the amount of data it has to send, and selects a target node from each neighboring node in conjunction with the time slot occupancy records (step S20). The occupying node sends data to the target node within the current time slot, and carries time slot occupancy right assignment information in the data frame or control signaling of the current time slot, assigning the time slot occupancy right of the next time slot to the target node (step S30). After the current time slot ends, the target node switches to the new occupying node (step S40). The new occupying node obtains the updated time slot occupancy records maintained locally, adaptively determines the duration of the next time slot based on the amount of data it has to send, and selects the target node for the next hop in conjunction with the updated time slot occupancy records, distributing the time slot occupancy right hop-by-hop among the nodes.

[0029] The dynamic time slot allocation method for MESH networks provided by this invention combines variable-length time slots with distributed dynamic time slot allocation. Specifically, at the time slot resource utilization level, each node calculates the required transmission duration based on the amount of data to be transmitted before sending, and determines the duration of the current time slot accordingly. This achieves adaptive matching between the time slot length and the data volume, thereby achieving self-allocation of time resources. Variable-length time slots eliminate the resource allocation process between nodes, allowing each node to allocate time slot length automatically based on its data volume to meet the adaptive resource allocation process without any additional overhead. Compared to existing fixed time slots or pre-allocation of time slots based on service levels, this time slot allocation method can not only quickly respond to sudden traffic fluctuations such as image transmission and telemetry data surges, but also fundamentally avoid channel idleness and resource waste caused by over-allocation of time slots, maximizing the utilization of limited spectrum resources.

[0030] At the distributed dynamic time slot allocation level: This invention employs a distributed hop-by-hop transfer of time slot occupancy rights between nodes. The currently occupying node, based on its locally maintained records of adjacent nodes' time slot occupancy, directly assigns the right to occupy the next time slot to the target node within the transmitted data frame or control signaling. This assignment mechanism is completed only between the sending and receiving nodes, without requiring requests or negotiations with third-party nodes. The handover of time slot occupancy rights can be completed within one hop, greatly simplifying the allocation process and significantly improving response speed. This mechanism is well-suited to the harsh environment of high-speed movement and rapidly changing topology in UAV MESH networks. Furthermore, the hop-by-hop transfer of time slot occupancy rights between nodes ensures that each node enjoys a completely equal opportunity to send and its network status. There is no central control node, thus completely eliminating the fundamental risk of network paralysis caused by central node congestion or even failure. Simultaneously, since each node is both the receiver and assignor of time slot occupancy rights, the entire network naturally achieves load distribution, preventing hotspots of traffic concentrated around the central node, resulting in more balanced network resource utilization. Furthermore, when a new node joins or an existing node leaves, it only needs to be detected by adjacent nodes and included in the time slot occupancy record to participate in subsequent transmission. There is no need to register with the central node or trigger a network-wide time slot table reallocation. The addition and removal of nodes is extremely flexible and fast, effectively solving the scalability problem in large-scale dynamic networking scenarios.

[0031] In this embodiment, the time slot occupancy right specification information is carried directly with the data frame or control signaling, without needing to repeatedly transmit the time slot occupancy table across the entire network. Compared to the practice in existing protocols of frequently exchanging control messages to maintain a unified time slot view, this setting fundamentally reduces data overhead in the network and effectively frees up valuable wireless bandwidth resources. In one possible implementation, the time slot occupancy right specification information can be carried within the control signaling, and the occupying node sends the data and the control signaling carrying the time slot occupancy right specification information to the target node in the current time slot. However, the present invention does not limit this in any way. In other embodiments, the time slot occupancy right specification information can also be embedded in the data frame and sent to the target node along with the data frame.

[0032] In this embodiment, while the occupying node sends the time slot occupancy right designation information to the target node along with the data frame or control signaling, other adjacent nodes near the occupying node will monitor the current channel in real time, learn about the occupying node of the next time slot through physical layer carrier sensing, and automatically remain silent. This method can effectively avoid the hidden terminal conflict problem caused by inconsistent carrier sensing range in traditional mechanisms, and does not require complex handshake interaction or central arbitration as in existing TDMA schemes, significantly reducing deployment difficulty and cost. On the other hand, physical layer carrier sensing does not require external high-precision timing signals such as GPS; for UAV MESH networks, aircraft are prone to losing GPS signals in mountainous areas, urban canyons, or electromagnetic interference environments. Existing networking schemes that rely on GPS synchronization experience a sharp drop in synchronization accuracy when the signal degrades, and blurred time slot boundaries lead to frequent collisions. However, this invention can still work stably in GPS-denied environments, greatly expanding the applicability of MESH networks in complex battlefields or emergency scenarios.

[0033] In one possible implementation, each node updates its locally maintained time slot occupancy record as follows: Step S11: Monitor the current channel and identify whether adjacent nodes are occupying time slots using physical layer carrier sensing. Specifically, determine which node is occupying the current channel using receiver preamble detection. However, this invention does not impose any limitations on this.

[0034] Step S12: When it is detected that any adjacent node is occupying the current time slot, obtain the node identifier of the adjacent node and record the occupancy parameters of the adjacent node in the current time slot.

[0035] Step S13: Based on the occupancy parameters, update the entries corresponding to the node identifier in the locally maintained time slot occupancy record to calculate the amount of time slot resources occupied by the adjacent node.

[0036] In one possible implementation, the time slot resource quantity includes the cumulative value of the number of time slots occupied by each adjacent node, and the cumulative update of the entry corresponding to the node identifier includes: Maintain an independent time slot occupancy counter for each adjacent node.

[0037] Once the node identifier of the neighboring node occupying the current time slot is obtained, an increment operation is performed on the time slot occupancy counter corresponding to the neighboring node to indicate that the neighboring node's occupation of the current time slot has been included in the locally maintained time slot occupancy record.

[0038] To better understand the local update and maintenance of time slot occupancy records by each node, this embodiment uses... Figure 3 The following example illustrates a five-node mesh network. During data transmission, the timeslot occupancy records of each node are updated as follows: Figures 4a to 4f As shown.

[0039] Specifically, each node maintains an independent time slot occupancy counter for itself and for each of its neighboring nodes, in order to Figure 4a Taking the currently occupying node (node ​​1) as an example, in 1:1, the 1 on the left is the node identifier, and the 1 on the right indicates that node 1 has occupied the time slot 1 a total of 1 times. Similarly, in 2:0, the 2 on the left is the node identifier, and the 0 on the right indicates that node 2 has occupied the time slot 0 times. This process continues to form the time slot occupancy record maintained locally by node 1. Likewise, for node 4, in addition to being adjacent to nodes 1, 2, and 3, it is also adjacent to node 5; therefore, the time slot occupancy record it maintains includes its own time slot occupancy counter and the time slot occupancy counters of its four adjacent nodes.

[0040] exist Figure 4a In the current time slot, node 1 is the occupying node. At this time, the cumulative occupation count of the time slot by its neighboring nodes is 0. Therefore, it selects node 2 as the target node and sends the time slot occupation right information for the next time slot in the control signaling to node 2. During the data transmission process of node 1, its neighboring nodes 2, 3, and 4 will identify the node identifier of node 1 through receiver preamble detection. Each node will increment the time slot occupation counter of node 1 in its locally maintained time slot occupation record. Therefore, in Figure 4a As can be seen, the time slot occupancy records for nodes 2, 3, and 4 are all 1:1.

[0041] exist Figure 4b In this process, after acquiring the time slot occupancy right, Node 2 becomes the new occupying node, and selects Node 3 as its next target node, sending the time slot occupancy right to Node 3 in the control signaling. At this time, Node 2 itself and its neighboring nodes all perform an increment operation on Node 2's time slot occupancy counter in the time slot occupancy record maintained locally, forming a 2:1 ratio.

[0042] exist Figure 4c In this process, node 3, as the new occupying node, selects node 4 as the next target node and sends the time slot occupancy right to node 4 in the control signaling. At this time, node 3 itself and its neighboring nodes all perform an increment operation on the time slot occupancy counter of node 3 in the time slot occupancy record maintained locally, forming a 3:1 ratio.

[0043] exist Figure 4d In this process, node 4 becomes the new occupying node, and selects node 5 as the next target node, sending the time slot occupancy right to node 5 in the control signaling. At this time, node 4 itself and its neighboring nodes (including node 5) all perform an increment operation on node 4's time slot occupancy counter in the locally maintained time slot occupancy record, forming a 4:1 ratio.

[0044] exist Figure 4e In this process, node 5, as the new occupying node, selects node 4 as the next target node and sends the time slot occupancy right to node 4 in the control signaling. At this time, node 5 itself and its neighboring node (i.e., node 4) perform an increment operation on node 5's time slot occupancy counter in the time slot occupancy record maintained locally, forming a 5:1 ratio.

[0045] exist Figure 4f In this process, node 4, as the new occupying node, selects node 1 as its next target node and sends the time slot occupancy right to node 1 in the control signaling. At this time, node 4 itself and its neighboring nodes all perform an increment operation on node 4's time slot occupancy counter in the time slot occupancy record maintained locally, forming a 4:2 ratio.

[0046] This enables each node to update its locally maintained time slot occupancy records in real time. Although this embodiment uses the example of each node maintaining an independent time slot occupancy counter for itself and its neighboring nodes, the present invention does not impose any limitations on this. In other embodiments, each node may not need to maintain an independent time slot occupancy counter for itself, but only for each of its neighboring nodes.

[0047] Although this embodiment uses the time slot resource quantity as the cumulative value of the number of time slots occupied by each adjacent node, the present invention does not impose any limitations on this. In one possible implementation, the time slot resource quantity may also include the cumulative value of the time slot duration occupied by each adjacent node, and the occupancy parameter includes at least the continuous occupancy duration from when the adjacent node began to occupy the time slot.

[0048] In one possible implementation, selecting the target node from each neighboring node in step S20, based on the time slot occupancy record, includes: Step S21: Determine whether the occupying node has cached directed data to be sent; If so, in step S22, the destination node of the directed data is determined as the target node to achieve priority transmission of the directed data.

[0049] If not, in step S23, the updated time slot occupancy records maintained locally are traversed, and a target node is determined from the adjacent nodes with the least amount of occupied time slot resources. Specifically, when no data packets are being sent or broadcast packets are being sent, the node with the fewest occupation times is selected for transmission based on the time slot occupancy records maintained locally by the occupying node. If multiple nodes with the fewest occupation times exist simultaneously, one is randomly selected as the target node.

[0050] In this target node scheduling method, the occupying node can make flexible and differentiated scheduling based on its local data needs (i.e., whether there is priority to send targeted data) and time slot occupancy records, without the need for additional coordination between nodes throughout the process.

[0051] In one possible implementation, each time slot includes at least one variable-length transmission period and at least one fixed-length response period. The occupying node calculates the required transmission duration based on the amount of data to be transmitted and adjusts the length of the transmission period to ensure it is not less than the transmission duration. During the transmission period, the currently occupying node sends control signaling carrying time slot occupancy information along with a data frame to the target node and waits for a response signal from the target node during the response period. Preferably, to prevent the occupying node from excessively occupying time slot resources due to excessive data volume, in one possible implementation, the length of the transmission period can also be limited to a preset minimum threshold K. min And the longest threshold K max Between. The transmission duration of the data to be sent is greater than the longest threshold K. max When the occupant node is in a time slot, it will packetize the data it is sending. Within the current time slot, it will send a portion of the data to the target node, while the remaining data will be used as directional data to be sent. This avoids a single node occupying the channel for an extended period. For the response time, preferably, its duration can be set to be equal to a preset minimum threshold K. min However, this invention does not limit the scope of the invention in any way.

[0052] In one possible implementation, such as Figure 6 As shown, after the occupying node sends data to the target node within the current time slot, it also includes: Listen for the response signal returned by the target node within the response time of the current time slot.

[0053] a) If an acknowledgment signal is received and the parsing result is an acknowledgment signal; or, if no acknowledgment signal is received but a valid data frame sent by the target node is received, then the data transmission of the current time slot is determined to be successful, the current time slot is terminated, and the time slot occupancy right is confirmed to have been transferred to the target node.

[0054] Otherwise, the pre-defined time slot exception handling procedure is triggered. Specifically, in one possible implementation, such as... Figure 6 As shown, the pre-defined time slot anomaly handling procedure includes: If an acknowledgment signal is received and the parsing result is a non-acknowledgment signal, the data is retransmitted during another transmission time in the current time slot, and the acknowledgment signal is listened for again during another acknowledgment time after that other transmission time. If an acknowledgment signal is still not received after repetition, the occupying node ends the current time slot and executes step S20 to reselect a new target node, and performs data transmission and time slot occupancy assignment in the next time slot.

[0055] In another scenario, if no response signal or valid data frame is received within the response time, the occupying node ends the current time slot and executes step S20 to reselect a new target node, and then transmits data and assigns time slot occupancy rights in the next time slot.

[0056] The dynamic time slot allocation method for MESH networks provided in this embodiment provides real-time feedback on the link status of the next-hop node through a response mechanism during allocation. This facilitates the system's accurate understanding of the reachability of adjacent nodes and changes in channel quality. Once a hop link deteriorates or a node leaves the network, the current node can promptly adjust its target node selection strategy, effectively avoiding data loss due to link interruption and greatly improving network stability.

[0057] Corresponding to the above-described dynamic time slot allocation method for MESH networks, this embodiment also provides a MESH network, which includes multiple network nodes, and each network node includes a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the various steps in the above-described dynamic time slot allocation method for MESH networks.

[0058] Preferably, in this embodiment, the MESH network is configured as a drone MESH network, and the network nodes are drone devices. However, this invention does not impose any limitations on this. The dynamic time slot allocation method for MESH networks provided by this invention can also be applied to MESH networks composed of other communication devices.

[0059] In summary, the MESH network dynamic time slot allocation method provided by this invention achieves fully distributed dynamic allocation of time slot resources. The currently occupying node, based on its locally maintained neighboring node time slot occupancy records, directly assigns the next time slot occupancy right to the target node within the transmitted data frame or control signaling. This process is completed only between the sending and receiving nodes, without negotiation with a third party or transmission of the time slot occupancy table across the entire network. This greatly simplifies the allocation process under fast dynamic topology, significantly reduces data overhead, and makes node additions and removals more flexible and rapid. Correspondingly, the distributed transmission of time slot occupancy rights among nodes in a hop-by-hop manner ensures that each node has an equal opportunity to transmit, eliminating the need for a central control node and fundamentally eliminating the risk of congestion or failure at the central node. Furthermore, this transmission mechanism relies solely on physical layer carrier sensing, without requiring high-precision external synchronization such as GPS. Based on this, the occupying node adaptively determines the duration of the current time slot according to the amount of data it needs to transmit, flexibly responding to burst traffic while effectively avoiding resource idleness caused by fixed time slot allocation, thus optimizing channel utilization.

[0060] Furthermore, at the target node scheduling level: the occupying node makes autonomous decisions based on local data needs and time slot occupancy records, enabling flexible and differentiated scheduling without requiring additional coordination between nodes throughout the process. Moreover, an embedded acknowledgment mechanism within the data frame allows for real-time awareness of the next-hop link status during transmission, facilitating timely network change monitoring. The dynamic time slot allocation method for MESH networks provided by this invention requires only simple counting and judgment to operate, exhibiting extremely low computational complexity while effectively ensuring the efficiency, robustness, and adaptability of time slot allocation, comprehensively improving the transmission performance and stability of MESH networks in dynamic environments.

[0061] Although the present invention has been disclosed above by way of preferred embodiments, it is not intended to limit the present invention. Any person skilled in the art may make some modifications and refinements without departing from the spirit and scope of the present invention. Therefore, the scope of protection of the present invention shall be determined by the scope of protection claimed in the claims.

Claims

1. A dynamic time slot allocation method for MESH networks, characterized in that, include: The node currently occupying a time slot obtains the time slot occupancy records of each adjacent node in the network. The time slot occupancy records are used to identify the amount of time slot resources occupied by each adjacent node. The occupying node adaptively determines the duration of the current time slot based on the amount of data it has to send, and selects the target node from each of its neighboring nodes in conjunction with the time slot occupancy record; The occupying node sends data to the target node in the current time slot and carries time slot occupancy right designation information in the data frame or control signaling of the current time slot, and designates the time slot occupancy right of the next time slot to the target node; After the current time slot ends, the target node switches to a new occupying node; the new occupying node obtains the updated time slot occupancy record maintained locally, adaptively determines the duration of the next time slot based on the amount of data to be sent, and selects the target node for the next hop in combination with the updated time slot occupancy record, and distributes the time slot occupancy right among the nodes hop by hop.

2. The dynamic time slot allocation method for MESH networks according to claim 1, characterized in that, Each node updates the locally maintained time slot occupancy record as follows: Monitor the current channel and identify whether each adjacent node is occupying a time slot through physical layer carrier sensing. When any adjacent node is detected to be occupying the current time slot, obtain the node identifier of the adjacent node and record the occupancy parameters of the adjacent node in the current time slot; Based on the occupancy parameters, the entries corresponding to the node identifier in the locally maintained time slot occupancy record are cumulatively updated to count the amount of time slot resources occupied by the adjacent node.

3. The dynamic time slot allocation method for MESH networks according to claim 2, characterized in that, The time slot resource quantity includes the cumulative value of the number of time slots occupied by each adjacent node. The cumulative update of the entry corresponding to the node identifier includes: Maintain an independent time slot occupancy counter for each adjacent node; Once the node identifier of the neighboring node occupying the current time slot is obtained, an increment operation is performed on the time slot occupancy counter corresponding to the neighboring node to indicate that the neighboring node's occupation of the current time slot has been included in the locally maintained time slot occupancy record.

4. The dynamic time slot allocation method for MESH networks according to claim 2, characterized in that, The time slot resource quantity includes the cumulative value of the time slot duration occupied by each adjacent node, and the occupation parameter includes at least the continuous occupation duration of the time slot when the adjacent node starts to occupy it.

5. The dynamic time slot allocation method for MESH networks according to claim 1, characterized in that, Each time slot includes at least one variable-length transmission time slot and at least one fixed-length response time slot. The occupying node calculates the required transmission duration based on the amount of data to be transmitted and adjusts the duration of the transmission time slot to ensure that it is not less than the transmission duration.

6. The dynamic time slot allocation method for MESH networks according to claim 5, characterized in that, The duration of the transmission time period is limited to a preset minimum threshold and a maximum threshold. When the transmission duration of the data to be transmitted exceeds the maximum threshold, the occupying node will group the data to be transmitted, send part of the data to the target node in the current time slot, and the remaining data will be used as the directed data to be transmitted.

7. The dynamic time slot allocation method for MESH networks according to claim 1, characterized in that, The selection of a target node from neighboring nodes by combining the occupancy node with the time slot occupancy record includes: Determine whether the occupying node has cached directed data to be sent; if so, determine the destination node of the directed data as the target node. If not, then iterate through the updated timeslot occupancy records maintained locally, and determine the target node from among the neighboring nodes with the least amount of occupied timeslot resources.

8. The dynamic time slot allocation method for MESH networks according to claim 1, characterized in that, After the occupying node sends data to the target node in the current time slot, the method further includes: Listen for the response signal returned by the target node within the response time of the current time slot; If the response signal is received and the parsing result is a confirmation response signal; or, if the response signal is not received but a valid data frame sent by the target node is received, then the data transmission of the current time slot is determined to be successful, the current time slot is terminated and the time slot occupancy right is confirmed to have been transferred to the target node. Otherwise, the pre-defined time slot exception handling procedure will be triggered.

9. The dynamic time slot allocation method for MESH networks according to claim 8, characterized in that, The predetermined time slot anomaly handling procedure includes: If the response signal is received and the parsing result is a non-acknowledgment response signal, the data is retransmitted in the current time slot and the response signal is listened for again. If no response signal or valid data frame is received within the response time, the occupying node ends the current time slot and selects a new target node according to the time slot occupancy record, and performs data transmission and time slot occupancy assignment in the next time slot.

10. A mesh network comprising multiple network nodes, each network node including a memory and a processor, the memory storing 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 9.

Images