A 5G wireless broadband routing method and system supporting multi-level mesh networking
By employing bidirectional growth dynamic boundary buffer partitioning and message semantic tag recognition in industrial Mesh edge nodes, the problem of transmission delay of emergency commands under resource-constrained conditions is solved, achieving efficient priority transmission of emergency commands and deterministic data transmission.
Patent Information
- Application Number
- CN202611082449.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-07-21
- Publication Date
- 2026-11-10
AI Technical Summary
In resource-constrained industrial mesh edge nodes, existing technologies often result in emergency control commands being blocked by a large amount of sensor status data, leading to large latency fluctuations. This can cause PLC response timeouts or malfunctions, making it impossible to prioritize the sending of emergency commands within 1ms.
A bidirectional growth dynamic boundary buffer partitioning mechanism is adopted, combined with message semantic tag recognition and link latency verification, to realize dynamic adjustment and priority scheduling of high and low priority queues. The semantic preemption and load reduction writing mechanism ensures that urgent instructions are sent first, and Mesh neighbor nodes coordinate forwarding when link quality fluctuates.
Under limited memory conditions, this system ensures that urgent instructions are sent with priority within 1ms, reduces the discarding of low-priority data, improves the real-time determinism of data transmission and system robustness, and avoids the blocking delays caused by traditional FIFO scheduling.
Smart Images

Figure CN123075713A_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of edge data transmission technology, and in particular to a 5G wireless broadband routing method and system that supports multi-level Mesh networking. Background Technology
[0002] Currently, in smart manufacturing production lines, 5G RedCap industrial routers are used as Mesh edge nodes to connect programmable logic controllers and various sensors, requiring the simultaneous transmission of emergency control commands and periodic status data. Existing technologies typically rely on the default FIFO buffer queue of a lightweight IP protocol stack, indiscriminately sending various packets into shared physical memory, relying on the 5G uplink for centralized transmission, with a fixed scheduling strategy and no priority division.
[0003] For example, in nodes like the Kunpeng C9-200 with only 32MB of DDR2 memory, when an emergency shutdown command is suddenly issued, the command message is queued after a large number of sensor status messages, causing drastic fluctuations in transmission latency, frequently exceeding the 1ms allowable threshold for the production line. This leads to PLC response timeouts or even malfunctioning shutdowns. Traditional FIFO scheduling, under extremely limited memory conditions, cannot identify semantic differences in data, nor can it dynamically adjust queue resources based on link quality. This results in high-real-time control traffic being blocked, while low-priority background data occupies forwarding opportunities, severely impacting transmission determinism.
[0004] Therefore, there is an urgent need for a lightweight priority scheduling method that occupies very little memory and can be aware of data semantics in industrial mesh edge nodes where both Flash and DRAM are limited. This method should be able to ensure that urgent instructions are sent within 1ms even under conditions of link quality fluctuations and queue congestion, while not discarding low-priority data, so as to improve the real-time determinism and system robustness of production line data transmission. Summary of the Invention
[0005] To address the aforementioned technical shortcomings, the purpose of this invention is to propose a 5G wireless broadband routing method that supports multi-level Mesh networking. This method aims to solve the problem in existing technologies where resource-constrained industrial Mesh edge nodes may experience downtime due to large fluctuations in emergency command delays caused by FIFO scheduling. In particular, it addresses the technical problem that, under conditions of only 32MB DDR2 memory and limited Flash, it is impossible to design a priority scheduling algorithm that occupies minimal memory to prioritize the transmission of emergency commands within 1ms.
[0006] To solve the above-mentioned technical problems, the present invention adopts the following technical solution: The present invention provides a 5G wireless broadband routing method that supports multi-level Mesh networking.
[0007] The 5G wireless broadband routing method supporting multi-level Mesh networking includes: Step S10: Obtain the shared physical memory space of the industrial Mesh edge node, and perform a queue construction task based on the shared physical memory space using a bidirectional growth dynamic boundary buffer partitioning mechanism, outputting a global sending buffer pool including high-priority queues and low-priority queues; Step S20: Obtain the IP packet to be sent, and perform packet classification task based on the IP packet to be sent and the queue type of the global sending buffer pool using the packet semantic tag recognition and link delay verification mechanism, and output the verified packet with priority tag; Step S30: Based on the verified message and the global sending buffer pool, a semantic preemption and load reduction writing mechanism is used to perform a buffer writing preprocessing task, and output a sequence of messages to be sent consisting of the high-priority queue and the low-priority queue; Step S40: Based on the sequence of messages to be sent and the dynamic threshold of the global sending buffer pool, a weighted delay scheduling mechanism linked to occupancy is used to execute the queue scheduling task and output the priority forwarding messages; Step S50: Obtain the dwell time of the priority forwarding message and each message in the low priority queue, perform adaptive aging processing and Mesh neighbor node collaborative forwarding processing according to the forwarding result and the dwell time, and output the collaborative forwarding message sent by the Mesh neighbor node on behalf of the uplink. Preferably, in step S10, the steps of obtaining the shared physical memory space of the industrial Mesh edge nodes, performing a queue construction task based on the shared physical memory space using a bidirectional growth dynamic boundary buffer partitioning mechanism, and outputting a global sending buffer pool including high-priority queues and low-priority queues specifically include: Step S101: Divide a continuous physical address range from the shared physical memory space and configure the continuous physical address range as the global send buffer pool; Step S102: Divide the global send buffer pool into the high-priority queue and the low-priority queue. Set the head of the high-priority queue at the low address end of the continuous physical address range and make the high-priority queue grow from the low address end to the high address end. Set the head of the low-priority queue at the high address end of the continuous physical address range and make the low-priority queue grow from the high address end to the low address end. Step S103: Collect the 5G uplink quality indicator value and the average enqueue rate of the high-priority queue; calculate the dynamic threshold based on the 5G uplink quality indicator value and the average enqueue rate; and determine the physical address corresponding to the dynamic threshold in the continuous physical address interval as the dynamic boundary address between the high-priority queue and the low-priority queue. The dynamic threshold is calculated according to the following formula: in, The current sampling time The dynamic threshold, and represents the available capacity of the high-priority queue calculated from the low address end of the continuous physical address range; This is the current sampling time; To preset the lower safety limit; This is the preset maximum capacity value, and ; To preset the steepness coefficient, and ; This is a preset link quality threshold; The current sampling time 5G uplink quality indicator value; The current sampling time The average enqueue rate of the high-priority queue within the previously preset sliding time window; The preset peak inbound rate; Represented by natural constant An exponential function with base 0; This indicates taking the minimum value among the values within the parentheses.
[0008] Preferably, step S20, which involves obtaining the IP packet to be sent, performing packet classification based on the IP packet to be sent and the queue type of the global sending buffer pool using a packet semantic tag recognition and link delay verification mechanism, and outputting the verified packet with a priority tag, specifically includes: Step S201: Parse the service code field, transport layer port number and application layer payload identifier field in the IP packet to be sent, and determine the priority label of the IP packet to be sent as an emergency instruction label, a normal status data label or a background data label based on the parsing result; Step S202: For an IP packet to be sent with the emergency instruction tag, obtain the real-time round-trip time of the 5G uplink, determine the difference between the preset maximum allowable time and the preset local processing reserved time as the available link time, and compare the real-time round-trip time with the available link time; when the real-time round-trip time is greater than the available link time, determine the link time verification result of the corresponding IP packet to be sent as invalid, and send the corresponding IP packet to be sent to the programmable logic controller that is communicatively connected to the industrial mesh edge node via the Layer 2 Mesh link; Step S203: Identify the IP packets to be sent that have not been determined to be invalid by the link delay verification result as the verified packets, and write the corresponding emergency instruction tag, normal status data tag or background data tag into the packet metadata field of the verified packets.
[0009] Preferably, step S202, the step of obtaining the real-time round-trip latency of the 5G uplink, includes: Multiple round-trip delay samples are collected within a preset delay sampling window, and the multiple round-trip delay samples are arranged in order of sampling time; The median is selected from the sorted round-trip delay samples, and the median is determined as the real-time round-trip delay; Calculate the ratio of the real-time round-trip delay to the preset maximum allowable delay, limit the ratio to a range of 0 to 1, and use 1 to subtract the limited ratio to obtain a normalized link quality indicator value. Write the normalized link quality indicator value into the link quality field of the verified message.
[0010] Preferably, step S30, which involves performing a buffer write preprocessing task based on the verified message and the global sending buffer pool using a semantic preemption and payload reduction write mechanism, and outputting a sequence of messages to be sent consisting of the high-priority queue and the low-priority queue, specifically includes: Step S301: Read the priority tag of the verified message, write the target corresponding to the verified message with the emergency instruction tag into the queue and determine it as the high priority queue, and write the target corresponding to the verified message with the normal status data tag or the background data tag into the queue and determine it as the low priority queue. Step S302: When the remaining capacity of the high-priority queue is less than the message length of the emergency instruction tag message to be written, obtain the dwell time, the difference in characteristics between adjacent similar sensors, and the preset retention priority of each background data tag message in the low-priority queue; determine the deletion order of each background data tag message according to the dwell time, the difference in characteristics between adjacent similar sensors, and the preset retention priority, wherein the background data tag message with the longer dwell time, the smaller the difference in characteristics between adjacent similar sensors, and the lower the preset retention priority, is placed earlier in the deletion order; delete at least one background data tag message according to the deletion order until the high-priority queue obtains available capacity to meet the writing requirements of the emergency instruction tag message; Step S303: Write the emergency instruction tag message into the high priority queue; for the verified message with the normal status data tag or the background data tag, convert the payload data of the corresponding verified message from the first numerical precision to the second numerical precision which is lower than the first numerical precision, update the message length field and the verification field of the corresponding verified message according to the converted payload data, and write the updated verified message into the low priority queue to obtain the message sequence to be sent.
[0011] Preferably, in step S40, the step of executing a queue scheduling task based on a weighted delay scheduling mechanism linked to occupancy, using the sequence of messages to be sent and the dynamic threshold of the global sending buffer pool, and outputting the priority forwarding message, specifically includes: Step S401: When a message transmission interruption is triggered, read the current occupancy of the high-priority queue, the first waiting time of the first message in the high-priority queue, and the second waiting time of the first message in the low-priority queue. Step S402: Calculate the ratio of the current occupancy to the dynamic threshold to obtain the high-priority queue occupancy ratio; adjust the scheduling weights corresponding to the high-priority queue and the low-priority queue according to the high-priority queue occupancy ratio, and determine the scheduling priority values of the two queue head messages according to the first waiting time, the second waiting time and the corresponding scheduling weights, wherein when the high-priority queue occupancy ratio increases, the scheduling weight corresponding to the high-priority queue increases; Step S403: Compare the scheduling priority values of the two queue-first messages, and determine the queue-first message with the larger scheduling priority value as the priority forwarding message; when the scheduling priority values of the two queue-first messages are the same, determine the queue-first message in the high-priority queue as the priority forwarding message, and send the priority forwarding message via the 5G uplink.
[0012] Preferably, step S50, which involves obtaining the dwell time of the priority forwarding packets and each packet in the low-priority queue, performing adaptive aging processing and Mesh neighbor node collaborative forwarding processing based on the forwarding results and dwell time, and outputting the collaboratively forwarded packets sent uplink by the Mesh neighbor nodes, specifically includes: Step S501: Obtain the current occupancy and current dynamic threshold of the high-priority queue; calculate the adaptive aging threshold based on the current occupancy and the current dynamic threshold; mark packets in the low-priority queue whose dwell time reaches the adaptive aging threshold as aging packets, the adaptive aging threshold being calculated according to the following formula: in, The current sampling time The adaptive aging threshold; This is the current sampling time; The preset baseline aging time; The current sampling time The usage of high-priority queues; The current sampling time The current dynamic threshold, and , ; Step S502: Identify the priority forwarding packets with failed forwarding results and the aging packets as packets to be coordinated; query the Mesh peer node list maintained according to the IEEE 802.11s protocol, obtain the high priority queue occupancy ratio and Mesh link quality indicator value of each Mesh neighbor node in the Mesh peer node list, filter candidate neighbor nodes whose high priority queue occupancy ratio is lower than the preset occupancy ratio threshold, and select the candidate neighbor node with the largest Mesh link quality indicator value as the cooperating node from the candidate neighbor nodes; Step S503: Generate a Mesh cooperative forwarding frame based on the message to be coordinated, and send the Mesh cooperative forwarding frame to the cooperative node so that the cooperative node performs duplicate message verification on the message to be coordinated, and after the duplicate message verification passes, send the message to be coordinated through the 5G uplink of the cooperative node, and output the cooperative forwarding message.
[0013] This invention also provides a 5G wireless broadband routing system supporting multi-level Mesh networking, the system comprising: The dynamic boundary buffer pool construction module is used to obtain the shared physical memory space of the industrial Mesh edge nodes, and to perform queue construction tasks based on the shared physical memory space using a bidirectional growth dynamic boundary buffer partitioning mechanism, outputting a global sending buffer pool including high-priority queues and low-priority queues. The message classification module is used to obtain the IP message to be sent, and to perform the message classification task based on the IP message to be sent and the queue type of the global sending buffer pool using the message semantic tag recognition and link delay verification mechanism, and output the verified message with priority tag; The buffer write preprocessing module is used to perform buffer write preprocessing tasks based on the verified message and the global send buffer pool using a semantic preemption and load reduction write mechanism, and output a sequence of messages to be sent consisting of the high-priority queue and the low-priority queue. The queue scheduling module is used to perform queue scheduling tasks based on the sequence of messages to be sent and the dynamic threshold of the global sending buffer pool using a weighted delay scheduling mechanism linked to occupancy, and output messages to be forwarded preferentially. The collaborative forwarding module is used to obtain the dwell time of the priority forwarding packets and each packet in the low priority queue, perform adaptive aging processing and Mesh neighbor node collaborative forwarding processing based on the forwarding results and dwell time, and output the collaborative forwarding packets sent by the Mesh neighbor nodes on their behalf.
[0014] The present invention also provides a 5G wireless broadband routing device supporting multi-level mesh networking. The 5G wireless broadband routing device supporting multi-level mesh networking includes: a memory, a processor, and a 5G wireless broadband routing program supporting multi-level mesh networking stored in the memory and executable on the processor. When the 5G wireless broadband routing program supporting multi-level mesh networking is executed by the processor, it implements the above-described method.
[0015] The present invention also provides a computer program product, the computer program product including a 5G wireless broadband routing program that supports multi-level Mesh networking, the 5G wireless broadband routing program that supports multi-level Mesh networking implementing the above method when executed by a processor.
[0016] The beneficial effects of this invention are as follows: This invention organizes the same continuous physical address range into a bidirectionally growing high-priority queue and a low-priority queue, and adjusts the dynamic boundary address according to the uplink quality and the average enqueue rate of high-priority packets, so that the available capacity of the limited shared physical memory can change with the actual emergency traffic and link conditions, without the need to reserve a fixed and potentially idle memory range for the two queues.
[0017] This invention combines the message semantics corresponding to the service code, port number, and application layer payload identifier with link latency verification, so that emergency commands, regular status data, and background data obtain clear priority labels before entering the queue; for emergency commands that cannot meet the latency requirements of the current uplink, they can be redirected to the programmable logic controller that communicates with the industrial Mesh edge node, reducing invalid uplink queuing.
[0018] This invention determines the writing queue based on priority tags, and when the capacity of the high-priority queue is insufficient, it determines the deletion order according to the residence time of background data messages, the difference in characteristics of adjacent similar sensors, and the preset retention priority; at the same time, it reduces the payload accuracy of low-priority messages, so that while urgent messages can obtain writing space, more representative regular and background data are retained.
[0019] This invention incorporates the occupancy ratio of high-priority queues, the waiting time of the first messages in both queues, and dynamic thresholds into the same scheduling process. The scheduling weight is adjusted according to the occupancy ratio of high-priority queues, enabling faster clearing of backlogged urgent messages. The waiting time of the first messages in low-priority queues is also retained in the scheduling criteria.
[0020] This invention includes priority forwarding packets that fail to forward locally and low priority packets that reach the adaptive aging threshold in the list of packets to be coordinated. It selects coordination nodes based on the high priority queue occupancy ratio of candidate neighbor nodes and the quality of the Mesh link, so that uplink transmission can still be completed through controllable Mesh neighbor nodes even under local congestion or link abnormalities. Attached Figure Description
[0021] Figure 1 This is a flowchart illustrating the first embodiment of a 5G wireless broadband routing method supporting multi-level Mesh networking according to the present invention. Detailed Implementation
[0022] The technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments.
[0023] Based on the embodiments of this invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this invention.
[0024] Example 1: As Figure 1 The diagram shown is a flowchart of a first embodiment of a 5G wireless broadband routing method supporting multi-level Mesh networking according to the present invention.
[0025] In the first embodiment, the 5G wireless broadband routing method supporting multi-level Mesh networking includes: Step S10: Obtain the shared physical memory space of the industrial Mesh edge node, and perform a queue construction task based on the shared physical memory space using a bidirectional growth dynamic boundary buffer partitioning mechanism, outputting a global sending buffer pool including high-priority queues and low-priority queues; Shared physical memory space refers to a contiguous range of physical addresses within an industrial mesh edge node that can be uniformly allocated and released by sending tasks. The bidirectionally growing dynamic boundary buffer partitioning does not permanently divide memory into two fixed-size regions. Instead, it configures the contiguous physical address range as a global sending buffer pool: high-priority queues grow from low to high addresses, and low-priority queues grow from high to low addresses, with a dynamically allocated boundary address reserved between them that can move with the running status. In this way, high-priority and low-priority packets use the same memory pool without overwriting each other due to confusion in their respective queue head positions and growth directions.
[0026] During queue construction, the system first acquires shared physical memory space and divides it into contiguous physical address ranges; then, it attaches these ranges to high-priority queues and low-priority queues respectively. Subsequently, it collects 5G uplink quality indicators and the average enqueue rate of the high-priority queue within a preset sliding time window. The dynamic threshold is jointly determined by a preset safety lower limit, a preset capacity upper limit, a preset steepness coefficient, a preset link quality threshold, the current link quality indicator, the average enqueue rate, and a preset peak enqueue rate: when the link quality is close to or below the preset threshold, the threshold changes more cautiously; when the average enqueue rate of the high-priority queue approaches the peak enqueue rate, the threshold is adjusted towards the capacity upper limit. The system determines the physical address corresponding to this dynamic threshold as the dynamic boundary address between the two queues.
[0027] The output of the global send buffer pool simultaneously retains the address correspondence between high-priority queues, low-priority queues, and dynamic thresholds. Therefore, step S20 can mark packets according to queue type, step S30 can determine the write space, step S40 can use the dynamic threshold to calculate the high-priority queue occupancy ratio, and step S50 can also determine the adaptive aging threshold accordingly. The dynamic threshold does not remain at the result of a single memory allocation but becomes a common capacity benchmark throughout subsequent packet classification, writing, scheduling, and aging processes.
[0028] Traditional fixed partitioning typically allocates fixed capacity to both high-priority and low-priority queues during the initialization phase. When emergency traffic is low, high-priority partitions may remain idle for extended periods; conversely, during periods of sudden emergency traffic surges, even if low-priority partitions still have available space, they cannot be directly utilized by high-priority packets. This approach, using the same contiguous physical address range as a basis and moving the boundary addresses according to link quality and average inbound rate, allows limited memory to be more closely aligned with the current service load, avoiding the capacity rigidity caused by fixed partitioning.
[0029] For example, when the uplink quality of an industrial mesh edge node remains stable and there are few emergency control messages within a 50ms sliding time window, the system maintains the dynamic boundary address close to the safety lower limit, allowing the low-priority queue to accommodate more periodic status data. If a device failure triggers a series of emergency shutdown and protection switching commands, the average enqueue rate increases. The system adjusts the dynamic threshold based on the proportion of the peak enqueue rate, moving the dynamic boundary address to a higher address, and the high-priority queue immediately gains additional available space. Throughout this process, both queues grow in opposite directions within the same continuous physical address range, without needing to reallocate memory or move existing messages.
[0030] Step S20: Obtain the IP packet to be sent, and perform packet classification task based on the IP packet to be sent and the queue type of the global sending buffer pool using the packet semantic tag recognition and link delay verification mechanism, and output the verified packet with priority tag; The IP packets to be sent refer to the network layer packets that industrial Mesh edge nodes are preparing to send via the 5G uplink. These packets can carry production line control commands, equipment status data, or background data. The packet semantic label recognition and link latency verification mechanism first reads the service code field, transport layer port number, and application layer payload identifier field from the packet. The service code field identifies the upper-layer service category, the port number distinguishes different data channels, and the application layer payload identifier field confirms the specific control or acquisition semantics. These three types of information are used together to label the IP packets to be sent as emergency command tags, regular status data tags, or background data tags.
[0031] For IP packets to be sent with an emergency instruction tag, the system also acquires the real-time round-trip latency of the 5G uplink. The real-time round-trip latency is not calculated using a single, random sample value, but rather by collecting multiple round-trip latency samples within a preset latency sampling window, arranging them by sampling time, and then selecting the median as the real-time round-trip latency to reduce the impact of spike fluctuations on the verification results. The system subtracts a preset local processing reserve time from the preset maximum allowable latency to obtain the available link latency. If the real-time round-trip latency is greater than the available link latency, the link latency verification result of the emergency packet is determined to be invalid, and it is sent to the programmable logic controller communicating with the edge node via a Layer 2 Mesh link.
[0032] For IP packets whose verification results are not determined to be invalid, the system identifies them as verified packets and writes an emergency instruction tag, a normal status data tag, or a background data tag into the packet metadata field. The verified packets output in step S20 not only have tags that can be selected for writing to the queue in step S30, but also retain a normalized link quality indicator value. This indicator value is obtained by subtracting the limit value from one after limiting the ratio of real-time round-trip delay to the preset maximum allowable delay, thus corresponding to the dynamic threshold adjustment in step S10.
[0033] When traffic is routed solely by port number or fixed network priority, edge nodes can only know which channel a packet comes from, making it difficult to distinguish between emergency control actions and regular data updates within the same channel. Furthermore, checking link latency only after packets have been queued can cause emergency packets unsuitable for 5G uplink to occupy local write and scheduling opportunities. This step performs semantic recognition and latency verification before queuing, ensuring that subsequent writes and scheduling deal with packets that are clearly categorized and have had their available paths determined.
[0034] For example, in an automotive welding production line, a message's service code and port number correspond to the welding fixture's emergency stop control, and the application layer load identifier also matches the emergency control type. The system writes it as an emergency command tag. If multiple round-trip samples collected in the latency sampling window show an abnormally high value due to wireless interference, but the median is still lower than the available link latency, the message is retained as a verified message and proceeds to step S30. If the median in subsequent windows exceeds the available link latency, similar messages will no longer occupy the 5G transmission queue, but will instead directly reach the programmable logic controller of the communication connection via a Layer 2 Mesh link, avoiding waiting for an uplink that can no longer meet the control time limit.
[0035] Step S30: Based on the verified message and the global sending buffer pool, a semantic preemption and load reduction writing mechanism is used to perform a buffer writing preprocessing task, and output a sequence of messages to be sent consisting of the high-priority queue and the low-priority queue; The semantic preemption and payload reduction write mechanism is used to arrange the entry of verified messages into the global transmission buffer pool based on their priority tags. Urgent instruction tags correspond to high-priority queues, while regular status data tags and background data tags correspond to low-priority queues. This mapping is not a simple message sorting, but rather implements the semantic classification result of step S20 into different memory write paths, enabling step S40 to directly compare the waiting states of the first two queue messages.
[0036] When the remaining capacity of the high-priority queue is insufficient to write emergency instruction tag messages, the system does not release memory in random order. Instead, it reads the residence time, the difference in characteristics between adjacent similar sensors, and the preset retention priority of each background data tag message in the low-priority queue. A longer residence time indicates lower real-time requirements; a smaller difference in characteristics between adjacent similar sensors indicates less information difference between the message and adjacent similar records; and a lower preset retention priority indicates lower business necessity for retaining the message. The system determines the deletion order based on these three factors, prioritizing the deletion of background data tag messages with long residence times, small characteristic differences, and low retention priorities, until sufficient capacity is available to meet the requirements for writing emergency messages.
[0037] For messages with verified status data tags or background data tags, the system converts the payload data from a first numerical precision to a second numerical precision lower than the first, and updates the message length field and checksum field accordingly before writing it into the low-priority queue. The meaning of payload reduction writing is to ensure that the message length and checksum field are consistent with the converted actual payload before entering the low-priority queue, preventing the receiver from treating the old length or old checksum field as valid information. After the high and low priority queues are written, they together form a sequence of messages to be sent, which is then scheduled in step S40.
[0038] Traditional buffer pools typically employ tail-drop or first-in-first-out (FIFO) strategies when capacity is insufficient. This might delete newly arrived monitoring data that shows significant changes, or cause urgent control commands to wait due to a lack of available space. Here, the deletion order considers dwell time, the difference in characteristics between adjacent similar sensors, and retention priority. It releases relatively old data that shows minimal change and has low business importance. For low-priority messages that do not require preemption, precision reduction is used instead of direct deletion, ensuring that necessary state change clues are preserved even under resource constraints.
[0039] For example, a high-priority queue in a semiconductor packaging line needs to write a device protection command, but the remaining capacity is insufficient. The low-priority queue contains two background temperature messages: the first has been resident for a long time, has a small difference in characteristics with the second message from a similar sensor, and has a low retention priority; the second was recently acquired and shows significant temperature changes. The system prioritizes the first message before deleting it, freeing up space before writing the protection command. Simultaneously, it performs precision conversion on the regular status messages to be written, updates the length and check fields, and then writes them to the low-priority queue. This way, the protection command gets an immediate opportunity to be written, and temperature records with significant changes are not lost due to simple queue discarding.
[0040] Step S40: Based on the sequence of messages to be sent and the dynamic threshold of the global sending buffer pool, a weighted delay scheduling mechanism linked to occupancy is used to execute the queue scheduling task and output the priority forwarding messages; The weighted delay scheduling mechanism linked to occupancy operates when a packet transmission interruption is triggered. An interruption indicates that the current transmission opportunity has arrived. The system reads the current occupancy of the high-priority queue, the first waiting time of the first packet in the high-priority queue, and the second waiting time of the first packet in the low-priority queue. The current occupancy reflects the backlog of urgent traffic in the high-priority queue, and the two waiting times reflect the dwell time of the first packets in each queue. These three factors work together to avoid unchanging service ordering based solely on fixed labels.
[0041] The system compares the current occupancy of the high-priority queue with a dynamic threshold to obtain the high-priority queue occupancy ratio. When this ratio increases, the system increases the scheduling weight corresponding to the high-priority queue and adjusts the scheduling weight of the low-priority queue accordingly. Then, it determines the scheduling priority value of the first message in each queue by combining the first waiting time, the second waiting time, and their respective weights. The first message in the queue with the larger scheduling priority value is determined as the priority forwarding message; if the two priority values are the same, to ensure the determinism of emergency control, the first message in the high-priority queue is selected and sent via the 5G uplink.
[0042] The output of step S40 is a priority forwarding message that can be immediately sent uplink, rather than just an abstract sorting result. This output enables step S50 to identify messages requiring collaborative processing based on whether forwarding was successful, and also allows the capacity information of the dynamic threshold to truly participate in the sending decision. The dynamic boundary address in step S10 determines the capacity baseline of the high-priority queue, step S30 forms a sequence of messages to be sent consisting of two queues, and step S40 then converts the occupancy ratio and waiting time into specific sending objects, maintaining continuity between the input and output.
[0043] Strict priority scheduling can suppress low-priority queues for extended periods when high-priority traffic continues to arrive, while scheduling based solely on waiting time may weaken the timeliness of control commands when urgent packets are piling up. This step allows the proportion of high-priority queue occupancy to determine the direction of weight adjustment, while still retaining the second waiting time of the first low-priority packet as a scheduling factor. When urgent traffic is significantly piling up, scheduling weights are tilted towards high priorities; when high-priority backlog is not significant but the first low-priority packet has been waiting for a long time, low-priority packets can still have a chance to be sent in the scheduling priority comparison.
[0044] For example, on a textile machinery production line, edge nodes continuously receive yarn breakage protection commands and weft density background data. When a yarn breakage event occurs, the current occupancy of the high-priority queue approaches the dynamic threshold, and the system increases the scheduling weight of the high-priority queue. Even if the head of a low-priority queue has already waited for a certain period of time, the protection command is still prioritized for forwarding due to its higher scheduling priority. After the yarn breakage event ends, the occupancy rate of the high-priority queue decreases, and the waiting time of the head of the low-priority queue gradually reflects in the priority value, allowing the backlogged weft density background data to be selected for transmission. This process does not require maintaining a separate, complex time wheel; it only relies on the current occupancy rate and the waiting status of the head of the queue to complete the selection.
[0045] Step S50: Obtain the dwell time of the priority forwarding message and each message in the low priority queue, perform adaptive aging processing and Mesh neighbor node collaborative forwarding processing according to the forwarding result and the dwell time, and output the collaborative forwarding message sent by the Mesh neighbor node on behalf of the uplink. Adaptive aging and Mesh neighbor node collaborative forwarding are used to address two types of packets that cannot be sent locally in a timely manner: one type is packets identified as priority forwarding in step S40 but which fail to forward; the other type is packets that have been residing in low-priority queues for a long time and have reached the aging conditions. The system reads the current occupancy and current dynamic threshold of the high-priority queue and determines the adaptive aging threshold based on a preset baseline aging time. The closer the high-priority queue occupancy is to the current dynamic threshold, the more strained the local sending resources are, and the adaptive aging threshold is shortened accordingly. The current dynamic threshold is always greater than zero, and the current occupancy does not exceed the current dynamic threshold to ensure that the aging judgment has a clear capacity boundary.
[0046] Packets whose dwell time in the low-priority queue reaches the adaptive aging threshold are marked as aging packets. The system identifies both failed forwarding priority packets and aging packets as packets to be coordinated, and then queries the Mesh peer node list maintained according to the IEEE 802.11s protocol. For each Mesh neighbor node in the list, the system reads its high-priority queue occupancy ratio and Mesh link quality indicator value, first filtering candidate neighbor nodes whose occupancy ratio is lower than a preset occupancy ratio threshold, and then selecting the node with the largest Mesh link quality indicator value from the candidate nodes as the cooperating node.
[0047] After determining the coordinating node, the system generates a Mesh coordinating forwarding frame based on the message to be coordinated and sends it to the coordinating node. The coordinating node performs duplicate message verification on the message to be coordinated. Only when the duplicate message verification passes will the message to be coordinated be sent through the 5G uplink of the coordinating node, and a coordinating forwarding message will be output. The purpose of duplicate message verification is to prevent the same message from being repeatedly sent uplink in scenarios such as local retries, aging forwarding, and multiple neighbor forwarding. The coordinating forwarding message is the traceable result output by step S50, which can be used to confirm from which neighbor node the message has obtained the uplink transmission opportunity.
[0048] Traditional processing typically only performs local retries when priority packet forwarding fails, while low-priority packets may continue to occupy buffers or be passively dropped when they remain in the queue for extended periods. Fixed aging times also fail to reflect the true congestion level of high-priority queues. This step correlates the aging threshold with current occupancy and dynamic thresholds, while simultaneously considering the high-priority queue occupancy ratio of neighboring nodes and the quality of the mesh link. This ensures that coordinated forwarding is not blind broadcasting, but rather a forwarding selection constrained by both local congestion status and the availability of candidate neighbors.
[0049] For example, in an automotive assembly workshop, an edge node continuously processes robot calibration commands. The high-priority queue occupancy is approaching the current dynamic threshold, while vehicle posture background messages in the low-priority queue have been lingering for a considerable time. Based on this, the system shortens the adaptive aging threshold and marks the message as an aging message. The Mesh peer node list shows that neighboring node B's high-priority queue occupancy is below the preset threshold, and its Mesh link quality indicator value is higher than other candidate nodes. The system selects node B as the cooperating node. The message to be cooperated generates a Mesh cooperative forwarding frame and sends it to node B. Node B, after verifying against duplicate messages, sends the frame via its own 5G uplink, outputting the cooperative forwarding message. If a local priority forwarding message also enters the cooperating set due to uplink failure, it is processed using the same selection process.
[0050] Example 2: Furthermore, the present invention provides a 5G wireless broadband routing system supporting multi-level mesh networking, employing a 5G wireless broadband routing method supporting multi-level mesh networking as described in the above embodiments, which can solve the technical problem of 5G wireless broadband routing supporting multi-level mesh networking. The beneficial effects of the 5G wireless broadband routing system supporting multi-level mesh networking provided by the present invention are the same as those of the 5G wireless broadband routing method supporting multi-level mesh networking provided in the above embodiments, and other technical features of the 5G wireless broadband routing system supporting multi-level mesh networking are the same as those disclosed in the methods of the above embodiments, and will not be repeated here.
[0051] Example 3: This invention provides a 5G wireless broadband routing device supporting multi-level mesh networking. The device includes at least one processor and a memory communicatively connected to the processor. The memory stores instructions executable by the processor, which in turn execute the instructions to enable the processor to perform the 5G wireless broadband routing method supporting multi-level mesh networking described in Example 1. The 5G wireless broadband routing device supporting multi-level mesh networking in this invention can include, but is not limited to, mobile terminals such as mobile phones, laptops, digital radio receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Description), PMPs (Portable Media Players), and in-vehicle terminals (e.g., in-vehicle navigation terminals), as well as fixed terminals such as digital TVs and desktop computers. This 5G wireless broadband routing device supporting multi-level mesh networking is merely an example and should not limit the functionality or scope of the invention. A 5G wireless broadband routing device supporting multi-level mesh networking may include a processing unit (e.g., a central processing unit, a graphics processing unit, etc.) that can perform various appropriate actions and processes based on programs stored in read-only memory or programs loaded from storage devices into random access memory. The random access memory also stores various programs and data required for the operation of the 5G wireless broadband routing device supporting multi-level mesh networking. The processing unit, read-only memory, and random access memory are interconnected via a bus. I / O interfaces are also connected to the bus. Typically, the following systems can be connected to the I / O interface: input devices including touchscreens, touchpads, keyboards, mice, image sensors, microphones, accelerometers, gyroscopes, etc.; output devices including liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices including magnetic tapes, hard disks, etc.; and communication devices. The communication device allows the 5G wireless broadband routing device supporting multi-level mesh networking to exchange data with other devices wirelessly or via wired communication. While a 5G wireless broadband routing device supporting multi-level mesh networking with various systems has been described, it should be understood that the implementation or presence of all the described systems is not required. Alternatively, more or fewer systems may be implemented.
[0052] Example 4: This invention also provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the 5G wireless broadband routing method supporting multi-level Mesh networking as described above. The computer program product provided by this invention can solve the technical problem of 5G wireless broadband routing supporting multi-level Mesh networking. Compared with the prior art, the beneficial effects of the computer program product provided by this invention are the same as those of the 5G wireless broadband routing method supporting multi-level Mesh networking provided in the above embodiments, and will not be repeated here.
[0053] In particular, according to the embodiments disclosed in this invention, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this invention include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device, or installed from a storage device, or installed from a read-only memory. When the computer program is executed by a processing device, it performs the functions defined in the methods of the embodiments disclosed in this invention.
[0054] It should be understood that the various parts disclosed in this invention can be implemented using hardware, software, firmware, or a combination thereof. In the description of the above embodiments, specific features, structures, materials, or characteristics may be combined in any suitable manner in one or more embodiments or examples.
[0055] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Therefore, if these modifications and variations fall within the scope of the present invention and its equivalents, the present invention also intends to include these modifications and variations.
Claims
1. A 5G wireless broadband routing method supporting multi-level Mesh networking, characterized in that, The method includes: Step S10: Obtain the shared physical memory space of the industrial Mesh edge node, and perform a queue construction task based on the shared physical memory space using a bidirectional growth dynamic boundary buffer partitioning mechanism, outputting a global sending buffer pool including high-priority queues and low-priority queues; Step S20: Obtain the IP packet to be sent, and perform packet classification task based on the IP packet to be sent and the queue type of the global sending buffer pool using the packet semantic tag recognition and link delay verification mechanism, and output the verified packet with priority tag; Step S30: Based on the verified message and the global sending buffer pool, a semantic preemption and load reduction writing mechanism is used to perform a buffer writing preprocessing task, and output a sequence of messages to be sent consisting of the high-priority queue and the low-priority queue; Step S40: Based on the sequence of messages to be sent and the dynamic threshold of the global sending buffer pool, a weighted delay scheduling mechanism linked to occupancy is used to execute the queue scheduling task and output the priority forwarding messages; Step S50: Obtain the dwell time of the priority forwarding packets and each packet in the low priority queue, perform adaptive aging processing and Mesh neighbor node collaborative forwarding processing based on the forwarding results and dwell time, and output the collaborative forwarding packets sent by the Mesh neighbor nodes on their behalf.
2. The 5G wireless broadband routing method supporting multi-level Mesh networking as described in claim 1, characterized in that, In step S10, the shared physical memory space of the industrial Mesh edge nodes is obtained. Based on the shared physical memory space, a queue construction task is performed using a bidirectional growth dynamic boundary buffer partitioning mechanism. The step of outputting a global sending buffer pool including high-priority queues and low-priority queues specifically includes: Step S101: Divide a continuous physical address range from the shared physical memory space and configure the continuous physical address range as the global send buffer pool; Step S102: Divide the global send buffer pool into the high-priority queue and the low-priority queue. Set the head of the high-priority queue at the low address end of the continuous physical address range and make the high-priority queue grow from the low address end to the high address end. Set the head of the low-priority queue at the high address end of the continuous physical address range and make the low-priority queue grow from the high address end to the low address end. Step S103: Collect the 5G uplink quality indicator value and the average enqueue rate of the high-priority queue; calculate the dynamic threshold based on the 5G uplink quality indicator value and the average enqueue rate; and determine the physical address corresponding to the dynamic threshold in the continuous physical address interval as the dynamic boundary address between the high-priority queue and the low-priority queue. The dynamic threshold is calculated according to the following formula: in, The current sampling time The dynamic threshold, and represents the available capacity of the high-priority queue calculated from the low address end of the continuous physical address range; This is the current sampling time; To preset the lower safety limit; This is the preset maximum capacity value, and ; To preset the steepness coefficient, and ; This is a preset link quality threshold; The current sampling time 5G uplink quality indicator value; The current sampling time The average enqueue rate of the high-priority queue within the previously preset sliding time window; The preset peak inbound rate; Represented by natural constant An exponential function with base 0; This indicates taking the minimum value among the values within the parentheses.
3. The 5G wireless broadband routing method supporting multi-level Mesh networking as described in claim 1, characterized in that, Step S20 involves obtaining the IP packet to be sent, performing packet classification based on the IP packet to be sent and the queue type of the global sending buffer pool using a packet semantic tag recognition and link delay verification mechanism, and outputting the verified packet with a priority tag. Specifically, this includes: Step S201: Parse the service code field, transport layer port number and application layer payload identifier field in the IP packet to be sent, and determine the priority label of the IP packet to be sent as an emergency instruction label, a normal status data label or a background data label based on the parsing result; Step S202: For an IP packet to be sent with the emergency instruction tag, obtain the real-time round-trip time of the 5G uplink, determine the difference between the preset maximum allowable time and the preset local processing reserved time as the available link time, and compare the real-time round-trip time with the available link time; when the real-time round-trip time is greater than the available link time, determine the link time verification result of the corresponding IP packet to be sent as invalid, and send the corresponding IP packet to be sent to the programmable logic controller that is communicatively connected to the industrial mesh edge node via the Layer 2 Mesh link; Step S203: Identify the IP packets to be sent that have not been determined to be invalid by the link delay verification result as the verified packets, and write the corresponding emergency instruction tag, normal status data tag or background data tag into the packet metadata field of the verified packets.
4. A 5G wireless broadband routing method supporting multi-level Mesh networking as described in claim 3, characterized in that, In step S202, the steps for obtaining the real-time round-trip latency of the 5G uplink include: Multiple round-trip delay samples are collected within a preset delay sampling window, and the multiple round-trip delay samples are arranged in order of sampling time; The median is selected from the sorted round-trip delay samples, and the median is determined as the real-time round-trip delay; Calculate the ratio of the real-time round-trip delay to the preset maximum allowable delay, limit the ratio to a range of 0 to 1, and use 1 to subtract the limited ratio to obtain a normalized link quality indicator value. Write the normalized link quality indicator value into the link quality field of the verified message.
5. A 5G wireless broadband routing method supporting multi-level Mesh networking as described in claim 3, characterized in that, Step S30, which involves performing a buffer write preprocessing task based on the verified message and the global sending buffer pool using a semantic preemption and payload reduction write mechanism, and outputting a sequence of messages to be sent consisting of the high-priority queue and the low-priority queue, specifically includes: Step S301: Read the priority tag of the verified message, write the target corresponding to the verified message with the emergency instruction tag into the queue and determine it as the high priority queue, and write the target corresponding to the verified message with the normal status data tag or the background data tag into the queue and determine it as the low priority queue. Step S302: When the remaining capacity of the high-priority queue is less than the message length of the emergency instruction tag message to be written, obtain the dwell time, the difference in characteristics between adjacent similar sensors, and the preset retention priority of each background data tag message in the low-priority queue; determine the deletion order of each background data tag message according to the dwell time, the difference in characteristics between adjacent similar sensors, and the preset retention priority, wherein the background data tag message with the longer dwell time, the smaller the difference in characteristics between adjacent similar sensors, and the lower the preset retention priority, is placed earlier in the deletion order; delete at least one background data tag message according to the deletion order until the high-priority queue obtains available capacity to meet the writing requirements of the emergency instruction tag message; Step S303: Write the emergency instruction tag message into the high priority queue; for the verified message with the normal status data tag or the background data tag, convert the payload data of the corresponding verified message from the first numerical precision to the second numerical precision which is lower than the first numerical precision, update the message length field and the verification field of the corresponding verified message according to the converted payload data, and write the updated verified message into the low priority queue to obtain the message sequence to be sent.
6. A 5G wireless broadband routing method supporting multi-level Mesh networking as described in claim 1, characterized in that, In step S40, the queue scheduling task is executed using a weighted delay scheduling mechanism linked to occupancy, based on the sequence of messages to be sent and the dynamic threshold of the global sending buffer pool, and the steps for outputting prioritized forwarding messages are specifically included: Step S401: When a message transmission interruption is triggered, read the current occupancy of the high-priority queue, the first waiting time of the first message in the high-priority queue, and the second waiting time of the first message in the low-priority queue. Step S402: Calculate the ratio of the current occupancy to the dynamic threshold to obtain the high-priority queue occupancy ratio; adjust the scheduling weights corresponding to the high-priority queue and the low-priority queue according to the high-priority queue occupancy ratio, and determine the scheduling priority values of the two queue head messages according to the first waiting time, the second waiting time and the corresponding scheduling weights, wherein when the high-priority queue occupancy ratio increases, the scheduling weight corresponding to the high-priority queue increases; Step S403: Compare the scheduling priority values of the two queue-first messages, and determine the queue-first message with the larger scheduling priority value as the priority forwarding message; when the scheduling priority values of the two queue-first messages are the same, determine the queue-first message in the high-priority queue as the priority forwarding message, and send the priority forwarding message via the 5G uplink.
7. A 5G wireless broadband routing method supporting multi-level Mesh networking as described in claim 1, characterized in that, Step S50 involves obtaining the dwell time of the prioritized forwarding packets and each packet in the low-priority queue, performing adaptive aging processing and Mesh neighbor node collaborative forwarding processing based on the forwarding results and dwell time, and outputting the collaboratively forwarded packets sent uplink by the Mesh neighbor nodes. Specifically, this includes: Step S501: Obtain the current occupancy and current dynamic threshold of the high-priority queue; calculate the adaptive aging threshold based on the current occupancy and the current dynamic threshold; mark packets in the low-priority queue whose dwell time reaches the adaptive aging threshold as aging packets, the adaptive aging threshold being calculated according to the following formula: in, The current sampling time The adaptive aging threshold; This is the current sampling time; The preset baseline aging time; The current sampling time The usage of high-priority queues; The current sampling time The current dynamic threshold, and , ; Step S502: Identify the priority forwarding packets with failed forwarding results and the aging packets as packets to be coordinated; query the Mesh peer node list maintained according to the IEEE 802.11s protocol, obtain the high priority queue occupancy ratio and Mesh link quality indicator value of each Mesh neighbor node in the Mesh peer node list, filter candidate neighbor nodes whose high priority queue occupancy ratio is lower than the preset occupancy ratio threshold, and select the candidate neighbor node with the largest Mesh link quality indicator value as the cooperating node from the candidate neighbor nodes; Step S503: Generate a Mesh cooperative forwarding frame based on the message to be coordinated, and send the Mesh cooperative forwarding frame to the cooperative node so that the cooperative node performs duplicate message verification on the message to be coordinated, and after the duplicate message verification passes, send the message to be coordinated through the 5G uplink of the cooperative node, and output the cooperative forwarding message.
8. A 5G wireless broadband routing system supporting multi-level mesh networking, applied to the 5G wireless broadband routing method supporting multi-level mesh networking as described in any one of claims 1 to 7, characterized in that, The 5G wireless broadband routing system supporting multi-level Mesh networking includes: The dynamic boundary buffer pool construction module is used to obtain the shared physical memory space of the industrial Mesh edge nodes, and to perform queue construction tasks based on the shared physical memory space using a bidirectional growth dynamic boundary buffer partitioning mechanism, outputting a global sending buffer pool including high-priority queues and low-priority queues. The message classification module is used to obtain the IP message to be sent, and to perform the message classification task based on the IP message to be sent and the queue type of the global sending buffer pool using the message semantic tag recognition and link delay verification mechanism, and output the verified message with priority tag; The buffer write preprocessing module is used to perform buffer write preprocessing tasks based on the verified message and the global send buffer pool using a semantic preemption and load reduction write mechanism, and output a sequence of messages to be sent consisting of the high-priority queue and the low-priority queue. The queue scheduling module is used to perform queue scheduling tasks based on the sequence of messages to be sent and the dynamic threshold of the global sending buffer pool using a weighted delay scheduling mechanism linked to occupancy, and output messages to be forwarded preferentially. The collaborative forwarding module is used to obtain the dwell time of the priority forwarding packets and each packet in the low priority queue, perform adaptive aging processing and Mesh neighbor node collaborative forwarding processing based on the forwarding results and dwell time, and output the collaborative forwarding packets sent by the Mesh neighbor nodes on their behalf.
9. A 5G wireless broadband routing device supporting multi-level Mesh networking, characterized in that, The 5G wireless broadband routing device supporting multi-level Mesh networking includes: a memory, a processor, and a 5G wireless broadband routing program supporting multi-level Mesh networking stored in the memory and executable on the processor. When the 5G wireless broadband routing program supporting multi-level Mesh networking is executed by the processor, it implements a 5G wireless broadband routing method supporting multi-level Mesh networking as described in any one of claims 1 to 7.
10. A computer program product, characterized in that, The computer program product includes a 5G wireless broadband routing program that supports multi-level Mesh networking. When the 5G wireless broadband routing program that supports multi-level Mesh networking is executed by a processor, it implements a 5G wireless broadband routing method that supports multi-level Mesh networking as described in any one of claims 1 to 7.
