TWI656775B - Decentralized coordinated communication - Google Patents

Abstract

Decentralized Coordinated Communication (Decentralized Coordinated Communication) is a distributed node architecture. First, the starting node finds the target node through the relay node on the broadcast channel, and then determines the frequency hopping transmission and reception mode between each other. The starting node and the target node can transmit data or voice calls through the corresponding frequency hopping transmission and reception mode on the non-broadcast channel through the relay node, thereby achieving the effect of “talking the phone without money”.

Description

Decentralized coordinated communication method

This creation is based on a decentralized node architecture proposed to coordinate the communication methods of each node.

With the popularity of communication devices such as smart phones, most people have at least one communication device. The basic use of communication devices involves making calls to provide communication between people.

In order to achieve the above-mentioned communication with the communication device, the user pays the telecommunication operator to rent the door number, and the SIM card is installed in the communication device, and the user can operate the communication device to transmit and receive the message, and connect to the telecommunication industry. The host, the call signal must pass through the host of the carrier to communicate to the other party's communication device. It can be seen that the host of the telecom operator plays the necessary medium for communication between the communication devices. The host of the telecommunication industry acts as the centralized control device for the telecommunication. If the user fails to pay the rented door number as scheduled, the communication device cannot connect to the carrier of the telecommunication operator, and thus cannot Make a call. However, paying the tenant number to the telecommunications operator may result in a financial burden on the user.

In addition, when the carrier of the telecom operator crashes or closes due to natural disasters and man-made disasters, all communication devices cannot be connected to each other through the carrier of the telecommunications carrier, causing a major problem that cannot be connected.

In view of the troubles caused by the prior art that the host of the telecom operator plays the centralized control device of the telecom, "call free" is the primary purpose of the creation. Therefore, this creation proposes a decentralized coordinated communication system based on decentralized The node architecture makes voice calls or data transfers.

The decentralized coordinated communication method of the present invention comprises: (a) first finding a target node, and then declaring a frequency hopping transceiver mode phase, comprising: (a-1) transmitting, by a starting node, a search target node code frame on a broadcast channel; - 2) receiving, by the at least one relay node, the search target node code frame, recording the identification code of the start node, and transmitting the search target node code frame on the broadcast channel; (a-3) receiving the target node by the target node The at least one relay node transmits the search target node code frame, and records the identification code of the at least one relay node; (a-4) recorded by the target node in the broadcast channel according to step (a-3) The at least one relay node identification code backhaul includes an announcement target frequency hopping transceiver mode code frame for the at least one relay node; and (a-5) receiving, by the at least one relay node, the announcement target frequency hopping transceiver mode code After the frame, the broadcast channel returns an announcement start frequency hopping transceiver mode code frame to the start node according to the start node identification code recorded in step (a-2); (c) transmitting data phase, including: Passing at least the starting node and the target node a relay node performs data transmission, wherein the start node and the at least one relay node transmit a data code frame through the initial frequency hopping transmission and reception mode of a non-broadcast channel, the at least one relay node and the target Transmitting a data code frame between the nodes through the target frequency hopping transceiver mode of a non-broadcast channel, the data code frame includes a content size information and a user-defined content, the content recording data or/and voice; The search target node code frame of a-1) includes the target node identification code, the start node identification code, a connection code, and a search range hierarchy job code, and the connection code is initiated by the start node and has Uniqueness; the search target node code frame transmitted in step (a-2) includes the target node identification code, the at least one relay node identification code, the connection code, and the search range class operation code of the down-conversion hierarchy And the level of the search range level job code in the search target node code frame received by the target node in step (a-3) is above zero; the announcement target frequency hopping transmission and reception in step (a-4) The mode code frame includes the target frequency hopping transceiver mode operation code and the connection code, and the target frequency hopping transceiver mode operation code corresponds to a target frequency hopping transmission and reception mode to support only the at least one relay node and the target node to hop and receive communication. The announcement start frequency hopping transceiver mode code frame in step (a-5) includes the initial frequency hopping transceiver mode operation code and the connection code, and the initial frequency hopping transceiver mode operation code corresponds to a starting frequency hopping transceiver. The mode supports only the at least one relay node to transmit and receive communication with the start node by frequency hopping; further, when the broadcast channel service usage rate is high, each node can repeatedly transmit the code frame in a time-multiplexed manner to avoid code frame collision. .

According to the decentralized coordinated communication method proposed in the present creation, the starting node in the distributed node architecture finds the target node through the relay node, and determines the frequency hopping transmission and reception mode between each other, so that between the starting node and the target node The voice call or data data transmission can be performed by the relay node. Compared with the prior art, the distributed distributed communication method of the present invention does not need to be controlled by the telecom operator's centralized control, so the user does not have to rent the carrier. The door number, in turn, achieves the goal of "talking the phone without money"; also because the communication between the starting node and the target node does not pass through the carrier of the telecom operator, and naturally it is not affected by the failure or failure of the host of the telecom operator.

The embodiment of the distributed decentralized communication method can be implemented in a distributed communication system, where the distributed communication system includes a plurality of nodes, wherein the node can be a communication device, and the communication device refers to an electronic device having a wireless transmission function, for example : Smart phones, tablets, laptops, wireless sharing devices or wireless transceivers, but not limited to them.

With the increasing popularity of Taiwan's urbanization, people living in the local area or people passing by, each citizen can hold one or more communication devices. In other words, the nodes are scattered in various areas, for example, the nodes can be dispersed in one Buildings, neighborhoods, counties, and even cities and counties are in line with the decentralized node architecture of this creation. The nodes are capable of installing and executing an application (APP) for each of the two nodes to be connected to each other via short-range wireless communication technology, for example, the short-range wireless communication technology can Bluetooth communication technology (Bluetooth 5.0), but not limited to this. Bluetooth-based technology is standard equipment for most mobile communication devices today, so this method of creation can be widely implemented and its usability is greatly enhanced. Bluetooth communication technology version 5.0 contains forty communication channels, three of which are broadcast channels, and the remaining thirty-seven channels are non-broadcast channels that can be frequency-hopping communication. Transmission of data through frequency-hopping transmission and reception mode is communication. The general knowledge in the technical field is not described in detail here. In short, the frequency hopping transceiver mode refers to transmitting data through different frequency channels at different time points to reduce the probability of communication interference, and the frequency hopping transceiver mode can be accompanied by half. Duplex or full-duplex technology operation.

The following is a description of the decentralized coordinated communication method of this creation. First, the overall flow is explained. Referring to FIG. 1 and FIG. 2, in order to enable the originating node N3 to find the distant target node N0 and perform voice call or data transmission, the embodiment of the creative distributed coordinated communication method includes (a) first searching. The target node then announces the frequency hopping transceiver mode phase; (b) records the node and test path phase; (c) transmits the data phase; (d) ends the communication phase; and (e) the communication quality test phase. Wherein, stages (a), (b), (c) of the embodiment shown in FIG. 1 may be executed sequentially, or in other embodiments, stage (a) is executed after skipping stage (b) and directly executing stage (c) ).

Referring to FIG. 7, a common frame format for transmitting and receiving between nodes is first described, which includes a preamble 11, a destination ID 12, and a source ID. 13. A connection code (Label) 14, an operation code (Action Code) 15, a content size (Content Size) 16, a user-defined content (Content) 17 and a checksum (Checksum) 18. The preamble 11 is a synchronization (identification) signal of the code frame; the destination identification code 12 can record a multimedia access control address (MAC address) of the code frame receiving node; the source identification code 13 can record the transmission code. a multimedia access control address of the node of the frame; the connection code 14 has uniqueness, and different connection requirements correspond to different connection codes; the job code 15 corresponds to a job execution program. In the present creative embodiment, each node An index table can be downloaded and stored from a server for use in a lookup table. The index table includes a plurality of job codes 15 and a plurality of job execution programs respectively corresponding to the job code 15, that is, one job code 15 only corresponds to a job execution program; the user definition content 17 is used to store the transferred data; the content size 16 records the size of the Bytes of the user-defined content 17 so that each node can distinguish and read the user-defined content. 17; the test and 18 provide code frame error checking or error correction code information.

Referring to FIG. 1 and FIG. 2, (a) first searching for a target node, and then declaring a frequency hopping transceiver mode phase includes:

(a-1) A lookup target node code frame is transmitted by a start node N3 on a broadcast channel.

(a-2) receiving, by the at least one relay node, the search target node code frame, recording the identification code of the start node, and transmitting the search target node code frame on the broadcast channel. In the present embodiment, since the starting node N3 and the target node N0 may be some distance apart, the two must be transmitted through the relay node, as shown between the starting node N3 and the target node N0 in FIG. The relay node N2, the relay node N1, the node N21, and the node N22 are taken as an example. When the starting node N3 transmits the search target node code frame on the broadcast channel, the relay node N2, the node N21, and the node N22 The search target node code frame may be received, and the start node N3 identification code and the connection code are recorded in respective memories, and then each node N2, N21, N22 transmits the search target through the broadcast channel. The node code frame, so the relay node N1 can receive the search target node code frame transmitted by each node N2, N21, N22. However, node N1 only retains a code frame with the best signal quality (including the strongest signal, the lowest transmission delay, and the least or even no error rate) to ensure the simplification of the connection. Further, the node N21 is connected with the relay node N1. The wall W is blocked, so the signal strength of the node N21 is weakened, and the distance from the node N22 to the relay node N1 is farther than the distance from the relay node N2 to the node relay N1. For the relay node N1, such as selection and Node N22 communication will increase the transmission delay and bear the risk of increasing the bit error rate. In summary, after the relay node N1 judges, only the connection code and the identification code of the relay node N2 are recorded as a later return "declaration frequency hopping". Transceiver mode "code frame destination identification code. In other words, the relay node N1 and the relay node N2 send and receive the search target node code frame on the broadcast channel with each other, and the node N21 and the node N22 are eliminated by the self-receipt time-out mechanism. The message timeout mechanism means that the node N21 and the node N22 judge that the code frame belonging to the connection code has not been received after the end of the communication threshold time, and then delete the connection code of the memory and end the communication.

(a-3) receiving, by a target node N0, the search target node code frame transmitted by the at least one relay node, and recording an identification code of the at least one relay node. In the present embodiment, the relay node N1 receives the frame of the target node of the relay node N2 and transmits it to the external node, and receives the target node N0 and records the relay node N1 identification code and the connection code in the memory. It should be noted that since the target node N0 identification code recorded in the search target node code frame transmitted in steps (a-1), (a-2) and (a-3) is the destination identification code of FIG. 7, all The node that receives the search target node code frame compares the identity code of the own target with the target node N0 identification code, and if so, is the target node N0; if not, it is the candidate relay node.

(a-4) the at least one relay node identification code returned by the target node N0 in the broadcast channel according to the step (a-3) includes an announcement target frequency hopping transceiver mode code frame for the at least one relay node. In the present embodiment, the target node N0 returns the announcement target frequency hopping transceiver mode code frame to the relay node N1 in the broadcast channel according to the relay node N1 identification code recorded in step (a-3); After the node N1 receives the announcement target frequency hopping transceiver mode code frame of the target node N0, the relay node N1 is in the broadcast channel according to the relay node N2 identification code returning record recorded in step (a-2). Following the frequency hopping transceiver mode code frame is given to the relay node N2. Therefore, the relay node N2 and the relay node N1 announce and relay the frequency hopping transceiver mode code frame in the broadcast channel.

(a-5) after receiving, by the at least one relay node, the announcement target frequency hopping transmission and reception mode code frame, the broadcast channel is back according to the initial node N3 identification code recorded in step (a-2). The initial frequency hopping transceiver mode code frame is given to the starting node N3. In the present embodiment, the relay node N2 returns the announcement start frequency hopping transceiver mode code frame to the start node N3 according to the recorded start node N3 identification code.

The search target node code frame in the step (a-1) includes the target node N0 identification code, the start node N3 identification code, a connection code, and a search range hierarchy job code, and the connection code is started by the start Node N3 is initiated and unique. In the present embodiment, the broadcast channel may have other connection code frames, so the unique connection code is advantageous for the identification and differentiation of all nodes.

The search target node code frame transmitted in the step (a-2) includes the target node N0 identification code, the at least one relay node N2 or N1 identification code, the connection code number, and the search range level operation of the down-regulation level Code. That is to say, after the starting node N3 transmits the search target node code frame, any node receives the code frame and reduces the first-order search range class operation code to the updated search range level before the transfer. Job code.

The level of the search range hierarchy job code in the search target node code frame received by the target node N0 in step (a-3) is above zero. In this embodiment, if the level of the search range hierarchy job code after the level is reduced is zero, the search target node code frame is no longer transmitted externally, so as to avoid unlimited expansion of the search range.

The announcement target frequency hopping transceiver mode code frame in the step (a-4) includes the target frequency hopping transceiver mode operation code and the connection code, and the target frequency hopping transceiver mode operation code corresponds to a target frequency hopping transmission and reception mode to support only The at least one relay node N1 and the target node N0 hop by frequency to transmit and receive communications. In the present embodiment, since the plurality of relay nodes N1 and N2 are included, the relay frequency hopping transmission and reception mode job code corresponds to a relay frequency hopping transmission and reception mode to support only the relay node N1 and the relay node N2. Inter-frequency hopping communication.

In the step (a-5), the initial frequency-hopping transceiver mode code frame includes the initial frequency-hopping transceiver mode operation code and the connection code, and the initial frequency-hopping transceiver mode operation code corresponds to a starting frequency-hopping transceiver mode. The communication is only supported by the at least one relay node N2 and the start node N3.

Moreover, when each node wants to transmit a code frame through a broadcast channel, when the broadcast channel service usage rate is high, each node can repeatedly transmit the code frame in a time-multiplexed manner to avoid code frame collision.

(b) Record node and test path stages, including:

(b-1) transmitting, by the originating node, the recording node and the test path code frame to the at least one relay node through the initial frequency hopping transmission and reception mode of the non-broadcast channel. In the present embodiment, the originating node N3 transmits the recording node and the test path code frame to the relay node N2 through the initial frequency hopping transmission and reception mode of the non-broadcast channel, and the relay node N2 transmits the non-broadcast channel again. The relay frequency hopping transmission and reception mode transmits the recording node and the test path code frame to the relay node N1, so the relay node N1 and the relay node N2 can transmit the code frame through the relay frequency hopping transmission and reception mode of the non-broadcast channel. .

(b-2) receiving, by the at least one relay node, the recording node and the test path code frame, and transmitting the recording node and the test path code frame to the target node through the target frequency hopping transmission and reception mode of the non-broadcast channel. In the present embodiment, the recording node and the test path code frame are transmitted to the target node N0 by the relay node N1 through the target frequency hopping transmission and reception mode of the non-broadcast channel.

(b-3) receiving, by the target node, the recording node and the test path code frame, and transmitting the recording node and the test path code frame to the at least one relay node by using the target frequency hopping transceiver mode. In the present embodiment, the target node N0 transmits the recording node and the test path code frame to the relay node N1 through the target frequency hopping transmission and reception mode, and then the relay node N1 transmits the relay frequency hopping transmission and reception mode. The recording node and the test path code frame are given to the relay node N2. Therefore, the relay node N1 and the relay node N2 can transmit the code frame to each other through the relay frequency hopping transmission/reception mode of the non-broadcast channel.

(b-4) receiving, by the at least one relay node, the recording node and the test path code frame, and transmitting the record node and the test path code frame to the start node through the initial frequency hopping transceiver mode. In the present embodiment, the relay node N2 transmits the record node and the test path code frame to the start node N3 through the initial frequency hopping transmission and reception mode.

(b-5) The recording node and the test path code frame are received by the starting node N3, and all node identification codes of the complete path are stored.

The recording node and the test path code frame transmitted by the starting node N3 in the step (b-1) contain one content defined by the user, that is, the user-defined content 17 shown in FIG. For recording the starting node N3 identification code.

In the recording node and the test path code frame transmitted by the at least one relay node N2, N1 in step (b-2), the user-defined content sequentially records the start node N3 identification code and the at least one medium. Following the node N2, N1 identification code. In the present embodiment, the content sequentially records the start node N3 identification code, the relay node N2 identification code, and the relay node N1 identification code.

In the recording node and the test path code frame returned by the target node N0 in step (b-3), the user-defined content sequentially records the start node N3 identification code, the relay node N2 identification code, and the middle The node N1 identification code and the target node N0 identification code form all node information of a complete path, and the target node N0 stores the information before the return.

Before the at least one relay node returns the recording node and the test path code frame in step (b-4), all the node identification codes are also stored first. In the present embodiment, the relay node N1 and the relay node N2 also store all node information of the complete path.

(c) The data transfer phase, which includes:

Data transmission is performed by the start node and the target node through the at least one relay node, wherein the start node and the at least one relay node transmit data through the initial frequency hopping transmission and reception mode of a non-broadcast channel a code frame, the at least one relay node and the target node transmit a data code frame through the target frequency hopping transmission and reception mode of a non-broadcast channel, where the data code frame includes a content size information and a content defined by the user, This content describes data or/and voice. In the present embodiment, the start node N3 and the relay node N2 transmit the data code frame through the initial frequency hopping transmission and reception mode of a non-broadcast channel, and the non-transmission node N2 and the relay node N1 pass through a non-transmission node. The relay frequency hopping transceiver mode of the broadcast channel transmits a code frame, and the data frame is transmitted between the relay node N1 and the target node N0 through the target frequency hopping transmission and reception mode of a non-broadcast channel.

When the initiating node N3 intends to end the communication, after the (c) transmission data phase, the starting node N3 dominates the entry (d) and the end of the communication phase includes:

(d-1) The start node transmits an end communication code frame to the at least one relay node through the initial frequency hopping transmission and reception mode, and deletes the connection code from the memory of the start node. In the present embodiment, the start node N3 transmits an end communication code frame to the relay node N2 through the initial frequency hopping transmission and reception mode, and then the start node N3 deletes the connection code from the memory.

(d-2) after receiving the end communication code frame, the at least one relay node first transmits the end communication code frame to the target node through the target frequency hopping transmission and reception mode, and then deletes the memory from the memory of the at least one relay node. Connection code. In the present embodiment, when the relay node N2 receives the end communication code frame, the relay node N2 first transmits the end communication code frame to the relay node N1 through the relay frequency hopping transmission and reception mode, and the memory from the relay node N2. The body deletes the connection code; when the relay node N1 receives the end communication code frame, the relay node N1 transmits the end communication code frame to the target node N0 through the target frequency hopping transmission and reception mode, and then deletes the memory of the relay node N1. The connection code.

(d-3) After the target node N0 receives the end communication code frame, the connection code is deleted from the memory of the target node N0.

In addition, all the nodes N3, N2, N1, and N0 can receive the connection timeout after receiving the communication threshold time, and then delete the connection code from the respective memory and end the communication. The value of the end of the communication threshold can be pre-stored in the memory of each node.

During the (c) transmission data phase, if the originating node N3 does not receive the data frame after a transmission threshold, and the reception timeout occurs, the (e) communication quality test phase is performed, wherein the communication threshold is terminated. The value of the time is greater than the value of the transmission threshold time, and the value of the transmission threshold time can also be preset in the memory. (e) The communication quality testing phase includes:

(e-1) The communication node transmits a communication quality test code frame through the initial frequency hopping transmission and reception mode. In the present embodiment, the start node N3 transmits a communication quality test code frame to the relay node N2 through the initial frequency hopping transmission and reception mode, and then the relay node N2 transmits the relay frequency hopping transmission and reception mode. The communication quality test code frame is given to the relay node N1.

(e-2) After receiving the communication quality test code frame transmitted by the start node, the at least one relay node transmits the communication quality test code frame through the target frequency hopping transmission and reception mode. In the present embodiment, the relay node N1 transmits the communication quality test code frame to the target node N0 through the target frequency hopping transmission and reception mode.

(e-3) After receiving the communication quality test code frame transmitted by the at least one relay node, the target node returns the communication quality test code frame through the target frequency hopping transmission and reception mode. In the present embodiment, the target node N0 transmits the communication quality test code frame to the relay node N1 through the target frequency hopping transmission and reception mode, and then the relay node N1 transmits the relay frequency hopping transmission and reception mode. The communication quality test code frame is given to the relay node N2.

(e-4) After receiving the communication quality test code frame returned by the target node, the at least one relay node returns the communication quality test code frame through the initial frequency hopping transmission and reception mode. In the present embodiment, the relay node N2 transmits the communication quality test code frame to the start node N3 through the initial frequency hopping transmission and reception mode.

(e-5) after the start node receives the communication quality test code frame returned by the at least one relay node, if the connection quality is normal, the (c) transmission data phase is continued; if the connection quality is abnormal, the execution is performed. (d) End the communication phase. In the present embodiment, the communication node test code frame returned by the relay node N2 is received by the originating node N3 to determine the connection quality.

Each of the communication quality test code frames transmitted in steps (e-1) and (e-2) includes a communication quality test operation code for each node to determine the communication product according to the received signal strength, signal transmission delay, and bit error rate. Value, since the test of communication quality is a common knowledge in the technical field, it will not be described in detail here.

Each of the communication quality test code frames issued in steps (e-3) and (e-4) includes a test result job code, a content size information, and a content defined by the user, and the content is recorded. The test result is used by the starting node N3 to determine whether the connection is normal.

In step (a-2), the at least one relay node includes a plurality of relay nodes, and the relay nodes transmit and receive the search target node code frame in a broadcast channel with each other; in step (a-5), the The relay nodes send and receive the relay frequency hopping transceiver mode code frame on the broadcast channel; similarly, in steps (b-2), (b-4), (d-2), (e-2), In (e-4) and (c), the relay nodes transmit code frames through the relay frequency hopping transmission and reception mode of the non-broadcast channel.

Referring to FIG. 1, when the starting node N3 performs (a) first searching for a target node, and then declaring that the frequency hopping transceiver mode is waiting for the receiving timeout, the representative node N0 is not found yet. Referring to FIG. 3, the starting node N3 is implemented (f) first to find the Internet access node, then announce the frequency hopping transceiver mode phase; (h) record node and test path phase; (g) transmit the Internet data phase; (i) end the communication phase; and (j) communication Quality testing phase. Wherein, the stages (f), (h), (g) of the embodiment shown in FIG. 3 may be executed sequentially, or in other embodiments, after the stage (f) is executed, the stage (h) is skipped and the stage is directly executed (g) ).

Referring to FIG. 3 and FIG. 4, (f) first searching for a networkable node, and then declaring the frequency hopping transceiver mode phase includes:

(f-1) A searchable internet node code frame is transmitted by the originating node N3 on the broadcast channel.

(f-2) receiving, by the at least one non-networkable relay node, the searchable network node code frame, recording the identification code of the start node, and transmitting the searchable network node code frame on the broadcast channel. In the present embodiment, as shown in FIG. 4, the non-Internet access relay node N2x and the non-Internet access relay node N2' may receive the searchable network node code frame transmitted by the start node N3, and the two nodes N2x, N2' record the connection code and the start node N3 identification code in the respective memory, and then the non-Internet relay nodes N2x, N2' respectively transmit the searchable network node code frame through the broadcast channel. The Internet access node N1x receives the searchable network node code frame transmitted by the non-Internet access relay node N2x and records the connection code and the non-networkable relay node N2x identification code, and the accessible network node N1x is externally and asymmetrically Digital subscriber line (ADSL) or fiber-to-the-home (FTTH) telecommunications network interface; similarly, the non-internet relay node N1'' receives the non-networkable relay node N2' to transmit the searchable network node code Blocking and recording the connection code and the non-networkable relay node N2' identification code, and then the network node N0'' receives the searchable network node code frame transmitted by the non-networkable relay node N1'' and records the connection Line code and the non-networkable relay node N1'' identification code And the Internet access node N0'' is externally connected to the satellite network; in the same way, the Internet node N1' receives the searchable network node code frame transmitted by the non-networkable relay node N2' and records the connection code And the non-networkable relay node N2' identification code, and the networkable node N1' is externally connected to the telecommunication network of Wi-Fi or 4G mobile communication.

(f-3) receiving the searchable network node code frame by an internet access node, and recording the identification code of the at least one non-network access node. In the present embodiment, as described in step (f-2), the non-Internet access node N2x identification code may be recorded by the Internet node N1x; the non-Internet access node N1'' identification code may be recorded by the Internet node N0''; The non-Internet access node N2' identification code is recorded by the Internet node N1'.

(f-4) the at least one non-Internet access relay node identification code backhaul recorded by the networkable node in the broadcast channel according to step (f-3) includes an announce first frequency hopping transceiver mode code frame. At least one non-networkable relay node. In the present embodiment, the non-networkable relay node N0'' is based on the non-networkable relay node N1'' identification code returning and advertising the frequency hopping transceiver mode code frame to the non-networkable relay node N1''. N1'', according to the non-networkable relay node N2' identification code return, announces that the non-Internet relay frequency hopping transceiver mode code frame is given to the non-networkable relay node N2'; and the Internet access node N1' is based on the non-networkable relay The node N2' identification code returns the first frequency hopping transceiver mode code frame to the non-networkable relay node N2'. However, the non-Internet relay node N2' needs to select a signal quality between the non-Internet relay node N1'' and the Internet access node N1' to ensure that the connection is singular, that is, non-Internet access The relay node N2' determines that the transmission delay of the networkable node N1' is lower than the transmission delay of the non-networkable relay node N1'', because the non-networkable relay node N1'' needs to wait for the backhaul node N0'' to be transmitted back. In order to pass back to the non-Internet relay node N2', the N1 node can be directly transmitted back to the non-Internet relay node N2' without waiting, so the non-Internet relay node N2' of course selects the record. The identification code of the N1' of the Internet node can be used as the destination or source identification code of the subsequent transmission code frame, and the non-Internet access node N1'' and the Internet access node N0'' are eliminated by the self-receiving timeout mechanism. In addition, the so-called receiving timeout mechanism means that each node N1'', N0'' does not receive the code frame belonging to the connection code after the end of the communication threshold time, and then deletes the connection code of the memory by itself. End the communication. Therefore, in this example, the non-Internet access relay node N2' receives the broadcast channel and only recognizes the announced first frequency hopping transceiver mode code frame returned by the networkable node N1'.

(f-5) after receiving the announcement of the first frequency hopping transceiver mode code frame by the at least one non-networkable relay node, returning the initial node identification code recorded in the broadcast channel according to step (f-2) A second frequency hopping transceiver mode code frame is declared to the starting node. In the present embodiment, the Internet access node N1x returns a frequency hopping transceiver mode code frame to the non-Internet access relay node N2x according to the non-Internet access relay node N2x identification code, and the non-Internet access relay node N2x is based on the start node. The N3 identification code returns a frequency hopping transceiver mode code frame to the start node N3; the non-Internet access relay node N2' hops according to the start node N3 identification code return hopping second frequency transceiver mode code frame to the start Node N3. However, the starting node N3 needs to select a signal quality between the two non-networkable relay nodes N2' and N2x to ensure that the connection is singular, that is, the starting node N3 judges that the connection is not OK. The signal error rate of the Internet relay node N2x is higher than that of the non-Internet relay node N2', so the originating node N3 selects the identification code of the non-Internet relay node N2' as the subsequent transmission code. The destination or source identification code of the box, as for the non-Internet access node N2x and the Internet access node N1x, are eliminated by the self-receiving timeout mechanism. The so-called receiving timeout mechanism means that each node N1x, N2x is over. After the communication threshold has not received the code frame belonging to the connection code, the connection code of the memory is deleted and the communication is terminated. Therefore, in this example, the originating node N3 receives the broadcast channel and only recognizes the announced second frequency hopping transceiver mode code frame returned by the non-Internet access relay node N2'.

The searchable network node code frame in the step (f-1) includes the target node N0 identification code, the start node N3 identification code, a connection code, and a search range class operation code, and the connection code is used by the The originating node N3 is initiated and unique.

The searchable network node code frame transmitted in the step (f-2) includes the target node N0 identification code, the at least one non-networkable relay node N2' identification code, the connection code number, and the search range of the down-conversion level Hierarchy job code.

In step (f-3), the level of the range-finding job code in the searchable network node code frame received by the network-connectable node N1' is above zero. For the reason, refer to the related description of the foregoing step (a-3). .

In the step (f-4), the first frequency hopping transceiver mode code frame includes the first frequency hopping transceiver mode operation code and the connection code, and the first frequency hopping transceiver mode job code corresponds to a first frequency hopping transceiver. The mode supports only the at least one non-Internet access node N2' and the networkable node N1' to perform frequency hopping communication.

In the step (f-5), the second frequency hopping transceiver mode code frame includes the second frequency hopping transceiver mode operation code and the connection code, and the second frequency hopping transceiver mode job code corresponds to a second frequency hopping transceiver. The mode is to support only the at least one non-Internet relay node N2' to transmit and receive communication with the start node N3.

Moreover, when each node wants to transmit a code frame through a broadcast channel, when the broadcast channel service usage rate is high, each node can repeatedly transmit the code frame in a time-multiplexed manner to avoid code frame collision.

(g) transmitting the Internet data phase, comprising: transmitting, by the originating node N3 and the networkable node N1', the Internet data transmission through the at least one non-network relay node N2', wherein the starting node N3 and the at least The non-networkable relay node N2' transmits the Internet data frame through the second frequency hopping transmission and reception mode of the non-broadcast channel, and the at least one non-Internet relay node N2' and the networkable node N1' pass through The first frequency hopping transceiver mode of the non-broadcast channel transmits an internet data code frame, and the internet data code frame includes a content size information and a user-defined content, and the content may record an internet command or data and/or voice.

For (h) record node and test path phase, (i) end communication phase and (j) communication quality test phase, refer to (b) record node and test path phase, (d) end communication phase and (e) The communication quality test phase, the details are as follows.

(h) Recording node and test path phases include:

(h-1) transmitting, by the originating node N3, the recording node and the test path code frame to the at least one non-network relay node N2' through the second frequency hopping transmission and reception mode of the non-broadcast channel.

(h-2) receiving, by the at least one non-networkable relay node N2', the recording node and the test path code frame, and transmitting the record node and the test path code frame to the first frequency hopping transceiver mode of the non-broadcast channel to The Internet access node N1'.

(h-3) receiving, by the network access node N1', the recording node and the test path code frame, and transmitting the recording node and the test path code frame to the at least one non-networkable relay through the first frequency hopping transceiver mode Node N2'.

(h-4) receiving, by the at least one non-networkable relay node N2', the recording node and the test path code frame, and transmitting the record node and the test path code frame to the start through the second frequency hopping transceiver mode Node N3.

(h-5) The recording node and the test path code frame are received by the starting node N3, and all node identification codes of the complete path are stored.

The recording node and the test path code frame transmitted by the starting node N3 in the step (h-1) contain one of the user-defined contents, that is, the user-defined content shown in FIG. 7, and the content is available for recording the start. Node N3 identification code.

In the recording node and the test path code frame transmitted by the at least one non-networkable relay node N2 ′ in step (h-2), the user-defined content sequentially records the start node N3 identification code and the at least A non-networkable relay node N2' identification code.

In the recording node and the test path code frame returned by the networkable node N1' in step (h-3), the user-defined content sequentially records the starting node N3 identification code, and the at least one non-Internet access The relay node N2' identification code and the networkable node N1' identification code form all node information of a complete path, and the networkable node N1' stores the information before returning.

Before the at least one non-networkable relay node N2' returns the recording node and the test path code frame in step (h-4), all the node identification codes are also stored first. In the present embodiment, the non-Internet relay node N2' also stores all node information of the complete path.

(i) End of the communication phase consists of:

(i-1) transmitting, by the start node N3, the end communication code frame to the at least one non-network relay node N2' through the second frequency hopping transmission and reception mode, and deleting the memory from the memory of the start node N3 Connection code.

(i-2) after the at least one non-networkable relay node N2' receives the end communication code frame, first transmitting the end communication code frame to the networkable node N1' through the first frequency hopping transmission and reception mode, and then from the at least The memory of a non-Internet relay node N2' deletes the connection code.

(i-3) After the network node N1' receives the end communication code frame, the connection code is deleted from the memory of the network node N1'.

In addition, all the nodes N3, N2', and N1' can receive the connection timeout after receiving the communication threshold time, and the connection code can be deleted from the respective memory and the communication is terminated. The value of the end of the communication threshold can be pre-stored in the memory of each node.

(j) The communication quality testing phase includes:

(j-1) A communication quality test code frame is transmitted by the start node N3 through the second frequency hopping transmission and reception mode. In the present embodiment, the originating node N3 transmits a communication quality test code frame to the non-Internet access relay node N2' through the second frequency hopping transmission and reception mode on the non-broadcast channel.

(j-2) After the at least one non-networkable relay node N2' receives the communication quality test code frame transmitted by the start node N3, the communication quality test code frame is transmitted through the first frequency hopping transmission and reception mode. In the present embodiment, the non-networkable relay node N2' transmits the communication quality test code frame to the network access node N1' through the first frequency hopping transmission and reception mode on the non-broadcast channel.

(j-3) the network access node N1' receives the communication quality test code frame transmitted by the at least one non-Internet relay node N2', and returns the communication quality test code frame through the first frequency hopping transmission and reception mode. . In the present embodiment, the communication quality test code frame is returned to the non-network relay node N2 ′ by the network access node N1 ′ through the first frequency hopping transceiver mode.

(j-4) after the at least one non-networkable relay node N2' receives the communication quality test code frame returned by the networkable node N1', the communication quality test code is transmitted back through the second frequency hopping transmission and reception mode. frame. In the present embodiment, the non-Internet access relay node N2' transmits the communication quality test code frame to the start node N3 through the second frequency hopping transmission and reception mode.

(j-5) after the start node N3 receives the communication quality test code frame returned by the at least one non-Internet access relay node N2', if the connection quality is normal, the (g) transmission of the Internet data phase is continued; If the connection quality is abnormal, execute (i) to end the communication phase. In the present embodiment, the communication quality test code frame returned by the non-Internet access relay node N2' is received by the originating node N3 to determine the connection quality.

Each of the communication quality test code frames transmitted in steps (j-1) and (j-2) includes a communication quality test operation code for each node to determine the communication product according to the received signal strength, signal transmission delay, and bit error rate. Value, since the test of communication quality is a common knowledge in the technical field, it will not be described in detail here.

Each of the communication quality test code frames issued in steps (j-3) and (j-4) includes a test result job code, a content size information, and a content defined by the user, and the content is recorded. The test result is used by the starting node N3 to determine whether the connection is normal.

In the step (f-2), the at least one non-Internet access relay node includes a plurality of non-Internet access relay nodes, and the non-Internet access relay nodes send and receive the searchable network node code frame on the broadcast channel with each other; In the step (f-5), the non-Internet access relay nodes send and receive a non-Internet-enabled relay frequency hopping transceiver mode code frame on the broadcast channel; similarly, in steps (h-2), (h) -4), (i-2), (j-2), (j-4), and phase (g) of non-Internet relaying hopping through non-broadcast channels Transceiver mode transmission code frame.

Figure 4 "FAR" indicates that the target node N0 is far away from the Internet access node N1' and needs to be connected through the other network. In the present embodiment, the network node N1' can connect the code frame to be transmitted by the start node N3 to a cloud server via a Wi-Fi or 4G mobile communication network to implement instant communication (such as LINE or SKYPE), that is, When the network node N1' and the remote destination node N0 are both connected to the cloud server, once the network node N1' transmits the code frame to the cloud server, the code frame records the target node N0 identification code. Therefore, the target node N0 can receive the code frame from the cloud server to reach the transmission target.

Referring to FIG. 3, when the starting node N3 performs (f) first searching for a networkable node, and then declaring that the frequency hopping transceiver mode is waiting for the reception timeout, referring to FIG. 5 and FIG. 6, the execution (k) generation phase is performed. ,contain:

(k-1) A generation request code frame is transmitted by the originating node N3 on the broadcast channel, which includes a pass-through demand job code.

(k-2) After receiving the generation request code frame by a passable node N _help , the generation of the frequency hopping frequency transmission and reception mode code frame is transmitted back through the broadcast channel. The node in the signal coverage range 400 of the start node N3 can receive the generation request code frame as the passable node N _help . In contrast, the signal at the start node N3 covers the range 400. The non-passive node N _no-help failed to receive the pass-through request code frame. When the pass-through node N _help receives the generation request code frame, it records the connection code and the start node N3 identification code in the memory, and then returns the generation on the broadcast channel according to the start node N3 identification code. The hopping frequency transmission and reception mode code frame is given to the starting node N3.

(k-3) for data transmission via the transceiver mode to generation of non-hopping channel broadcast by the originating node N3 to the node can be to generation N _help.

(k-4) After the data transmission is completed, the originating node N3 knows that the passable node N _help ends the communication through the generation frequency hopping transmission and reception mode, so that the passable node N _help deletes the connection from its memory. Line code.

According to the (k) pass-through stage, when the user of the starting node N3 gets lost during the climbing process, the help-response code box can be issued by performing the (k) pass-through phase, so that the pass-through node N _help in the receiving range can assist the Users improve their chances of being rescued.

N0‧‧‧ target node

N1‧‧‧ relay node

N2‧‧‧ relay node

N21, N22‧‧‧ nodes

N3‧‧‧ starting node

W‧‧‧ wall

N1x, N1', N0''‧‧‧ can be connected to the node

N2x, N2', N1''‧‧‧ non-Internet relay nodes

N _help ‧‧‧ can pass the node

N _no-help ‧‧‧Cannot pass the node

400‧‧‧Starting node N3 signal coverage

11‧‧‧ preamble

12‧‧‧Destination ID

13‧‧‧Source identification code

14‧‧‧Connection code

15‧‧‧Operation code

16‧‧‧Content size

17‧‧‧ User-defined content

18‧‧‧Inspection and

Figure 1: Schematic diagram of an embodiment of the present distributed decentralized communication method. Figure 2: Corresponding to the node connection topology of Figure 1. Figure 3 is a flow chart showing an embodiment of the distributed distributed communication method of the present invention. Figure 4: Corresponding to the node connection topology diagram of Figure 3. Figure 5 is a flow chart showing an embodiment of the distributed distributed communication method of the present invention. Figure 6: Corresponding to the node connection topology diagram of Figure 5. Figure 7: Schematic diagram of the general format of the code frame for decentralized coordinated communication.

Claims (11)

A decentralized coordinated communication method, comprising: (a) first finding a target node, and then declaring a frequency hopping transceiver mode phase, comprising: (a-1) transmitting, by a starting node, a search target node code frame on a broadcast channel; - 2) receiving, by the at least one relay node, the search target node code frame, recording the identification code of the start node, and transmitting the search target node code frame on the broadcast channel; (a-3) receiving the target node by the target node The at least one relay node transmits the search target node code frame, and records the identification code of the at least one relay node; (a-4) recorded by the target node in the broadcast channel according to step (a-3) The at least one relay node identification code backhaul includes an announcement target frequency hopping transceiver mode code frame for the at least one relay node; and (a-5) receiving, by the at least one relay node, the announcement target frequency hopping transceiver mode code After the frame, the broadcast channel returns an announcement start frequency hopping transceiver mode code frame to the start node according to the start node identification code recorded in step (a-2); (c) transmitting data phase, including: Passing at least the starting node and the target node a relay node performs data transmission, wherein the start node and the at least one relay node transmit a data code frame through the initial frequency hopping transmission and reception mode of a non-broadcast channel, the at least one relay node and the target Transmitting a data code frame between the nodes through the target frequency hopping transceiver mode of a non-broadcast channel, the data code frame includes a content size information and a user-defined content, the content recording data or/and voice; The search target node code frame of a-1) includes the target node identification code, the start node identification code, a connection code, and a search range hierarchy job code, and the connection code is initiated by the start node and has Uniqueness; the search target node code frame transmitted in step (a-2) includes the target node identification code, the at least one relay node identification code, the connection code, and the search range class operation code of the down-conversion hierarchy And the level of the search range level job code in the search target node code frame received by the target node in step (a-3) is above zero; the announcement target frequency hopping transmission and reception in step (a-4) The mode code frame includes the target frequency hopping transceiver mode operation code and the connection code, and the target frequency hopping transceiver mode operation code corresponds to a target frequency hopping transmission and reception mode to support only the at least one relay node and the target node to hop and receive communication. The announcement start frequency hopping transceiver mode code frame in step (a-5) includes the initial frequency hopping transceiver mode operation code and the connection code, and the initial frequency hopping transceiver mode operation code corresponds to a starting frequency hopping transceiver. The mode supports only the at least one relay node to transmit and receive communication with the start node by frequency hopping; further, when the broadcast channel service usage rate is high, each node can repeatedly transmit the code frame in a time-multiplexed manner to avoid code frame collision. . The decentralized coordinated communication method according to claim 1, further comprising (b) a recording node and a test path phase between phase (a) and phase (c), comprising: (b-1) being transmitted by the starting node The initial frequency hopping transceiver mode of the non-broadcast channel transmits a recording node and a test path code frame to the at least one relay node; (b-2) receiving, by the at least one relay node, the recording node and the test path code frame, Transmitting the record node and the test path code frame to the target node through the target frequency hopping transceiver mode of the non-broadcast channel; (b-3) receiving, by the target node, the record node and the test path code frame, and hopping through the target Transmitting and transmitting the recording node and the test path code frame to the at least one relay node; (b-4) receiving, by the at least one relay node, the recording node and the test path code frame, and transmitting the initial frequency hopping Transmitting and transmitting mode returning the recording node and the test path code frame to the start node; and (b-5) receiving, by the start node, the record node and the test path code frame, and storing all node identification codes of the complete path; Step (b-1) transmitted by the starting node The recorded node and the test path code frame include a content defined by the user, wherein the content is used to record the start node identification code; and the record node transmitted by the at least one relay node in step (b-2) In the test path code frame, the user-defined content sequentially records the start node identification code and the at least one relay node identification code; the record node and the test returned by the target node in step (b-3) In the path code frame, the user-defined content sequentially records the start node identification code, the at least one relay node identification code, and the target node identification code to form all node information of a complete path, and before returning The target node stores the information of all the nodes; and before the at least one relay node returns the recording node and the test path code frame in step (b-4), all the node identification codes are also stored first. The decentralized coordinated communication method according to claim 2, after (c) transmitting the data phase, the starting node is dominant to enter (d) to end the communication phase, comprising: (d-1) from the starting node The initial frequency hopping transceiver mode transmits an end communication code frame to the at least one relay node, and deletes the connection code from the memory of the start node; (d-2) the at least one relay node receives the end communication code After the frame, the end communication code frame is first transmitted to the target node through the target frequency hopping transceiver mode, and then the connection code is deleted from the memory of the at least one relay node; (d-3) the target node receives the end After the communication code frame, the connection code is deleted from the memory of the target node; in addition, all the nodes can delete the connection code from the memory and end the communication after receiving no response within the communication threshold. According to the decentralized coordinated communication method described in claim 3, during the (c) transmission data phase, if the initial node does not receive the data frame after a transmission threshold, and the reception timeout occurs, the execution is performed (e) a communication quality test phase, comprising: (e-1) transmitting, by the originating node, a communication quality test code frame through the initial frequency hopping transceiver mode; (e-2) the at least one relay node receives the start After the communication quality test code frame transmitted by the node, the communication quality test code frame is transmitted through the target frequency hopping transmission and reception mode; (e-3) the target node receives the communication quality test code frame transmitted by the at least one relay node And transmitting, by the target frequency hopping transceiver mode, the communication quality test code frame; (e-4) the at least one relay node receives the communication quality test code frame returned by the target node, and then starts the jump The communication mode test module returns the communication quality test code frame; (e-5) after the start node receives the communication quality test code frame returned by the at least one relay node, if the connection quality is normal, the execution continues (c Transfer data stage; if the connection quality is abnormal, execute (d) end The communication quality test code frame transmitted in steps (e-1), (e-2) includes a communication quality test operation code; and is sent in steps (e-3), (e-4) Each of the communication quality test code frames includes a test result job code, a content size information, and a user-defined content, and the content records the test result. The decentralized coordinated communication method according to claim 4, when the starting node performs (a) first searching for the target node, and then declaring that the frequency hopping transceiver mode is not responding due to timeout, then executing (f) first finding The internet node then announces the frequency hopping transceiver mode phase, comprising: (f-1) transmitting, by the originating node, a searchable network node code frame on the broadcast channel; (f-2) by at least one non-networkable relay node Receiving the searchable network node code frame, recording the identification code of the start node, and transmitting the searchable network node code frame on the broadcast channel; (f-3) receiving the searchable network node code frame by an available network node And recording the identification code of the at least one non-networkable relay node; (f-4) identifying, by the networkable node, the at least one non-networkable relay node recorded in the broadcast channel according to step (f-3) The code backhaul includes a first hopping transceiver mode code frame for the at least one non-networkable relay node; and (f-5) receiving, by the at least one non-networkable relay node, the advertised first frequency hopping transceiver mode After the code frame, recorded on the broadcast channel according to step (f-2) The initial node identification code is transmitted back to announce the second frequency hopping transmission and reception mode code frame to the starting node; (g) transmitting the Internet data phase, comprising: the at least one non-Internet access through the starting node and the available network node The relay node performs the data transmission on the Internet, wherein the first node and the at least one non-networkable relay node transmit the Internet data frame through the second frequency hopping transceiver mode of the non-broadcast channel, and the at least one is not available And transmitting, by the relay node, the first hopping transmission and reception mode of the non-broadcast channel to the Internet data frame, the Internet data frame includes a content size information and a user-defined content, and the content may be Recording the Internet access command or data or/and voice; the searchable Internet node code frame in step (f-1) includes the target node identification code, the start node identification code, a connection code, and a search range class operation code. And the connection code is initiated by the originating node and is unique; the searchable network node code frame transmitted in step (f-2) includes the target node identification code, and the at least one non-receivable a network relay node identification code, the connection code, and the search range class operation code of the down-conversion level; and the search range level in the searchable network node code frame received by the networkable node in step (f-3) The level of the job code is above zero; in the step (f-4), the first frequency hopping transceiver mode code frame includes the first frequency hopping transceiver mode operation code and the connection code, and the first frequency hopping transceiver mode operation The code corresponds to a first frequency hopping transceiver mode to support only the at least one non-networkable relay node and the surfable node hopping transceiver communication; the second hopping transceiver mode code frame included in the step (f-5) includes The second frequency hopping transceiver mode operation code and the connection code, the second frequency hopping transceiver mode operation code is corresponding to a second frequency hopping transceiver mode to support only the at least one non-networkable relay node to jump with the starting node Frequency transmission and reception communication; Moreover, when the broadcast channel usage rate is high, each node can repeatedly transmit code frames in a time-multiplexed manner to avoid code frame collision. The decentralized coordinated communication method according to claim 5, further comprising (h) a recording node and a test path phase between phase (f) and phase (g), comprising: (h-1) being transmitted by the starting node The second frequency hopping transceiver mode of the non-broadcast channel transmits a recording node and a test path code frame to the at least one non-networkable relay node; (h-2) receiving, by the at least one non-networkable relay node, the recording node And testing the path code frame, and transmitting the record node and the test path code frame to the networkable node through the first frequency hopping transceiver mode of the non-broadcast channel; (h-3) receiving the record node and testing by the networkable node a path code frame, and transmitting, by the first frequency hopping transceiver mode, the recording node and the test path code frame to the at least one non-networkable relay node; (h-4) receiving by the at least one non-networkable relay node Recording the node and the test path code frame, and transmitting the record node and the test path code frame to the start node through the second frequency hopping transceiver mode; and (h-5) receiving the record node by the start node and Test the path code box and store all of the full path a node identification code; the recording node and the test path code frame transmitted by the starting node in step (h-1) contain one of user-defined contents, the content being available for recording the starting node identification code; - 2) the recording node and the test path code frame transmitted by the at least one non-networkable relay node, the content defined by the user sequentially records the start node identification code and the at least one non-networkable relay node An identification code; in the record node and the test path code frame returned by the networkable node in step (h-3), the user-defined content sequentially records the start node identification code, and the at least one non-Internet access The relay node identification code and the networkable node identification code form all node information of a complete path, and before the return, the networkable node stores the information of all the nodes; at step (h-4) the at least one is not available Before returning the recording node and the test path code frame, the Internet relay node first stores all the node identification codes. The decentralized coordinated communication method according to claim 6, after the (g) transmission of the data access phase, the initial node leads to enter (i) the end of the communication phase, comprising: (i-1) the originating node transmits the The second frequency hopping transceiver mode transmits an end communication code frame to the at least one non-networkable relay node, and deletes the connection code from the memory of the start node; (i-2) the at least one non-Internet access After receiving the end communication code frame, the node first transmits the end communication code frame to the network access node through the first frequency hopping transmission and reception mode, and then deletes the connection code from the memory of the at least one non-network relay node. (i-3) after the network node receives the end communication code frame, the connection code is deleted from the memory of the network node; in addition, all the nodes receive no response within the time of ending the communication threshold, that is, The connection code can be deleted from the memory and the communication can be ended. According to the decentralized coordinated communication method described in claim 7, during the (g) transmission of the data access phase, if the initial node does not receive the data frame after a transmission threshold, and the reception timeout occurs, the execution is performed ( j) a communication quality test phase, comprising: (j-1) transmitting, by the start node, a communication quality test code frame through the second frequency hopping transmission and reception mode; (j-2) the at least one non-networkable relay node receiving After the communication quality test code frame transmitted by the start node, the communication quality test code frame is transmitted through the first frequency hopping transmission and reception mode; (j-3) the networkable node receives the at least one non-networkable relay After the communication quality test code frame transmitted by the node, the communication quality test code frame is returned by the first frequency hopping transmission and reception mode; (j-4) the at least one non-networkable relay node receives the returnable network node After the communication quality test code frame, the communication quality test code frame is returned by the second frequency hopping transmission and reception mode; (j-5) the start node receives the at least one non-networkable relay node backhauled After the communication quality test code frame, if the connection quality is normal, continue to execute (g) In the data transmission phase; if the connection quality is abnormal, the execution (i) ends the communication phase; each of the communication quality test code frames transmitted in steps (j-1) and (j-2) includes a communication quality test operation code; Each of the communication quality test code frames issued in the steps (j-3) and (j-4) includes a test result job code, a content size information and a user-defined content, and the content records the test result. The decentralized coordinated communication method according to claim 8, when the starting node performs (f) first searching for a networkable node, and then declaring that the frequency hopping transceiver mode is not responding due to timeout, then performing (k) generation transmission The stage includes: (k-1) transmitting, by the originating node, a generation request frame on the broadcast channel; (k-2) receiving the generation request frame by a pass-through node, and transmitting the generation through the broadcast channel (k-3) transmitting data by the originating node and the passable node through the non-broadcast channel in the generation of the frequency hopping transmission and reception mode; (k-4) after completing the data transmission, The originating node knows that the passable node ends the communication through the generation frequency hopping transmission and reception mode. The decentralized coordinated communication method according to claim 8, wherein in the step (a-2), the at least one relay node includes a plurality of relay nodes, and the relay nodes transmit and receive the search target node in a broadcast channel with each other a code frame; in step (a-5), the relay nodes send and receive a relay frequency hopping transceiver mode code frame on the broadcast channel; similarly, in steps (b-2), (b-4) And (d-2), (e-2), (e-4), and (c) of the relay nodes transmit a code frame to each other through a non-broadcast channel relay frequency hopping transmission and reception mode; In the f-2), the at least one non-Internet access relay node includes a plurality of non-Internet access relay nodes, and the non-Internet access relay nodes send and receive the searchable network node code frame on the broadcast channel with each other; In f-5), the non-Internet access relay nodes send and receive a non-Internet access hopping frequency transmission and reception mode code frame on the broadcast channel; similarly, in steps (h-2), (h-4) (i-2), (j-2), (j-4), and phase (g) of the non-Internet access relay nodes transmitting non-Internet access relay frequency hopping transmission and reception mode through non-broadcast channels Code box. The decentralized coordinated communication method according to claim 5, wherein in the steps (f-4) and (f-5), the at least one non-networkable relay node and the starting node may receive more than one from different nodes. The frequency hopping transceiver mode code frame, but the at least one non-networkable relay node and the starting node can only retain a signal frame with the best signal quality to ensure that the connection is simplified, and the excess code frame will pass the reception. The time mechanism was eliminated.