Data continuous transmission dynamic routing calculation method for rectangular grid sequence cell elements

Abstract

The invention relates to a data continuous transmission dynamic routing calculation method for rectangular grid sequence cell elements, which comprises the following steps of: acquiring rectangular grid sequence cell element transmission parameters including the row number, the column number and the transmission period of a rectangular grid; each grid of the rectangular grid represents a cell element, and the cell element at the leftmost end of the rectangular grid is uniformly connected with a control center; dividing a transmission period according to the line number of the rectangular grid to obtain a single-line data transmission time period corresponding to each line in the rectangular grid; and in a corresponding single-row data transmission time period, according to a transmission path determination strategy, determining transmission path cells for the cells in the row sequentially through the cells in the rectangular grid along the forward direction, generating a data transmission path, and carrying out relay continuous transmission on the data of the cells in the same row. The method is suitable for a super-large-scale rectangular grid system, and an efficient and reliable routing solution is provided for a distributed system through a unique line-by-line timing transmission, dynamic local detour and path optimization and fault positioning integrated mechanism.

Description

Technical Field

[0001] This invention relates to the field of path planning technology, and in particular to a method for dynamic pathfinding calculation of data continuation in rectangular grid sequence cells. Background Technology

[0002] In distributed systems, especially those involving large matrix grid structures, efficient data transmission and routing are crucial technical requirements. These systems typically consist of a large number of individual units (called "cells") arranged in a rectangular grid, forming a multi-row, multi-column matrix structure. Each cell needs to periodically transmit its status information to a designated aggregation point, such as one side of the shorter side of the matrix, for real-time monitoring and data integration. As a distributed system topology, the core characteristic of the matrix grid structure is the relay-through of data between adjacent nodes to the target aggregation point. Grid-based relay transmission becomes a necessary solution.

[0003] Relay transmission relies on efficient routing algorithms. However, existing routing technologies suffer from several key technical drawbacks when applied to ultra-large-scale matrix mesh systems, significantly limiting the system's performance in terms of real-time performance, fault tolerance, transmission efficiency, and cross-scenario applicability. First, the primary drawback of existing technologies is their excessively high computational complexity, leading to insufficient real-time response capabilities. In ultra-large-scale matrix meshes, such as systems containing tens of thousands to hundreds of thousands of nodes, the surge in node numbers places extremely high demands on the computational efficiency of routing algorithms. However, mesh network-based minimization of maximum link congestion routing algorithms (such as SPMM and NSPMM) require analyzing all possible path combinations to optimize load balancing. In scenarios with a large node scale, this excessive complexity results in lengthy path planning times, making it difficult to meet the real-time requirements of periodic data acquisition. Similarly, while geographic model-based grid-oriented routing algorithms reduce some computational overhead through pre-calculated directions, their initialization and path generation processes still require traversing a large number of nodes. Especially when dynamically adjusting paths, the computational burden increases significantly with the growth of the mesh size. This high computational complexity stems directly from the algorithm's reliance on global or semi-global path optimization, limiting its application in distributed systems that require fast response times.

[0004] Second, the shortcomings of existing technologies in real-time fault tolerance significantly impact system stability and data integrity. In matrix grid systems, node failure is a common phenomenon, potentially caused by hardware aging, external interference, or other factors. Routing algorithms based on minimizing link congestion (such as SPMM / NSPMM) primarily focus on traffic distribution optimization during design, lacking rapid response mechanisms for dynamic faults. When a node fails, these algorithms must recalculate the global path, increasing computational overhead and potentially leading to path planning failure due to complex fault distribution. Geographic model grid routing algorithms rely on predefined grid structures and location information. If a large number of faulty nodes or irregular dead zones appear in the grid, path selection may be interrupted due to the lack of dynamic detour mechanisms or reduced efficiency due to excessively long detour paths. This lack of fault tolerance directly makes it difficult to guarantee reliable data transmission from all normal nodes during long-term system operation, especially evident in scenarios requiring full grid coverage.

[0005] Third, existing technologies suffer from low transmission efficiency, manifested in path redundancy and high communication overhead. Routing algorithms that minimize link congestion reduce bottlenecks by optimizing path selection, but their path planning does not fully utilize the regularity of the matrix grid, easily generating paths containing redundant segments. This is especially problematic when data is progressively transmitted from the far end of the grid to the aggregation point, increasing unnecessary communication overhead. Geographic model grid routing algorithms generate path directions numerically, reducing real-time computation requirements. However, in periodic full-coverage transmission scenarios, their path selection may miss some nodes, particularly near fault areas, leading to decreased transmission efficiency due to a lack of targeted optimization. This inefficiency stems from the fact that existing algorithms do not design dedicated modes for the fixed topology of the matrix grid and the periodic transmission requirements, resulting in increased transmission latency and resource consumption.

[0006] Fourth, existing technologies (especially methods relying on global path computation such as SPMM / NSPMM) suffer from "centralized computing bottlenecks and limited system scalability." In ultra-large-scale matrix meshes (e.g., tens of thousands to hundreds of thousands of nodes), the central node or global computing unit needs to handle massive amounts of node state information and path planning tasks, resulting in huge consumption of computing resources, high communication overhead, and becoming a system performance bottleneck. As the mesh size increases, the management complexity of this centralized architecture rises sharply, making it difficult to meet the "distributed autonomous management" requirements of large-scale arrays. This architectural deficiency limits the effective expansion and deployment flexibility of the system in ultra-large-scale scenarios.

[0007] Therefore, how to provide an efficient and stable routing algorithm to meet the needs of distributed systems in terms of real-time performance, data integrity, transmission efficiency, and cross-scenario applications has become an urgent problem to be solved. Summary of the Invention

[0008] To solve the technical problems existing in the above-mentioned prior art, the purpose of the present invention is to provide a data continuous transmission dynamic routing calculation system for rectangular grid sequence cells, which has the characteristics of high efficiency and stability and can meet the requirements of distributed systems in terms of real-time performance, data integrity, transmission efficiency, and cross-scenario applications.

[0009] To achieve the above-mentioned invention purpose, the present invention provides a data continuous transmission dynamic routing calculation method for rectangular grid sequence cells, including the following steps:

[0010] Obtain the transmission parameters of the rectangular grid sequence cells, including the number of rows and columns of the rectangular grid and the transmission period; each grid of the rectangular grid represents a cell, and the leftmost cell of the rectangular grid is uniformly connected to the control center;

[0011] Divide the transmission period according to the number of rows of the rectangular grid to obtain the single-row data transmission time period corresponding to each row in the rectangular grid; within the corresponding single-row data transmission time period, according to the strategy determined for the transmission path, determine the transmission path cells for the cells in the row along the forward direction in turn through the cells in the rectangular grid to generate a data transmission path, and relay and continuously transmit the data of the cells in the same row. The strategy determined for the transmission path includes:

[0012] a. Determine the second cell as the transmission path cell for data transmission according to the normal connection state between the first cell and the second cell; where the second cell is the adjacent next cell in the forward direction of the first cell.

[0013] b. Determine the third cell and the fourth cell as the path transmission cells for data transmission according to the abnormal connection state between the first cell and the second cell, and the normal connection states between the first cell and the third cell and between the third cell and the fourth cell; where the third cell is the cell with consecutive column numbers in the forward or backward direction of the column where the first cell is located, and the fourth cell is the adjacent next cell in the forward direction of the third cell.

[0014] c. For the "匚" - shaped abnormality of the first cell, adopt the way of turning back and detouring, and determine the cell corresponding to the farthest longitudinal connection distance of the first cell as the transmission path cell for data transmission; the "匚" - shaped abnormality means that for the first cell, there is an abnormal connection state between the first cell and the second cell, and there are respectively N fifth cells and M sixth cells with consecutive column numbers in the forward or backward direction of the column where the first cell is located, and there is an abnormal connection state between the fifth cell and the sixth cell; the farthest longitudinal connection distance refers to the longest distance with a normal connection state in the forward or backward direction of the column where the first cell is located.

[0015] According to a technical solution of the present invention, the generation of the data transmission path specifically includes the following steps:

[0016] Determine the connection status between the first cell and the next cell adjacent to it in the direction of its row; if the connection status between the first cell and the next cell adjacent to it in the direction of its row is normal, execute strategy a;

[0017] If the connection status between the first cell and the next cell adjacent to it in the row direction is abnormal, the connection status between the first cell and the next cell adjacent to it in the column direction or out direction, and the connection status between the next cell adjacent to it in the column direction or out direction and the next cell adjacent to it in the row direction are judged. If both are abnormal, strategy c is executed; otherwise, strategy b is executed.

[0018] According to one technical solution of the present invention, strategy c is implemented by using a bit-addition and foldback method, specifically including:

[0019] Based on the priority strategy of first-in-last-out or first-out-last-in, the longitudinal connection distances of the column containing the first cell are calculated sequentially along the outgoing direction of the row containing the first cell until the maximum longitudinal connection distance of the first cell is obtained. The cell corresponding to the farthest longitudinal connection distance is selected as the transmission path cell.

[0020] According to one technical solution of the present invention, the generation of the data transmission path further includes:

[0021] The generated data transmission path is optimized based on a path optimization strategy; the path optimization strategy includes:

[0022] For generating data transmission paths, the behavior of the starting cell of the data transmission path is defined as the transmission line, and the other behaviors are non-transmission lines.

[0023] For non-transmission lines, check each point in the path sequence. If a transmission path cell P is found... x The transmission path cell P of the next two bits x+2 If the coordinates are the same, delete the transmission path cell P. x P x+1 P x+2 And recheck until no more cross-point co-locations occur; if the transmission path cell P x and P x+2 If all cells are in the transmission line, then only the transmission path cell P is deleted. x+1 Preserve the transmission path cell P x and transmission path cell P x+2 .

[0024] According to one technical solution of the present invention, the transmission period is evenly divided according to the number of rows of the rectangular grid, and the duration of the single-row data transmission time period corresponding to each row in the rectangular grid is the same.

[0025] According to one technical solution of the present invention, it further includes:

[0026] When generating a data transmission path, a "superior abnormality" message or a "lower abnormality" message is generated based on the abnormal connection status between cells. This message, along with the data to be transmitted, is then transmitted to the control center through the data transmission path so that the control center can lock and maintain the location of the abnormal connection status.

[0027] According to one aspect of the present invention, an electronic device is provided, comprising: one or more processors, one or more memories, and one or more computer programs; wherein the processor is connected to the memory, and the one or more computer programs are stored in the memory; when the electronic device is running, the processor executes the one or more computer programs stored in the memory to cause the electronic device to perform a dynamic pathfinding calculation method for data continuation of rectangular grid sequence cells as described in any of the above technical solutions.

[0028] According to one aspect of the present invention, a computer-readable storage medium is provided for storing computer instructions, which, when executed by a processor, implement a dynamic pathfinding calculation method for data continuation of rectangular grid sequence cells as described in any of the above technical solutions.

[0029] Compared with the prior art, the present invention has the following beneficial effects:

[0030] (1) Significantly improves the speed and real-time performance of path planning. Based on the "row-by-row timed transmission mechanism" and predefined paths, the global path search process required by traditional routing algorithms is avoided. This mechanism makes full use of the regular topology characteristics of the matrix grid, and only needs to perform linear sequential scheduling by row, which greatly simplifies the path planning calculation process and significantly reduces the computing resource requirements, thereby efficiently meeting the real-time requirements of periodic data acquisition.

[0031] (2) Achieve high reliability and fault tolerance. In fault scenarios, the dynamic detour mechanism ensures that the non-dead zone data acquisition rate reaches 100%. Even if a large number of nodes fail randomly, the system can still stably transmit data from all normal nodes. Compared with the shortcomings of existing technologies (such as geographic model routing) that are prone to interruption in fault areas, the system stability is greatly improved.

[0032] (3) Optimize transmission efficiency and resource consumption. The path optimization module effectively removes redundant path points on non-transmission lines, reducing unnecessary communication hops and transmission delays. Combined with efficient transmission scheduling, it significantly reduces the overall communication overhead and energy consumption of the system, providing an efficient solution for resource-constrained distributed systems.

[0033] (4) Enhance system scalability and management efficiency. Through local unit autonomous decision-making, the computational load distribution in the ultra-large-scale array is more uniform, avoiding global bottlenecks, improving scalability, and enhancing the management adaptability and robustness of the large-scale array. Attached Figure Description

[0034] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the embodiments will be briefly described below. Obviously, the drawings described below are merely some embodiments of the present invention, and those skilled in the art can obtain other drawings based on these drawings without creative effort.

[0035] Figure 1 This schematic diagram illustrates a flowchart of a dynamic pathfinding calculation method for data continuation of rectangular grid sequence cells according to an embodiment of the present invention.

[0036] Figure 2 This diagram illustrates the furthest transmission path of an 8x40 array in an extreme case according to an embodiment of the present invention.

[0037] Figure 3 This is a schematic diagram illustrating the transmission process of Mode 1 according to an embodiment of the present invention;

[0038] Figure 4 This is a schematic diagram illustrating the transmission process in Mode 2 according to an embodiment of the present invention;

[0039] Figure 5 A schematic diagram illustrating mode 2 according to an embodiment of the present invention;

[0040] Figure 6 This diagram illustrates the abnormal location identification under the condition that there is an abnormality in the row but the vertical adjacent cells are normally connected, according to an embodiment of the present invention.

[0041] Figure 7 This illustration illustrates the location of the cutoff point in an embodiment of the present invention where there is an abnormality in the row but normal connectivity between adjacent cells in the longitudinal direction.

[0042] Figure 8 The schematic diagram illustrates the logic block diagram of mode 3 according to an embodiment of the present invention;

[0043] Figure 9 Schematic representation of the addition of bit u according to an embodiment of the present invention x +or- Value retrieval logic flowchart;

[0044] Figure 10 This is a schematic diagram illustrating the transmission process in mode 3 according to an embodiment of the present invention;

[0045] Figure 11 This illustration shows the transmission process and truncation point location in Mode 3 according to an embodiment of the present invention.

[0046] Figure 12 This schematically illustrates the execution operation logic of mode 3 "stakes" in an embodiment of the present invention. Detailed Implementation

[0047] The description of the embodiments in this specification should be taken in conjunction with the accompanying drawings, which should form part of the complete specification. In the drawings, the shape or thickness of the embodiments may be exaggerated and may be indicated in a simplified or convenient manner. Furthermore, parts of the various structures in the drawings will be described separately; it is worth noting that elements not shown in the figures or not described in words are in a form known to those skilled in the art.

[0048] The descriptions of the embodiments herein, including any references to directions and orientations, are for ease of description only and should not be construed as limiting the scope of the invention. The following description of preferred embodiments involves combinations of features, which may exist independently or in combination; the invention is not particularly limited to the preferred embodiments. The scope of the invention is defined by the claims.

[0049] This invention provides a method for dynamic pathfinding calculation of data continuation in rectangular grid sequence cells, comprising the following steps:

[0050] Obtain the cell transmission parameters of the rectangular grid sequence, including the number of rows and columns of the rectangular grid and the transmission period; each grid of the rectangular grid represents a cell, and the leftmost cell of the rectangular grid is uniformly connected to the control center;

[0051] The transmission period is divided according to the number of rows in the rectangular grid, resulting in a single-row data transmission time period for each row. Within the corresponding single-row data transmission time period, the transmission path is determined sequentially by passing through the cells in the rectangular grid along the transmission path direction, generating a data transmission path. Data in cells within the same row is then relayed. The transmission path determination strategy includes:

[0052] a. Based on the normal connection status between the first cell and the second cell, the second cell is determined as the transmission path cell, and data transmission is performed; wherein the second cell is the next cell adjacent to the first cell in the row;

[0053] b. Based on the abnormal connection status between the first cell and the second cell, and the normal connection status between the first cell and the third cell and the fourth cell, the third cell and the fourth cell are determined as path transmission cells for data transmission; wherein the third cell is the cell with consecutive column numbers in the column of the first cell, and the fourth cell is the cell next to the third cell in the row.

[0054] c. For the first cell with a "匚"-shaped anomaly, use the折返绕行方式 (it's not clear what this specific method is in English, maybe "turn-back and detour method" for example), determine the cell corresponding to the farthest longitudinal connection distance of the first cell as the transmission path cell, and perform data transmission; where the "匚"-shaped anomaly means that for the first cell, there is an abnormal connection state between the first cell and the second cell, and there are respectively N fifth cells and M sixth cells with consecutive column numbers in the in-direction or out-direction of the column where the first cell is located, and there are abnormal connection states between the fifth cells and the sixth cells; the farthest longitudinal connection distance refers to the longest distance with a normal connection state in the in-direction or out-direction of the column where the first cell is located.

[0055] The present invention significantly reduces the computational complexity through an innovative transmission mechanism, ensures fast path planning and data transfer in a matrix grid with a large number of nodes, and overcomes the problem of insufficient real-time performance caused by high complexity in the prior art; the present invention can enhance the fault tolerance ability of the system, ensure reliable transmission of data of all normal nodes through a dynamic path adjustment strategy, and avoid communication interruptions caused by node failures, thus solving the problem of insufficient stability in the prior art in fault scenarios; the present invention can improve the data transmission efficiency, reduce communication latency and resource consumption by optimizing path selection and reducing redundant transmission, and provides improvements for the problems of path redundancy and high overhead in the prior art. In the present invention, by defining the routing decision program in local units (i.e., each cell itself), distributed autonomous path judgment is achieved, avoiding dependence on global computing and control. This architecture significantly reduces the computational load and communication pressure of the central node, enables the system to more efficiently expand to ultra-large-scale matrix grid scenarios, and simplifies the management complexity of large-scale arrays.

[0056] Preferably, generating a data transmission path specifically includes the following steps:

[0057] Judge the connection state between the first cell and the next adjacent cell in its traveling direction; if the connection state between the first cell and the next adjacent cell in its traveling direction is normal, execute strategy a;

[0058] According to the abnormal connection state between the first cell and the next adjacent cell in its traveling direction, judge the connection state between the first cell and the next adjacent cell in the in-direction or out-direction of its column, and the connection state between the next adjacent cell in the in-direction or out-direction of the column where the first cell is located and the next adjacent cell in its traveling direction. If both are abnormal, execute strategy c, otherwise, execute strategy b.

[0059] Preferably, strategy c is implemented by adopting the加位折返方式 (it's not clear what this specific method is in English, maybe "bit-adding turn-back method" for example), specifically including:

[0060] Based on the priority strategy of first-in-last-out or first-out-last-in, the longitudinal connection distances of the column containing the first cell are calculated sequentially along the outgoing direction of the row containing the first cell until the maximum longitudinal connection distance of the first cell is obtained. The cell corresponding to the farthest longitudinal connection distance is selected as the transmission path cell.

[0061] Preferably, generating a data transmission path further includes:

[0062] The generated data transmission path is optimized based on the path optimization strategy; the path optimization strategy includes:

[0063] For generating data transmission paths, the behavior of the starting cell of the data transmission path is defined as the transmission line, and the other behaviors are non-transmission lines.

[0064] For non-transmission lines, check each point in the path sequence. If a transmission path cell P is found... x The transmission path cell P of the next two bits x+2 If the coordinates are the same, delete the transmission path cell P. x P x+1 P x+2 And recheck until no more cross-point co-locations occur; if the transmission path cell P x and P x+2 If all cells are in the transmission line, then only the transmission path cell P is deleted. x+1 Preserve the transmission path cell P x and transmission path cell P x+2 .

[0065] Preferably, the transmission period is divided equally according to the number of rows in the rectangular grid, and the duration of the single-row data transmission time period corresponding to each row in the rectangular grid is the same.

[0066] Preferably, it further includes:

[0067] When generating a data transmission path, a "superior abnormality" message or a "lower abnormality" message is generated based on the abnormal connection status between cells. This message, along with the data to be transmitted, is then transmitted to the control center through the data transmission path so that the control center can lock and maintain the location of the abnormal connection status.

[0068] The embodiments of the present invention will now be described with reference to the accompanying drawings.

[0069] In this embodiment, the following provisions are made regarding the description of some aspects of the routing algorithm involved:

[0070] 1) Define the cell in column j of row i as cell (i, j), and the control center column can be regarded as (i, 0), i.e. column 0.

[0071] 2) The direction from column n to column 1 in the same row is called the inward direction, and the direction from column 1 to column n in the same row is called the outward direction.

[0072] 3) Transmission of the same column but different rows is vertical transmission, where the direction from row 1 to row m is positive vertical transmission, and the direction from row m to row 1 is negative vertical transmission.

[0073] When a path is transmitted along the current propagation line, cells along the path transmit and concatenate their own state measurement data; when a path is transmitted via a non-current propagation line, cells along the path only transmit data and do not concatenate their own data.

[0074] like Figure 1 As shown, in this embodiment, three dynamic transmission modes are designed: (1) normal connectivity mode, which transmits data linearly along the row; (2) detour mode, which continues transmission by utilizing unoccupied channels in adjacent rows when a node in the row fails; and (3) "U"-shaped detour mode, which detours in the opposite direction to a passable path when both the adjacent row and the path ahead fail. These modes achieve dynamic path adjustment through local state checks, overcoming the path interruption problem caused by the lack of dynamic fault tolerance mechanism in existing technologies (such as geographic model routing).

[0075] (1) Mode 1 - Normal connectivity

[0076] Suppose there is a structure array with m rows, each row containing n cells, and each row is transmitted once every T hours, with the i-th row starting to be transmitted later than the (i+1)-th row. Minutes, which is much longer than the longest line transmission time. ,in The average time interval from the start of transmission in a given cell to the start of transmission in the next adjacent cell. This is the average time interval from the start of transmission in a given cell to the start of transmission in the next vertically adjacent cell. An example of this extreme case of a transmission path is shown below. Figure 2 As shown.

[0077] like Figure 3 As shown, each row of cells performs "connection management" operations for both inbound and outbound directions before transmission. Under normal circumstances, cell connections are normal and lines are unobstructed. Each row starts transmission from the nth column cell furthest from the control center to the 1st column cell, with the transmission path being...

[0078]

[0079] (3) Mode 2 - Row connectivity is abnormal but vertical adjacent cell connectivity is normal

[0080] Suppose that one or more cells in the i-th row have abnormal connectivity, preventing independent transmission within that row. Before transmission, the cells in the i-th row perform "connection management" operations for both inbound and outbound directions, and identify the abnormal nodes.

[0081] 1) Suppose that once cell (i, j) discovers that its upstream cell (i, j+1) cannot transmit a message to it, it will stop waiting for messages from upstream cells in the same row at the start of transmission in row i. Starting from itself, it will directly begin transmission with a "superior abnormality" message attached, until it reaches the control center or the next abnormal node (i, r) in the same row, where r ≤ j-1. The transmission path is as follows:

[0082]

[0083] If it is the latter, then continue with the mode 2 (II) operation.

[0084] 2) Suppose that after cell (i, j) detects an anomaly in the connection to the downstream cell (i, j-1), it immediately begins to perform the vertical "connection management" operation, which is divided into the following two cases a and b:

[0085] (a) such as Figure 4 As shown in lines 1 and 2, if the vertical connection is confirmed to be normal, then after transmitting from the starting point or turning point (i, b) of that line to (i, j), a "lower-level error" message is carried and transmitted to (i+1, j), and then transmission continues from line i+1. The transmission path is as follows.

[0086]

[0087] Where (i+1, r) is the next abnormal node in the adjacent row, r ≤ j-1. If it is the latter, then continue to execute the mode 2 (II) operation. After the "connection management" confirms that the vertical connection is normal, (i+1, j) will perform the operation of "pausing the reception of messages from the upstream of row i+1 until τ×j time after the message from the vertical leaves the cell" and send a "yield" instruction to the upstream (i+1, j+1). After receiving the instruction, (i+1, j+1) will perform the operation of "if there is a message transmission from the upstream, store the upstream message until the downstream indicates that reception is enabled".

[0088] (b) such as Figure 4 As shown in the diagram, for rows (m-1) and m, if the negative vertical connection is confirmed to be normal, after transmitting from the starting point or turning point (i, b) of that row to (i, j), a message with the message "lower-level error" is transmitted to (i-1, j), and transmission continues from row (i-1) in the direction of transmission. The transmission path is as follows.

[0089]

[0090] Among them, (i + 1, r) is the next abnormal node in the adjacent row, where r ≤ j - 1. If it is the latter case, the operation of Mode 2 (II) will continue. And after "Connection Management" confirms that the negative vertical connection is normal, (i - 1, j) will perform the operation of "pausing to receive messages from the upstream of row i - 1 until τ × j time after the message from the vertical direction leaves this cell" and send a "yield" instruction to the upstream (i - 1, j + 1). After receiving the instruction, (i - 1, j + 1) will perform the operation of "if there is a message passing from the upstream, store the upstream message until the downstream signals to open for reception". Its logic block diagram is as Figure 5 shown.

[0091] After the control center receives the information, based on the "upper abnormal" (represented by ) and "lower abnormal" (represented by ), it can lock the position of the abnormal connection state and report for repair in time, as Figure 6 shown.

[0092] If in the z - th (a) operation of Mode 2 (II), r = j - 1 always exists in each row until i + z = m, then the operation of Mode 2 (II) will start again from row i, and at this time, only the (b) operation can be performed. If r = j - 1 still always exists in each row until the second row at this time, the upstream signal will be blocked, resulting in "array truncation". The control center can only receive a packet from the (3) operation within a specified time. Based on the "upper abnormal" (represented by ), the array truncation site of this row is marked. After the truncation sites of each row are marked after the array period of T hours, the complete truncation shape can be confirmed, as Figure 7 shown, and the row array truncation site is marked with .

[0093] (4) Mode 3 - "匚" - shaped abnormal connection state

[0094] 1) The operation of the cell downstream of the abnormal connection point is the same as 1) in Mode 2.

[0095] 2) The following regulations are made for the operation of the cell upstream of the abnormal connection point:

[0096] Suppose the cell (i, j) finds that the connection to the downstream cell (i, j - 1) is abnormal, and when performing the operation of Mode 2, the "Connection Management" is abnormal at the u0 + - th row (u0 + ≤ m - 1) in the positive vertical direction, and the negative vertical "Connection Management" is abnormal at the u0 - - th row (u0 - ≥ 2) in the negative vertical direction. And from the u0 + -th row to the u0 -If the progress is always blocked between rows, it is regarded as encountering a "匚"-shaped abnormal state, and the "add-position return" operation is started. The logic block diagram is as Figure 8 The add-position return is defined as follows: Suppose this is the xth "add-position return" operation continuously performed after the "匚"-shaped abnormal state is found in the (i, j1) cell. (i, j x ) The cell sends an "add-position return" command to the upstream cell (i, j x +1), and the cell (i, j x +1) starts to execute the u x +or- -bit longitudinal "connection management" operation, that is, under the priority of positive first and then negative, confirm the connection status of longitudinally adjacent continuous u x +or- -bit cells. Among them, u0 + represents the row number where the positive longitudinal fault is detected when the fault is just discovered and the first return bypass has not started. Since a fault is encountered in the mth row and the wall has been adhered to, there is no need to check the fault distance in the positive longitudinal direction and no bypass can be performed, so u0 + ≤m - 1.

[0097] Among them, for u x +or- , it is stipulated that u1 + =u0 + -i +1, u1 - =i -u0 + +1. If the farthest positive longitudinal continuous connection distance l x-1 + =u x-1 + -1 in the (x - 1)th "add-position return" operation, then u x + = u x-1 + +1; if l x-1 + <u x-1 + -1, then u x + =u x-1 + . Similarly, if the farthest negative longitudinal continuous connection distance l x-1 - =u x-1 - -1 in the (x - 1)th "add-position return" operation, then u x - =u x-1 - +1; if l x-1 - <u x-1 - -1, then ux - =u x-1 - u x + with u x - There is no size relationship between them. Regarding u x +or- The logic block diagram is as follows Figure 9 As shown. Where, l x-1 + This represents the farthest positive longitudinal continuous connection distance actually detected. x + This represents the maximum longitudinal fault distance index, which is the maximum longitudinal fault distance that satisfies the conditions for successful detour. It is only valid if it is greater than the farthest continuously connected longitudinal fault distance actually detected. x The value must be at least one digit larger to successfully reroute. Here, x ≠ 0, and x = 0 merely represents "the row number where the fault is detected in the positive longitudinal direction when the fault is first discovered and before the first rerouting begins." During the first rerouting, this number is subtracted from the row number i where the fault was discovered and then incremented by 1 to obtain u1. + .

[0098] If the connectivity status obtained from the positive or negative "bit-addition back" of the upstream cell (i, j+1) also reports an error, then add bits again and send the "bit-addition back" command to the next cell (i, j+2) to confirm the positive vertical u2. + Position or negative vertical u2 - Check if the cell connectivity is normal. Repeat the operation until one of the following two conditions is met: The xth "addition and return" of u x +or- In the vertical "Connection Management" section, confirm that the connection is normal. When x=bj, "adding bit and turning back" always reports an error, where (i, b) is the starting point or turning point of the path in this row, and b≤n;

[0099] (a) Regarding the situation :

[0100] In the situation In this context, the superscript "+" indicates a positive vertical confirmation and "-" indicates a negative vertical confirmation. Data packets are collected at (i,j+x) from the starting or turning point of the path (i,b) and (i,j) respectively, and then together via (i±u) x +or- (j+x) from the i±u x +or-Transmit in the advancing direction, and set that the subsequent unidirectional (i, j+1) → (i+1, j+1) "connection management" will surely fail to avoid falling into an infinite loop subsequently. The transmission path is

[0101]

[0102] where (i± , r’) is the next abnormal node encountered in the i± th row, r ≤ j + x - 1. If it is the latter, then at (i± , r’ + 1), perform operation mode 2 (II) according to the longitudinal "connection management" result of this cell, as Figure 10 shown.

[0103] (b) For the case :

[0104] The upstream signal is blocked, it is judged that there is a transmission dead zone, that is, "array truncation" occurs. The control center can only receive a segment of data packets from operation (I) within the specified time. Mark the array truncation site of this row according to the "upper abnormal" (represented by ). After each row has completed marking the truncation site after the array period of T hours, the complete truncation shape can be summarized and confirmed, as Figure 11 shown. According to the shape analysis, if each row has a truncation site marked, it is recorded as "waist truncation", as Figure 11 shown in the transmission of the 5th row at (60T - ) min; if there are marks only in several rows, it is recorded as "eye truncation" in these rows, as Figure 11 shown in the transmission of the 5th row at (60T - ) min.

[0105] If during the addition bit folding-back process, it is found that the upstream connection management is abnormal, that is, j ≠ n + 1 and the connection management with (i, j + 1) fails. At this time, the "stake bypassing" operation needs to be taken, that is, perform an operation similar to mode 2 in the out-going direction, manage the out-going connection by 2 bits each time to cross the out-going fault until reaching the position after the abnormal point, and then perform the operation. It should be noted that after the stake bypassing, it changes from (i, j) to (i0, j + 2). In the subsequent addition bit folding-back operation, the value of u x + - u x – should not be less than the value of u xbefore + - u xbefore – before the stake bypassing, otherwise it may cause the subsequent folding-back operation to return to the "匚"-shaped abnormality again. Therefore, take the u x + at this time = u xbefore ++ i0-i+1,u x - =u xbefore - - i0+i+1. Its logic block diagram is as follows: Figure 12 As shown.

[0106] In this embodiment, a path optimization algorithm is also used to optimize the generated data transmission path. This algorithm achieves the simplest functional path, avoids redundant and ineffective transmission losses, and avoids unnecessary simplifications to prevent affecting the complete coverage of the transmission lines.

[0107] For repeated round-trip paths occurring on non-transfer lines, simplification is achieved by deleting the paths. The method used is as follows: on the path containing a starting cell of a transfer line, check each point of the non-transfer line in path order. If a cell P is found... x And the next two cells P x+2 If the coordinates are the same, delete P. x P x+1 P x+2 And recheck until no more cross-point co-locations occur. If P x and P x+2 If both are in the transmission line, then only delete P. x+1 Keep P x and P x+2 .

[0108] If a simplification operation is performed on the round-trip duplicate path that appears on the transmission line, the cell that should be transmitted will be deleted by mistake. Therefore, the simplification operation is not performed.

[0109] In summary, the dynamic routing calculation method for data continuation in rectangular grid sequence cells provided by this invention is applicable to ultra-large-scale rectangular grid systems. Through a unique integrated mechanism of row-by-row timed transmission, dynamic local detours, and path optimization and fault location, it provides an efficient and reliable routing solution for distributed systems through the following four mechanisms:

[0110] 1) Row-by-row timed transmission mechanism: In this invention, data transmission is divided into n independent rows in an n×m grid. Each row is allocated T / n time within a fixed period T, and the data is linearly transmitted from the m-th column to the 1st column. This mechanism utilizes the regularity of the grid to predefine the transmission path, avoiding global path search and reducing the computational complexity to O(n·m), which has significant advantages over existing technologies.

[0111] 2) Dynamic Local Detour Mechanism: This invention provides a dynamic local detour mechanism that addresses node failures through local state checks and supports three transmission modes: normal connectivity mode (linear transmission along the row); detour mode (borrowing an unused channel in an adjacent row when a failure occurs within the row); and "U"-shaped detour mode (reversing to a passable path before borrowing a channel when both the adjacent and preceding rows are faulty). This mechanism achieves dynamic path adjustment through local decision-making, avoiding global path recalculation.

[0112] 3) Integrated Method for Path Optimization and Fault Location: This invention proposes an integrated method for path optimization and fault location, combining selective path optimization and fault diagnosis functions. First, the path optimization module removes duplicate points for non-transfer line paths; for example, when path P... x and P x+2 Remove the intermediate point P when the coordinates are the same x+1 Furthermore, it preserves the integrity of the transmission path through logic, ensuring full grid coverage. Secondly, the fault location module comprehensively identifies fault areas and dead zones by marking the location and direction of faulty nodes along the route, or by statistically analyzing the coordinates of untraversed nodes at the end of the cycle. This integrated method improves transmission efficiency and diagnostic capabilities, offering significant advantages over existing technologies that may miss nodes or lack dedicated location services.

[0113] 4) Local Unit Autonomous Decision-Making Mechanism: This invention proposes a local unit autonomous decision-making mechanism, endowing each cell with the ability to independently determine paths based on local connection state information, thus realizing the feasibility of distributed routing decision-making. This mechanism allows local units (cells) to autonomously select transmission paths or modes based on their inbound, outbound, and vertical connection states, avoiding reliance on global computation or centralized coordination, significantly reducing centralized computing bottlenecks, and is particularly suitable for ultra-large-scale matrix grid systems. Unlike existing technologies that rely on centralized control for computation, this mechanism achieves the feasibility of dynamic path adjustment through local state awareness and message exchange (such as "yield" or "add position and return" instructions).

[0114] According to one aspect of the present invention, an electronic device is provided, comprising: one or more processors, one or more memories, and one or more computer programs; wherein the processor is connected to the memory, and the one or more computer programs are stored in the memory; when the electronic device is running, the processor executes the one or more computer programs stored in the memory to cause the electronic device to perform a dynamic pathfinding calculation method for data continuation of rectangular grid sequence cells as described in any of the above technical solutions.

[0115] According to one aspect of the present invention, a computer-readable storage medium is provided for storing computer instructions, which, when executed by a processor, implement a dynamic pathfinding calculation method for data continuation of rectangular grid sequence cells as described in any of the above technical solutions.

[0116] Furthermore, it should be noted that the present invention can be provided as a method, apparatus, or computer program product. Therefore, embodiments of the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, embodiments of the present invention can take the form of a computer program product implemented on one or more computer-usable storage media containing computer-usable program code.

[0117] Embodiments of the present invention are described with reference to flowchart illustrations and / or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal device, generate instructions for implementing the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0118] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing terminal device to operate in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The functions specified in one or more boxes. These computer program instructions may also be loaded onto a computer or other programmable data processing terminal equipment to cause a series of operational steps to be performed on the computer or other programmable terminal equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable terminal equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0119] It should also be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or terminal device that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or terminal device. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or terminal device that includes said element.

[0120] Finally, it should be noted that the above description represents a preferred embodiment of the present invention. It should be pointed out that although preferred embodiments have been described, those skilled in the art, once they understand the basic inventive concept of the present invention, can make various improvements and modifications without departing from the principles described herein. These improvements and modifications should also be considered within the scope of protection of the present invention. Therefore, the appended claims are intended to be interpreted as including both the preferred embodiments and all changes and modifications falling within the scope of the embodiments of the present invention.

Claims

1. A method for dynamic pathfinding calculation of data continuation in a rectangular grid sequence cell, characterized in that, It includes the following steps: Obtain the cell transmission parameters of the rectangular grid sequence, including the number of rows and columns of the rectangular grid and the transmission period; each grid of the rectangular grid represents a cell, and the leftmost cell of the rectangular grid is uniformly connected to the control center; Divide the transmission period according to the number of rows of the rectangular grid to obtain the single-row data transmission time period corresponding to each row in the rectangular grid; within the corresponding single-row data transmission time period, according to the strategy determined by the transmission path, for the cells in the row, determine the transmission path cells along the forward direction through the cells in the rectangular grid in sequence to generate a data transmission path, and relay the data of the cells in the same row. The strategy determined by the transmission path includes: a. Determine that the second cell is the transmission path cell and perform data transmission according to the normal connection state between the first cell and the second cell; where the second cell is the next adjacent cell in the forward direction of the first cell. b. Determine that the third cell and the fourth cell are the path transmission cells and perform data transmission according to the abnormal connection state between the first cell and the second cell, and the normal connection states between the first cell and the third cell and between the third cell and the fourth cell; where the third cell is the cell with consecutive column numbers in the forward or backward direction of the column where the first cell is located, and the fourth cell is the next adjacent cell in the forward direction of the third cell. c. For the first cell with a "匚" - shaped abnormality, adopt the way of turning back and detouring, and determine that the cell corresponding to the farthest longitudinal connection distance of the first cell is the transmission path cell and perform data transmission; where the "匚" - shaped abnormality means that for the first cell, there is an abnormal connection state between the first cell and the second cell, and there are respectively N fifth cells and M sixth cells with consecutive column numbers in the forward or backward direction of the column where the first cell is located, and there is an abnormal connection state between the fifth cell and the sixth cell; the farthest longitudinal connection distance refers to the longest distance with a normal connection state in the forward or backward direction of the column where the first cell is located.

2. The method for dynamic pathfinding calculation of data continuation in rectangular grid sequence cells according to claim 1, characterized in that, The generation of the data transmission path specifically includes the following steps: Judge the connection state between the first cell and the next adjacent cell in the forward direction of the first cell; if the connection state between the first cell and the next adjacent cell in the forward direction of the first cell is normal, execute strategy a; According to the abnormal connection state between the first cell and the next adjacent cell in the forward direction of the first cell, judge the connection states between the first cell and the next adjacent cell in the forward or backward direction of the column where the first cell is located, and between the next adjacent cell in the forward or backward direction of the column where the first cell is located and the next adjacent cell in the forward direction of the column where the first cell is located. If both are not normal, execute strategy c, otherwise, execute strategy b.

3. The method for dynamic pathfinding calculation of data continuation in rectangular grid sequence cells according to claim 2, characterized in that, Strategy c is implemented by adopting the way of adding bits and turning back, specifically including: Based on the priority strategy of first forward then backward or first backward then forward, along the out - of - row direction of the row where the first cell is located, calculate the longitudinal connection distances in the forward and backward directions of the column where the first cell is located in sequence until the maximum longitudinal connection distance of the first cell is obtained, and select the cell corresponding to the farthest longitudinal connection distance as the transmission path cell.

4. The method for dynamic pathfinding calculation of data continuation in rectangular grid sequence cells according to claim 2, characterized in that, The generation of the data transmission path further includes: Based on the path optimization strategy, optimize the generated data transmission path; the path optimization strategy includes: For generating data transmission paths, the behavior of the starting cell of the data transmission path is defined as the transmission line, and the other behaviors are non-transmission lines. For non-transmission lines, check each point in the path sequence. If a transmission path cell P is found... x The transmission path cell P of the next two bits x+2 If the coordinates are the same, delete the transmission path cell P. x P x+1 P x+2 And recheck until no more cross-point co-locations occur; if the transmission path cell P x and P x+2 If all cells are in the transmission line, then only the transmission path cell P is deleted. x+1 Preserve the transmission path cell P x and transmission path cell P x+2 .

5. The method for dynamic pathfinding calculation of data continuation in rectangular grid sequence cells according to claim 1, characterized in that, The transmission period is divided equally according to the number of rows in the rectangular grid, and the duration of the single-row data transmission time period corresponding to each row in the rectangular grid is the same.

6. The method for dynamic pathfinding calculation of data continuation in rectangular grid sequence cells according to claim 2, characterized in that, Also includes: When generating a data transmission path, a "superior abnormality" message or a "lower abnormality" message is generated based on the abnormal connection status between cells. This message, along with the data to be transmitted, is then transmitted to the control center through the data transmission path so that the control center can lock and maintain the location of the abnormal connection status.

7. An electronic device, characterized in that, include: One or more processors, one or more memories, and one or more computer programs; wherein the processor is connected to the memory, and the one or more computer programs are stored in the memory, and when the electronic device is running, the processor executes the one or more computer programs stored in the memory to cause the electronic device to perform the dynamic pathfinding calculation method for data continuation of rectangular grid sequence cells as described in any one of claims 1 to 6.

8. A computer-readable storage medium, characterized in that, Used to store computer instructions, which, when executed by a processor, implement the dynamic pathfinding calculation method for data continuation of rectangular grid sequence cells as described in any one of claims 1 to 6.

Images