A smart fire-fighting platform and method based on wireless networking, and a storage medium

Abstract

This invention discloses a smart fire protection platform, method, and storage medium based on wireless networking, specifically relating to the field of smart fire protection. It includes acquiring status records, connection records, location records, and door records from a Z-Wave wireless network; performing time-series reconstruction of the status records according to the transmission and reception times in the status records; and outputting the reconstruction sequence. This invention identifies the same continuous fire event process by performing time-series reconstruction, fire chain concatenation, disturbance removal, linkage generation, and post-linkage verification on the status records in the Z-Wave wireless network. It also determines the effectiveness of the linkage based on the rewriting of the continuous fire event process after linkage. This solves the problem of how to identify the same continuous fire event process from status records with distorted arrival order and mixed disturbances under Z-Wave wireless networking conditions, and how to determine the effectiveness of the linkage based on whether the continuous fire event process is rewritten after linkage.

Description

Technical Field

[0001] This invention relates to the field of smart fire protection technology, and more specifically, to a smart fire protection platform, method, and storage medium based on wireless networking. Background Technology

[0002] In smart fire protection applications, existing solutions mainly revolve around fire detection and equipment linkage. Typically, smoke detectors, heat detectors, door sensors, audible and visual alarms, and ventilation actuators are connected to the same control system. The status results sent by each node are comprehensively judged, and linkage operations such as broadcasting, access control release, and ventilation switching are executed after the corresponding triggering relationship is met.

[0003] In renovation scenarios involving old high-rise residential buildings, small apartments, and light commercial spaces, where it is impossible to re-lay wired circuits and Z-Wave wireless networking is required to access distributed nodes, and constraints exist such as cooking steam, frequent door opening and closing, local airflow disturbances, and inconsistent reporting sequences from some battery nodes, the system often does not actually receive complete and continuous fire evolution information. Instead, it receives node status changes from scattered sources with distorted arrival sequences. In this situation, on the one hand, it is easy to piece together unrelated short-term anomalies into the same fire, and on the other hand, it may split a real, continuously developing fire into multiple isolated anomalies. More importantly, after the linkage command is issued, the system usually only receives feedback that the command has been sent or the equipment has acted, making it difficult to confirm whether the linkage has truly suppressed the continued spread of the same fire. On-site manifestations include an amplified false alarm range, deviations in linkage location, local passages being affected but the handling continuing according to the original judgment, or equipment acting but smoke spread not being effectively cut off.

[0004] Therefore, the technical problem to be solved by this application is: how to identify the same continuous fire process from the state changes of nodes with distorted arrival order and mixed disturbances under Z-Wave wireless networking conditions, and to determine whether the linkage is effective based on whether the fire process is actually rewritten after linkage. Summary of the Invention

[0005] To overcome the aforementioned deficiencies of the prior art, embodiments of the present invention provide a smart fire protection platform, method, and storage medium based on wireless networking. By performing time sequence restoration, fire chain concatenation, disturbance elimination, linkage generation, and post-linkage verification on the state records in the Z-Wave wireless network, the same continuous fire process can be identified, and the effectiveness of the linkage can be determined based on the rewriting of the continuous fire process after linkage, thereby solving the problems mentioned in the background art.

[0006] To achieve the above objectives, the present invention provides the following technical solution: A smart fire protection method based on wireless networking includes: S1. Obtain the status record, connection record, location record and gate record in the Z-Wave wireless network, restore the status record according to the transmission and reception times in the status record, and output the restored sequence; S2. Match each state record in the restored sequence with the connection record, position record and door record. For each state record, retrieve the state records that satisfy the conditions of connection, adjacent position and door connection, and connect them in sequence to output the fire chain. S3. Check whether there are any serialized status records before and after each status record in the fire chain. Combine the door opening record and ventilation record, remove the status records that have no serialized status records before or after them, as well as the status records that have serialized status records only before or only after them and have door opening records or ventilation records in the corresponding time period from the fire chain, and output the target chain. S4. Determine the extension path according to the position order of each status record in the target chain, generate a linkage sequence according to the extension path, send linkage instructions to the fire nodes corresponding to the linkage sequence, collect subsequent status records after the linkage instructions are sent, and output the linkage sequence. S5. Compare the linked sequence with the target chain in the same position and order. When the linked sequence terminates, stops continuing to the next position, or reverts to the previous position at the corresponding position, output a valid linkage result. When the linked sequence continues to add state records in the position order of the target chain, output an invalid linkage result and generate the next linked sequence according to the position of the newly added state record.

[0007] The following are further optimizations of the above technical solution by the present invention: S1 includes: S1-1. Group the status records according to the sending node and the receiving node, calculate the difference between the receiving time and the sending time of each group of status records, form the time difference sequence corresponding to each group, and identify the same time difference that appears consecutively from each group of time difference sequences, and output the time difference of the corresponding group. S1-2. Match each status record with the time difference of the corresponding group, perform the operation of subtracting the time difference of the corresponding group from the receiving time for each status record, solve for the restored time of the corresponding status record, and write the restored time into the corresponding status record. S1-3. Sort the status records written at the restoration time according to the restoration time. If the restoration times are the same, sort them according to the connection order in the connection record and the position order in the position record, and output the restoration sequence.

[0008] Further optimization: S2 includes: S2-1. Match each state record in the restored sequence with the connection record, position record and gate record. For each state record, search in parallel for the state records that satisfy the connection, the position, and the gate connection. Write the state records that fall into all three types of search results into the intersection group, write the state records that fall into only two types of search results into the verification group, and write the state records that fall into only one type of search result into the exclusion group. S2-2. Extract the connection direction from the connection record, the position direction from the position record, and the passage direction from the gate record for each state record in the intersection group. Write the state records with the same connection direction, position direction, and passage direction into the main tag. Write the state records with two of the connection direction, position direction, and passage direction being the same and the other being opposite into the branch tag. Write the state records with different connection directions, position directions, and passage directions into the conflict tag. Then, form a candidate group by combining the state records written into the main tag and the state records written into the branch tag.

[0009] Further optimization: S2 also includes: S2-3. Sort each status record in the candidate group in ascending order according to the difference between the receiving time and the receiving time of the previous status record. When the time difference is the same, sort them in turn according to the connection order in the connection record and the position order in the position record. Connect the status record that is first in the sort and has a main tag written to it to the fire chain. Connect the status record that is first in the sort and has a branch tag written to it and has no main tag written to it in the corresponding candidate group to the fire chain branch. Write the remaining status records to the test tag. S2-4. Re-execute parallel retrieval and direction comparison for each status record in the group to be verified and the status record written with the inspection mark. Connect the status record rewritten with the main mark or branch mark to the fire chain. Write the status record rewritten with the exclusion group or conflict mark to the broken chain mark and stop the serial connection. Output the fire chain.

[0010] Further optimization: S3 includes: S3-1. For each status record in the fire chain, retrieve the previous and next connected status records respectively, calculate the forward position interval between each status record and the previous connected status record and the backward position interval between each status record and the next connected status record, and output the interval record. S3-2. Match each status record with the door opening record and ventilation record in the corresponding time period. Write the status record with the door opening record into the door opening mark, write the status record with the ventilation record into the ventilation mark, and write the status record with both the door opening record and the ventilation record into the double disturbance mark.

[0011] Further optimization: S3 also includes: S3-3. Write the state record where neither the previous serialized state record nor the next serialized state record exists into the isolated mark. Write the state record where only the previous serialized state record or only the next serialized state record exists and is written into the door open mark, ventilation mark, or double disturbance mark into the edge mark. Write the state record where both the previous serialized state record and the next serialized state record exist and are written into the double disturbance mark, and the forward position interval is equal to the backward position interval into the inspection mark. S3-4. Remove the state records written with isolated markers and edge markers from the fire chain. For the state records written with the markers to be checked, re-perform the position continuity check according to the position corresponding to the previous connected state record, the position corresponding to the current state record, and the position corresponding to the next connected state record. Keep the state records with continuous positions in the fire chain, remove the state records with discontinuous positions from the fire chain, and output the target chain.

[0012] Further optimization: S4 includes: S4-1. Extract the position records corresponding to each state record in the target chain, and connect them sequentially according to the order in which each position record is in the target chain to form an extended path. Write each position record in the extended path into the linkage sequence in the same order. S4-2. Match each position record in the linkage sequence with the corresponding fire node, send linkage commands to the corresponding fire node in sequence according to the position order in the linkage sequence, and write the sending time of each linkage command into the linkage sequence. S4-3. Match the linkage sequence with the subsequent status records after the linkage command is sent, extract the subsequent status records received after the corresponding sending time for each position record, sort them according to the position order in the linkage sequence and the receiving time order of the subsequent status records, and output the linkage sequence.

[0013] Further optimization: S5 includes: S5-1. Match the subsequent state records in the linked sequence with the state records in the target chain according to the same position and the same order. Search for whether there is a subsequent state record in the next position corresponding to each position, and search for whether there is a subsequent state record in the previous position corresponding to each position. Output the comparison record. S5-2. Write the position record in the comparison record where there is no subsequent state record in the next position into the termination result, write the position record where there is no subsequent state record in the next position and there is a subsequent state record in the previous position into the rollback result, and write the position record where there is a subsequent state record in the next position and the next position does not conform to the corresponding order in the target chain into the invalid result. S5-3. Output the termination result and rollback result as the effective results of the linkage. Write the position records corresponding to the ineffective results into the next linkage sequence in the corresponding order in the target chain. Output the ineffective results of the linkage and the next linkage sequence.

[0014] This invention also provides a smart fire protection platform based on wireless networking, comprising: The timing restoration module is used to acquire the status records, connection records, location records and gate records in the Z-Wave wireless network, restore the status records according to the transmission and reception times in the status records, and output the restored sequence. The link concatenation module is used to match each state record in the restoration sequence with the connection record, position record and door record. For each state record, it retrieves the state records that satisfy the conditions of connection, adjacent position and door connection, and concatenates them in sequence to output the fire chain. The disturbance removal module is used to check whether there are any serialized state records before and after each state record in the fire chain. Combined with door opening records and ventilation records, it removes state records that have no serialized state records before or after them, as well as state records that have serialized state records only before or only after them and have door opening records or ventilation records within the corresponding time period from the fire chain, and outputs the target chain. The linkage generation module determines the extension path based on the positional order of each status record in the target chain, generates a linkage sequence according to the extension path, sends linkage commands to the fire nodes corresponding to the linkage sequence, collects subsequent status records after the linkage commands are sent, and outputs the linkage sequence. The result determination module is used to compare the linked sequence with the target chain in the same position and in the same order. When the linked sequence terminates, stops continuing to the next position, or regresses to the previous position at the corresponding position, it outputs a valid linkage result. When the linked sequence continues to add state records in the position order of the target chain, it outputs an invalid linkage result and generates the next linkage sequence according to the position corresponding to the newly added state record.

[0015] The present invention also provides a smart fire protection storage medium based on wireless networking, comprising: The intelligent fire protection storage medium stores a computer program, which, when executed by a processor, implements the various steps of the intelligent fire protection storage method.

[0016] The present invention, by adopting the above technical solution, has at least the following beneficial effects: 1. By performing time sequence restoration on the status record, and then combining the connection record, position record and door record to form a fire chain, and verifying the target chain position by position with the sequence after linkage, it can relatively improve the identification accuracy of the same continuous fire process under Z-Wave wireless networking conditions with arrival order distortion and disturbance interference, and make a more direct judgment on whether the linkage actually suppressed the fire process.

[0017] 2. By parallelly searching the status records in the restored sequence for connections, adjacent positions, and gate connectivity, and then combining the connection direction, position direction, and passage direction for hierarchical connection, the fire chain can simultaneously have network relationships, spatial relationships, and gate passage relationships, thereby relatively reducing the situation where unrelated short-term anomalies are mistakenly connected as the same fire.

[0018] 3. By performing isolation, marginalization, and inspection processing on the status records in the fire chain in combination with door opening records and ventilation records, and continuing to perform position continuous checks on the status records to be inspected, it is possible to remove disturbed status records affected by local door openings or local ventilation from the fire chain, thereby relatively improving the stability of the target chain's representation of the actual fire spread path.

[0019] 4. By forming an extension path and generating a linkage sequence based on the positional order of each state record in the target chain, and then sending linkage commands to the corresponding fire nodes according to the positional order in the linkage sequence, the on-site linkage actions can be kept consistent with the positional advancement relationship of the target chain, thereby relatively alleviating the problems of linkage range offset and linkage sequence mismatch.

[0020] 5. By extracting the subsequent status records after the linkage command is sent to form a linkage sequence, and comparing it with the target chain in the same position and order, it is possible to distinguish between three types of results: termination, rollback, and ineffectiveness. Thus, it is no longer based solely on whether the command has been sent or the equipment has been activated, but rather on a verification of the linkage effect based on the changes in the fire situation.

[0021] 6. By writing the position records corresponding to invalid results into the next linkage sequence in the corresponding order in the target chain, subsequent linkages can continue from positions where there are still signs of expansion, without repeatedly overwriting positions that have already terminated or regressed, thus forming a clearer control basis for the subsequent allocation and handling of linkage resources. Attached Figure Description

[0022] Figure 1 This is a flowchart of the method steps of the present invention; Figure 2 This is a schematic diagram of the system modules of the present invention. Detailed Implementation

[0023] The technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative effort are within the scope of protection of the present invention.

[0024] Refer to the instruction manual appendix Figure 1-2 The present invention provides a smart fire protection method based on wireless networking, comprising: S1. Obtain the status record, connection record, location record, and gate record in the Z-Wave wireless network. Reconstruct the status record according to the transmission and reception times in the status record and output the reconstruction sequence.

[0025] In this implementation, the role of S1 is to first restore the status records sent by each fire node in the Z-Wave wireless network to the same comparable time reference, and then form a restoration sequence for subsequent fire chain retrieval. Since there are differences in transmission paths, forwarding nodes, and reception order between different nodes in the same network and the control end, directly using the reception time as the basis for the order of each status record is easy to push the status changes that occurred earlier to the later ones. Therefore, it is necessary to first group the status records, then extract the stable transmission time difference within the group, and use the transmission time difference to back-calculate the reception time to obtain the restoration time of the corresponding status record. After the restoration time is written, it is then combined with the connection record and the location record for unified sorting before the restoration sequence that can be directly entered into subsequent retrieval and concatenation can be output.

[0026] The implementation process includes the following steps: In S1-1, the sending node identifier, receiving node identifier, sending time, receiving time, and record sequence number are first read from the status record. The status records are then grouped according to the combination of the sending node identifier and the receiving node identifier, ensuring that status records from the same sending node to the same receiving node are processed within the same group. After grouping, the difference between the receiving time and the sending time is calculated for each status record within each group. This difference is used as the intra-group time difference for the corresponding status record, and a time difference sequence is formed for that group based on the record sequence number or the original receiving order. Subsequently, in each group's time difference sequence, adjacent time differences are checked sequentially from front to back to see if they are identical. If a certain time difference appears twice or more consecutively, this consecutively appearing identical time difference is determined as the time difference of that group. When multiple consecutive times appear within the same group... When identical time differences are found, the time difference with the longest consecutive occurrence is taken as the time difference of the group; when the consecutive occurrences are the same, the earliest occurrence of identical time differences is taken as the time difference of the group; when there are no consecutive identical time differences in the time difference sequence of the group, the first time difference in the time difference sequence of the group is taken as the time difference of the group; after completing the above processing, the time differences corresponding to each group are output; in practical applications, for example, in the same group of status records where the sending node is a smoke detector node and the receiving node is a gateway node, if the time differences calculated in sequence are 3 seconds, 3 seconds, 3 seconds, and 4 seconds, then the consecutive occurrence of 3 seconds is determined as the time difference of the group; if the time differences obtained in sequence are 2 seconds, 2 seconds, 5 seconds, and 5 seconds, then since the consecutive occurrences of the two consecutive identical time differences are the same, the earliest occurrence of 2 seconds is taken as the time difference of the group.

[0027] In S1-2, each status record is matched with the time difference corresponding to its corresponding sending and receiving node combination, ensuring that each status record obtains the time difference value of its group. Then, the receiving time is subtracted from the corresponding group's time difference for each status record to obtain its restored time. The receiving time and the corresponding group's time difference use the same time unit to avoid inconsistencies in conversion. After the calculation, the restored time is written to the corresponding status record, ensuring that the status record contains at least the sending node identifier, receiving node identifier, sending time, receiving time, restored time, and record sequence number. If multiple records... If the status records belong to the same group, their respective restoration times are independently determined by subtracting the time difference of the same group from their respective reception times, without using cross-record averaging or overall correction, to ensure that each status record retains its own time position. In practical applications, for example, if the reception time of a status record is 10:05:18 and the time difference of its group is 3 seconds, its restoration time is written as 10:05:15. If the reception time of another status record in the same group is 10:05:24, its restoration time is written as 10:05:21. This ensures that a consistent time backtracking standard is maintained within the same group.

[0028] In S1-3, all state records written to the restoration time are first extracted and sorted from front to back according to the restoration time to form an initial sorting result. When two or more state records have the same restoration time, the connection order in the connection record is read, and the corresponding state records are arranged from front to back according to the connection order. If the restoration time and connection order are still the same, the position order in the position record is read, and the corresponding state records are arranged from front to back according to the position order. If the restoration time, connection order, and position order are all the same, they are arranged in ascending order according to the record number in the state record. After completing all sorting, the restoration sequence is output. The connection order here is based on the sequence number in the connection record. The sequence number from the starting node to the destination node is pre-written, and the positional order is based on the pre-written positional arrangement number in the position record. Therefore, the sorting process does not rely on manual judgment, but directly relies on the existing record fields to make decisions step by step. In practical applications, for example, if the restoration time of two status records is 10:05:15, and one of them has a connection order of 2 and the other has a connection order of 3, then the status record with connection order 2 will be placed first. If the connection order of the two status records is also the same, then their respective positional orders are compared. For example, the status record with positional order 5 will be placed before the status record with positional order 6, thus obtaining a unique restoration sequence output result.

[0029] Through the above processing, this implementation first extracts the stable time difference within the group based on the correspondence between the sending and receiving nodes, then uses this time difference to uniformly backtrack the receiving time, and superimposes the connection order and position order on the restored time to complete the sorting, so that the output restored sequence has a unified time base and a clear sequence relationship, which can be directly used as the input for subsequent fire chain retrieval and concatenation; after this processing, the status record is no longer affected by the simple difference in the order of reception, and the retrieval of subsequent status records in subsequent steps also has a clear basis, which can reduce the concatenation deviation caused by timing misalignment.

[0030] In practical applications: For example, in an old apartment building using Z-Wave wireless networking, smoke detectors in the corridor, room temperature detectors in front of the building, and door magnetic sensors at the entrance all send status records to the floor gateway. Due to relay forwarding and link differences, the reception times of the status records received by the gateway do not correspond to the actual order of occurrence. In this case, the nodes are first grouped according to the sending and receiving nodes, the time difference sequence is calculated for each group, and the time difference of the corresponding group is determined. Then, the restoration time is written into each status record. Subsequently, the records are uniformly sorted according to the restoration time, connection order, and position order to obtain the restoration sequence under the same time reference. When performing status record matching, fire chain concatenation, disturbance elimination, and linkage determination based on this restoration sequence, the order of each status record is fixed, thus supporting the subsequent implementation of the entire method.

[0031] S2. Match each state record in the restored sequence with the connection record, position record and door record. For each state record, retrieve the state records that satisfy the conditions of connection, adjacent position and door connection, and concatenate them in order to output the fire chain.

[0032] In this implementation, the role of S2 is to identify, based on the completed temporal reconstruction, the state records that can continuously transmit fire information from the reconstructed sequence, and to connect the state records that can truly form a continuous extension relationship into a fire chain. Here, the state records are not directly connected sequentially according to time. Instead, each state record is first searched in parallel from three levels: connection relationship, position relationship, and gate access relationship. Then, the results are layered according to the degree of overlap of the three types of search results. Subsequently, the directional relationship is compared to distinguish between main continuation, branch continuation, and conflicting records. Finally, the fire chain is formed through sorting, access, back-checking, and chain breaking. The purpose of this process is to transform the state records that are easily misconnected based solely on time sequence into a chained result based on the joint constraints of connection records, position records, and gate records. This ensures that the subsequent fire chain has both temporal sequence and spatial continuity and gate access basis.

[0033] The implementation process includes the following steps: In S2-1, each state record is first read from the restoration sequence in the order of restoration time, and the subsequent retrieval range for each state record is determined, wherein the state record with the later restoration time in the restoration sequence is used as the standard. Then, the current state record is matched with the connection record, position record, and gate record respectively to form three types of parallel retrieval results. For state records that satisfy the connection connection, the specific retrieval method is as follows: read the sending node identifier and receiving node identifier corresponding to the current state record, then read the sending node identifier and receiving node identifier corresponding to each subsequent state record, and search in the connection record for whether there is a connection item with the node corresponding to the current state record as the starting node and the node corresponding to the subsequent state record as the ending node. If such a connection item exists, the subsequent state record is recorded in the connection connection retrieval result. For state records that satisfy the positional adjacency, the specific retrieval method is as follows: read the position identifier corresponding to the current state record and the position identifier corresponding to each subsequent state record, and search in the position record for whether the position corresponding to the current state record and the position corresponding to the subsequent state record are adjacent to each other. If such a correspondence exists, the subsequent state record is recorded in the positional adjacency retrieval result. For state records that satisfy the gate connectivity, the specific retrieval method is as follows: read the current state record, then read the receiving node identifier and receiving node identifier corresponding to each subsequent ... The system uses the location identifiers corresponding to the previous state record, the location identifiers corresponding to the subsequent state record, and the restoration times of the current state record and the subsequent state record to search the door record for a door record that simultaneously covers both locations and whose opening time covers the corresponding time periods of both state records. If such a door record exists, the subsequent state record is recorded in the door connectivity search results. After completing the three types of searches, the system counts the number of times each subsequent state record falls into the three types of search results. If it falls into all three types of search results, the subsequent state record is written to the intersection group; if it falls into only two types of search results, the subsequent state record is written to the verification group; if it falls into only one type of search result, the subsequent state record is written to the verification group. For results of the same type of search, the subsequent state record is written to the exclusion group. In practical applications, for example, if the current state record corresponds to a smoke detector node in the corridor, and a subsequent state record corresponds to a room temperature detector node in the front room, and there is a direct connection between the two in the connection record, they are adjacent in the location record, and the fire door between them is open in the door record, then the subsequent state record falls into all three types of search results and is written to the intersection group. If another subsequent state record only satisfies the conditions of being adjacent in location and having a door connection, but there is no direct connection item in the connection record, then it is written to the verification group. If yet another subsequent state record only satisfies the condition of being adjacent in location, then it is written to the exclusion group.

[0034] In S2-2, direction comparison is performed on each state record in the intersection group. Specifically, the connection direction pointing from the node corresponding to the current state record to the node corresponding to a certain state record in the intersection group is first extracted from the connection record. Then, the position direction pointing from the position corresponding to the current state record to the position corresponding to that state record is extracted from the position record. Finally, the passage direction between the position corresponding to the current state record and the position corresponding to that state record is extracted from the gate record. To ensure direct comparison of the three types of directions, in this implementation, all three types of directions are uniformly converted into ordered position pairs from the current position to the candidate position. If the ordered position pairs corresponding to the connection direction, position direction, and passage direction are completely identical, it indicates that the state record maintains consistency in connection relationship, position relationship, and gate passage relationship, and the state record is written to the main marker. If the ordered position pairs corresponding to two of the three types of directions are identical, and the ordered position pair corresponding to the other type of direction is a reversed position pair, it indicates that the state record has... If a state record has a local continuity feature but a reversal point, write that state record to the branch marker. If the ordered position pairs corresponding to the three types of directions are all different, it means that the state record cannot form a consistent continuity with the current state record, and write that state record to the conflict marker. After marking, the state records written to the main marker and the state records written to the branch marker form a candidate group for subsequent sorting and concatenation. In practical applications, for example, if the current state record corresponds to the middle section of the corridor, and the state record of a certain intersection group corresponds to the entrance of the vestibule, and the connection direction in the connection record, the position direction in the position record, and the passage direction in the door record all show the middle section of the corridor to the entrance of the vestibule, then that state record is written to the main marker. If the state record of another intersection group has the connection direction and position direction both being the middle section of the corridor to the stairwell, but the passage direction in the door record is the stairwell to the middle section of the corridor, then that state record is written to the branch marker. If the three types of directions point to three different position pairs, then that state record is written to the conflict marker.

[0035] In S2-3, the status records in the candidate group are sorted before access, and the main link access, branch link access, and pending inspection processing are determined according to the sorting results. Specifically, the current status record is first read as the preceding status record, and then the difference between the reception time of each status record in the candidate group and the reception time of the preceding status record is calculated to form a corresponding time difference. Subsequently, the status records are sorted from smallest to largest time difference, with the smaller the time difference, the higher the sorting order. If multiple status records have the same time difference, the connection order in the connection record is read and sorted from front to back according to the connection order. If the connection order is still the same, the position order in the position record is read and sorted from front to back according to the position order. If the position order is still the same, the status records are sorted from smallest to largest according to the record number. After sorting, if the status record at the top of the sorting is written to the main marker, then this status record is directly connected to the fire chain as the next connected status record of the preceding status record. If the status record at the top of the sorting is not written to the main marker, then this status record is directly connected to the fire chain as the next connected status record of the preceding status record. If a status record is written to a branch marker and there is no status record written to the main marker in the corresponding candidate group, then that status record is connected to the fire chain branch. The remaining status records in the candidate group that are not connected to the fire chain or its branch are uniformly written to the inspection marker. Here, a fire chain branch refers to a branch continuation chain formed relative to the current main chain position, used to retain status records that still have the potential for continuation but do not meet the main continuation conditions. In practical applications, for example, if there are three status records in a candidate group, one written to the main marker and two written to branch markers, and their corresponding time differences are 2 seconds, 2 seconds, and 4 seconds respectively, then the first two status records with the same 2-second difference are compared first, and then the first and second records are determined according to the connection order and position order. If the first record is written to the main marker, then it is connected to the fire chain, and the other two status records are written to the inspection marker. If there is only one status record written to a branch marker and no status record written to the main marker in the candidate group, then that status record is connected to the fire chain branch.

[0036] In S2-4, each status record in the verification group and the status record with the inspection mark are re-searched and re-directed compared, and the connection, exclusion, or chain break is determined based on the reprocessing result. Specifically, for each status record in the verification group, the same three-category parallel search as in S2-1 is performed, and then the main mark, branch mark, or conflict mark is written according to the same direction comparison rules as in S2-2. For status records with the inspection mark, the same three-category parallel search and direction comparison are performed based on their corresponding preceding status record and current position. After reprocessing, all status records with a rewritten main mark or branch mark are connected to the fire chain; those with a rewritten main mark are connected to the main fire chain, and those with a rewritten branch mark are connected to the branch fire chain. All status records with a rewritten exclusion group or conflict mark are marked with a chain break and the connection is stopped. Then proceed to subsequent searches; here, stopping the chain means that the status record is retained in the status record set for record keeping, but is no longer used as a chained status record in the fire chain for subsequent searches; to avoid repeated loops in the re-examination process, in this implementation, only one re-search and re-direction comparison are performed on the same status record. If the main tag or branch tag is still not written after reprocessing, it is directly written to the exclusion group or conflict tag; after completing the above processing, the fire chain is output; in actual applications, for example, if a certain status record to be verified only satisfies the connection and adjacent position during the initial search, and the subsequent door record is added during the re-search, forming the door connection condition, and the direction comparison result is that the three directions are the same, then the status record is rewritten to the main tag and connected to the fire chain; if the direction relationship of a certain check tag status record is still inconsistent after re-comparison, a conflict tag is written, then a chain break tag is written and the chain is stopped.

[0037] Through the above processing, this implementation does not directly concatenate the restored sequence in chronological order. Instead, it first uses connection records, position records, and gate records to form a parallel retrieval, then uses directional consistency to form main markers, branch markers, and conflict markers. After sorting, linking, re-checking, and breaking the chain, the fire chain is output. Therefore, it can retain the state records that truly have a continuous propagation relationship and distinguish the state records that only have a local correspondence or have directional conflicts. The fire chain formed in this way has a unified temporal basis, a clear spatial continuity basis, and a clear gate passage basis.

[0038] In practical applications: For example, in a light commercial apartment building using Z-Wave wireless networking, the control terminal has already obtained the reconstruction sequences corresponding to the smoke detector nodes in the corridor, the room temperature detector nodes, the door magnetic nodes at the stairwell, and the sound and light nodes in the anteroom via S1. Starting with the current state record corresponding to the smoke detector node in the corridor, the system first searches the connection record for direct connections, the location record for adjacent locations, and the door record for connected locations covered by the door opening period. Then, state records that simultaneously satisfy all three types of relationships are written to the intersection group, state records that satisfy only two types of relationships are written to the verification group, and state records that satisfy only one type of relationship are written to the exclusion group. Subsequently, the state records in the intersection group are further compared for connection direction, location direction, and passage direction. The process involves writing state records with completely consistent directions to the main marker, writing state records with two types of consistent directions but one type of opposite direction to the branch marker, and then sorting the state records in the candidate group according to time difference, connection order, and position order. The first main marker state record is connected to the fire chain, and the first branch marker state record is connected to the fire chain branch if there is no main marker state record. The remaining state records are written to the test marker. Finally, the parallel search and direction comparison are re-performed on the test group and the test marker state records. State records that re-form main markers or branch markers are connected to the fire chain, and state records that re-form exclusion groups or conflict markers are written to the chain break marker and the connection is stopped. This results in a fire chain that can truly reflect the direction of fire continuation, providing direct input for subsequent removal of disturbing state records and generation of linkage sequences.

[0039] S3. Check whether there are any serialized status records before and after each status record in the fire chain. Combine the door opening record and ventilation record, remove the status records that have no serialized status records before or after them, as well as the status records that have serialized status records only before or only after them and have door opening records or ventilation records in the corresponding time period from the fire chain, and output the target chain.

[0040] In this implementation, the role of S3 is to remove status records from the established fire chain that are no longer suitable for retention due to local door opening, local ventilation, or isolated occurrences, while retaining status records that continuously reflect the fire expansion process, and then outputting the target chain. In specific processing, the status records in the fire chain are not deleted uniformly. Instead, the sequential position of each status record in the fire chain is determined one by one. Then, based on the door opening and ventilation records in the corresponding time period, it is determined whether the status record is isolated, marginally disturbed, or needs to be re-verified. Finally, it is removed or verified according to different markers. After this processing, the status records in the target chain not only retain the sequential relationship, but also remove the local offset records caused by door opening or local ventilation, so that the determination of subsequent expansion paths and the generation of linkage sequences have a more stable positional basis.

[0041] The implementation process includes the following steps: In S3-1, each status record is read sequentially from the fire chain according to the serialization order. For each status record, its preceding and following serialized status records in the fire chain are retrieved. Here, the preceding serialized status record refers to the serialized status record in the fire chain that is located before the current status record and directly adjacent to the current status record. The following serialized status record refers to the serialized status record in the fire chain that is located after the current status record and directly adjacent to the current status record. After completing the forward and backward retrieval, the position records corresponding to the current status record, the preceding serialized status record, and the following serialized status record are read, and their position order is extracted. If the preceding serialized status record exists, the position order corresponding to the current status record is subtracted from the position order corresponding to the preceding serialized status record to obtain the forward position interval of the current status record. If the preceding serialized status record does not exist, the forward position interval is recorded as no forward interval. If a subsequent linked state record exists, the backward position interval of the current state record is obtained by subtracting the position order of the current state record from the position order of the subsequent linked state record. If a subsequent linked state record does not exist, the backward position interval is recorded as no backward interval. Subsequently, the current state record identifier, the previous linked state record identifier, the next linked state record identifier, the forward position interval, and the backward position interval are written into the same interval record for subsequent marking and judgment. In practical applications, for example, if the position order of a current state record is 6, the position order of its previous linked state record is 5, and the position order of its next linked state record is 7, then the forward position interval of the current state record is 1, and the backward position interval is also 1. If a current state record is located at the beginning of the fire chain and there is no previous linked state record, then its forward position interval is recorded as no forward interval, and only the backward position interval is retained.

[0042] In S3-2, each state record is matched with the door opening and ventilation records within the corresponding time period to determine whether each state record is affected by door opening or local ventilation. The corresponding time period uses a unified value method: when the current state record has both a previous and a subsequent linked state record, the corresponding time period is the period between the restoration time of the previous linked state record and the restoration time of the subsequent linked state record; when only the previous linked state record exists, the corresponding time period is the period from the restoration time of the previous linked state record to the current state. The time period between the restoration times of the records; when only a subsequent serialized state record exists, the corresponding time period is the period between the restoration time of the current state record and the restoration time of the subsequent serialized state record; when neither the current nor the subsequent serialized state record exists, the corresponding time period is the single moment when the restoration time of the current state record is located; after determining the corresponding time period, read the door identifier, the positions of both sides of the door, the opening time, and the closing time in the door record, and check if there is a door record whose opening time period overlaps with the corresponding time period of the current state record, and if the position covered by the door record includes the position corresponding to the current state record; if such a door record exists, write the current state record to the door opening mark; then read the ventilation position, start time, end time, and ventilation direction in the ventilation record, and check if there is a ventilation record whose ventilation time period overlaps with the corresponding time period of the current state record, and if the position covered by the ventilation record includes the position corresponding to the current state record; if such a ventilation record exists, write the current state record to the ventilation mark; if the same state record meets both of the above conditions, then write the state record to the double disturbance. The system records the dynamic markers and retains the writing results of the door opening marker and ventilation marker. In practical applications, for example, if a certain status record corresponds to the location of the anteroom, and the corresponding time period is from 10:05:12 to 10:05:19, if the door record shows that the anteroom door opened at 10:05:10 and closed at 10:05:20, then the status record will be marked with a door opening marker. If the ventilation record also shows that the exhaust equipment corresponding to this location was in ventilation mode from 10:05:15 to 10:05:18, then the status record will be further marked with a ventilation marker and a double disturbance marker.

[0043] In S3-3, the interval records output from S3-1 and the door opening, ventilation, and double disturbance markers written in S3-2 are retrieved first. Then, the status records in the fire chain are classified according to a unified rule. For a status record that does not exist in either the preceding or following connected status record, it indicates that the status record does not form a continuous relationship with other connected status records in the fire chain, and the status record is written with an isolated marker. For a status record that exists only in either the preceding or following connected status record, and that is simultaneously marked with a door opening, ventilation, or double disturbance marker, it indicates that the status record is at the edge of the fire chain and is simultaneously affected by door opening or local ventilation, and the status record is written with an edge marker. For a status record that exists in both the preceding and following connected status records, and that is written with a door opening, ventilation, or double disturbance marker, it indicates that the status record is at the edge of the fire chain and is simultaneously affected by door opening or local ventilation, and the status record is written with an edge marker. A status record with double disturbance markers and a forward position interval equal to a backward position interval is written to the inspection mark. Here, the forward position interval equals the backward position interval, indicating that the current status record is located at a symmetrical position between the preceding and following connected status records. If it is simultaneously disturbed by both door opening and ventilation, it needs to be further checked whether it should still be retained in the fire chain. In practical applications, for example, if a status record is located in the middle of a corridor and there are no connected status records before or after it, it is directly written to the isolated mark. If a status record is located at the end of the fire chain, and there is only a preceding connected status record, and there is a door opening record in the corresponding time period, it is written to the edge mark. If another status record has connected status records before and after it, the forward position interval is 1, the backward position interval is also 1, and there are both door opening records and ventilation records in the corresponding time period, then this status record is written to the inspection mark.

[0044] In S3-4, the status records with isolated and edge markers are first removed from the fire chain, and the removal result is written back to the fire chain. Then, a position continuity check is performed on the status records with the check mark to determine whether the status record remains positionally continuous after removing disturbance factors. The specific check method is as follows: read the position corresponding to the previous linked status record, the position corresponding to the current status record, and the position corresponding to the next linked status record, and retrieve the correspondence between these three positions in the position record. When the current position simultaneously satisfies the condition of being the position following the position of the previous linked status record and simultaneously satisfies the condition of being the position preceding the position of the next linked status record, the current status record is determined to be positionally continuous, and this status record is retained in the fire chain. In the fire chain; when the current position does not meet the above two conditions, it is determined that the current state record position is not continuous, and the state record is removed from the fire chain; after completing the position continuity check of all the state records to be checked, the target chain is output; in practical applications, for example, the position corresponding to the previous connected state record is corridor position 5, the position corresponding to the current state record is corridor position 6, the position corresponding to the next connected state record is corridor position 7, and the position record clearly states that position 6 is the next position after position 5 and the previous position before position 7, then the current state record passes the position continuity check and is retained in the fire chain; if the current position is not a continuous position between the two positions, but jumps to the position of the door on the other side, then the current state record is removed from the fire chain.

[0045] Through the above processing, this implementation process first extracts the sequential relationships and positional intervals from within the fire chain, then matches each status record with the corresponding door opening and ventilation records within the time period, thereby distinguishing status records that only appear in isolation, are only disturbed at the edge, or are affected by dual disturbances and require verification, and performs elimination or positional continuity checks on them respectively, finally outputting the target chain; the target chain obtained in this way removes status records that do not have the significance of continuous propagation, and also retains status records that can still be closed in the preceding and following positions, so that when determining the expansion path and generating the linkage sequence based on the target chain, the positional order is more stable and the sequential relationship is clearer.

[0046] In practical applications: For example, in an old high-rise residential building using Z-Wave wireless networking, a fire alarm chain has already been formed after preliminary steps, containing status records corresponding to corridor smoke detectors, front room temperature detectors, stairwell door magnetic nodes, and corner sound and light nodes. At this point, each status record in the fire alarm chain is first searched for the preceding and following connected status records, calculating the forward and backward position intervals. Then, based on the door opening and ventilation records within the corresponding time period of each status record, it is determined whether an door opening marker, ventilation marker, or double disturbance marker has been written. Subsequently, status records without any connected status records before or after are written with an isolated marker, and only... State records with connected status records on the front side or only the rear side, and with doors open or ventilation during the corresponding time period, are written into edge markers. State records with connected status records on both the front and rear sides, with double disturbance markers and a forward position interval equal to a backward position interval, are written into inspection markers. Finally, the state records corresponding to isolated markers and edge markers are removed from the fire chain. The state records corresponding to the inspection markers are then subjected to a position continuity check. State records with continuous positions are retained in the fire chain, while state records with discontinuous positions are removed. This results in a target chain that more accurately reflects the continuous expansion range of the fire and provides a direct basis for subsequent expansion path determination and linkage judgment.

[0047] S4. Determine the extension path according to the position order of each state record in the target chain, generate a linkage sequence according to the extension path, send linkage instructions to the fire nodes corresponding to the linkage sequence, collect subsequent state records after the linkage instructions are sent, and output the linkage sequence.

[0048] In this implementation process, the role of S4 is to convert the target chain obtained from the previous steps into an executable on-site linkage process. First, the fire spread direction is formed based on the positional order of each state record in the target chain. Then, this spread direction is implemented as a linkage sequence, and linkage commands are sent to the corresponding fire nodes accordingly. Subsequently, the subsequent state records after the linkage commands are sent are extracted and organized to form a post-linkage sequence that can be used for subsequent linkage effect assessment. Here, linkage commands are not issued to all positions in the target chain simultaneously. Instead, an expansion path is first formed based on the established sequential positional relationships in the target chain, and then the linkage sequence is organized sequentially according to the positions in the expansion path, ensuring that the linkage actions are consistent with the positional progression of the target chain. After the linkage commands are sent, subsequent state records are extracted based on the positional records and sending time in the linkage sequence, thus ensuring that the post-linkage sequence used for subsequent assessment corresponds one-to-one with the linkage actions of this round.

[0049] The implementation process includes the following steps: In S4-1, state records are first read sequentially from the target chain in the order of concatenation, and the corresponding position records are extracted. For two adjacent state records, their order in the target chain is preserved, ensuring a continuous positional relationship between the current and subsequent position records. When multiple state records exist in the target chain, they are concatenated sequentially according to the position records corresponding to the first, second, and last state records, forming an extended path. This extended path is a positional arrangement based solely on the positional progression relationship in the target chain and does not include specific linkage instructions. After the extended path is formed, the position records in the extended path are written into the linkage sequence in the same order, so that... The position records in the linkage sequence are arranged in the same way as the expansion path. When the position records corresponding to adjacent state records in the target chain are the same, only the first position record is retained in the linkage sequence, and subsequent identical position records are not written repeatedly. When the position record corresponding to a subsequent state record in the target chain is different from the position record corresponding to the previous state record, the subsequent position record is written into the linkage sequence. In practical applications, for example, if the positions corresponding to the state records in the target chain are, in order, the middle section of the corridor, the entrance to the vestibule, the stairwell, and the stair landing, the expansion path is formed in the above order, and the middle section of the corridor, the entrance to the vestibule, the stairwell, and the stair landing are written into the linkage sequence in order. If two consecutive state records in the target chain correspond to the entrance to the vestibule, only one entrance to the vestibule position record is retained in the linkage sequence.

[0050] In S4-2, the location records in the linkage sequence are first read, and each location record is matched with its corresponding fire node. Specifically, based on the pre-established node-location correspondence, the fire node corresponding to the currently processed location record is retrieved. When the same location record corresponds to multiple fire nodes, they are arranged sequentially according to the preset node order at that location, forming the set of fire nodes corresponding to that location record. Then, linkage commands are sent to the corresponding fire nodes one by one according to the location order in the linkage sequence. These linkage commands use pre-configured fire action commands, such as sending an audible and visual alarm start command when corresponding to an audible and visual alarm node, an exhaust start command when corresponding to an exhaust node, an access control command when corresponding to an access control node, and a broadcast command when corresponding to a broadcast node. The specific linkage command used is determined by the current location record. Fire node type is determined; after each linkage command is sent, the sending time of the linkage command is recorded and written into the corresponding location record item in the linkage sequence, so that each location record in the linkage sequence has location information, corresponding fire node information, and sending time information simultaneously; if the same location record corresponds to multiple fire nodes, the linkage commands are sent sequentially according to the node order, and the completion time of the linkage command of the last fire node is used as the sending time corresponding to the location record and written into the linkage sequence; in practical applications, for example, if the anteroom entrance location record in the linkage sequence corresponds to the anteroom sound and light node and the anteroom broadcast node, the sound and light activation command is sent to the anteroom sound and light node first, and then the broadcast command is sent to the anteroom broadcast node. After both commands are sent, the sending time of the latter command is written into the linkage sequence item corresponding to the anteroom entrance location record.

[0051] In S4-3, the linkage sequence written with the transmission time is read first, then the subsequent state records after the linkage command is sent are read, and each position record in the linkage sequence is matched with the subsequent state records. Specifically, during extraction, the transmission time corresponding to each position record in the linkage sequence is taken as the starting point, and subsequent state records whose reception time is greater than the transmission time and whose position record is the same as the current position record are retrieved. Subsequent state records that meet this condition are extracted as the linkage post-state corresponding to that position record. State records whose reception time is not greater than the transmission time are not included in the linkage post-state corresponding to the current position record. For each position record in the linkage sequence, the subsequent state records received after the corresponding transmission time are extracted in the same way, and all extraction results are summarized to form the linkage post-sequence. When forming the linkage post-sequence, the subsequent state records are first arranged according to the position order in the linkage sequence, that is, the subsequent state records belonging to the previous position record in the linkage sequence are placed first, and those belonging to the linkage sequence are placed first. The subsequent state records of the next position are placed last; for multiple subsequent state records corresponding to the same position record, they are sorted from front to back according to the receiving time; when multiple subsequent state records under the same position record have the same receiving time, they are sorted from smallest to largest according to the record number in the state record; after sorting, the linked sequence is output; in practical applications, for example, if the linked sequence contains three position records in sequence: the middle section of the corridor, the entrance of the vestibule, and the stairwell, and the corresponding sending times are 10:05:10, 10:05:15, and 10:05:20 respectively, then the subsequent state records with the receiving time later than 10:05:10 and the position of the middle section of the corridor, the subsequent state records with the receiving time later than 10:05:15 and the position of the entrance of the vestibule, and the subsequent state records with the receiving time later than 10:05:20 and the position of the stairwell are extracted respectively, and then arranged in the order of the middle section of the corridor, the entrance of the vestibule, and the stairwell, and in the order of their respective receiving times, to obtain the linked sequence.

[0052] Through the above processing, this implementation first converts the position progression relationship in the target chain into an extended path, then writes the position records in the extended path into the linkage sequence in the same order, and sends linkage commands to the corresponding fire nodes according to the position order in the linkage sequence. Finally, it extracts subsequent status records based on the sending time in the linkage sequence and forms a post-linkage sequence, thereby establishing a continuous correspondence between the target chain and the on-site linkage actions. The resulting post-linkage sequence is not simply a collection of all status records after linkage, but a set of subsequent states that correspond to the sending time of each position record and are consistent with the position order of the linkage sequence. Therefore, it can be directly used as input for subsequent comparison and linkage effect judgment.

[0053] In practical applications: For example, in an old high-rise residential building using Z-Wave wireless networking, a target chain consisting of the middle section of the corridor, the entrance to the vestibule, the stairwell, and the stair landing has been obtained after preliminary processing. First, the location records corresponding to each state record in the target chain are extracted, and an extension path is formed according to this sequence. Then, each location record in the extension path is written into the linkage sequence. Subsequently, based on the correspondence between nodes and locations, the location record of the middle section of the corridor is matched to the corresponding audio-visual node, the location record of the entrance to the vestibule is matched to the corresponding broadcast node and access control node, and the location record of the stairwell is matched to the corresponding ventilation node. Audio-visual activation commands, broadcast commands, access control commands, and ventilation activation commands are sent sequentially according to the positional order in the linkage sequence, while the sending time corresponding to each location record is written into the linkage sequence. After the linkage command is issued, the subsequent state records received after the corresponding sending time for each location record are extracted and organized into a post-linkage sequence according to the positional order and the order of receiving time. This clarifies the state change of each location after this round of linkage and provides direct evidence for subsequent judgments on whether the fire has ended, whether to stop the continuation to the next location, and whether to retreat.

[0054] S5. Compare the linked sequence with the target chain in the same position and order. When the linked sequence terminates, stops continuing to the next position, or reverts to the previous position at the corresponding position, output a valid linkage result. When the linked sequence continues to add state records in the position order of the target chain, output an invalid linkage result and generate the next linked sequence according to the position of the newly added state record.

[0055] In this implementation process, the role of S5 is to perform a position-level review of the state changes after the current linkage, determining whether the fire expansion process reflected by the target chain has terminated after the linkage, whether a reversal has occurred, or whether it continues to expand along a position outside the original target chain. Based on this, it provides a valid linkage result or an invalid linkage result, and generates the next linkage sequence. This is not a general judgment of the linkage sequence, but rather a position-by-position and sequential mapping of the subsequent state records in the linkage sequence with the state records in the target chain. First, it checks whether there are still subsequent state records at the next position corresponding to each position in the target chain, and then checks whether subsequent state records reappear at the previous position, thereby distinguishing between the three categories of termination, reversal, and invalidity. Subsequently, the position results of valid linkage and the position results of invalid linkage are written out separately, so that subsequent linkages only continue around the invalid subsequent expansion positions.

[0056] The implementation process includes the following steps: In S5-1, the position records corresponding to each state record are read sequentially according to their position order in the target chain, and each position record is used as the current comparison position. Then, subsequent state records in the linked sequence are read, and the position records corresponding to each subsequent state record are extracted. The subsequent state records in the linked sequence are then matched with the state records in the target chain according to the same position and order. Specifically, if the position record corresponding to a subsequent state record in the linked sequence is the same as the position record corresponding to the current state record in the target chain, then that subsequent state record is determined as the matching record corresponding to the current position. After completing the current position matching, the next and previous positions corresponding to the current position are determined according to the position order in the target chain. The next position refers to the position record in the target chain that is after the current position and directly adjacent to it, and the previous position refers to the position record in the target chain that is before the current position and directly adjacent to it. Then, the linked sequence is searched to determine whether a subsequent state record exists at the next position corresponding to the current position. The system records and searches for a subsequent state record corresponding to the previous position. If a subsequent state record with the same position as the next position exists in the linked sequence, it is recorded as if a subsequent state record exists for the next position; otherwise, it is recorded as if a subsequent state record does not exist for the next position. Similarly, if a subsequent state record with the same position as the previous position exists in the linked sequence, it is recorded as if a subsequent state record exists for the previous position; otherwise, it is recorded as if a subsequent state record does not exist for the previous position. After completing the above search, the current position record, the search result for the next position, and the search result for the previous position are written into the same comparison record for subsequent result classification. In practical applications, for example, if the current position in the target chain is the entrance to the vestibule, the next position is the stairwell, and the previous position is the middle section of the corridor, if a subsequent state record corresponding to the stairwell exists in the linked sequence, it is recorded as if a subsequent state record exists for the next position. If a subsequent state record corresponding to the middle section of the corridor also exists, it is recorded as if a subsequent state record exists for the previous position, and both results are written into the comparison record corresponding to the entrance to the vestibule.

[0057] In S5-2, the comparison records output by S5-1 are first read, and the results are written in a uniform order. Specifically, each comparison record first checks if a subsequent state record exists at the previous position. If a subsequent state record exists at the previous position and no subsequent state record exists at the next position, the position record corresponding to that comparison record is written to the rollback result. If no subsequent state record exists at the previous position, the next comparison record is checked. If no subsequent state record exists at the next position, the position record corresponding to that comparison record is written to the termination result. If a subsequent state record exists at the next position, the position record corresponding to that next position is read and compared with the next position record corresponding to the current position in the target chain. If the next position in the linked sequence is the same as the corresponding next position in the target chain, that position is not written to the result set of this step. If they differ, the position corresponding to the comparison record is written as an invalid result. The reason for searching the previous position before searching the next position is to avoid repeatedly writing the termination result and the rollback result when the same position simultaneously satisfies the conditions that the next position has no subsequent state record and the previous position has a subsequent state record. In practical applications, for example, if the comparison record corresponding to a certain position shows that the previous position has a subsequent state record and the next position does not, then the rollback result is directly written to that position, and the termination result is not written. If the comparison record corresponding to another position shows that the previous position has no subsequent state record and the next position also does not have a subsequent state record, then the termination result is written to that position. If the comparison record corresponding to another position shows that the next position has a subsequent state record, but this next position is not the theoretical next position corresponding to that position in the target chain, but extends beyond the theoretical next position to a later position, then the invalid result is written to that position.

[0058] In S5-3, the termination and rollback results written in S5-2 are first summarized and output as valid linkage results, indicating that the linkage state corresponding to the current position has stopped expanding backward or rolled back to the previous position. Then, the position records in the invalid results are read and the next linkage sequence is generated according to the corresponding order in the target chain. Specifically, during generation, all position records are extracted from the invalid results and then rearranged from front to back according to the position order of these position records in the target chain. When there are multiple position records in the invalid results, the position record with the earliest position is taken as the starting position of the next linkage sequence, and the next linkage sequence is written in the order from the starting position to the next position in the target chain. When there is only one position record in the invalid results, that position record is taken as the next linkage. The starting position of the dynamic sequence is determined, and the next linkage sequence is written in the order of that position and its subsequent positions in the target chain. After writing is completed, invalid results are output as invalid linkage results, and the next linkage sequence is output synchronously. After this processing, subsequent linkages will no longer overwrite positions that have already been written with valid linkage results, but will only continue to execute from the position corresponding to the invalid linkage result. In practical applications, for example, if the invalid results contain two position records, namely the vestibule entrance and the stairwell, and the position of the vestibule entrance in the target chain is before that of the stairwell, then the vestibule entrance is determined as the starting position of the next linkage sequence, and the next linkage sequence is written in the order of the vestibule entrance, the stairwell, and its subsequent positions. If the invalid results only contain one position record, namely the stairwell platform, then the next linkage sequence continues to write from the stairwell platform.

[0059] Through the above processing, this implementation process first maps the subsequent state records in the linked sequence to the state records in the target chain position by position, and then checks whether the next position continues to have a subsequent state record and whether the previous position has a subsequent state record reappears, thereby distinguishing the three types of results: termination, rollback, and ineffectiveness. Then, the termination result and the rollback result are uniformly output as the effective result of the linkage, and the position records corresponding to the ineffective result are used to generate the next linkage sequence according to the corresponding order in the target chain. In this way, it is possible to make a position-level judgment on whether the current linkage has actually changed the fire spread process, and to limit the scope of subsequent linkage to the spread position that has not yet been effectively suppressed.

[0060] In practical applications: For example, in a light commercial apartment building using Z-Wave wireless networking, the target chain sequentially includes four locations: the middle of the corridor, the entrance to the vestibule, the stairwell, and the stair landing. After one round of linkage, a linked sequence is formed. At this point, the subsequent state records in the linked sequence are matched one by one with each location in the target chain. For each location, it is checked whether there is a subsequent state record in the next location and whether there is a subsequent state record in the previous location, forming a corresponding comparison record. Then, the comparison record first determines whether there is a subsequent state record in the previous location. If it exists and the next location does not, then that location is written into the rollback result. If... If neither the previous nor the next position exists, the position is written into the termination result. If the next position exists but is not the corresponding next position in the target chain, the position is written into the invalid result. Finally, the termination result and the rollback result are output as the linkage valid result. The position with the earliest position in the invalid result is taken as the starting position of the next linkage sequence. The next linkage sequence is written in the corresponding order in the target chain. In this way, after each round of linkage, it is possible to accurately identify which positions have been suppressed and which positions still need to be linked. The subsequent linkage process always continues to advance around the fire expansion position that has not yet been dealt with.

[0061] The present invention also provides a smart fire protection platform based on wireless networking, the smart fire protection platform comprising: The timing restoration module is used to acquire the status records, connection records, location records and gate records in the Z-Wave wireless network, restore the status records according to the transmission and reception times in the status records, and output the restored sequence. The link concatenation module is used to match each state record in the restoration sequence with the connection record, position record and door record. For each state record, it retrieves the state records that satisfy the conditions of connection, adjacent position and door connection, and concatenates them in sequence to output the fire chain. The disturbance removal module is used to check whether there are any serialized state records before and after each state record in the fire chain. Combined with door opening records and ventilation records, it removes state records that have no serialized state records before or after them, as well as state records that have serialized state records only before or only after them and have door opening records or ventilation records within the corresponding time period from the fire chain, and outputs the target chain. The linkage generation module determines the extension path based on the positional order of each status record in the target chain, generates a linkage sequence according to the extension path, sends linkage commands to the fire nodes corresponding to the linkage sequence, collects subsequent status records after the linkage commands are sent, and outputs the linkage sequence. The result determination module is used to compare the linked sequence with the target chain in the same position and in the same order. When the linked sequence terminates, stops continuing to the next position, or regresses to the previous position at the corresponding position, it outputs a valid linkage result. When the linked sequence continues to add state records in the position order of the target chain, it outputs an invalid linkage result and generates the next linkage sequence according to the position corresponding to the newly added state record.

[0062] The present invention also provides a smart fire protection storage medium based on wireless networking, the smart fire protection storage medium comprising: The intelligent fire protection storage medium stores computer programs. When the computer programs are executed by the processor, they realize the various steps of the intelligent fire protection storage method.

[0063] Working Principle: This solution first restores the time sequence of status records uploaded by each fire node in the Z-Wave wireless network, restoring the previously chaotic status changes due to different transmission paths and reception sequences to a unified time base. Then, it matches these status records with connection records, location records, and door records item by item, identifying which status records are sequentially connected in terms of connection relationships, spatial location, and door access relationships, and uses this to form a fire chain. Subsequently, by combining door opening records and ventilation records, clearly isolated, marginally disturbed, or discontinuous status records are removed from the fire chain, resulting in a more accurate reflection of the actual fire situation. The process involves identifying the target chain of the fire alarm; then generating a linkage sequence based on the positional order in the target chain, sending linkage commands to the corresponding fire nodes, and extracting subsequent status records after linkage to form a post-linkage sequence; finally, comparing the post-linkage sequence with the target chain position by position to determine whether the fire terminates, retreats, or continues to expand at the corresponding position, thereby outputting a valid linkage result or an invalid linkage result, and generating the next linkage sequence when necessary; the output of the previous step directly serves as the input of the next step, so the entire method does not isolate whether a certain node alarms, but rather completes identification, correction, linkage, and verification around the same fire process.

[0064] For example, in an old high-rise residential building using Z-Wave wireless networking, smoke detectors, ambient temperature detectors, door sensors, sound and light sensors, and ventilation sensors are installed separately in the corridor. At a certain moment, smoke appears in the corridor first, followed by changes in status in the vestibule and stairwell. However, due to the influence of wireless transmission and door opening and closing, the order received by the control terminal may not equal the actual order on site. This solution first restores these status records to the same temporal sequence, then determines which locations are indeed connected, adjacent, or have door connections, and strings the continuously corresponding status records into a fire chain. If a certain status record is only due to someone briefly opening a door or localized fire... If the fire is caused by ventilation, it will be identified and eliminated in subsequent processing. After obtaining the target chain, the system will trigger linkage actions such as sound and light, broadcast, access control or ventilation in sequence according to the position corresponding to the target chain. Then observe whether new subsequent status records continue to appear at each position after linkage. If the expansion after a certain position stops, or the status returns to the previous position, it means that the linkage has been effective. If the fire continues to develop outside the target chain, the system will regenerate the next linkage sequence from that position and continue to deal with it. In this way, in practical applications, the solution can not only look at whether the equipment is activated, but also whether the fire process under the Z-Wave network is really suppressed.

[0065] The above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A smart fire protection method based on wireless networking, characterized in that, include: S1. Obtain the status record, connection record, location record and gate record in the Z-Wave wireless network, restore the status record according to the transmission and reception times in the status record, and output the restored sequence; S2. Match each state record in the restored sequence with the connection record, position record and door record. For each state record, retrieve the state records that satisfy the conditions of connection, adjacent position and door connection, and connect them in sequence to output the fire chain. S3. Check whether there are any serialized status records before and after each status record in the fire chain. Combine the door opening record and ventilation record, remove the status records that have no serialized status records before or after them, as well as the status records that have serialized status records only before or only after them and have door opening records or ventilation records in the corresponding time period from the fire chain, and output the target chain. S4. Determine the extension path according to the position order of each status record in the target chain, generate a linkage sequence according to the extension path, send linkage instructions to the fire nodes corresponding to the linkage sequence, collect subsequent status records after the linkage instructions are sent, and output the linkage sequence. S5. Compare the linked sequence with the target chain in the same position and order. When the linked sequence terminates, stops continuing to the next position, or reverts to the previous position at the corresponding position, output a valid linkage result. When the linked sequence continues to add state records in the position order of the target chain, output an invalid linkage result and generate the next linked sequence according to the position of the newly added state record.

2. The intelligent fire protection method based on wireless networking according to claim 1, characterized in that: S1 includes: S1-1. Group the status records according to the sending node and the receiving node, calculate the difference between the receiving time and the sending time of each group of status records, form the time difference sequence corresponding to each group, and identify the same time difference that appears consecutively from each group of time difference sequences, and output the time difference of the corresponding group. S1-2. Match each status record with the time difference of the corresponding group, perform the operation of subtracting the time difference of the corresponding group from the receiving time for each status record, solve for the restored time of the corresponding status record, and write the restored time into the corresponding status record. S1-3. Sort the status records written at the restoration time according to the restoration time. If the restoration times are the same, sort them according to the connection order in the connection record and the position order in the position record, and output the restoration sequence.

3. The intelligent fire protection method based on wireless networking according to claim 2, characterized in that: S2 includes: S2-1. Match each state record in the restored sequence with the connection record, position record and gate record. For each state record, search in parallel for the state records that satisfy the connection, the position, and the gate connection. Write the state records that fall into all three types of search results into the intersection group, write the state records that fall into only two types of search results into the verification group, and write the state records that fall into only one type of search result into the exclusion group. S2-2. Extract the connection direction from the connection record, the position direction from the position record, and the passage direction from the gate record for each state record in the intersection group. Write the state records with the same connection direction, position direction, and passage direction into the main tag. Write the state records with two of the connection direction, position direction, and passage direction being the same and the other being opposite into the branch tag. Write the state records with different connection directions, position directions, and passage directions into the conflict tag. Then, form a candidate group by combining the state records written into the main tag and the state records written into the branch tag.

4. The intelligent fire protection method based on wireless networking according to claim 3, characterized in that: S2 further includes: S2-3. Sort each status record in the candidate group in ascending order according to the difference between the receiving time and the receiving time of the previous status record. When the time difference is the same, sort them in turn according to the connection order in the connection record and the position order in the position record. Connect the status record that is first in the sort and has a main tag written to it to the fire chain. Connect the status record that is first in the sort and has a branch tag written to it and has no main tag written to it in the corresponding candidate group to the fire chain branch. Write the remaining status records to the test tag. S2-4. Re-execute parallel retrieval and direction comparison for each status record in the group to be verified and the status record written with the inspection mark. Connect the status record rewritten with the main mark or branch mark to the fire chain. Write the status record rewritten with the exclusion group or conflict mark to the broken chain mark and stop the serial connection. Output the fire chain.

5. The intelligent fire protection method based on wireless networking according to claim 4, characterized in that: S3 includes: S3-1. For each status record in the fire chain, retrieve the previous and next connected status records respectively, calculate the forward position interval between each status record and the previous connected status record and the backward position interval between each status record and the next connected status record, and output the interval record. S3-2. Match each status record with the door opening record and ventilation record in the corresponding time period. Write the status record with the door opening record into the door opening mark, write the status record with the ventilation record into the ventilation mark, and write the status record with both the door opening record and the ventilation record into the double disturbance mark.

6. The intelligent fire protection method based on wireless networking according to claim 5, characterized in that: S3 further includes: S3-3. Write the state record where neither the previous serialized state record nor the next serialized state record exists into the isolated mark. Write the state record where only the previous serialized state record or only the next serialized state record exists and is written into the door open mark, ventilation mark, or double disturbance mark into the edge mark. Write the state record where both the previous serialized state record and the next serialized state record exist and are written into the double disturbance mark, and the forward position interval is equal to the backward position interval into the inspection mark. S3-4. Remove the state records written with isolated markers and edge markers from the fire chain. For the state records written with the markers to be checked, re-perform the position continuity check according to the position corresponding to the previous connected state record, the position corresponding to the current state record, and the position corresponding to the next connected state record. Keep the state records with continuous positions in the fire chain, remove the state records with discontinuous positions from the fire chain, and output the target chain.

7. The intelligent fire protection method based on wireless networking according to claim 6, characterized in that: S4 includes: S4-1. Extract the position records corresponding to each state record in the target chain, and connect them sequentially according to the order in which each position record is in the target chain to form an extended path. Write each position record in the extended path into the linkage sequence in the same order. S4-2. Match each position record in the linkage sequence with the corresponding fire node, send linkage commands to the corresponding fire node in sequence according to the position order in the linkage sequence, and write the sending time of each linkage command into the linkage sequence. S4-3. Match the linkage sequence with the subsequent status records after the linkage command is sent, extract the subsequent status records received after the corresponding sending time for each position record, sort them according to the position order in the linkage sequence and the receiving time order of the subsequent status records, and output the linkage sequence.

8. The intelligent fire protection method based on wireless networking according to claim 7, characterized in that: S5 includes: S5-1. Match the subsequent state records in the linked sequence with the state records in the target chain according to the same position and the same order. Search for whether there is a subsequent state record in the next position corresponding to each position, and search for whether there is a subsequent state record in the previous position corresponding to each position. Output the comparison record. S5-2. Write the position record in the comparison record where there is no subsequent state record in the next position into the termination result, write the position record where there is no subsequent state record in the next position and there is a subsequent state record in the previous position into the rollback result, and write the position record where there is a subsequent state record in the next position and the next position does not conform to the corresponding order in the target chain into the invalid result. S5-3. Output the termination result and rollback result as the effective results of the linkage. Write the position records corresponding to the ineffective results into the next linkage sequence in the corresponding order in the target chain. Output the ineffective results of the linkage and the next linkage sequence.

9. A smart fire protection platform based on wireless networking, characterized in that, include: The timing restoration module is used to acquire the status records, connection records, location records and gate records in the Z-Wave wireless network, restore the status records according to the transmission and reception times in the status records, and output the restored sequence. The link concatenation module is used to match each state record in the restoration sequence with the connection record, position record and door record. For each state record, it retrieves the state records that satisfy the conditions of connection, adjacent position and door connection, and concatenates them in sequence to output the fire chain. The disturbance removal module is used to check whether there are any serialized state records before and after each state record in the fire chain. Combined with door opening records and ventilation records, it removes state records that have no serialized state records before or after them, as well as state records that have serialized state records only before or only after them and have door opening records or ventilation records within the corresponding time period from the fire chain, and outputs the target chain. The linkage generation module determines the extension path based on the positional order of each status record in the target chain, generates a linkage sequence according to the extension path, sends linkage commands to the fire nodes corresponding to the linkage sequence, collects subsequent status records after the linkage commands are sent, and outputs the linkage sequence. The result determination module is used to compare the linked sequence with the target chain in the same position and in the same order. When the linked sequence terminates, stops continuing to the next position, or regresses to the previous position at the corresponding position, it outputs a valid linkage result. When the linked sequence continues to add state records in the position order of the target chain, it outputs an invalid linkage result and generates the next linkage sequence according to the position corresponding to the newly added state record.

10. A smart fire protection storage medium based on wireless networking, characterized in that, include: The intelligent fire protection storage medium stores a computer program, which, when executed by a processor, implements the various steps of the intelligent fire protection storage method as described in any one of claims 1-8.

Images