# US 12,192,874 B2 · Node, communication system, and communication method > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,192,874 B2 - Document ID: US12192874B2 - Status: Granted - Kind: B2 - Application number: 17/702,690 - Filed: 2022-03-23 - Published: 2022-07-07 - Granted: 2025-01-07 - Earliest claimed: 2019-09-30 - Assignees: Daikin Industries, Ltd. - Applicants: Daikin Industries, Ltd. - Inventors: Yoshiyuki Masuda; Chang Wenn Tok - Web page: https://patentgrep.com/patent/US12192874B2 ## CPC - H04W 40/02: Communication route or path selection, e.g. power-based or shortest path routing - H04W 40/22: using selective relaying for reaching a BTS [Base Transceiver Station] or an access point - H04W 28/0883: {between entities in ad-hoc networks} - H04W 40/04: based on wireless node resources - H04W 40/34: Modification of an existing route - H04W 84/20: Leader-follower arrangements - 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) - 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 node performs multi-hop communication. The node includes a relay node determiner that determines a relay node from a plurality of relay node candidates having path information of a path to a master node. The relay node performs relaying. At least when communication frequencies of the relay node candidates are within a predetermined range, the relay node determiner determines the relay node so that a relay node candidate with a higher communication frequency is more likely to be determined as the relay node than a relay node candidate with a lower communication frequency. ## Claims ### Claim 1 A node that performs multi-hop communication, the node comprising: a relay node determiner configured to determine a relay node from a plurality of relay node candidates having path information of a path to a master node, the relay node being configured to perform relaying, at least when a number of lower nodes of each of the relay node candidates is within a predetermined range, the relay node determiner being configured to determine the relay node so that a relay node candidate having a larger number of lower nodes is more likely to be determined as the relay node than a relay node candidate having a smaller number of lower nodes. ### Claim 2 (depends on 1) The node according to claim 1, further comprising: cost obtainers configured to obtain a first cost, a second cost, and a third cost, the first cost being a cost from the node to each of the relay node candidates, the second cost being a cost from each of the relay node candidates to the master node, the second cost being adjusted based on the number of lower nodes of each of the relay node candidates, the third cost being a cost from the node to the master node, the third cost being determined based on the first cost and the second cost, and the relay node determiner being configured to determine the relay node based on the third cost. ### Claim 3 (depends on 2) The node according to claim 2, wherein the second cost is a cost obtained by multiplying a value by a predetermined weighting factor, the value being a cost from each of the relay node candidates to the master node and being stored in a corresponding one of the relay node candidates, and when the number of lower nodes of each of the relay node candidates is within a predetermined range, the weighting factor decreases the second cost. ### Claim 4 (depends on 2) The node according to claim 2, wherein if a plurality of the relay node candidates having third costs that are the same are found, the relay node determiner is configured to determine the relay node candidate having the smallest second cost as the relay node. ### Claim 5 (depends on 1) The node according to claim 1, further comprising: a path information generator configured to generate the path information of a path from the node to the master node via the relay node; a path information receiver configured to receive, from a lower node of the node, the path information of a path from the lower node to the master node; and a path information sender configured to send the path information generated by the path information generator and the path information received by the path information receiver to the relay node, the number of lower nodes of each of the relay node candidates being determined based on a number of items of the path information received by a corresponding one of the relay node candidates. ### Claim 6 (depends on 1) The node according to claim 1, wherein if the number of lower nodes of the relay node candidate is not within the predetermined range, the relay node determiner is configured to determine the relay node so that the relay node candidate is less likely to be determined as the relay node. ### Claim 7 (depends on 1) A communication system including the node according to claim 1, the communication system being configured to perform multi-hop communication. ### Claim 8 A node that performs multi-hop communication, the node comprising: a relay node determiner configured to determine a relay node from a plurality of relay node candidates having path information of a path to a master node, the relay node being configured to perform relaying, at least when communication frequencies of the relay node candidates are within a predetermined range, the relay node determiner being configured to determine the relay node so that a relay node candidate with a higher communication frequency is more likely to be determined as the relay node than a relay node candidate with a lower communication frequency, the communication frequency being determined based on a communication frequency estimated value of the relay node candidate, and at least when the communication frequency estimated values of the relay node candidates are within a predetermined range, the relay node determiner being configured to determine the relay node so that a relay node candidate having a higher communication frequency estimated value is more likely to be determined as the relay node than a relay node candidate having a lower communication frequency estimated value. ### Claim 9 (depends on 8) The node according to claim 8, wherein node information is set in the node, and the node information at least includes identification information of the node, system identification information of a system to which the node belongs, and type information of the node. ### Claim 10 (depends on 8) The node according to claim 8, wherein the relay node candidates have information concerning a priority usable to determine the relay node candidates as the relay node. ### Claim 11 (depends on 8) The node according to claim 8, wherein if a different node from the node belongs to the same system as the node, if identification information of the different node indicates that the different node is a parent node of the node, and if the different node is included in the relay node candidates, the relay node determiner is configured to preferentially determine the different node as the relay node. ### Claim 12 (depends on 8) The node according to claim 8, wherein if a different node from the node belongs to the same system as the node, if identification information of the different node indicates that the different node is a parent node of the node, and if the different node is included in the relay node candidates, the relay node determiner is configured to preferentially determine as the relay node, the relay node candidate other than the master node belonging to the same system and having the highest priority. ### Claim 13 (depends on 8) The node according to claim 8, wherein if a node belonging to the same system as the node is not included in the relay node candidates, the relay node determiner is configured to determine the relay node based on a priority of the relay node candidates. ### Claim 14 (depends on 8) The node according to claim 8, wherein the node is an outdoor unit or an indoor unit of an air conditioner. ### Claim 15 (depends on 8) The node according to claim 8, wherein a communication frequency actual value is determined based on a signal transmission frequency of the relay node candidate. ### Claim 16 (depends on 8) The node according to claim 8, wherein if the communication frequency of the relay node candidate is higher than or equal to a predetermined threshold, the relay node determiner is configured to determine the relay node so that the relay node candidate is less likely to be determined as the relay node. ### Claim 17 (depends on 8) A communication system including the node according to claim 8, the communication system being configured to perform multi-hop communication. ### Claim 18 A communication method for a communication system that performs multi-hop communication, the communication method comprising: determining a relay node from a plurality of relay node candidates having path information of a path to a master node, the relay node being configured to perform relaying, at least when a number of lower nodes of each of the relay node candidates is within a predetermined range, the relay node being determined so that a relay node candidate having a larger number of lower nodes is more likely to be determined as the relay node than a relay node candidate having a smaller number of lower nodes.