A method and system for ad hoc network in power plant equipment monitoring

Abstract

This invention relates to the field of ad hoc networking technology, specifically to an ad hoc networking method and system for monitoring equipment in thermal power plants. In this invention, communication edges are matched between furnace temperature nodes, bearing vibration nodes, and pulverized coal pipe pressure nodes. The Dixtra algorithm is used to compare packet loss rate, acknowledgment rate, buffer rate, and remaining capacity. This ensures that path selection from the source node to the sink node no longer relies solely on the quality of a single link, but incorporates link reliability, relay node forwarding pressure, remaining forwarding capacity, and path hop count into the same candidate path ranking process, generating a constrained route candidate table. Based on a frozen switching state table, an ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link. A hierarchical pheromone path role table is generated by comparing the first-hop node, buffer rate, and hop count, allowing the path availability state, backup verification state, and congestion avoidance state to be expressed through hierarchical values. Finally, the path number is bound to the primary path, verification path, and offloading path.

Description

Technical Field

[0001] This invention relates to the field of ad hoc networking technology, and in particular to an ad hoc networking method and system for monitoring equipment in thermal power plants. Background Technology

[0002] The field of ad hoc networking technology aims to enable multiple communication nodes to automatically complete neighbor discovery, topology establishment, route generation, link maintenance, and path switching without relying on a fixed central node or fixed communication infrastructure through distributed networking protocols. This forms a wireless communication network capable of multi-hop data transmission, allowing the network to maintain data transmission continuity through route reconstruction or alternative path selection even when nodes join or leave, link quality degrades, or communication paths are interrupted.

[0003] A self-organizing network method for monitoring equipment in thermal power plants is specifically a method for constructing a network of equipment status monitoring nodes, selecting communication paths, and maintaining links in thermal power plants. The aim is to solve the problems of dispersed equipment distribution in thermal power plant areas, numerous metal structures obstructing the view, difficulties in wiring construction in some areas, insufficient coverage of single-hop wireless communication, and the inability to stably transmit monitoring data after a single communication path fails. By enabling multiple monitoring nodes to automatically discover neighboring nodes, calculate link quality, establish multi-hop routing paths, and switch to backup paths when the link quality is lower than a set threshold or a node becomes disconnected, the method enables the transmission of equipment monitoring data from the acquisition nodes to the aggregation nodes or the monitoring master station.

[0004] Existing ad hoc networks primarily rely on neighbor discovery, topology establishment, route generation, link maintenance, and path switching to achieve multi-hop communication. In actual operation, they tend to respond to node additions, link quality degradation, and path interruptions. In scenarios where nodes are centrally restoring communication, there is a lack of restrictions on the access order of equipment areas such as boiler areas, turbine areas, and feedwater pump areas. When multiple monitoring nodes in the same area are simultaneously powered on or restored after maintenance, neighbor discovery frames, network access request frames, and confirmation frames are easily sent in close succession, causing broadcast contention and control message collisions. Furthermore, existing path generation typically relies on link quality thresholds or single reachability judgments, especially when the area near the furnace... Metal obstructions can cause a short-term increase in packet loss rate, or temporary accumulation of cache at relay nodes can lead to frequent path reconstruction, resulting in repeated changes to the next-hop node, an increase in the number of control messages, and long-term idleness of backup paths during regular transmissions. There is a lack of periodic availability status confirmation. When the backup path is activated after the primary path degrades, it may be found that the first-hop node of the backup path has a high load or an excessive number of hops, and there is a lag in the switching. If monitoring data backhaul fails, and it is only processed by retransmitting the entire packet or batch, continuous monitoring data such as water pump current and bearing vibration can easily occupy the repeated transmission time slots, affecting the backhaul of other monitoring nodes in the same area, and causing the local link congestion to spread. Summary of the Invention

[0005] The purpose of this invention is to overcome the shortcomings of the existing technology and propose a self-organizing network method and system for monitoring equipment in thermal power plants.

[0006] To achieve the above objectives, the present invention adopts the following technical solution: a self-organizing network method for monitoring equipment in thermal power plants, comprising the following steps:

[0007] S1: Based on the registration number of the monitoring node of the thermal power plant equipment, verify the area codes of the boiler measuring point, steam turbine measuring point, and feedwater pump measuring point, compare the token duration, access quantity, and backoff window, and generate a token network entry queue.

[0008] S2: Based on the token entry queue, match the communication edges of the furnace temperature node, bearing vibration node, and pulverized coal pipe pressure node, and use the Dixtro algorithm to compare packet loss rate, confirmation rate, buffer rate, and remaining capacity to generate a constrained route candidate table.

[0009] S3: Based on the constrained route candidate table, compare the cost of the current path and the backup path, determine the degradation level of the boiler measuring point link, verify the number of test frame confirmations and the waiting time, and generate a freeze switching status table.

[0010] S4: Based on the aforementioned frozen switching state table, the ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link, compare the first hop node, buffer rate, and hop count, and generate a hierarchical pheromone path role table.

[0011] S5: Based on the hierarchical pheromone path role table, bind the water pump current shard transaction number and shard number, select the primary path, verification path, and unloading path, verify the receipt shard difference set, and generate a transaction shard reissue list.

[0012] As a further embodiment of the present invention, the token entry queue includes a node registration number, device area code, device system code priority, token number, token remaining duration, parent node number, and backoff window value; the constrained route candidate table includes a path number, source node number, aggregation node number, first-hop node number, relay node number sequence, communication edge value, path hop count, and path sorting position; the frozen handover status table includes a current path number, backup path number, degradation level, handover permission identifier, number of trial frame acknowledgments, average forwarding wait time, and candidate path penalty level; the hierarchical pheromone path role table includes a path number, primary path number, verification path number, offload path number, primary transmission value, backup verification value, suppression value, and first-hop node number; and the transaction fragment reissue list includes a transaction number, fragment sequence number, missing fragment sequence number, fragment type identifier, reissue path number, receipt transaction number, and receipt fragment sequence number.

[0013] As a further aspect of the present invention, the specific steps for generating the token entry queue are as follows:

[0014] Based on the registration number of the monitoring node of the thermal power plant equipment, the area codes of the boiler measuring point, steam turbine measuring point and feedwater pump measuring point are checked one by one. Nodes with consistent area codes are written into the access candidate items, and nodes with inconsistent area codes are written into the delayed access items. The access candidate items are arranged according to the priority of the equipment system code, and the area priority node table is generated.

[0015] Based on the area priority node table, the difference between the token duration and the application time is compared, the difference between the number of accesses and the allowed number of accesses is compared, the backoff window is compared with the current waiting count, and nodes with valid tokens, no exceeded access limits, and zero waiting counts are selected to generate a token network entry queue.

[0016] As a further aspect of the present invention, the specific steps for generating the constraint route candidate table are as follows:

[0017] Based on the token network entry queue, the communication edges of furnace temperature node, bearing vibration node, and pulverized coal pipe pressure node are matched item by item. The source node number, candidate relay node number, aggregation node number, communication direction, and equipment area code are checked. Edges with missing node numbers, conflicting directions, and mismatched areas are removed to generate a monitoring node communication edge table.

[0018] Based on the monitoring node communication edge table, compare the packet loss rate with the upper limit of packet loss rate, the confirmation rate with the lower limit of confirmation rate, the buffer rate with the upper limit of buffer rate, and the remaining capacity with the lower limit of capacity. Retain communication edges whose packet loss rate does not exceed the limit, confirmation rate does not exceed the lower limit, buffer rate does not exceed the limit, and remaining capacity does not exceed the lower limit, and generate a communication edge constraint filtering table.

[0019] Based on the communication edge constraint screening table, the Dixtra algorithm is used to calculate the packet loss rate weight, confirmation rate weight, buffer rate weight, remaining capacity weight, and path hop count weight in the path from the source node to the sink node. The communication edge weights are accumulated, and the candidate paths are arranged in the order of accumulated weight, path hop count, and first-hop node load to generate a constraint route candidate table.

[0020] As a further aspect of the present invention, the Dixtra algorithm first reads the source node number, sink node number, relay node number, communication edge number, packet loss rate weight, confirmation rate weight, buffer rate weight, remaining capacity weight, and path hop count weight from the communication edge constraint filtering table. It then sets the cumulative weight of the source node to zero and sets the cumulative weights of the sink node and relay node to a preset upper limit. It establishes an unfixed vertex set and a fixed vertex set. For each communication edge, it calculates the sum of the packet loss rate weight, confirmation rate weight, buffer rate weight, remaining capacity weight, and path hop count weight to obtain the communication edge weight. Finally, it selects the vertex with the lowest cumulative weight from the unfixed vertex set as the current vertex and reads the current vertex. Connect the communication edge, calculate the sum of the current vertex's cumulative weight and the communication edge's weight to obtain the adjacent vertex's updated weight. When the adjacent vertex's updated weight is less than the adjacent vertex's existing cumulative weight, replace the adjacent vertex's cumulative weight with the adjacent vertex's updated weight, and write the current vertex's number into the adjacent vertex's predecessor number. Then, move the current vertex into the fixed vertex set. Repeat vertex selection, communication edge reading, updated weight comparison, and predecessor number writing until the sink node enters the fixed vertex set. Backtrack from the sink node to the source node according to the predecessor number to form the path from the source node to the sink node. Then sort the paths in ascending order by cumulative weight, path hop count, and first-hop node load to generate a constrained route candidate table.

[0021] As a further aspect of the present invention, the specific steps for generating the freeze switching state table are as follows:

[0022] Based on the constrained route candidate table, extract the current path number, backup path number, current path cost, and backup path cost, calculate the difference between the two, write paths whose difference exceeds the switching threshold into the switchable item, and write paths whose difference does not exceed the switching threshold into the frozen and held item to generate a path cost grouping table.

[0023] Based on the path cost grouping table, the degradation level of the boiler measuring point link is determined, mildly degraded paths are written into the backup update item, moderately degraded paths are matched with the number of trial frame confirmations and the waiting time, and severely degraded paths are matched with the backup path number to generate a freeze switching status table.

[0024] As a further aspect of the present invention, the specific steps for generating the hierarchical pheromone path role table are as follows:

[0025] Based on the aforementioned freeze-switching status table, the turbine vibration link number, current path number, backup path number, path degradation level, number of test frame confirmations, and average waiting time are read. Allowed update path items, frozen and maintained path items, and prohibited switching path items are then filtered to generate a vibration link update item table.

[0026] Based on the vibration link update item table, the ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link. The link hierarchical value table is generated by correcting the values ​​according to the end-to-end confirmation status, verification frame confirmation status, retransmission count, buffer rate, timeout count, and path hop count.

[0027] Based on the link hierarchical numerical table, the differences in the first hop node, buffer rate, path hop count, primary transmission value, backup verification value, and suppression value are compared. The path number is then bound to the primary path, verification path, and offload path to generate a hierarchical pheromone path role table.

[0028] As a further aspect of the present invention, the ant colony algorithm first reads the turbine vibration link number, path number, end-to-end confirmation status, verification frame confirmation status, retransmission count, buffer rate, timeout count, path hop count, main transmission value, backup verification value, and suppression value from the vibration link update table. It then sets the main transmission increment, main transmission deduction, backup verification increment, backup verification deduction, suppression increment, settlement coefficient, retransmission upper limit, buffer rate threshold, and hop count upper limit. The algorithm adds the main transmission increment to the main transmission value corresponding to a successful end-to-end confirmation path, subtracts the main transmission deduction from the main transmission value corresponding to a path with a retransmission count greater than the retransmission upper limit, and then... For paths with a confirmed successful status, add the backup verification increment to the backup verification value. For paths with a confirmed failed status, subtract the backup verification deduction amount from the backup verification value. For paths with a buffer rate greater than the buffer rate threshold, a timeout count greater than zero, or a path hop count greater than the hop count limit, add the suppression increment to the suppression value. Multiply the main transmission value, backup verification value, and suppression value by the settlement coefficient to obtain the main transmission settlement value, backup verification settlement value, and suppression settlement value. Bind the turbine vibration link number, main transmission settlement value, backup verification settlement value, suppression settlement value, retransmission count, buffer rate, timeout count, and path hop count according to the path number to generate a link layered value table.

[0029] As a further aspect of the present invention, the specific steps for generating the transaction fragment reissue list are as follows:

[0030] Based on the hierarchical pheromone path role table, bind the water pump current segment transaction number and segment number, match the key segment with the primary path number, match the non-key segment with the unloading path number, and match the verification frame sequence number with the verification path number to generate a transaction path binding table.

[0031] Based on the transaction path binding table, select the primary path, verification path, and unloading path, verify the receipt transaction number and fragment number, calculate the difference between the set of sent fragment sequence numbers and the set of receipt fragment sequence numbers, write the difference fragments into the resend path number, and generate a transaction fragment resend list.

[0032] A self-organizing network system for monitoring equipment in thermal power plants, the self-organizing network system for monitoring equipment in thermal power plants being used to execute the aforementioned self-organizing network method for monitoring equipment in thermal power plants, the system comprising:

[0033] Access verification module: Based on the registration numbers of boiler measuring points, steam turbine measuring points, and feedwater pump measuring points, compare the area code, token duration, number of accesses, and backoff window, sort by system code, and generate a token access queue;

[0034] The routing constraint module: Based on the token entry queue, it matches the furnace temperature, bearing vibration, and pulverized coal pipe pressure communication edge, and uses the Dixtro algorithm to compare packet loss rate, confirmation rate, buffer rate, and remaining capacity to generate a constraint route candidate table;

[0035] Switching to freeze module: Based on the constrained route candidate table, compare the current path cost, backup path cost, number of trial frame confirmations, and waiting time to determine the boiler measuring point link degradation level and generate a freeze switching status table.

[0036] Ant colony hierarchical module: Based on the frozen switching state table, the ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link, compare the first hop node, buffer rate, and hop count, and generate a hierarchical pheromone path role table;

[0037] The fragment reissue module: Based on the hierarchical pheromone path role table, it binds the water pump current fragment transaction number and fragment number, selects the primary path, verification path, and unloading path, verifies the receipt fragment difference set, and generates a transaction fragment reissue list.

[0038] Compared with the prior art, the advantages and positive effects of the present invention are as follows:

[0039] In this invention, the communication edges of the furnace temperature node, bearing vibration node, and pulverized coal pipe pressure node are matched, and the Dixtra algorithm is used to compare packet loss rate, confirmation rate, buffer rate, and remaining capacity. This makes the path selection from the source node to the sink node no longer depend solely on the quality of a single link, but incorporates the link reliability, relay node forwarding pressure, remaining forwarding capacity, and path hop count into the same candidate path sorting process to generate a constrained route candidate table.

[0040] In this invention, the cost of the current path and the backup path are compared based on the constrained route candidate table, and a frozen switching status table is generated by combining the boiler measuring point link degradation level, the number of trial frame confirmations, and the waiting time. This enables the path to be maintained, the backup to be updated, the trial switching, and the direct replacement to form a hierarchical judgment relationship, thereby reducing the frequent changes of the next hop caused by instantaneous fluctuations.

[0041] In this invention, the main transmission value, backup verification value, and suppression value of the turbine vibration link are updated by ant colony algorithm based on the frozen switching state table. The first hop node, buffer rate, and hop count are compared to generate a hierarchical pheromone path role table, so that the path availability state, backup verification state, and congestion avoidance state are expressed by hierarchical values. In this way, the path number is bound to the primary path, verification path, and offloading path.

[0042] In this invention, by binding the water pump current fragment transaction number and fragment number based on the hierarchical pheromone path role table, and verifying the receipt fragment difference set to generate a transaction fragment resend list, missing fragments can be located by transaction number and fragment number, reducing the time occupied by batch retransmission. Attached Figure Description

[0043] Figure 1 This is a schematic diagram of the workflow of the present invention;

[0044] Figure 2 This is a system flowchart of the present invention. Detailed Implementation

[0045] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0046] Example 1

[0047] Please see Figure 1 This invention provides a technical solution: a self-organizing network method for monitoring equipment in thermal power plants, comprising the following steps:

[0048] S1: Based on the registration number of the monitoring node of the thermal power plant equipment, verify the area codes of the boiler measuring point, steam turbine measuring point, and feedwater pump measuring point, compare the token duration, access quantity, and backoff window, and generate a token network entry queue.

[0049] S2: Based on the token-based network entry queue, match the communication edges of furnace temperature node, bearing vibration node, and pulverized coal pipe pressure node. Use the Dixtra algorithm to compare packet loss rate, confirmation rate, buffer rate, and remaining capacity to generate a constrained route candidate table.

[0050] S3: Based on the constrained route candidate table, compare the cost of the current path and the backup path, determine the degradation level of the boiler measuring point link, verify the number of test frame confirmations and the waiting time, and generate a freeze switching status table.

[0051] S4: Based on the frozen switching state table, the ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link, compare the first hop node, buffer rate, and hop count, and generate a hierarchical pheromone path role table.

[0052] S5: Based on the hierarchical pheromone path role table, bind the water pump current shard transaction number and shard number, select the primary path, verification path, and unloading path, verify the receipt shard difference set, and generate a transaction shard reissue list.

[0053] The token entry queue includes node registration number, device area code, device system code priority, token number, token remaining duration, parent node number, and backoff window value. The constrained route candidate table includes path number, source node number, sink node number, first-hop node number, relay node number sequence, communication edge value, path hop count, and path sorting position. The frozen handover status table includes current path number, backup path number, degradation level, handover permission flag, number of trial frame acknowledgments, average forwarding wait time, and candidate path penalty level. The hierarchical pheromone path role table includes path number, primary path number, verification path number, offload path number, primary transmission value, backup verification value, suppression value, and first-hop node number. The transaction fragment reissue list includes transaction number, fragment sequence number, missing fragment sequence number, fragment type identifier, reissue path number, receipt transaction number, and receipt fragment sequence number.

[0054] The specific steps for generating the token entry queue are as follows:

[0055] Based on the registration number of the monitoring node of the thermal power plant equipment, the area codes of the boiler measuring point, steam turbine measuring point and feedwater pump measuring point are checked one by one. Nodes with consistent area codes are written into the access candidate items, and nodes with inconsistent area codes are written into the delayed access items. The access candidate items are arranged according to the priority of the equipment system code, and the area priority node table is generated.

[0056] Based on the regional priority node table, compare the difference between the token duration and the application time, compare the difference between the number of accesses and the allowed number of accesses, compare the backoff window and the current waiting count, select nodes whose tokens have not expired, whose number of accesses has not exceeded the limit, and whose waiting count has returned to zero, and generate a token entry queue.

[0057] Based on the equipment monitoring node registration number of the thermal power plant, using the equipment monitoring node registration number as the key and the boiler monitoring point area code, turbine monitoring point area code, and feedwater pump monitoring point area code as the value, the key format is set to the equipment system code plus a six-digit node serial number, and the area code format is set to a two-digit plant area code plus a two-digit unit code plus a two-digit equipment section code. The `put` command is used to write the node registration number and area code mapping item, and the `get` command is used to read the boiler monitoring point area code, turbine monitoring point area code, and feedwater pump monitoring point area code under the same node registration number. The `equals` command is used to compare the three types of area code strings item by item. Specifically, the boiler monitoring point area code is compared with the turbine monitoring point area code first, and if the comparison result is true, the boiler monitoring point area code is compared with the feedwater pump monitoring point area code. If the comparison result is true, the `add` command is used to add the node... The node registration number, equipment system code, area code, and access sequence number are written into the access candidate. If the comparison result is false, the add command is used to write the node registration number, equipment system code, boiler measuring point area code, steam turbine measuring point area code, and feedwater pump measuring point area code into the delayed access item. The access candidate is sorted using a priority queue sorting algorithm. The priority of the equipment system code is set as follows: boiler system code B01 priority 1, steam turbine system code T01 priority 2, feedwater pump system code P01 priority 3, and auxiliary machine system code A01 priority 4. The Comparator is used to compare the priority of the equipment system code, the lexicographical order of the area code, and the ascending value of the node serial number in sequence. The offer command is used to write the sorted nodes into the queue. The poll command is used to retrieve the nodes according to priority and generate an area priority node table.

[0058] Based on the aforementioned region-priority node table, the token generation cycle is set to 1000 milliseconds, the token validity period is set to 30000 milliseconds, the allowed access per round is set to 64, the initial backoff window value is set to 8 counting cycles, and the initial current waiting count value is set to the integer obtained by taking the last two digits of the node registration number modulo 8. The token generation time and request time are read using the node token field. The `subtractExact` command is used to calculate the difference between the token duration (obtained by subtracting the token generation time from the request time) and the request time. The `compare` command is used to determine if the difference is less than or equal to 30000 milliseconds. For nodes whose tokens have not expired, the current round access quantity and allowed access are read again. The quantity is calculated using the `subtractExact` command, which subtracts the current round's access quantity from the allowed access quantity. The difference between this and the allowed access quantity is then calculated using the `compare` command. The difference is checked to see if it is greater than 0. For nodes whose access quantity has not exceeded the limit, the backoff window and the current waiting count are read. The `compare` command is then used to check if the current waiting count is equal to 0. For nodes whose waiting count is not 0, the `decrementExact` command is used to decrement the current waiting count by 1 and write it back to the delayed access entry. For nodes whose tokens have not expired, whose access quantity has not exceeded the limit, and whose waiting count has reached zero, the `offer` command is used to write them into the queue in the order of the area priority node table, and a token entry queue is generated.

[0059] The specific steps for generating a constrained route candidate table are as follows:

[0060] Based on the token-based network entry queue, the communication edges of furnace temperature nodes, bearing vibration nodes, and pulverized coal pipe pressure nodes are matched one by one. The source node number, candidate relay node number, aggregation node number, communication direction, and equipment area code are verified. Edges with missing node numbers, conflicting directions, and mismatched areas are removed, and a monitoring node communication edge table is generated.

[0061] Based on the communication edge table of monitoring nodes, compare the packet loss rate with the upper limit of packet loss rate, the confirmation rate with the lower limit of confirmation rate, the buffer rate with the upper limit of buffer rate, and the remaining capacity with the lower limit of capacity. Retain communication edges that have not exceeded the packet loss rate limit, the confirmation rate limit, the buffer rate limit, and the remaining capacity limit, and generate a communication edge constraint filtering table.

[0062] Based on the communication edge constraint screening table, the Dixtler algorithm is used to calculate the packet loss rate weight, confirmation rate weight, buffer rate weight, remaining capacity weight, and path hop count weight in the path from the source node to the sink node. The communication edge weights are accumulated, and the candidate paths are arranged in the order of accumulated weight, path hop count, and first-hop node load to generate a constraint route candidate table.

[0063] Based on the token-based network entry queue, the communication edges of furnace temperature nodes, bearing vibration nodes, and pulverized coal pipe pressure nodes are matched item by item. The key field is set as the source node number plus the candidate relay node number plus the aggregation node number, and the value field is set as the communication direction, the equipment area code, the edge number, and the enqueue number. The put command is used to write the communication edge index item, the get command is used to read the candidate communication edges by the source node number, the containsKey command is used to check if the source node number, the candidate relay node number, and the aggregation node number exist, the equals command is used to compare the communication direction with the uplink direction flag UP, and the equals command is used to compare the equipment area code with the network entry node area code. Communication edges with empty source node numbers, empty candidate relay node numbers, and empty aggregation node numbers are written as nodes with missing node numbers. Communication edges with communication directions not equal to UP are written as directions with conflict. Communication edges with equipment area codes not equal to the network entry node area codes are written as areas with mismatch. Communication edges with missing node numbers, conflicting directions, and mismatched areas are sorted in ascending order by the enqueue number and a monitoring node communication edge table is generated.

[0064] Based on the communication side table of the monitoring nodes, packet loss rate, confirmation rate, buffering rate, and remaining capacity are compared item by item. The upper limit for packet loss rate is set to 0.08, the lower limit for confirmation rate is set to 0.92, the upper limit for buffering rate is set to 0.75, and the lower limit for capacity is set to 128 kilobytes. The `compare` command is used to compare the packet loss rate with 0.08, the confirmation rate with 0.92, the buffering rate with 0.75, and the remaining capacity with 128 kilobytes. Packets with a packet loss rate greater than 0.08 are considered acceptable. Write the packet loss limit for communication edges with a loss rate of 0.08, write the confirmation rate of less than 0.92 into the confirmation limit, write the buffer rate of greater than 0.75 into the buffer limit, write the remaining capacity of less than 128 kilobytes into the capacity limit, and write the packet loss rate of no more than 0.08, confirmation rate of no less than 0.92, buffer rate of no more than 0.75, and remaining capacity of no less than 128 kilobytes into the reserved communication edge item. Sort the reserved communication edge items in ascending order of source node number, candidate relay node number, and aggregation node number, and generate a communication edge constraint filtering table.

[0065] Based on a communication edge constraint filtering table, the Dixtella algorithm is used to calculate the weights of candidate paths from the source node to the sink node. The source node distance is set to 0, the distances to other nodes are set to 2147483647, the set of unvisited nodes is set to all node numbers, and the weight coefficients are set as follows: packet loss rate 40, confirmation rate 30, buffer rate 20, remaining capacity 10, and path hop count 5. The `priorityQueue.offer` command is used to write to the source node, and the `priorityQueue.poll` command is used to retrieve the node with the smallest cumulative weight. For each node adjacent to a communication edge, the packet loss rate is multiplied by 40 to obtain the packet loss rate weight, the acknowledgment rate is multiplied by 30 (1 minus acknowledgment rate), the buffer rate is multiplied by 20 to obtain the buffer rate weight, the remaining capacity is obtained by subtracting the remaining capacity from 128, divided by 128, and then multiplied by 10, and the path hop count is multiplied by 5 to obtain the path hop count weight. The five weights are added together to obtain the communication edge weight. The current cumulative weight is added to the communication edge weight to obtain the candidate cumulative weight. If the candidate cumulative weight is less than the original distance value, the distance value is replaced and the predecessor node is recorded. The candidate paths are sorted in ascending order of cumulative weight, ascending order of path hop count, and ascending order of first-hop node load, and a constrained route candidate table is generated.

[0066] Dixtra's algorithm first reads the source node number, sink node number, relay node number, communication edge number, packet loss rate weight, confirmation rate weight, buffer rate weight, remaining capacity weight, and path hop count weight from the communication edge constraint filtering table. It sets the cumulative weight of the source node to zero and sets the cumulative weights of the sink and relay nodes to a preset upper limit. It then establishes an unfixed vertex set and a fixed vertex set. For each communication edge, it calculates the sum of the packet loss rate weight, confirmation rate weight, buffer rate weight, remaining capacity weight, and path hop count weight to obtain the communication edge weight. It selects the vertex with the lowest cumulative weight from the unfixed vertex set as the current vertex, reads the communication edges connected to the current vertex, and calculates... Calculate the sum of the current vertex's cumulative weight and the communication edge weight to obtain the adjacent vertex's updated weight. When the adjacent vertex's updated weight is less than the adjacent vertex's existing cumulative weight, replace the adjacent vertex's cumulative weight with the adjacent vertex's updated weight, and write the current vertex's number into the adjacent vertex's predecessor number. Then, move the current vertex into the set of fixed vertices. Repeat the vertex selection, communication edge reading, updated weight comparison, and predecessor number writing until the sink node enters the set of fixed vertices. Backtrack from the sink node to the source node according to the predecessor number to form the path from the source node to the sink node. Then sort the paths in ascending order by cumulative weight, path hop count, and first-hop node load to generate a constrained route candidate table.

[0067] The specific steps for generating the freeze switch status table are as follows:

[0068] Based on the constrained route candidate table, extract the current path number, backup path number, current path cost, and backup path cost, calculate the difference between the two, write paths whose difference exceeds the switching threshold into the switchable item, and write paths whose difference does not exceed the switching threshold into the frozen and held item, and generate a path cost grouping table.

[0069] Based on the path cost grouping table, determine the degradation level of the boiler measuring point link, write the slightly degraded path into the backup update item, match the moderately degraded path with the number of trial frame confirmations and the waiting time, match the severely degraded path with the backup path number, and generate a freeze switching status table.

[0070] Based on the constrained route candidate table, the following are extracted item by item: current path number, backup path number, current path cost, backup path cost, and switching threshold. The key field is set to the boiler measuring point link number plus the current path number plus the backup path number, and the value field is set to the current path cost, backup path cost, switching threshold, and grouping flag. The get command is used to read the current path number and backup path number under the same boiler measuring point link number. The subtractExact command is used to calculate the difference between the current path cost and the backup path cost. The switching threshold is set to 15. The compare command is used to compare the difference with 15. Paths with a difference greater than 15 are written into the switchable items, and paths with a difference less than or equal to 15 are written into the frozen items. The put command is used to write the boiler measuring point link number, current path number, backup path number, difference, and grouping flag. The switchable items are sorted in descending order of difference, ascending order of backup path cost, and ascending order of backup path number. The frozen items are sorted in ascending order of current path number, and a path cost grouping table is generated.

[0071] Based on the path cost grouping table, the degradation level of the boiler measuring point link is determined. The degradation level field is set as mild degradation, moderate degradation, and severe degradation. The number of test frames sent is set to 8, the threshold for mild test frame confirmation is set to 8, the threshold for moderate test frame confirmation is set to 6, the threshold for moderate waiting time is set to 120 milliseconds, and the threshold for severe waiting time is set to 200 milliseconds. The `get` command is used to read the grouping flag, difference, number of test frame confirmations, waiting time, and backup path number. Paths with a difference less than or equal to 8 and a number of test frame confirmations equal to 8 are written into the mild degradation category, and mildly degraded paths are written into the backup path number. The new item writes paths with a difference greater than 8 and less than or equal to 15, a number of test frame confirmations greater than or equal to 6 and less than 8, and a waiting time greater than 120 milliseconds and less than or equal to 200 milliseconds into the medium degradation item. The medium degradation path is matched with the number of test frame confirmations and the waiting time. The path with a difference greater than 15, a number of test frame confirmations less than 6, and a waiting time greater than 200 milliseconds is written into the severe degradation item. The severe degradation path is matched with the backup path number. The boiler measuring point link number, degradation level, number of test frame confirmations, waiting time, backup path number, and freeze flag are written using the put command, and a freeze switching status table is generated.

[0072] The specific steps for generating a hierarchical pheromone path role table are as follows:

[0073] Based on the frozen switching status table, the turbine vibration link number, current path number, backup path number, path degradation level, number of test frame confirmations, and average waiting time are read. The allowed update path items, frozen and maintained path items, and prohibited switching path items are then filtered to generate a vibration link update item table.

[0074] Based on the vibration link update item table, the ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link. The values ​​are corrected according to the end-to-end confirmation status, verification frame confirmation status, retransmission count, buffer rate, timeout count, and path hop count to generate a link layered value table.

[0075] Based on the link hierarchical numerical table, the differences in the first hop node, buffer rate, path hop count, primary transmission value, backup verification value, and suppression value are compared. The path number is bound to the primary path, verification path, and offload path to generate a hierarchical pheromone path role table.

[0076] Based on the frozen switching status table, the turbine vibration link number, current path number, backup path number, path degradation level, number of test frame confirmations, and average waiting time are read item by item. The update-allowed status code is set to U01, the freeze-hold status code to F01, and the switching-prohibited status code to D01. The upper limit for the number of test frame confirmations is set to 8, the middle limit is set to 6, the middle limit for the average waiting time is set to 120 milliseconds, and the upper limit is set to 200 milliseconds. The `get` command is used to read the current path number and backup path number under the same turbine vibration link number. The `compare` command is used to compare the path degradation level with mild, moderate, and severe degradation. The `compare` command is used to compare the number of test frame confirmations with 8 and 6. The `compare` command compares the average waiting time with 120 milliseconds and 200 milliseconds. Paths with a mild degradation level, 8 test frame confirmations, and an average waiting time less than or equal to 120 milliseconds are written into the "Allow Update Path" item. Paths with a moderate degradation level, 6 test frame confirmations, and an average waiting time greater than 120 milliseconds but less than or equal to 200 milliseconds are written into the "Freeze and Hold Path" item. Paths with a severe degradation level, less than 6 test frame confirmations, or an average waiting time greater than 200 milliseconds are written into the "Prohibit Switching Path" item. The `put` command is used to write the turbine vibration link number, current path number, backup path number, status code, test frame confirmations, and average waiting time, and a vibration link update item table is generated.

[0077] Based on the vibration link update table, an ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link. The pheromone evaporation coefficient is set to 0.15, the main transmission increment to 0.20, the backup verification increment to 0.14, and the suppression increment to 0.18. The end-to-end confirmation status and verification frame confirmation status are set to 1 or 0. The maximum number of retransmissions is set to 3, the maximum buffer rate to 0.75, the maximum timeout count to 2, and the maximum path hop count to 5. The `get` command is used to read the path number, status code, end-to-end confirmation status, verification frame confirmation status, retransmission count, buffer rate, and timeout count. The path hop count is calculated by multiplying the primary transmission value by 0.85, adding the end-to-end confirmation status by 0.20, multiplying the backup verification value by 0.85, adding the verification frame confirmation status by 0.14, multiplying the suppression value by 0.85, adding the timeout count divided by 2, and then multiplying by 0.18. For paths with more than 3 retransmissions, the primary transmission value is subtracted by 0.06. For paths with a buffer rate greater than 0.75, the backup verification value is subtracted by 0.05. For paths with more than 5 hop counts, the suppression value is added by 0.07. These three values ​​are limited to the range of 0 to 1. The path number, primary transmission value, backup verification value, suppression value, retransmission count, buffer rate, timeout count, and path hop count are written using the put command, and a link layered value table is generated.

[0078] Based on the link layering numerical table, the following parameters are compared item by item: first-hop node difference, buffer rate, path hop count, primary transmission value, backup verification value, and suppression value. The thresholds for first-hop node difference, buffer rate, path hop count, primary transmission value, backup verification value, and suppression value are set to 1, 0.75, 5, 0.60, 0.50, and 0.55, respectively. The `compare` command is used to compare the first-hop node number with the currently used first-hop node number. If the first-hop node numbers are different, the first-hop node difference is set to 1; if they are the same, the first-hop node difference is set to 0. The `compare` command is then used to compare the buffer rate with 0.75. Compare the path hop count with 5, and use the compare command to compare the primary transmission value with 0.60, the backup verification value with 0.50, and the suppression value with 0.55. Bind the path number with a primary transmission value greater than or equal to 0.60, a cache rate less than or equal to 0.75, and a path hop count less than or equal to 5 to the primary path. Bind the path number with a backup verification value greater than or equal to 0.50 and a first-hop node difference of 1 to the verification path. Bind the path number with a suppression value greater than or equal to 0.55, a cache rate greater than 0.75, or a path hop count greater than 5 to the unloading path. Use the put command to write the path number, first-hop node difference, cache rate, path hop count, and path role, and generate a hierarchical pheromone path role table.

[0079] The ant colony algorithm first reads the turbine vibration link number, path number, end-to-end confirmation status, verification frame confirmation status, retransmission count, buffer rate, timeout count, path hop count, primary transmission value, backup verification value, and suppression value from the vibration link update table. It then sets the primary transmission increment, primary transmission deduction, backup verification increment, backup verification deduction, suppression increment, settlement coefficient, retransmission limit, buffer rate threshold, and hop count limit. For paths with a successful end-to-end confirmation status, it adds the primary transmission increment to the primary transmission value. For paths with a retransmission count greater than the retransmission limit, it subtracts the primary transmission deduction from the primary transmission value. Finally, it sets the verification frame confirmation status to successful. The backup verification value corresponding to the path is added to the backup verification increment. The backup verification deduction amount is subtracted from the backup verification value corresponding to the path whose verification frame confirmation status is failed. The suppression value corresponding to the path whose buffer rate is greater than the buffer rate threshold, whose timeout count is greater than zero, and whose path hop count is greater than the hop count limit is added to the suppression increment. The main transmission value, backup verification value, and suppression value are multiplied by the settlement coefficient respectively to obtain the main transmission settlement value, backup verification settlement value, and suppression settlement value. The turbine vibration link number, main transmission settlement value, backup verification settlement value, suppression settlement value, retransmission count, buffer rate, timeout count, and path hop count are bound according to the path number to generate a link layered value table.

[0080] The specific steps for generating the transaction fragment reissue list are as follows:

[0081] Based on the hierarchical pheromone path role table, bind the current segment transaction number and segment number of the water pump, match the key segment with the primary path number, match the non-key segment with the unloading path number, and match the verification frame sequence number with the verification path number to generate a transaction path binding table.

[0082] Based on the transaction path binding table, select the primary path, verification path, and unloading path, verify the receipt transaction number and fragment number, calculate the difference between the set of sent fragment sequence numbers and the set of receipt fragment sequence numbers, write the difference fragments into the resend path number, and generate a transaction fragment resend list.

[0083] Based on the hierarchical pheromone path role table, the TreeMap transaction path binding method is adopted to read the transaction number, segment number, segment type, verification frame sequence number, primary path number, verification path number, and unloading path number of the feedwater pump current segment one by one. The key field is set as the segment transaction number plus the segment number, and the value fields are set as segment type, verification frame sequence number, path role, and path number. The get command is used to read the segment number and segment type under the same segment transaction number. The compare command is used to compare the segment type with the critical segment flag K01, the non-critical segment flag N01, and the verification frame flag V01. When the segment type is equal to K01 and the path role is equal to the primary path, the primary path number is bound. When the segment type is equal to N01 and the path role is equal to the unloading path, the unloading path number is bound. When the segment type is equal to V01 and the path role is equal to the verification path, the verification path number is bound. The put command is used to write the segment transaction number, segment number, segment type, verification frame sequence number, path role, and path number, and generate a transaction path binding table.

[0084] Based on the transaction path binding table, the HashSet sharding difference verification method is used to select the primary path, verification path, and unloading path, verify the receipt transaction number and shard number, set the set of sent shard sequence numbers as sendSet, and set the set of receipt shard sequence numbers as ackSet. The add command is used to write the sent shard numbers under the same shard transaction number into sendSet, and the add command is used to write the shard numbers with the same receipt transaction number and receipt status code equal to ACK into ackSet. The removeAll command is used to delete the shard numbers with the same value from sendSet and ackSet to obtain the difference shard set. The get command is used to read the path role corresponding to the difference shard. When the path role is the primary path, the primary path number is written; when the path role is the verification path, the verification path number is written; when the path role is the unloading path, the unloading path number is written. The put command is used to write the shard transaction number, difference shard number, resend path number, path role, and receipt status code, and generate a transaction shard resend list.

[0085] A self-organizing network system for monitoring equipment in thermal power plants, the self-organizing network system for monitoring equipment in thermal power plants is used to execute the above-described self-organizing network method for monitoring equipment in thermal power plants, the system comprising:

[0086] Access verification module: Based on the registration numbers of boiler measuring points, steam turbine measuring points, and feedwater pump measuring points, compare the area code, token duration, number of accesses, and backoff window, sort by system code, and generate a token access queue;

[0087] The routing constraint module is based on the token-based network entry queue. It matches the furnace temperature, bearing vibration, and pulverized coal pipe pressure communication edge, and uses the Dixtra algorithm to compare packet loss rate, confirmation rate, buffer rate, and remaining capacity to generate a constraint route candidate table.

[0088] Switching to freeze module: Based on the constrained route candidate table, compare the cost of the current path, the cost of the backup path, the number of trial frame confirmations, and the waiting time to determine the degradation level of the boiler measuring point link and generate a freeze switching status table.

[0089] Ant colony hierarchical module: Based on the frozen switching state table, using the ant colony algorithm, update the main transmission value, backup verification value, and suppression value of the turbine vibration link, compare the first hop node, buffer rate, and hop count, and generate a hierarchical pheromone path role table;

[0090] The sharding reissue module is based on the hierarchical pheromone path role table. It binds the water pump current sharding transaction number and shard number, selects the primary path, verification path, and unloading path, verifies the sharding difference set of the receipt, and generates a transaction sharding reissue list.

[0091] The above are merely preferred embodiments of the present invention and are not intended to limit the present invention in any other way. Any person skilled in the art may make changes or modifications to the above-disclosed technical content to create equivalent embodiments that can be applied to other fields. However, any simple modifications, equivalent changes, and modifications made to the above embodiments based on the technical essence of the present invention without departing from the scope of the present invention shall still fall within the protection scope of the present invention.

Claims

1. A method for ad-hoc network in monitoring of power plant equipment, characterized in that, Includes the following steps: S1: Based on the registration number of the monitoring node of the thermal power plant equipment, verify the area codes of the boiler measuring point, steam turbine measuring point, and feedwater pump measuring point, compare the token duration, access quantity, and backoff window, and generate a token network entry queue. S2: Based on the token entry queue, match the communication edges of the furnace temperature node, bearing vibration node, and pulverized coal pipe pressure node, and use the Dixtro algorithm to compare packet loss rate, confirmation rate, buffer rate, and remaining capacity to generate a constrained route candidate table. S3: Based on the constrained route candidate table, compare the cost of the current path and the backup path, determine the degradation level of the boiler measuring point link, verify the number of test frame confirmations and the waiting time, and generate a freeze switching status table. S4: Based on the aforementioned frozen switching state table, the ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link, compare the first hop node, buffer rate, and hop count, and generate a hierarchical pheromone path role table. S5: Based on the hierarchical pheromone path role table, bind the water pump current sharding transaction number and shard number, select the primary path, verification path, and unloading path, check the receipt sharding difference set, and generate a transaction sharding reissue list. The specific steps for generating the token inbound queue are as follows: Based on the registration number of the monitoring node of the thermal power plant equipment, the area codes of the boiler measuring point, steam turbine measuring point and feedwater pump measuring point are checked one by one. Nodes with consistent area codes are written into the access candidate items, and nodes with inconsistent area codes are written into the delayed access items. The access candidate items are arranged according to the priority of the equipment system code, and the area priority node table is generated. Based on the aforementioned regional priority node table, the difference between the token duration and the application time is compared, the difference between the number of accesses and the allowed number of accesses is compared, the backoff window is compared with the current waiting count, and nodes with valid tokens, accesses not exceeding the limit, and waiting counts zero are selected to generate a token entry queue. The specific steps for generating the constraint route candidate table are as follows: Based on the token network entry queue, the communication edges of furnace temperature node, bearing vibration node, and pulverized coal pipe pressure node are matched item by item. The source node number, candidate relay node number, aggregation node number, communication direction, and equipment area code are checked. Edges with missing node numbers, conflicting directions, and mismatched areas are removed to generate a monitoring node communication edge table. Based on the monitoring node communication edge table, compare the packet loss rate with the upper limit of packet loss rate, the confirmation rate with the lower limit of confirmation rate, the buffer rate with the upper limit of buffer rate, and the remaining capacity with the lower limit of capacity. Retain communication edges whose packet loss rate does not exceed the limit, confirmation rate does not exceed the lower limit, buffer rate does not exceed the limit, and remaining capacity does not exceed the lower limit, and generate a communication edge constraint filtering table. Based on the communication edge constraint screening table, the Dixtra algorithm is used to calculate the packet loss rate weight, confirmation rate weight, buffer rate weight, remaining capacity weight, and path hop count weight in the path from the source node to the sink node. The communication edge weights are accumulated, and the candidate paths are arranged in the order of accumulated weight, path hop count, and first-hop node load to generate a constraint route candidate table. The specific steps for generating the freeze switch status table are as follows: Based on the constrained route candidate table, extract the current path number, backup path number, current path cost, and backup path cost, calculate the difference between the two, write paths whose difference exceeds the switching threshold into the switchable item, and write paths whose difference does not exceed the switching threshold into the frozen and held item to generate a path cost grouping table. Based on the path cost grouping table, the degradation level of the boiler measuring point link is determined, the mildly degraded path is written into the backup update item, the moderately degraded path is matched with the number of trial frame confirmations and the waiting time, and the severely degraded path is matched with the backup path number to generate a freeze switching status table. The specific steps for generating the hierarchical pheromone path role table are as follows: Based on the aforementioned freeze-switching status table, the turbine vibration link number, current path number, backup path number, path degradation level, number of test frame confirmations, and average waiting time are read. Allowed update path items, frozen and maintained path items, and prohibited switching path items are then filtered to generate a vibration link update item table. Based on the vibration link update item table, the ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link. The link hierarchical value table is generated by correcting the values ​​according to the end-to-end confirmation status, verification frame confirmation status, retransmission count, buffer rate, timeout count, and path hop count. Based on the link hierarchical numerical table, the differences in the first hop node, buffer rate, path hop count, primary transmission value, backup verification value, and suppression value are compared. The path number is then bound to the primary path, verification path, and offload path to generate a hierarchical pheromone path role table. The specific steps for generating the transaction fragment reissue list are as follows: Based on the hierarchical pheromone path role table, bind the water pump current segment transaction number and segment number, match the key segment with the primary path number, match the non-key segment with the unloading path number, and match the verification frame sequence number with the verification path number to generate a transaction path binding table. Based on the transaction path binding table, select the primary path, verification path, and unloading path, verify the receipt transaction number and fragment number, calculate the difference between the set of sent fragment sequence numbers and the set of receipt fragment sequence numbers, write the difference fragments into the resend path number, and generate a transaction fragment resend list.

2. The self-organizing network method for monitoring equipment in thermal power plants according to claim 1, characterized in that, The token entry queue includes node registration number, device area code, device system code priority, token number, token remaining duration, parent node number, and backoff window value. The constrained route candidate table includes path number, source node number, aggregation node number, first-hop node number, relay node number sequence, communication edge value, path hop count, and path sorting position. The frozen handover status table includes current path number, backup path number, degradation level, handover permission flag, number of trial frame acknowledgments, average forwarding wait time, and candidate path penalty level. The hierarchical pheromone path role table includes path number, primary path number, verification path number, offload path number, primary transmission value, backup verification value, suppression value, and first-hop node number. The transaction fragment reissue list includes transaction number, fragment sequence number, missing fragment sequence number, fragment type flag, reissue path number, receipt transaction number, and receipt fragment sequence number.

3. The self-organizing network method for monitoring equipment in thermal power plants according to claim 1, characterized in that, The Dixtra algorithm first reads the source node number, sink node number, relay node number, communication edge number, packet loss rate weight, confirmation rate weight, buffer rate weight, remaining capacity weight, and path hop count weight from the communication edge constraint filtering table. It sets the cumulative weight of the source node to zero and sets the cumulative weights of the sink and relay nodes to a preset upper limit. It then establishes an unfixed vertex set and a fixed vertex set. For each communication edge, it calculates the sum of the packet loss rate weight, confirmation rate weight, buffer rate weight, remaining capacity weight, and path hop count weight to obtain the communication edge weight. It selects the vertex with the lowest cumulative weight from the unfixed vertex set as the current vertex and reads the communication edge connected to the current vertex. Calculate the sum of the current vertex's cumulative weight and the communication edge weight to obtain the adjacent vertex's updated weight. When the adjacent vertex's updated weight is less than the adjacent vertex's existing cumulative weight, replace the adjacent vertex's cumulative weight with the adjacent vertex's updated weight, and write the current vertex's number into the adjacent vertex's predecessor number. Then, move the current vertex into the set of fixed vertices. Repeat vertex selection, communication edge reading, updated weight comparison, and predecessor number writing until the sink node enters the set of fixed vertices. Backtrack from the sink node to the source node according to the predecessor number to form the path from the source node to the sink node. Then sort the paths in ascending order by cumulative weight, path hop count, and first-hop node load to generate a constrained route candidate table.

4. The self-organizing network method for monitoring equipment in thermal power plants according to claim 1, characterized in that, The ant colony algorithm first reads the turbine vibration link number, path number, end-to-end confirmation status, verification frame confirmation status, retransmission count, buffer rate, timeout count, path hop count, main transmission value, backup verification value, and suppression value from the vibration link update table. It then sets the main transmission increment, main transmission deduction, backup verification increment, backup verification deduction, suppression increment, settlement coefficient, retransmission limit, buffer rate threshold, and hop count limit. For paths with a successful end-to-end confirmation status, the algorithm adds the main transmission increment to the main transmission value. For paths with a retransmission count greater than the retransmission limit, the algorithm subtracts the main transmission deduction from the main transmission value. Finally, it sets the verification frame confirmation status to... For a successful path, add the backup verification increment to the backup verification value. For a path whose verification frame confirmation status is failed, subtract the backup verification deduction amount from the backup verification value. For paths with a buffer rate greater than the buffer rate threshold, a timeout count greater than zero, or a path hop count greater than the hop count limit, add the suppression increment to the suppression value. Multiply the main transmission value, backup verification value, and suppression value by the settlement coefficient to obtain the main transmission settlement value, backup verification settlement value, and suppression settlement value. Bind the turbine vibration link number, main transmission settlement value, backup verification settlement value, suppression settlement value, retransmission count, buffer rate, timeout count, and path hop count according to the path number to generate a link layered value table.

5. A self-organizing network system for monitoring equipment in thermal power plants, characterized in that, The self-organizing network method for monitoring equipment in thermal power plants according to any one of claims 1-4, the system comprising: Access verification module: Based on the registration numbers of boiler measuring points, steam turbine measuring points, and feedwater pump measuring points, compare the area code, token duration, number of accesses, and backoff window, sort by system code, and generate a token access queue; The routing constraint module: Based on the token entry queue, it matches the furnace temperature, bearing vibration, and pulverized coal pipe pressure communication edge, and uses the Dixtro algorithm to compare packet loss rate, confirmation rate, buffer rate, and remaining capacity to generate a constraint route candidate table; Switching to freeze module: Based on the constrained route candidate table, compare the current path cost, backup path cost, number of trial frame confirmations, and waiting time to determine the boiler measuring point link degradation level and generate a freeze switching status table. Ant colony hierarchical module: Based on the frozen switching state table, the ant colony algorithm is used to update the main transmission value, backup verification value, and suppression value of the turbine vibration link, compare the first hop node, buffer rate, and hop count, and generate a hierarchical pheromone path role table; The fragment reissue module: Based on the hierarchical pheromone path role table, it binds the water pump current fragment transaction number and fragment number, selects the primary path, verification path, and unloading path, verifies the receipt fragment difference set, and generates a transaction fragment reissue list.

Images