JPS58147262A - Broadcast communication system - Google Patents

Abstract

PURPOSE:To perform communication from one station to plural stations effectively by transmitting a signal from an originating station to adjacent stations together with an additional sequence number which has a longer repetitive period than the difference between maximum delay time and minimum delay time in a communication network and an added originating station name. CONSTITUTION:This describes only the transmission and reception of a signal 511 with the transmission and reception timing 51 of a station 1 by the transmission and reception timing signals 52, 53-55 of other stations 2, 3-5 when the station 1 originates. In this case, the minimum delay time (b) is delay time between the stations 1 and 5, and the maximum delay time (a) is delay time between the stations 1 and 3 through the station 5. Each station has a counter for every sequence number of an originating station and drives the counter by an up-to-data signal; once its counted value reaches signal delay time (c), the counter is reset. A signal with the same sequence number of the same station received during the counting operation is discarded and a signal received while the counter is reset is decided to be the up-to-data signal, which is sent to adjacent stations.

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a communication system between stations in a communication network, and more particularly to a Fi1-to-island broadcast communication system.

When transmitting and receiving signals between stations in a communication network, there are cases in which signals are sent to a specific station and cases in which signals are sent from one station to all stations in the network.The former is for communication between KFi terminals and terminals. The latter includes the transmission and reception of exchange control signals and the like between stations necessary for the network, and the latter includes the transmission and reception of network management signals such as traffic conditions necessary for smooth operation of the network.

When transmitting signals from one station to all other stations, there are various communication methods depending on the network type and operation method, but the well-known Lindane and Talkyabus coupling clearly have an l-to-n ratio based on the communication form. Furthermore, a hierarchical communication network is suitable for l-to-n communication because the signal path is unique and is suitable for operation between a master station and a slave station.

On the other hand, in a carved net that does not fall into any of the above cases, as shown in Figure 1, the degree of freedom in the path is large, and the main station
Since it is not compatible with the slave station configuration, the 1:n communication It becomes complicated.

In other words, in the communication network shown in Fig. 1, a method has been conventionally used in which 1-to-10 communication is applied to all stations in the network, and when the signal format shown in Fig. 2 is used, 9 calling station names 112
2. A signal with the same data 11123 and the receiving station name written in the destination station name $21 will be repeatedly transmitted to all stations in the network.

The signal transmission/reception timing diagram in FIG. 3 shows how station 1 of the network shown in FIG. 1 transmits signals to all other stations. Transmission signal 312°313.314 of signal timing 31 of station 1,
315Fi are respectively destined for stations 2.3.4.5. A direct 11 signal is sent to station 2.5, which transmits from the originating station I, and a [signal is sent to other stations 3.4 via station 2 and station 5. A signal 321 at timing 32 is a signal for receiving a received signal 313 of a signal 312 whose destination is station 2 in station IK and transmitting it to station 3.

In addition to the drawback that this type of communication system requires a lot of time and effort to repeatedly transmit the same signal, each station in the network must know the strategy for each destination station in advance, which means that it is difficult to transmit the same signal repeatedly. When constructing a network, it is necessary to register the network data to each station before transportation, or to communicate the network configuration with each other after installation by means of communication other than the own communication network, which has the disadvantage of lacking speed. . Furthermore, when a failure occurs in the communication network, signals for reconfiguring the network are sent and received through predetermined detours, so it is vulnerable to complex failures that occur in multiple locations at the same time.

SUMMARY OF THE INVENTION An object of the present invention is to provide an inter-office broadcast communication method that eliminates the above-mentioned drawbacks, allows quick startup of a communication network, quick grasp of the network operating status, and increases resistance to network failures. It is in.

In other words, according to the present invention, when transmitting a signal from one station to all stations in an overconfident network, one transmitting station transmits a signal at a period longer than the difference between the minimum delay time and the minimum delay time within the overconfident network (by repeating the sequence number). and the originating station name are added to the signal and transmitted to the adjacent station, and the -blade receiving station detects and discards the duplicately received signal from the value of the counter corresponding to the originating station name and sequence number.

In addition, a broadcast communication system is obtained which is characterized in that only the latest signals are transmitted to neighboring stations.

Further, according to the present invention, when transmitting a signal from one station to all stations in the communication network, one transmitting station repeats the signal at a cycle longer than twice the difference between the minimum delay time in the communication network and the minimum delay time. It assigns a sequence number and a transmitting station name and transmits it to an adjacent station, and the receiving station matches the transmitting station name and sequence number and receives duplicate signals from the values in the memory and detects a good signal. A goodcast communication system is obtained, which is characterized in that the latest signal is discarded and only the latest signal is transmitted to the neighboring station.

The present invention will be explained below with reference to the drawings.

FIG. 4 shows the signal format used in the present invention.
In the figure, 1 communication mode 41 indicates the communication mode, broadcast communication or one-to-one communication, and 1 transmitting station name machine 43 indicates the transmitting station name (or transmitting station number; together, these will be referred to as the transmitting station name. ) in the sequence number field 44
In the column 45, enter a sequence number that is updated every time the transmitting station transmits a signal by broadcast communication and that circulates at a constant cycle, and in the data column 45, enter the data that you want to transmit.

Note that the destination station name field 42 is used only in one-to-one communication mode.

Also, any two stations within the communication network 1. Let aij and bi be the values at which the time τij from transmitting a signal to receiving it at station j is the maximum and minimum for all routes between stations i and j, respectively.
Let j be the maximum value of the minimum delay time adalj among all stations within one communication network, and the minimum delay time b%j is defined as the minimum value among all stations. That is, a signal transmitted from one station in the communication network is received by all stations within a time period ranging from the minimum delay time to the maximum delay time a. The difference between the maximum delay time a and the minimum delay time S will hereinafter be referred to as signal delay time C.

Next, the first embodiment of the present invention will be explained using FIG. 5. b0 FIG. 5 shows the communication network of FIG. ．． 3.4.5, shows the transmission and reception timing. Station 2.
3.4.5, the transmission/reception timing 5λ 53.54.55 indicates only the transmission/reception of the signal 511 at the transmission/reception timing 51 of station I, and is the minimum delay time bti delay time between stations 1.5 in the communication network of FIG. The maximum delay time a is the delay time between stations 1 and 3 via station 5. Each station has a counter for each sequence number of the transmitting station, starts the counter with the latest signal, and resets the counter when the signal delay time C is reached. Signals with the same sequence number from the same station that were received during counting are discarded, and signals that were previously received while the counter was in the sector state are determined to be the latest signals and are transmitted to the adjacent station. In other words, station 2 receives signal 511 of station 1 at the timing of signal 521.
When station 5 receives signal 511 from station 1 at the timing of signal 551, it starts its counter and transmits it to adjacent station 3.4°S.
．． ? , 0 station 2 sends it to 4 the signal 55 from station 5
1 as a signal 522, but the counter corresponding to that signal is in a counting state and after receiving the alarm signal 521, the counter is reset when the signal delay time tip elapses.
When the same sequence number signal from the same station is received again as the latest signal, the result becomes 11. The transmitting station selects the cycle N and the sending interval so that the repetition cycle of the sequence number is equal to or longer than the signal delay time C. In other words, the transmission/reception timing 51
signal 513 with the same sequence number as signal 511 in
is transmitted at time C after signal 511, and during that time, signal 512 with a different sequence number is selected.

Next, the second embodiment of the present invention will be explained below. Figure 6 shows a system in which signals are continuously transmitted from one station in the communication network, and those signals may be received by any station at any time. Indicates tying. The signal 611 at the transmission timing 61 of the transmitting station is received within the interval 621 of the reception timing 62 of the receiving station.The 0 interval 621 is between the minimum delay time and the maximum delay time a after the signal 611 is transmitted, The time is the signal delay time C. Section 622, 623.624.62
5 are receivable sections of the signals 612, 613, 614, and 615, respectively. If the repetition cycle time T of the signal sequence number is set to 02 times the signal delay time or more, and the minimum value of the transmission interval of No. 11 is set to 1 hour, then the repetition cycle N of the sequence number is determined by T/l. The transmission timing 61 in FIG. 6 is for 'l'-2·c, N=4.

Therefore, the signal with the same sequence number as signal Ul is signal 615, and the signal half a cycle later is signal 61! It is. Before reception time 4 62 ~ 1 section 623 sex section 6z
It does not intersect with 11th Ward Kaku 625, that is, ding≧2
If the condition e, N≧T/l is met, signals with a certain sequence number and a sequence number half a period after that will be received in reverse order no matter what receiving station in the network receives the signal. Therefore, each station in the network has a sequence number (hereinafter referred to as 7 stations) for each sequence number of the transmitting station, and performs 219 processes in the nine-frame P-char F shown in FIG.

In other words, when a signal is received, if the 7 rad corresponding to the signal's transmitting station name and sequence number is 101, it is determined that it is the latest signal, and its own flag is set to 11', and the flag corresponding to the seedance number half a cycle later is set to 10. ' and transmits the received signal to the neighboring station. On the other hand, if the received flag corresponding to a good signal is 11', it is determined that double reception has occurred and it is discarded. Next, FIG. 8 shows the transmission and reception timing when the second embodiment is applied to the communication network of FIG. 1. At transmission timing 80 when station 1 transmits a signal with a sequence number period N of 4, signals 801, 802, 803° 804, and 80 companies each have sequence numbers n of 1, 2, and 3.
．． 41, reception timings 81 and 82 are reception timings at stations 2 whose sequence numbers n of station 1's transmission signals are 1 and 3, respectively. The n-1 signal 801 is the signal 811, 812
, 813 until the reception is completed at the timing of n=3 signal 8.
03 is not received by station 2, signal 803 with n=3
It has been demonstrated that the signal 805 for n=1 is not received at station 2 until it has been received at the timing of signals 821, 822, 823.

As explained above, according to the present invention, overconfidence in the l-to-n p-docas F method can be avoided in a communication network that does not have a ring, path, or hierarchical structure like the communication network shown in FIG. il
can be expressed.

By using the broadcast communication system of the present invention, each station can transmit the relationship between its own station and neighboring stations by broadcast communication when the network is installed, so that the configuration of the entire network can be known. Also, when adding a new station to the network, the new station can easily reconfigure the network by transmitting only the relationship with the II connected station via broadcast communication and having other stations send similar data. . Similarly, when a station leaves, the network is reconfigured if the station to leave sends a message to the effect of leaving via broadcast communication. Furthermore, when a station failure or route failure is detected, the station that detects it sends a broadcast message, which is transmitted to all stations in the network, and the network is reconfigured. It is clear that this is unnecessary. Even if a failure occurs in some part of the network and the signal is lost, there is no difference between the signal and the originating station. 3 is a signal transmission/reception timing diagram when using the conventional technology, FIG. 94 is a signal format diagram used in the present invention, FIG. 5 is a signal transmission/reception timing diagram jlES diagram of the first embodiment, and FIG. 8 is an implementation of tijI2. An example signal transmission/reception timing diagram.

FIG. 7 is a processing flow diagram.

In the figure, 41...Communication mode, 21.41...Destination station name type,
22゜43... Source station name type, 44... Sequence number field, 23゜45... Data structure, 31.32.33
．． 34.35.51, 52°53, 54.55.61,
62.80.81,82...Signal transmission/reception timing, 3
12,313%314,315,321,322゜33
1.341,351,352,511,512,513
,521°522.523,531,532,533,
541,542,543゜551.552,553,6
11,612,613,614,615゜801.80
2,803,804,805,811,812%813
゜814.821,822,823...Signal, 621
．． 622.623°624.625...Receivable section.

1PJI diagram wJ2 figure Figure 3 ) II, Figure 4 Figure 5 Figure 6 6z '187 Figure Figure 8 369

Claims (2)

[Claims] (1) When transmitting a signal from one station to all stations in an overconfident network, the transmitting station sends a sequence number and transmitting station name that are repeated at a cycle longer than the difference between the maximum delay time and the maximum delay time within the overconfident network. is added to the signal and transmitted to the adjacent station, while the receiving station receives duplicates from the kakunta value corresponding to the originating am name and seedance number, detects a large signal, discards it, and sends the latest received signal. Only - lol! Boocast communication method characterized by transmitting to stations (2) When transmitting a signal from one station to all stations in a communication network, the transmitting station transmits a sequence number that repeats at a cycle longer than twice the difference between the maximum delay time and the maximum delay time in the communication network. The transmitting station name and sequence number are added to the signal and transmitted to the CIHI station, while the receiving station detects and discards the duplicately received Shingo from the values in the nine memory corresponding to the transmitting station name and sequence number, and sends the signal to the CIHI station. Transmits only the received signal to the neighboring station *
*P-broadcast communication method.