# US 2019/0246341 A1 · Method for Wireless Automatic Networking

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0246341 A1
- Document ID: US20190246341A1
- Status: Published application
- Kind: A1
- Application number: 16/320,182
- Filed: 2018-01-25
- Published: 2019-08-08
- Earliest claimed: 2017-02-06
- Assignees: Guangdong Industry Polytechnic
- Applicants: Guangdong Industry Polytechnic
- Inventors: Bing DONG
- Web page: https://patentgrep.com/patent/US20190246341A1

## CPC

- H04W 48/16: Discovering, processing access restriction or access information
- H04B 1/713: using frequency hopping
- H04B 17/345: Interference values ({signal-to-interference ratio [SIR] or carrier-to-interference ratio [CIR]} H04B17/336)
- H04L 12/44: Star or tree networks
- H04W 24/02: Arrangements for optimising operational condition
- H04W 48/10: using broadcasted information
- H04W 48/12: using downlink control channel
- H04W 52/245: {taking into account received signal strength}
- H04W 52/46: in multi-hop networks, e.g. wireless relay networks
- H04W 84/18: Self-organising networks, e.g. ad-hoc networks or sensor networks
- Y02D 30/70: in wireless communication networks
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04B: TRANSMISSION
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

A method for wireless automatic networking, includes: pre-selecting N frequencies for frequency-hopping, if a relay node requires frequency hopping, then transmitting a beacon to routing nodes, if the routing nodes do not receive the beacon, then the routing nodes hop frequencies, search, and track until the beacon is received; work frequencies of the relay node, of the routing nodes, and of a terminal node are established in a shared channel; then, insofar as the transmit powers of the nodes are optimized, each routing node is tested for the presence of a frequency conflict with other routing nodes; if found, then frequencies are reassigned to the conflicting routing nodes until none of the frequencies of the routing nodes overlap each other; the relay node sequentially loads the frequencies of the routing nodes, and when frequency loading is completed for all of the routing nodes, a network enters a normal working state.

## Claims

### Claim 1

A method for wireless automatic networking, wherein a network adopts a layered network structure, including a relay layer, a routing layer and a terminal layer, a star connection is adopted between a relay node on the relay layer and a routing node on the subordinate routing layer, and a star connection is also adopted between the routing node and a terminal node on the subordinate terminal layer; and
the method comprising:
pre-selecting N working channels between working frequency bands as N hopping frequencies;
setting an RSSI threshold of the routing node, wherein when an RSSI detected in real time is higher than the RSSI threshold, the routing node determines that it is interfered, reports to the corresponding relay node to apply for frequency hopping, and the relay node hops and sends a beacon to the routing node, and if the routing node does not receive the beacon, the routing node hops to search and track until the beacon is received, to ensure that the relay node shares the same channel with each routing node, and the routing node locks the shared channel;
establishing working frequencies of the routing node and each terminal node on the shared channel, calculating an optimal power value of the routing node and each terminal node during communication respectively, and then testing whether each routing node conflicts with the frequencies of other routing nodes under the premise that the transmit power of the routing node and the terminal node is optimal, and if so, the frequencies of the conflicting routing nodes are reallocated until the frequencies of the routing nodes do not conflict; and
loading, by the relay node, the frequency of each routing node successively, wherein when the routing node receives a frequency value, it first notifies each terminal node to change frequency on the shared channel, and confirms that each terminal node receives frequency-changing data, and then automatically changes the frequency from a shared frequency to a new frequency; after a polling test is performed on each terminal node on the new frequency, the frequency being successfully loaded is reported to the relay node; and after all the routing nodes complete frequency loading, the network enters a normal working state.

### Claim 2 (depends on 1)

The method for wireless automatic networking according to claim 1, wherein the method for determining the frequency hopping of the relay node comprises:
(1-1) the routing node samples an RSSI value of a listening channel on the N working channels on the N working channels in a frequency hopping area for time T1, and takes an RSSI average value on the N channels, and based on the average value, after an increment, it is used as the RSSI threshold of the routing node, and the RSSI threshold is updated every T2 time; and
(1-2) selecting a channel with the smallest RSSI value as the working frequency of the current relay node, wherein when an RSSI detected in real time is higher than the RSSI threshold, the relay node hops and the frequency hopping adopts cyclic frequency hopping.

### Claim 3 (depends on 1)

The method for wireless automatic networking according to claim 1, wherein the relay node transmits a beacon to each routing node according to a certain timing, the beacon is a broadcast data packet, the broadcast data packet includes a determined flag, and if the routing node receives the flag, it indicates that its shared channel is the same as the relay node.

### Claim 4 (depends on 1)

The method for wireless automatic networking according to claim 1, wherein during the synchronization operation of the network system by the relay node, the routing node uses cyclic frequency hopping for searching and tracking the beacon, and the specific settings comprise:
(2-1) frequency hopping slot setting: the routing node is in a receiving state, a receiving slot of each frequency is set to T3 to ensure that the beacons of any frequency can be tracked under the slots of N different frequencies, and after receiving more than P beacon data packets continuously, the receiving frequency is locked and the shared channel is entered;
(2-2) setting of the optimal transmit power of the routing node: the relay node re-transmits to the relay node RSSI data detected when the relay node replies data, and the routing node adjusts its transmit power to the optimal transmit power value;
(2-3) transmission slot setting: if the routing node still does not receive any beacon after the slots of P different frequencies have passed, it indicates that the relay node does not send any beacon or the transmit power is small, at this time, a search state is entered, and under the search state, in addition to completing the search for N channels, the data exchange slot of the routing node and its terminal node is also included to realize the periodic control of the terminal node by the routing node; and after searching for one cycle, the power of the routing node is increased by one level, and if no beacon is received when the power is increased to the maximum, it is deemed that the relay node does not send any beacon; and
(2-4) frequency hopping initial value setting: when the frequency of the routing node is in a locked receiving frequency state, if no beacon data packet is suddenly received, the current frequency is used as the initial value of the frequency hopping search to start the search.

### Claim 5 (depends on 4)

The method for wireless automatic networking according to claim 4, wherein after the relay node sends out M groups of beacons, the channel of each routing node can theoretically jump to the shared channel, polling is started from the (M+1)th group, and after receiving a reply from the routing node, it determines that the channel is shared, otherwise, the relay node continues polling under the premise of not stopping other work, and if there is no reply X times, it will report through Ethernet, and the routing node is designated as fault handling.

### Claim 6 (depends on 1)

The method for wireless automatic networking according to claim 1, wherein the routing node communicates with each terminal node in a polling manner, and the routing node obtains an optimal power value for communication with the terminal node respectively during data transmission, denoted as Ps1, Ps2, . . . , Psk, where Psk is an optimal power value for communication between the sth routing node and its corresponding kth terminal node, the maximum value Psimax in the above optimal power values is taken as the optimal power value of the sth routing node; at the same time, the terminal node obtains an optimal power value for communication with the routing node, denoted as Pe1, Pe2, . . . , Peu, where Peu is an optimal power value for communication between the uth terminal node with its corresponding eth route node.

### Claim 7 (depends on 1)

The method for wireless automatic networking according to claim 1, wherein the step of testing whether each routing node conflicts with the frequency of other routing nodes comprises:
after the working frequencies of the relay node, the corresponding routing node and its terminal nodes are all established on the shared channel, the relay node starts broadcasting, each routing node receives a TEST character and reports same, and instructs the routing node No. 1 to poll each terminal node corresponding to the routing node No. 1 with the TEST character, and also replies with the TEST character to detect the routing number in which the routing node No. 1 conflicts with the frequencies of other routing node areas, upload the relay node and list same into a corresponding conflict table; and similarly, the routing numbers of all routing nodes conflicting with the frequencies of other routing nodes are detected; and a routing frequency conflict table is formed, the conflicting table including a routing number and a routing number that conflicts with its frequency.

### Claim 8 (depends on 7)

The method for wireless automatic networking according to claim 7, wherein the step of reallocating the frequencies of the conflicting routing nodes comprises: allocating the frequencies from low to high and first odd and then even according to the routing number, that is, according to the following order: F1, F3, F5, . . . , FV, F2, F4, F6, . . . , FG, where V is an odd number, G=V+1 is an even number, scanning whether there is a routing number that is the same as the set frequency among the routing numbers that conflict with its frequency, and if so, continuing scanning from small to large frequency until the frequency is different.

### Claim 9 (depends on 1)

The method for wireless automatic networking according to claim 1, wherein in the process of completing networking for communication, the routing node is monitored in real time for interference, and if it is interfered, the routing node is automatically frequency-changed, and the steps comprises:
(3-1) determining whether the current interference is the interference of the network system or the external interference through the RSSI and the received data format, and if it is the interference of the network system, step (3-2) is performed, otherwise, step (3-3) is performed;
(3-2) the current routing node reports to the relay node after suffering from the interference of the network system, and the relay node invokes the routing frequency conflict table to find the frequency of the interfered routing node number, and replaces a new frequency that is not used by the network in order, and then tests whether the interference is eliminated until the interference is eliminated, the frequency at this time is the new frequency of the routing node, and the updated frequency number is recorded in a frequency update table; and
(3-3) the current routing node reports to the relay node after suffering from external interference, and the relay node invokes the routing frequency conflict table to find the frequency of the interfered routing node number, and replaces a new frequency that is not used by the network in sequence, and then tests whether the interference is eliminated until the interference is eliminated, and the frequency at this time is the dynamic new frequency of the routing node and is recorded in a frequency hopping update table; and when the routing node is confirmed to be interfered by the external frequency, the routing node will jump between the original frequency and the dynamic new frequency.

### Claim 10 (depends on 9)

The method for wireless automatic networking according to claim 9, wherein in the step (3-1), the specific step of determining whether the current interference is the interference of the network system or the external interference further comprises:
(3-1-1) setting the RSSI threshold of the routing node: under a set single frequency, if the communication is normal, the current RSSI is sampled three times continuously, and an average value is taken as the current RSSI threshold, the RSSI threshold is updated every minute; and
(3-1-2) when the RSSI detected in real time is higher than the RSSI threshold, the routing node is considered to be interfered, and if the data received by the routing node is an identifier of the network system, the current interference is considered to be the network system interference; and if the routing node receives garbled characters, the current interference is considered to be external interference.