# US 2020/0396293 A1 · Method and apparatus for determining cooperation node > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2020/0396293 A1 - Document ID: US20200396293A1 - Status: Published application - Kind: A1 - Application number: 17/004,750 - Filed: 2020-08-27 - Published: 2020-12-17 - Earliest claimed: 2016-08-04 - Assignees: Zte Corporation - Applicants: Zte Corporation - Inventors: Kun Yang; Hao Wu; Songjie Liu; Jing Ren - Web page: https://patentgrep.com/patent/US20200396293A1 ## CPC - H04L 67/12: specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks - H04L 41/0806: for initial configuration or provisioning, e.g. plug-and-play - H04L 47/70: Admission control; Resource allocation - H04L 67/52: specially adapted for the location of the user terminal - H04L 67/56: Provisioning of proxy services (store-and-forward switching systems in data switching networks H04L12/54) - H04L 69/40: for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection (management of faults, events, alarms or notifications in data switching networks H04L41/06) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract Provided is a method and apparatus for determining a cooperation node. The method includes: acquiring first location information of a target node when it is required to allocate a cooperation node to the target node; and selecting, from a plurality of nodes, the cooperation node satisfying a preset location requirement for the target node based on the first location information, where the plurality of nodes and the target node are located in a same network, and the preset location requirement refers to that the target node and the cooperation node do not have a common parent node or have a lowest-level common parent node closest to a root node. ## Claims ### Claim 1 A method for determining a cooperation node, comprising: acquiring first location information of a target node when it is required to allocate a cooperation node to the target node; and selecting, from a plurality of nodes, the cooperation node satisfying a preset location requirement for the target node based on the first location information, wherein the plurality of nodes and the target node are located in a same network, and the preset location requirement refers to that the target node and the cooperation node do not have a common parent node or have a lowest-level common parent node closest to a root node, wherein after the selecting, from a plurality of nodes, the cooperation node satisfying a preset location requirement for the target node based on the first location information, the method further comprises: when a node is added in the same network, acquiring a first node which does not have an optimal cooperation node in the same network; and re-allocating the cooperation node to the first node. ### Claim 2 (depends on 1) The method of claim 1, wherein the selecting, from a plurality of nodes, the cooperation node satisfying a preset location requirement for the target node based on the first location information comprises: acquiring a plurality of pieces of second location information of the plurality of nodes, wherein each of the plurality of nodes corresponds to one piece of second location information; and selecting, from the plurality of nodes and based on the plurality of pieces of second location information and the first location information, a node satisfying the preset location requirement as the cooperation node. ### Claim 3 (depends on 2) The method of claim 2, wherein the selecting, from the plurality of node and based on the plurality of pieces of second location information and the first location information, a node satisfying the preset location requirement as the cooperation node comprises: acquiring first encoded information for representing the first location information and a plurality of pieces of second encoded information for representing the plurality of pieces of second location information; comparing, from a most significant bit, a plurality of encoded bits of the first encoded information with a plurality of encoded bits of each of the plurality of pieces of second encoded information, and searching the plurality of pieces of second encoded information for target encoded information having a maximum number of continuous non-coincident encoded bits with the first encoded information from the most significant bit; and taking a node corresponding to the target encoded information as the cooperation node. ### Claim 4 (depends on 3) The method of claim 3, wherein the comparing, from a most significant bit, a plurality of encoded bits of the first encoded information with a plurality of encoded bits of each of the plurality of pieces of second encoded information, and searching the plurality of pieces of second encoded information for target encoded information having a maximum number of continuous non-coincident encoded bits with the first encoded information from the most significant bit comprises: determining a number M of encoded bits of the first encoded information; determining whether the plurality of pieces of second encoded information contains at least one piece of second encoded information having the number M of encoded bits; when it is determined that the plurality of pieces of second encoded information contains the at least one piece of second encoded information having the number M of encoded bits, acquiring, from the at least one piece of second encoded information having the number M of encoded bits, the target encoded information having (M−1) most significant bits different from (M−1) most significant bits of the first encoded information; when it is determined that the plurality of pieces of second encoded information does not contain a piece of second encoded information having the number M of encoded bits, or when failing to acquire, from the at least one piece of second encoded information having the number M of encoded bits, the target encoded information having (M−1) most significant bits different from (M−1) most significant bits of the first encoded information, acquiring, from at least one piece of second encoded information having a number (M−1) of encoded bits, the target encoded information having (M−2) most significant bits different from (M−2) most significant bits of the first encoded information; and when failing to acquire, from at least one piece of second encoded information having a number (M−N) of encoded bits, the target encoded information having (M−N−1) most significant bits different from (M−N−1) most significant bits of the first encoded information, acquiring, from at least one piece of second encoded information having a number (M−N−1) of encoded bits, the target encoded information having (M−N−2) most significant bits different from (M−N−2) most significant bits of the first encoded information, wherein N is a positive integer greater than 0 and less than (M−1). ### Claim 5 (depends on 1) The method of claim 1, wherein the optimal cooperation node of one node has a same number of encoded bits as the one node and has (M−1) most significant bits different from (M−1) most significant bits of the one node, wherein M is a number of encoded bits of the one node. ### Claim 6 (depends on 1) The method of claim 1, wherein after the selecting, from a plurality of nodes, the cooperation node satisfying a preset location requirement for the target node based on the first location information, or after the re-allocating the cooperation node to the first node, each node in the same network has at most two cooperation nodes. ### Claim 7 (depends on 1) The method of claim 1, wherein after the acquiring first location information of a target node, the method further comprises: configuring encoded information for each node in the same network. ### Claim 8 (depends on 7) The method of claim 7, wherein the configuring encoded information for each node in the same network comprises: acquiring a tree network corresponding to the same network and configuring encoded information Ni for a node at a second level of the tree network, wherein i is a serial number of the node at the second level, i is a positive integer, and the node at the second level is a subnode of the root node in the tree network; and configuring, encoded information Nkp for a node at a j-th level of the tree network, wherein j is a positive integer greater than 2, k is a serial number of a parent node of the node at the j-th level, and p is a positive integer. ### Claim 9 (depends on 1) The method of claim 1, wherein each node in the same network is a terminal or a gateway. ### Claim 10 (depends on 1) The method of claim 1, wherein the method for determining the cooperation node is applied to any node in the same network. ### Claim 11 An apparatus for determining a cooperation node, comprising: a processor; and a storage device for storing a program executable by the processor; wherein when executing the program, the processor is configured to implement: a first acquisition unit, which is configured to acquire first location information of a target node when it is required to allocate a cooperation node to the target node; a selection unit, which is configured to select, from a plurality of nodes, the cooperation node satisfying a preset location requirement for the target node based on the first location information, wherein the plurality of nodes and the target node are located in a same network, and the preset location requirement refers to that the target node and the cooperation node do not have a common parent node or have a lowest-level common parent node closest to a root node; a second acquisition unit, which is configured to acquire a first node which does not have an optimal cooperation node in the same network when a node is added in the same network, after the cooperation node is selected, from the plurality of nodes, for the target node based on the first location information; and an allocation unit, which is configured to re-allocate the cooperation node to the first node. ### Claim 12 (depends on 11) The apparatus of claim 11, wherein the selection unit comprises: an acquisition module, which is configured to acquire a plurality of pieces of second location information of the plurality of nodes, wherein each of the plurality of nodes corresponds to one piece of second location information; and a selection module, which is configured to select, from the plurality of nodes and based on the plurality of pieces of second location information and the first location information, a node satisfying the preset location requirement as the cooperation node. ### Claim 13 (depends on 12) The apparatus of claim 12, wherein the selection module comprises: a first acquisition submodule, which is configured to acquire first encoded information for representing the first location information and a plurality of pieces of second encoded information for representing the plurality of pieces of second location information; a search submodule, which is configured to compare, from a most significant bit, a plurality of encoded bits of the first encoded information with a plurality of encoded bits of each of the plurality of pieces of second encoded information, and search the plurality of pieces of second encoded information for target encoded information having a maximum number of continuous non-coincident encoded bits with the first encoded information from the most significant bit; and an operation submodule, which is configured to take a node corresponding to the target encoded information as the cooperation node. ### Claim 14 (depends on 13) The apparatus of claim 13, wherein the search submodule comprises: a determination submodule, which is configured to determine a number M of encoded bits of the first encoded information; a determining submodule, which is configured to determine whether the plurality of pieces of second encoded information contains at least one piece of second encoded information having the number M of encoded bits; a second acquisition submodule, which is configured to acquire, from the at least one piece of second encoded information having the number M of encoded bits, the target encoded information having (M−1) most significant bits different from (M−1) most significant bits of the first encoded information when it is determined that the plurality of pieces of second encoded information contains the at least one piece of second encoded information having the number M of encoded bits; a third acquisition submodule, which is configured to acquire, from at least one piece of second encoded information having a number (M−1) of encoded bits, the target encoded information having (M−2) most significant bits different from (M−2) most significant bits of the first encoded information when it is determined that the plurality of pieces of second encoded information does not contain a piece of second encoded information having the number M of encoded bits, or when the second acquisition submodule fails to acquire, from the at least one piece of second encoded information having the number M of encoded bits, the target encoded information having (M−1) most significant bits different from (M−1) most significant bits of the first encoded information; and a fourth acquisition submodule, which is configured to acquire, from at least one piece of second encoded information having a number (M−N−1) of encoded bits, the target encoded information having (M−N−2) most significant bits different from (M−N−2) most significant bits of the first encoded information, when failing to acquire, from at least one piece of second encoded information having a number (M−N) of encoded bits, the target encoded information having (M−N−1) most significant bits different from (M−N−1) most significant bits of the first encoded information, wherein N is a positive integer greater than 0 and less than (M−1). ### Claim 15 (depends on 11) The apparatus of claim 11, wherein the optimal cooperation node of one node has a same number of encoded bits as the one node and has (M−1) most significant bits different from (M−1) most significant bits of the one node, wherein M is a number of encoded bits of the one node. ### Claim 16 (depends on 11) The apparatus of claim 11, wherein each node in the same network has at most two cooperation nodes. ### Claim 17 (depends on 11) The apparatus of claim 11, wherein the processor is configured to further implement: a configuration unit, which is configured to configure encoded information for each node in the same network after the first location information of the target node is acquired. ### Claim 18 (depends on 17) The apparatus of claim 17, wherein the configuration unit comprises: a first configuration module, which is configured to acquire a tree network corresponding to the same network and configure encoded information Ni for a node at a second level of the tree network, wherein i is a serial number of the node at the second level, i is a positive integer, and the node at the second level is a subnode of the root node in the tree network; and a second configuration module, which is configured to configure encoded information Nkp for a node at a j-th level of the tree network, wherein j is a positive integer greater than 2, k is a serial number of a parent node of the node at the j-th level, and p is a positive integer. ### Claim 19 (depends on 11) The apparatus of claim 11, wherein each node in the same network is a terminal or a gateway. ### Claim 20 A non-transitory computer-readable storage medium, wherein the storage medium is configured to store a program which, when executed by a processor, implements a method for determining a cooperation node, comprising: acquiring first location information of a target node when it is required to allocate a cooperation node to the target node; and selecting, from a plurality of nodes, the cooperation node satisfying a preset location requirement for the target node based on the first location information, wherein the plurality of nodes and the target node are located in a same network, and the preset location requirement refers to that the target node and the cooperation node do not have a common parent node or have a lowest-level common parent node closest to a root node, wherein after the selecting, from a plurality of nodes, the cooperation node satisfying a preset location requirement for the target node based on the first location information, the method further comprises: when a node is added in the same network, acquiring a first node which does not have an optimal cooperation node in the same network; and re-allocating the cooperation node to the first node.