JPH09186711A - Disaster-prevention monitor system and data transmission method in the disaster-prevention monitor system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To reduce system-down to the utmost by utilizing at maximum a main line and a sub-line in a connecting state on the occurrence of a fault and sending data and to restore the system efficiently in the case of occurrence of system-down at once. SOLUTION: In this system, plural nodes are interconnected by transmission lines to configure a network for data transmission and the transmission lines are made up of main lines 21 and sub-lines 22. Furthermore, each node 10 is provided with a CPU control signal 16, and network communication interfaces 11, 12 and network control sections 13, 14 corresponding to the main lines 21 and the sub-lines 22. The CPU control section 16 is provided with a connection state table denoting the current connection state between nodes by the the main lines 21 and the sub-lines 22. On the occurrence of a transmission fault, a transmission line having no fault is retrieved between its node and a data station destination node based on the connection state table independently of the main lines 21 and the sub-lines 22 as the data transmission path. Then a data relay is commanded to nodes requiring data relay between the main lines 21 and the sub-lines 22 in the retrieved path to form the transmission line between itself and the destination node and the data are sent through the transmission line.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a disaster prevention monitoring system for preventing and detecting a disaster such as a fire or theft and a data transmission method thereof, and in particular, each node is provided with a connection state table indicating a connection state between nodes, The present invention relates to a disaster prevention monitoring system and a data transmission method for judging the connection status of the entire system based on this to perform data transmission and failure recovery when a failure occurs.

[0002]

2. Description of the Related Art In a local area network for highly reliable communication generally used in disaster prevention monitoring systems, a loop type network system as shown in FIG. 30 or a local area network as shown in FIG. 31 is used for data transmission. A bus-type network is used. In these systems, a network is constructed by connecting each node 10 (N1 to N10) by a transmission line such as a metal cable such as a coaxial cable or a twisted pair cable or an optical cable. In addition, disaster prevention / crime prevention terminal devices such as a receiver panel, a relay panel, and a display device (not shown) are connected to each node 10. Further, in order to ensure the reliability of the system, the transmission line is duplicated by a main line 21 that transmits data during normal operation of the disaster prevention monitoring system and a sub line 22 that transmits data when the main line 21 fails. The data transmission by the main line 21 and the sub line 22 is performed by the node 10 (not shown).
It is controlled by the internal network communication interface unit, the network control unit, and the CPU control unit, and one set of these is provided for each node 10.

In the network system having such a configuration,
When a failure such as disconnection or short circuit occurs in the transmission line, data transmission is secured by the following method. That is, in the loop type network system shown in FIG. 30, when a failure such as a disconnection occurs in the main line 21 between the node N1 (hereinafter abbreviated as N1 and other nodes) and N2 as shown in FIG. By using the sub line 22 to loop back the data in each of N1 and N2, a new loop is formed to prevent the entire system from going down. Further, in the bus type network system shown in FIG. 31, when a failure occurs in the main line 21 between N3 and N4 as shown in FIG. 33, the data transmission is switched to the side of the sub line 22 and the entire system goes down. It prevents it from being lost.

[0004]

However, in such a conventional disaster prevention monitoring system, first, in the loop type network system, as shown in FIG. 34, N1 and N2 are used.
When a failure occurs at two places between the line and between N6 and N7, even when the main line 21 only has a failure and the sub line 22 has no failure, the failure is tried to be resolved by loopback, Loopback is performed in each of N1, N2, N6, and N7. Therefore, although the secondary line 22 side is normal, there is a problem that the system is divided into two regions, loop A and loop B, as shown in FIG.

On the other hand, in the bus type network system, data transmission is possible if the sub line is normal even if the main line 21 has a plurality of faults. However, as shown in FIG. If a failure occurs at two locations between N3 and N4 and between N4 and N5 on the side of the sub line 22, there is a problem that the entire system goes down. Although the transmission line is normally duplicated, its wiring normally passes through the same duct, so that a failure due to a disconnection or the like is likely to occur simultaneously with the main line and the sub line. In such a case, in the bus type network system, the system goes down by disconnecting both lines at one place.

Further, in the conventional network system, since the main line 21 and the sub line 22 are controlled by one control system in the node, there is the main line 21 and the sub line 22. I could only build a simple backup system. Furthermore, when a system failure occurs, the recovery work is performed by specifying the failure location in any system, but even if failures occur at multiple locations, the recovery work is performed uniformly without setting a priority. There were many things. In addition, even when the work is performed by setting the priority order, it is difficult to say that efficient recovery work is performed because there are many parts that depend on the experience and intuition of workers on the site. In such a case, even if the network disconnection and system down are solved for the time being by recovering a certain point, there is also a problem that the system recovery is delayed because the part that is not directly connected to the system recovery is performed first. It was happening.

The present invention solves the above-mentioned problems and prevents the system from going down as much as possible by performing the data transmission by making the most of the main line and the sub line in the connected state even if a system failure occurs, and When a system failure occurs, a disaster prevention monitoring system and a data transmission method for the disaster prevention system, which displays the priority order to restore the failure preferentially from the point where the system is most efficiently restored and promptly recovers the system. The purpose is to

[0008]

In order to solve the above-mentioned problems, the present invention according to claim 1 is a disaster prevention system in which a plurality of nodes are connected via a transmission line to form a network to perform data transmission. In the monitoring system, the transmission line is composed of a main line that transmits data during normal operation of the disaster prevention monitoring system and a sub line that transmits data when the main line fails, and the node controls the node. And a network communication interface unit for transmitting and receiving data to and from another node via the transmission line, which is connected to the transmission line on each of the main line side and the sub line side. A reception signal of the CPU control unit as transmission data to the CPU control unit, and the transmission data output from the CPU control unit is transmitted to the network. And a network control unit for transmitting a transmission signal to the signal interface unit, the CP
The U control unit includes a connection state table indicating the current connection state between the respective nodes by the main line and the sub line, and at the time of data transmission, a failure occurs between itself and the node of the data transmission destination based on the connection state table. A transmission line that has not occurred is searched as a data transmission route regardless of the main line and sub line, and a node that requires data relay between the main line and the sub line in the searched route is instructed to perform data relay and the above-mentioned data A transmission path is formed with the destination node to transmit data to the data destination node.

Further, according to the present invention of claim 2, in the disaster prevention monitoring system of claim 1, the CPU control unit, when a failure occurs in the transmission path, detects a failure location based on the connection state table. And the priority order is set for the restoration of the faulty part, and the priority order is displayed.

Further, according to the present invention of claim 3, in a data transmission method in a disaster prevention monitoring system in which a network is constituted by connecting a plurality of nodes via a transmission line, the transmission line is connected to the disaster prevention monitoring system. A connection state that is composed of a main line that carries out data transmission during normal operation and a sub line that carries out data transmission when there is a failure of the main line Each table is provided, and at the time of data transmission, a transmission line in which no fault has occurred between itself and the node of the data transmission destination is searched as a data transmission route based on the connection state table regardless of the main line and the sub line, and the search is performed. Data relay is instructed to a node that needs to relay data between the main line and the sub line in the route, and a transmission line between itself and the data destination node is formed and It is configured to transmit data to the data destination node.

In addition, according to the present invention of claim 4, in the disaster prevention monitoring system of claim 1, when a failure occurs in the transmission line, the node detects a failure location based on the connection status table. The priority order is set for the retrieval and the restoration of the fault location, and the priority order is displayed.

According to the disaster prevention monitoring system and the data transmission method thereof of the present invention having such a configuration, at the time of data transmission, the connection states of the transmission lines of the entire system are comprehensively determined based on the connection state table of each node. to decide. That is, based on the connection state table, when a failure has occurred in the transmission path, a failure-free transmission path is searched as a data transmission path regardless of the main line and sub line. Then, a node that needs to relay data between the main line and the sub line in the searched route is requested to relay the data to form a transmission line, and the main line and the sub line in the connected state are utilized to the maximum extent for data transmission. To do.

Further, even when a node isolated from the network occurs due to a transmission line failure, the failure point is searched based on the connection state table, and the priority is given to the restoration of the failure point in consideration of the influence on the entire system. Set and display their priority. Then, on the basis of this priority order, the failure at the above failure point is restored. Therefore, it is possible to restore the system by giving priority to the place where the influence on the system is large, so that the system can be restored quickly and the influence of the failure can be minimized.

[0014]

BEST MODE FOR CARRYING OUT THE INVENTION Next, an embodiment of the present invention will be described.
This will be described with reference to the drawings. FIG. 1 is a diagram showing an overall configuration of a disaster prevention monitoring system 1 according to the present invention. The system of the present invention is similar to the conventional disaster prevention monitoring system, and the node 10 (N
1 to N6) are connected by a main line 21 and a sub line 22, and data is transmitted by the token passing method. A disaster prevention and crime prevention terminal device (hereinafter, disaster prevention terminal) 3 is connected to each node 10 by an interface such as RS-232C or a CPU bus.

In the present embodiment, the main line 21 is a bus type connection having the node N1 as the starting point and the node N6 as the ending point. Further, the sub line 22 is a bus type connection having N3 as a starting point and N4 as an ending point. As described above, according to the present invention, the main line 21 and the sub line 22 are connected to different nodes 1
The connection is made so that 0 becomes the terminal node, while at least the main line 21 or the sub line 2 is connected between all the nodes 10.
It is adapted to be connected by either one of the two. That is, in the system of the present invention, the main line 21 and the sub line 22 form a loop as a whole system.

FIG. 2 shows a node 1 used in this system.
FIG. 3 is a block diagram showing a configuration of a 0. The node 10 includes network communication interface units 11 and 12 and network control units 13 and 14 having the same function on the main line 21 side and the sub line 22 side, respectively. That is, in the node 10 according to the present invention, these are provided separately for the main line 21 and the sub line 22 independently of each other. The node 10 includes a terminal interface unit 15 for communication with the disaster prevention terminal 3 connected to the node 10, network communication interface units 11 and 12, and a network control unit 1.
C for controlling the terminals 3 and 14 and the terminal interface unit 15
CPU and peripheral circuits (not shown) such as PU, ROM, and RAM
And a CPU control unit 16 including

Here, the network communication interface units 11 and 12 are connected from the adjacent node 10 to the main line 21,
The signal received via the sub line 22 is sent to the next node 10, and the received signal is sent to the network control units 13 and 14
Plays the role of passing to. Further, the main line 21 and the sub line 22 of the signals passed from the network control units 13 and 14
It is also sent to. That is, the network communication interface units 11 and 12 perform the function of the physical layer level in the data transmission of the network. When the power of the node 10 is cut off, the network communication interface units 11 and 12 are connected to the adjacent node 1
Signals from the main line 21 and the sub line 22 from 0 can be automatically transmitted to the next node 10 by directly connecting the main line 21 and the sub line 22 of the adjacent node 10. Next, the network control units 13 and 14 send CPs to the received signals passed from the network communication interface units 11 and 12.
It plays a role of passing the received data to the U control unit 16 as well as passing the transmission data passed from the CPU control unit 16 to the network communication interface units 11 and 12 as a transmission signal. It also performs data ring layer level functions in the network such as token management.

On the other hand, the CPU control unit 16 controls each unit and, if necessary, the network control units 13 and 1
It also plays a role of passing the data received from the terminal 4 to the terminal interface unit 15 and passing the data from the terminal interface unit 15 to the network control units 13 and 14. In addition, the network communication interface unit 11 and the network control unit 13 on the main line 21 side,
Network communication interface unit 12 on the side of the sub line 22
The network control unit 14 and the network control unit 14 operate independently based on a command from the CPU control unit 16.

Here, in this system, each node 10 connected by the transmission line 2 at the time of system startup.
A network is constructed between them, and the token starts to rotate from the node 10 having a smaller node number. This network construction work is also performed when the token is lost, when a new node joins the network, or conversely when the joining node is deleted. In FIG. 1,
Here, the node number unique to each node 10 is N1 <
The description will be given as N2 <N3 <N4 <N5 <N6. Due to this system construction, the main line 2
1 and sub line 22 are N1 → N2 → N3 → N4 → N5 → N6
→ Tokens circulate in the order of N1, {N1, N2, N3,
One network is constructed by N4, N5, N6}. In this token-based data transmission, the node having the token has the data transmission right. Also, if there is no data to send even if the token is received, the token must be immediately passed to the next node.

The data transfer between the nodes will be described by taking the data transfer from the nodes N1 to N4 to the node 10 as an example. N1
When the free token is obtained, the data is transmitted to all N2 to N6 together with the busy token with N4 as the destination ID and N1 as the source ID. N4 is
If it is determined that the destination ID of this data matches with its own node number, the data is received, and after the processing, N1 is used as the destination ID and N4 is used as the destination ID, and a reception confirmation mark is added together with the busy token and N3 is added. And N2 are relayed and transmitted to N1. The N1 confirms the data and the reception confirmation mark, and if there is no work to transmit the data subsequently, the N1 transmits a free token to the N2 and ends the processing. At the time of rising, N1 transmits data to the other nodes N2 to N6, confirms the connection state, and automatically creates the node connection state table in the same manner as the data transfer procedure. In this case, if there is a reception confirmation mark and data transmission from the other party after a certain period of transmission, it is judged that the connection status is "1", and a reception confirmation mark from the other party is transmitted after a certain period of transmission. If no data is transmitted, the unconnected state is determined to be "-1". The connection state between each node 10 is described in FIG.
It can be represented by using a node connection state table (hereinafter, table) as shown in FIG. The data of Table 4 may be input by the line connection person to each node 10 or N1 and the data corresponding to Table 4 may be transmitted to the other nodes N2 to N6. FIG. 3 is a table 4 showing the connection state between itself and other nodes viewed from N1 during normal operation.
It is one. In the table, "1" indicates that the self and its node are connected but not adjacent, and "2" indicates
A state in which the self and its node are connected and adjacent to each other is shown. That is, looking at the relationship between N1 and N2, N
Since 1 and N2 are also connected to the main line 21 and the sub line 22 and are adjacent nodes, both the main line 21 side and the sub line 22 side are “2”. Looking at the relationship between N1 and N3, N
The main line 21 and the sub line 22 are also connected between 1 and N3, but since they are not adjacent as nodes, the main line 21 side sub line 22
Both sides are "1". Further, looking at the relationship between N1 and N6, although only the sub line 22 is connected between N1 and N6, N1 and N6 are also connected on the main line 21 side via N2 to N5. However, N1 and N6
Are adjacent to each other on the sub line 22 side, but are not adjacent to each other on the main line 21 side. Therefore, regarding N1 and N6, in the table 4, the main line 21 side is "1" (connection non-adjacent), the sub line 22.
The side is represented as "2" (connected and adjacent).

The connection state between itself and the other nodes viewed from the other nodes N2 to N6 can be represented in the same manner.
Tables 43 and 45 showing connection states when viewed from N3 and N5 are shown in FIG. Also in this case, by seeing this, for example, between N3 and N4, the main line 21 side is "2",
Since the sub line 22 side is represented by "1", the main line 21 side and the sub line 22 side are connected together during this time, but they are not adjacent to each other on the sub line 22 side, that is, the main line 2 side during this time.
It can be seen that only one is connected.

Table 4 of FIG. 6 is a collection of the tables 4 for the respective nodes 10 as described above. This table 4 shows the connection status between the nodes during normal operation throughout the system,
First, it is configured when the system is started up. In this system, each node 10 has the table 4 of the entire system in the CPU control unit 16 as an initial value.

As described above, the table 4 represents the node connection state of the entire system, but when a failure occurs in the transmission line 2, the connection state between the nodes changes, so that it needs to be updated. Therefore, updating of the table 4 will be described. The CPU control unit 16 updates this table. First, assume that a failure has occurred between N2 and N3 of the main line 21 as shown in FIG.
In this case, the network on the main line 21 side is {N1, N
2} and {N3, N4, N5, N6}. Looking at this from the {N1, N2} side, {N3, N
4, N5, N6} is also {N3, N4, N5, N
When viewed from the 6 side, {N1, N2} is deleted from the network. Therefore, as mentioned above, network construction based on node deletion occurs and the network is divided into respective groups. Then, the connection state after the network construction is as follows: Main line side = {{N1, N2}, {N3, N4, N5, N
6}} Sub-line side = {N1, N2, N3, N4, N5, N6}, and it becomes necessary to update the data in Table 4 as well.

Here, looking at the connection status with each node as viewed from N1 after the occurrence of a failure, the main line 21 side is in a non-connected state after N3. Therefore, the table 51 in FIG. 8 is a table in which the connection disconnected state is represented by a negative (-) number and the N1 connection state table is newly created. In this table 51, the relationship with N3 to N5 on the main line 21 side is represented by "-1" indicating disconnection and non-adjacency. Similarly, tables 53 and 55 showing the connection status with each node after the occurrence of a failure as seen from N3 and N5 are shown in FIGS. Here, for example, the relationship between N3 and N2 on the main line 21 side is represented by “−2” indicating a state where the connection is disconnected and the main line 21 side is originally adjacent. Then, by exchanging such connection state information among the nodes 10, the table 5 of FIG. 11 showing the node connection state of the entire system is created, and the above table 4 is updated to this table 5. If table 4 is updated,
That is, when the connection state between the nodes changes, there is a disconnection of the transmission path, a failure of the transmission unit, a power-off of the node, a restart of the node (power-on), or the like.

Next, in this embodiment, how data is transmitted when there is a failure in the transmission line 2 will be described. Here, as shown in FIG. 12, the main line 2
It is assumed that a failure has occurred between N2 and N3 of 1 and between N1 and N6 of the secondary line 22. In this embodiment, the connection state of the main line 21 and the sub line 22 of the entire system is comprehensively determined based on the table 4, and the connection state is requested by requesting another node 10 to relay data between the main line and the sub line. Data transmission is performed by making the maximum use of the main line 21 and the sub line 22. The CPU control unit 16 also determines such a transmission path.

13 to 15 show N when a failure occurs.
Tables 61, 63 and 65 showing connection states with other nodes as viewed from 1, N3 and N5. 16 is a table 6 showing the node connection status of the entire system at that time.
The table held by each node 10 is this table 6
Will be updated to

The data transmission of this embodiment will be described by taking the data transmission from N1 to N6 in this fault condition as an example. 17 to 23 are flowcharts showing the data transmission procedure. Note that “route search (a, b)” in the figure means that the route between the nodes a and b is searched, and it has the same meaning in connection search and relay search.
In this case, in each node 10, as shown in FIG. 17, after the initial setting (step 1 in FIG. 17, hereinafter referred to as S1), the terminal interface receiving process (S2) and the terminal interface transmitting process (S3) are performed via the terminal interface unit 15. )
Then, communication with the disaster prevention terminal 3 is performed. Next, a network interface reception process (S4) and a network interface transmission process (S5) are performed via the network communication interface units 11 and 12 and the network control units 13 and 14 to process transmission / reception data. Then, it is determined whether or not the communication is continued (S6), and when the communication is connected, the process returns to the terminal interface receiving process (S2) and the above process is repeated.

FIG. 18 is a flow chart showing the procedure of the network interface receiving process (S4). In this process, first, the destination ID in the transmission data is checked to see if there is data that needs to be received.
And the node number of its own match is determined (S4
1). When the destination ID and its own node number match, the received data is processed according to the meaning of the received data (S42). Further, when there is no received data or when the processing of the received data is completed, it is determined whether the network has been reconstructed (S43).
This network restructuring is judged based on the tokens that rotate separately for the main line 21 and the sub line 22. That is, when the token cannot be received within the predetermined time (timeout), there is a situation in which the token does not rotate in the network, it is determined that the network has been reconfigured, and a flag indicating that fact is given to the network control units 13 and 14. Is set up. Then, the presence / absence of network reconstruction is determined by looking at the flags of the network control units 13 and 14. When the network is reconfigured, the current map data cannot be used and the map data is acquired (S4).
4).

The flow chart of FIG. 19 shows the procedure for acquiring this map data. Here, first, the token is monitored by visiting the network control units 13 and 14 (S441). Tokens are traveling in a group that does not have a failure even if there is a failure such as disconnection, and the source and destination of the token are written there, so by monitoring the token, it belongs to the current network. The member's ID can be obtained. Next, when it is found from the token monitoring that the network is divided, the difference between the member configurations of the main line 21 and the sub line 22 is examined.
Then, when the own node belongs to only one of the networks, the network to which the own node does not belong is notified of its own map data (S44).
2). For example, if the self-node (N1) is N on the main line 21 side,
When belonging to the network of 1 to N3, the map data in N1 of the main line 21 is sent to the nodes of N4 to N6.

This map data is, as shown in FIG. 24, an identifier indicating that it is map data of the main line 21 or the sub line 22, and the size of the map data table (N ×
It is composed of size data indicating N) and individual numerical data indicating the connection state following the size data. in this case,
The numerical data is blank because it cannot recognize parts that it does not belong to. The data flowing on the network is actually the same as that shown in FIG.
The data length and error check code are added. Accordingly, for example, in the above example, N4 to N4
Even on the side of No. 6, the map data on the side of N1 to N3 can be acquired.

When the map data is acquired in this way, the map data is updated based on the new data (S45), and the network interface receiving process (S4) ends. Even when the system is started up, each CPU control unit 16 acquires map data and creates a table in order to grasp the node connection relationship of the entire system. As a result, a table such as the table 4 above is set as an initial value.

Next, FIG. 20 shows the procedure of the network interface transmission process (S5). Here again, the presence / absence of transmission data is first determined (S51). Then, when there is transmission data, whether transmission is currently possible, that is,
It is determined whether the network control units 13 and 14 can accept the transmission data (S52). Then, when the network control units 13 and 14 are not clogged with data and the data can be transmitted, a transmission route search for transmitting the data to the transmission destination is performed (S53). When the route is determined by the transmission route search, the data to be transmitted and the destination are set (S54), and when the route search is performed in S53, all the investigated nodes are set as uninvestigated (S55). If the transmission is permitted (S56), the data is transmitted when the token comes around.

On the other hand, FIG. 21 shows the procedure of the above-mentioned route search. Here, in order to perform data transmission from N1 to N6, the connection state between N1 and N6 is first searched in N1 (S101). In this search, as shown in FIG. 22, after the relationship with self is already investigated (S
10), it is performed by investigating the table 6 shown in FIG. 16 (S11). In this case, the data between the N1 and N6 of "-1" on the main line 21 side and "-2" on the sub line 22 side is acquired from the table 6 and becomes the return value (S12). Next, it is determined based on this data whether N1 and N6 are directly connected (S102). If no failure has occurred in the transmission line and N1 and N6 are directly connected, a return value N6 is obtained (S103) and then S54 →
By proceeding to S55 → S56 and transmitting data to N6, data transmission is performed through the route of the main line 21. However, at present, between N1 and N6, from the above acquired data,
It can be seen that the main line 21 side is in a disconnected and non-adjacent state with "-1", and the sub line side 22 is also in a disconnected and adjacent state with "-2", and is not directly connected during this ( S102). Therefore, in this case, a relay search is performed to investigate whether N1 and N6 can be connected by relay by another node (S104).

FIG. 23 shows the procedure of this relay search.
It is a flowchart of FIG. The relay search between the nodes a and b is performed from the relay search between the nodes a and b. First, S indicating the start point node is a and S indicating the end point node is E.
Is set to 1 (S21). In S21, the value of E = 1 is set every time this step is performed, but when this step is performed in the subroutine, that value is set in another memory. Therefore, when this step is passed, the original value does not always become all 1, and E only for the relevant routine.
= 1, and you will enter a different routine.

After S and E are set in this way, S and E
Are compared with each other, and it is determined whether or not the relationship with E (= 1) has already been investigated (S22). In the case of this embodiment, since the starting point node is N1, S is set to 1, but S =
Since it becomes E, the process proceeds from S22 to S23, and 1 is added to E. Then, it is judged whether or not the relay search with all the nodes is completed (S24), but since E and b are not equal and the relay search has not been performed with respect to all the nodes, the process returns from S24 to S22. In S22, E = 2
Since E = 2 has not been investigated at this time, the process proceeds to the N0 side and the connection relationship between N1 and N2 is searched (S25).
The table 6 of FIG. 16 is examined by the connection search of FIG. 22 (S11), and in the relationship between N1 and N2, the main line 21 side is “2”, the sub line 22 side is “2” (hereinafter, appropriately referred to as “2.2”). (Abbreviated) data is obtained (S12), and based on this, it is determined whether or not N1 and N2 are directly connected (S2).
6). In this case, since it is "2.2", it is understood that the main line 21 and the sub line 22 are directly connected to N1 and N2.

When it is found that N1 and N2 are directly connected, a route search is next performed between N2 and N6 (S27). In this case, returning to the flow of FIG. 21, the connection search is performed again (S101). In this connection search, E =
2 is determined to have been investigated (S10), and data "-1.-1" of the connection state between N2 and N6 is obtained (S11, S1).
2). From this, it can be seen that the main line 21 and the sub line 22 are not directly connected between N2 and N6, and S102 to S
Proceed to 104. Then, a relay search between N2 and N6 is performed. Here, since E = 1 and 2 have been investigated (S2
2), via the route of S23 → S24 → S22, E = 3 as described above, the connection search between N2 and N3 is performed, and the connection state data “−2.2” is obtained (S25). In this case, since N2 and N3 are directly connected by the sub line 22 (S26), a route search between N3 and N6 is performed (S27).

Here, N3 and N6 are connection search (S10).
As can be seen from the result “1, -1” of 1), the main line 21
Are directly connected through. Therefore, in FIG. 21, the process proceeds from S102 to S103, and the process returns to S28 with "return value: b = 6". In S28, since the return value is not "not connected", the relay search ends with "return value: E = 3" and the process proceeds to S105. Then, in S105, since the return value is "3", it is determined that there is a relay node, and the route search ends with "return value: E = N3" (S).
106). That is, it turns out that in order to transmit data from N1 to N6, it is sufficient to relay the data at N3.

When the relay node N3 is found by such a procedure, N1 requests N3 to relay the data. As a result, the relay of the data of N3 (subline 22
→ By the main line 21), data is transmitted using the sub line 22 from N1 to N3 and the main line 21 from N3 to N6 (route a → b in FIG. 12).

When the relay search is performed for all the nodes by repeating the flow of FIG. 21 to FIG. 23, if the node is not connected, the relay search ends with “return value = not connected” from S30 and the route search is performed. Returning from the absence of the relay node, the process proceeds from S105 to S107, and the route search ends with the conclusion "not connected". In this case, the failure recovery operation is started separately.

Next, the failure recovery operation will be described. In this case as well, the following recovery operation is performed by the CPU control unit 16. Now, as shown in FIG. 25, it is assumed that a failure occurs between N1 and N6 of the sub line 22, between N3 and N4 of the main line 21, and between N5 and N6 of the sub line 22 in this order.
First, the table is updated as shown in Table 7 in FIG. 26 due to the failure between the sub-lines 22 between N1 and N6. Next, if a failure occurs between N3 and N4 of the main line 21, the network is divided into two areas X and Y, and information cannot be exchanged between these two areas. Therefore, {N1, N2, N3} on the area X side and {N4, N5, on the area Y side.
In N6}, the node connection states in other areas cannot be grasped. Therefore, a table is created separately in each area, and the current table 7 is the table 81 (FIG. 27) on the area X side and the table 8 on the area Y side.
2 (FIG. 28). Here, "0" in the table indicates that the connection relationship is unknown as a result of the disconnection.

In this case, the areas P and Q of the tables 81 and 82 show the relationship between the nodes in the area X and the nodes in the area Y, such as addition / deletion of the main line 21 and the sub line 22. As long as there is no change in the network configuration, these relationships are only changes from the original connection relationship to "disconnected". That is, the areas P and Q
Can be created by simply adding "-" to the original relationship without exchanging information between areas X and Y. On the other hand, the relationships between nodes in other areas cannot be known without obtaining the current relationships between them in other areas. Therefore, the area R of the tables 81 and 82 is displayed as "0". Furthermore, if a failure occurs between N5 and N6, the table 81 on the area X side does not change,
The table 82 on the area Y side is the table 83 shown in FIG.
Is updated as.

In the present embodiment, failure recovery from such a state is achieved as follows. In the present invention, first, a failure point is specified to determine the present situation, prioritize restoration work according to the situation, and display it on a display device such as a receiver panel, relay panel, disaster prevention monitoring center, etc. . Even if it is called a failure, the degree of influence on the entire system varies depending on its location. That is, for example, a failure in a single line section where only the main line or the sub line is connected has a larger influence on the system than a failure in a part connected by both the main line and the sub line. Therefore, the situation of such a failure place is judged, the influence on the system is taken into consideration, and the priority order of the restoration work is determined and displayed. Then, based on the display, it is a feature of the present invention that the system having a large influence on the system is restored preferentially and the system is efficiently rebuilt.

In the present invention, the fault location is specified by paying attention to the "-2" portion of the table. "-2" means that the connected and adjacent nodes are disconnected, and it can be determined that a failure has occurred between them. Here, looking at the table 81 in the area X, it can be seen that the sub line between N1 and N6 is "-2", and the sub line 22 between them is broken. On the other hand, the main line 21 side is "-1"
Therefore, it is understood that the adjacent connection state is not established. That is, as the situation during this period, it can be read from the table 81 that "the place connected only by the sub line 22 is broken". Further, in the table 81, the main line between N3 and N4 is also "-2". In this case, since the side of the sub line 22 is "-1", it can be seen that "the part connected only by the main line 21 is broken".

On the other hand, looking at the table 83 in the area Y,
In addition to the obstacles mentioned above, N5 and N6 in area Y
The subline between and is "-2". In this case, the main line 21 side is “2”, which means that it is in the adjacent connection state. In other words, the situation during this period is "Main Line 2
It is possible to read from the table 83 that only the sub line 22 in the portion connected by 1 and the sub line 22 is broken.
Thus, by looking at the tables 81 and 83, it is possible to immediately determine the location of the failure and its status.

The CPU control unit 16 determines the priority of the failure recovery when the failure location and its condition are known, and after the failure is determined, the failure recovery is performed on the disaster prevention terminal 3 such as the receiver panel, the relay panel, and the display unit. Control output is performed to display the priority order of. The person who performs the restoration knows the priority order of the restoration work by checking this display, and the work is performed based on this. Then, the failure recovery is performed in order from the one having a large influence on the system. In this example, the main line is given priority over the sub line.

In this embodiment, first, the points where the nodes are connected only by the main line are repaired, and then all the fault points on the main line side are restored. Then, the single line section by the sub line is restored, and finally, the remaining faulty part on the sub line side is restored. Looking at this on the table, "-2" on the main line side (→ "-" on the main line side
1 ")->"-2 "on the sub-line side (->"-1 "on the sub-line side). In addition, what is shown in parentheses about "-1" here is that by restoring "-2" on the main line 21 side, all failures between adjacent nodes on the main line 21 side are repaired. This is because the "-1" portion on the main line 21 side on the table also becomes "1" and the "-1" on the main line 21 side automatically disappears. In other words, for failure recovery, first, "-2.-
It is performed from the place of the combination of "1", and then "-2.-2"
Will be restored. Due to the restoration of "-2" on the main line 21 side, the negative value section disappears on the main line 21 side. Then, after the main line 21 side is restored, the sub line 22 side is restored to "1-2" and "2-2". This allows
Similarly to the above, the "-1" portion on the side of the sub line 22 is also restored, and the restoration of the entire system is completed. Using the example above,
The main line 21 between N3 and N4 of "-2.-1" is first repaired. Due to this restoration, the main line 21 side is fully exposed and N1 ・ N
Between 6 will be "1-2". Subsequently, the sub line 22 between N1 and N6 which has become "1 -2" is repaired. Finally, the subline 22 between N5 and N6 of "2-2" will be restored.

In the present embodiment, the priority of the restoration order is given to the main line 21 only. However, the single line section is prioritized, and the rest of the main line 21 is restored after all the single line sections are restored. Is also good. It is also possible to give priority to the sub line 22 over the main line 21. further,
In this embodiment, the failure recovery operation is performed when the conclusion "not connected" is reached after the path search. However, when a failure occurs, it is possible to perform the failure recovery together with the path search. . Even at this time, it is desirable to prioritize the single-line section and the main line to perform the failure recovery to promptly complete the system recovery.

[0048]

As described above, according to the disaster prevention monitoring system and the data transmission method thereof according to the present invention, each node is provided with two sets of data transmission / reception function sections and is provided with a node connection state table. Based on the connection status table, the connection status of the transmission paths of the entire system is comprehensively determined to determine the optimum transmission path, and the data is relayed to the appropriate node, so that the connection status is maintained even when a failure occurs. The main line and the sub line can be used as much as possible for data transmission, and the system down can be prevented as much as possible. Therefore, it is possible to significantly improve the reliability of the entire disaster prevention monitoring system.

When a failure occurs, the failure location is identified, the current situation is judged, the restoration work is prioritized according to the situation, and the restoration work is displayed on the receiver or the disaster prevention monitoring center. There is an effect that the system can be quickly restored by preferentially recovering the system from a place having a large influence on the system. Therefore, it is possible to minimize the impact of the obstacle,
It is possible to significantly improve the reliability of the disaster prevention monitoring system as a whole.

[Brief description of the drawings]

FIG. 1 is a diagram showing an overall configuration of a disaster prevention monitoring system according to the present invention.

FIG. 2 is a block diagram showing a configuration of a node used in the disaster prevention monitoring system according to the present invention.

FIG. 3 is a table showing a connection state between itself and other nodes viewed from N1 during normal operation.

FIG. 4 is a table showing a connection state between itself and other nodes viewed from N3 during normal operation.

FIG. 5 is a table showing a connection state between itself and other nodes viewed from N5 during normal operation.

FIG. 6 is a diagram showing a node connection status of the entire system during normal operation.

FIG. 7 is a diagram showing a situation in which a failure has occurred between N2 and N3 of the disaster prevention monitoring system.

8 is a table showing a connection state between itself and another node as viewed from N1 when a failure occurs in FIG. 7. FIG.

9 is a table showing a connection state between itself and another node viewed from N3 when a failure occurs in FIG. 7. FIG.

10 is a table showing a connection state between itself and another node as seen from N5 when a failure occurs in FIG. 7. FIG.

11 is a table showing a node connection state of the entire system at the time of failure occurrence in FIG. 7. FIG.

[Fig. 12] Between N2 and N3 and N1 of the disaster prevention monitoring system
It is a figure showing the situation where a failure occurred in two places between N6.

FIG. 13 is a table showing a connection state between itself and other nodes viewed from N1 when a failure occurs in FIG. 12;

FIG. 14 is a table showing a connection state between itself and another node viewed from N3 when a failure occurs in FIG. 12;

FIG. 15 is a table showing a connection state between itself and another node viewed from N5 when a failure occurs in FIG.

16 is a table showing a node connection state of the entire system at the time of failure occurrence in FIG.

FIG. 17 is a flowchart showing a data transmission processing procedure in this embodiment.

FIG. 18 is a flowchart showing a procedure of network interface reception processing.

FIG. 19 is a flowchart showing a procedure for acquiring map data.

FIG. 20 is a flowchart showing the procedure of a network interface transmission process.

FIG. 21 is a flowchart showing a procedure for searching a data transmission path when a failure occurs.

FIG. 22 is a flowchart showing a procedure of node connection search in the data transmission path search.

FIG. 23 is a flowchart showing the procedure of a relay search in the data transmission path search.

FIG. 24 is a diagram showing a format example of map data.

[Fig. 25] Between N1 and N6, N3 and N of the disaster prevention monitoring system
FIG. 4 is a diagram showing a situation in which a failure has occurred in four locations and three locations between N5 and N6.

FIG. 26 is a table showing a node connection state of the entire system when a failure occurs between N1 and N6.

FIG. 27 is a table showing a node connection state on the area X side when a failure occurs between N1 and N6 and between N3 and N4.

FIG. 28 is a table showing a node connection state on the area Y side when a failure occurs between N1 and N6 and between N3 and N4.

FIG. 29: Between N1 and N6, between N3 and N4 and N5 and N6
It is a table showing a node connection state on the area Y side when a failure occurs in the meantime.

FIG. 30 is a diagram showing a configuration of a conventional disaster prevention monitoring system using a loop type network system.

FIG. 31 is a diagram showing a configuration of a conventional disaster prevention monitoring system using a bus type network system.

[Fig. 32] Fig. 32 is a diagram showing a situation in which a failure has occurred at one place of a transmission path in a conventional disaster prevention monitoring system using a loop type network system.

[Fig. 33] Fig. 33 is a diagram showing a situation in the case where a failure occurs at one location of a transmission path in a conventional disaster prevention monitoring system using a bus type network system.

FIG. 34 is a diagram showing a situation in which a failure has occurred at two locations on a transmission line in a conventional disaster prevention monitoring system using a loop type network system.

FIG. 35 is a diagram showing a situation in which a failure has occurred at two locations on a transmission line in a conventional disaster prevention monitoring system using a bus type network system.

[Explanation of symbols]

 1 disaster prevention monitoring system 2 transmission line 3 disaster prevention and crime prevention terminal equipment 4 to 7 node connection status table 10 node 11 network communication interface unit (main line side) 12 network communication interface unit (secondary line side) 13 network control unit (main line side) 14 network Control unit (sub line side) 15 Terminal interface unit 16 CPU control unit 21 Main line 22 Sub line 41, 43, 45 Node connection state table 51, 53, 55 Node connection state table 61, 63, 65 Node connection state table 81, 82 , 83 node connection status table N1 to N10 nodes

─────────────────────────────────────────────────── ─── Continuation of the front page (51) Int.Cl. ⁶ Identification code Internal reference number FI Technical display location H04L 12/40 H04Q 9/00 321F H04M 11/00 301 H04L 11/00 310D H04Q 9/00 321 320 (72) Inventor Masaki Sakai 7 Shimokofukada, Asada Town, Nisshin City, Aichi Prefecture Hagiwara Electric Co., Ltd. Electronic Application Division

Claims (4)

[Claims] 1. A disaster prevention monitoring system configured to connect a plurality of nodes via a transmission line to form a network for data transmission, wherein the transmission line is a main line for transmitting data during normal operation of the disaster prevention monitoring system. And a sub line that performs data transmission when the main line fails, and the node includes a CPU control unit that controls the node, and the main line side and the sub line side each have the transmission line The network communication interface unit which is connected and transmits / receives data to / from another node via a transmission path, and the received signal of the network communication interface unit
The above CP is transmitted to the PU control unit as received data.
A network control unit for transmitting the transmission data output from the U control unit to the network communication interface unit as a transmission signal, wherein the CPU control unit indicates the current connection state between the nodes by the main line and the sub line. A connection status table is provided, and at the time of data transmission, a transmission path in which no fault has occurred between itself and the node of the data transmission destination is searched as a data transmission path based on the connection status table regardless of the main line and sub-line, and Data relay is instructed to the node that needs to relay data between the main line and the sub line in the searched route, and a transmission path is formed between itself and the data destination node to transmit data to the data destination node. Disaster prevention monitoring system characterized by: 2. The disaster prevention monitoring system according to claim 1, wherein when a failure occurs in the transmission path, the CPU control unit searches for a failure point based on the connection state table and prioritizes restoration of the failure point. A disaster prevention monitoring system characterized by setting priorities and displaying the priorities. 3. A data transmission method in a disaster prevention monitoring system in which a network is configured by connecting a plurality of nodes via a transmission line, wherein the transmission line is a main line for transmitting data during normal operation of the disaster prevention monitoring system, It is composed of a sub line for data transmission when the main line fails, etc., and each node is provided with a connection state table showing the current connection state between each node by the main line and the sub line. Based on the status table, a transmission line in which no fault has occurred between itself and the node of the data transmission destination is searched as a data transmission route regardless of the main line and the sub line, and the data between the main line and the sub line in the searched route is searched. The data relay is instructed to the node that needs to be relayed, and a transmission path between itself and the data destination node is formed and data is transmitted to the data destination node. How data transmission in disaster prevention monitoring system according to claim and. 4. The disaster prevention monitoring system according to claim 1, wherein, when a failure occurs in the transmission line, the node searches for a failure point based on the connection status table and prioritizes recovery of the failure point. A data transmission method in a disaster prevention monitoring system, characterized in that the priority is displayed while being set.