WO2018023971A1

WO2018023971A1 - Method and apparatus for determining cooperating node

Info

Publication number: WO2018023971A1
Application number: PCT/CN2017/075360
Authority: WO
Inventors: 杨坤; 吴昊; 刘松洁; 任婧
Original assignee: 中兴通讯股份有限公司
Priority date: 2016-08-04
Filing date: 2017-03-01
Publication date: 2018-02-08

Abstract

The present invention provides a method and apparatus for determining a cooperating node. The method comprises: when it needs to allocate a cooperating node to a target node, obtaining first location information of the target node; and selecting a coordinating node meeting a preset location requirement for the target node from multiple nodes on the basis of the first location information, the multiple nodes and the target node being located in the same network, and the preset location requirement being that the target node and the cooperating node do not have a common parent node, or have a lowest-level common parent node closest to the root node. The present invention solves the technical problem in the related art that data backup and data recovery cannot be conducted when the node fails.

Description

Method and device for determining cooperative node

Technical field

The present application relates to the field of communications, and in particular, to a method and apparatus for determining a coordinated node.

Background technique

With the gradual expansion of the application scope of the Internet of Things technology, there has been a growing number of “ubiquitous/intermediary networks” with a large geographical span. In order to cover these ubiquitous networks with large spans, it is usually necessary to use multiple gateways simultaneously for data collection and transmission. These gateways can be interconnected using a carrier network or other private network. Due to the complexity of the ubiquitous/intermediary network environment, terminal equipment is usually unattended, so there is a situation of unstable communication. In order to improve the reliability of information transmission and meet the needs of IoT applications, it is usually necessary to select cooperative nodes to achieve data redundancy. Backup and recovery, which promotes efficient network data transmission, achieves network security and communication reliability, and meets the core content of specific application requirements.

For example, the rapid development of the economy and the rapid expansion of the city have made the problem of energy shortage increasingly serious. As a major energy technology reform, the smart grid has become an important research hotspot in the current country. The smart grid develops power supply plans and prices by monitoring the power load. The adjustment scheme ensures the safety, reliability and economy of electricity use. Therefore, the safe operation of the grid system is the primary problem that the smart grid needs to solve. When some power equipment in the power grid trips due to excessive load, or is damaged due to natural or human factors, the smart grid needs to judge the cause of the fault in time, but because the current smart grid adopts a central structure, the collected data is regularly reported and managed. Center, when there is a problem with a power device, it takes a while to discover the problem. And because the collected data is lost, it will be impossible to determine the cause of the problem. Therefore, the collaborative nodes need to back up data with each other, and when the collaborative node is found to be unable to connect, the collaborative node is reported to the management center to report the fault and the previously collected data is reported.

In the choice of traditional cooperative nodes, the hop count or physical distance between the cooperative nodes is mainly considered, but the same failure scenario may be considered to affect multiple cooperative nodes, so that the two cooperative nodes are isolated from the primary network. Unable to guarantee the completion of communication, can not carry out data Backup and recovery.

In view of the technical problems that data backup and data recovery cannot be performed when a node fails in the related art, an effective solution has not been proposed yet.

Summary of the invention

The present application provides a method and apparatus for determining a cooperative node to at least solve the technical problem that data backup and data recovery cannot be performed when a node fails in the related art.

According to an aspect of the present application, a method for determining a coordinated node is provided, the method comprising: acquiring first location information of a target node when a coordinated node needs to be allocated to a target node; and from a plurality of nodes based on the first location information Selecting a collaborative node that meets the preset location requirement for the target node, where multiple nodes and target nodes are located in the same network, and the preset location requirement means that the target node and the coordinated node do not have a common parent node or have a lowest level The common parent node is closest to the root node.

Optionally, selecting, according to the first location information, the coordinated node that meets the preset location requirement for the target node from the multiple nodes includes: acquiring a plurality of second location information of the multiple nodes, where each of the multiple nodes Having a second location information; selecting, from the plurality of nodes, the node that meets the preset location requirement according to the plurality of second location information and the first location information is a coordinated node.

Optionally, selecting, as the coordinated node, the node that meets the preset location requirement from the multiple nodes according to the multiple second location information and the first location information includes: acquiring first coding information for indicating the first location information, and for using a plurality of second encoding information indicating a plurality of second location information; comparing each of the first encoding information and the plurality of second encoding information from a high bit, searching for a plurality of second encoding information from a high bit and a first encoding The information does not continuously overlap the target coding information with the largest number of coded bits; the node corresponding to the target coding information is used as the coordination node.

Optionally, comparing the first coding information and each of the plurality of second coding information from a high bit, searching for a target code that has the largest number of consecutive coding bits from the upper bits and the first coding information from the upper bits. The information includes: determining a coded bit number M of the first coded information; determining whether the second coded information having the coded bit number M exists in the plurality of second coded information of the second position information; and determining the plurality of second coded information There is a second encoded information with a coded bit number M In the case where the high (M-1) bit code of the one or more second coded information having the coded number of bits is obtained, the target coded information different from the high (M-1) bit code in the first coded information is obtained; In the case where the second coded information having the coded bit number M does not exist in the second coded information, or in the execution step, the high (M-1) bit code and the first one or more pieces of the second coded information having the coded bit number M are obtained. When the high (M-1) bits of the coded information fail to encode different target coded information, the high (M-2) bit code and the first code of the one or more second coded information having the coded bit number (M-1) are obtained. The high (M-2) bits of the information encode different target encoding information; in the performing step, the high (MN-1) bit encoding and the first encoding information are obtained in one or more second encoding information having a coded bit number (MN) When the high (MN-1) bit fails to encode different target coding information, the high (MN-2) bit code and the first coded information in the one or more second coded information having the coded bit number (MN-1) are obtained. The (MN-2) bit encodes different target coding information, where N is a positive integer greater than 0 and less than (M-1).

Optionally, after selecting a coordinated node for the target node from the multiple nodes based on the first location information, the method further includes: when adding a node in the same network, acquiring the first that the optimal cooperative node does not exist in the same network. Node, where the optimal cooperative node of any node means that the coded bits are the same as the coded bits of any node and the high (M-1) bit code is different from the high (M-1) bit code of any node. Node, M is the number of coded bits of any node.

Optionally, after selecting a coordinated node that meets the preset location requirement for the target node from the multiple nodes based on the first location information, or after re-assigning the coordinated node to the first node, each node in the same network at most Has two collaborative nodes.

Optionally, after acquiring the first location information of the target node, the method further includes: configuring coding information for each node in the same network.

Optionally, configuring the coding information for each node in the same network includes: acquiring a tree network corresponding to the same network, where the coding information configured for the second level node in the tree network is Ni, and i is the second level node. Coding, i is a positive integer, the second-level node is a child node of the root node in the tree network; the coding information configured for the j-th node in the tree network is Nkp, where j is a positive integer greater than 2, k Is the encoding of the parent node of the jth node, p is a positive integer.

Optionally, the nodes in the same network are terminals or gateways.

Optionally, the determining method of the cooperative node of the present application is applied to any node in the same network described above.

According to another aspect of the present application, a determining apparatus for a cooperative node is provided, the apparatus comprising: a first acquiring unit, configured to acquire first location information of a target node when a coordinated node needs to be allocated to a target node; And selecting, according to the first location information, a coordinated node that meets a preset location requirement from the plurality of nodes, wherein the multiple nodes and the target node are located in the same network, and the preset location requirement refers to the target node and the coordinated node. A common parent node that does not have a common parent node or has the lowest level is closest to the root node.

Optionally, the selecting unit includes: an acquiring module, configured to acquire multiple second location information of the multiple nodes, where each node of the multiple nodes has one second location information; and a selection module, configured to use multiple The second location information and the first location information select a node that meets the preset location requirement from the plurality of nodes as the collaboration node.

Optionally, the selecting module includes: a first acquiring submodule, configured to acquire first encoding information for indicating first location information and multiple second encoding information for indicating multiple second location information; and searching submodule For comparing the first coding information and the multiple coding codes of the plurality of second coding information from the upper bits, searching for the target coding information that has the largest number of coding bits from the upper bits and the first coding information from the upper bits. An operation submodule for using a node corresponding to the target coding information as a coordination node.

Optionally, the determining submodule includes: a determining submodule, configured to determine a coded bit number M of the first coded information; and a determining submodule, configured to determine whether the number of coded bits exists in the plurality of second coded information of the second location information a second encoding information that is M; and a second obtaining sub-module, configured to: when it is determined that the second encoding information with the number of encoding bits is M in the plurality of second encoding information, obtain one or The high (M-1) bits of the plurality of second encoding information encode target encoding information different from the high (M-1) bit encoding in the first encoding information; and the third obtaining submodule is configured to determine the plurality of second encoding information In the case where the second coded information having the coded bit number M does not exist, or in the step of performing the step of obtaining the high (M-1) bit code and the first coded information in the one or more pieces of the second coded information having the coded bit number M (M-1) bit when encoding different target encoding information fails, Taking the high (M-2) bit encoding of the one or more second encoding information having the coded bit number (M-1) to be different from the high (M-2) bit encoding of the first encoding information; the fourth obtaining a submodule, configured to obtain, in the performing step, a target in which the high (MN-1) bit code is different from the high (MN-1) bit code of the first coded information in the one or more second coded information having the coded bit number (MN) When the coding information fails, obtaining a target code having a high (MN-2) bit code different from the high (MN-2) bit code of the first coded information in one or more second coded information having a coded bit number of (MN-1) Information, where N is a positive integer greater than 0 and less than (M-1).

Optionally, the device further includes: a second acquiring unit, configured to: when the node is added to the target node from the plurality of nodes based on the first location information, when the node is added in the same network, the acquiring does not exist in the same network The first node of the optimal cooperative node, wherein the optimal cooperative node of any node means that the coded number of bits is the same as the coded number of bits of any node and the high (M-1) bit code is high with any node (M -1) The bit encodes a different node, and M is the number of coded bits of any node.

Optionally, each node in the same network has at most two cooperating nodes.

Optionally, the device further includes: a configuration unit, configured to configure coding information for each node in the same network after acquiring the first location information of the target node.

Optionally, the configuration unit includes: a first configuration module, configured to acquire a tree network corresponding to the same network, where the coding information configured for the second level node in the tree network is Ni, and the code of the second level node is , i is a positive integer, the second level node is a child node of the root node in the tree network; the second configuration module is configured to encode the information of the jth level node in the tree network as Nkp, where j is greater than 2 Positive integer, k is the encoding of the parent node of the jth node, and p is a positive integer.

Optionally, the nodes in the tree network are terminals or gateways.

According to another embodiment of the present application, there is provided a storage medium configurable to store program code for performing the following steps: acquiring first location information of a target node when a coordinated node needs to be assigned to a target node And selecting, according to the first location information, a coordinated node that meets a preset location requirement for the target node from the plurality of nodes, where the multiple nodes and the target node are located in the same network, and the preset location requirement means that the target node and the coordinated node do not have The common parent node or the lowest parent of the lowest level is closest to the root node.

In the present application, when it is required to allocate a coordinated node to the target node, the first location information of the target node is acquired; and the coordinated node that meets the preset location requirement is selected from the plurality of nodes for the target node based on the first location information, where The node and the target node are located in the same network. The preset location requirement means that the target node and the coordinated node do not have a common parent node or have the lowest level of the common parent node closest to the root node, thereby solving the node occurrence in the related art. The technical problems of data backup and data recovery cannot be performed in the event of a failure, which reduces the impact of failure on data backup and data recovery.

DRAWINGS

The drawings described herein are intended to provide a further understanding of the present application, and are intended to be a part of this application. In the drawing:

1 is a schematic diagram of a terminal device according to the present application;

2 is a flowchart of a method for determining a collaboration node according to the present application;

3 is a flow chart of a method of determining an optional cooperative node in accordance with the present application;

4 is a schematic diagram of an alternative tree network structure in accordance with the present application;

5 is a flow chart of a method of determining an optional cooperative node in accordance with the present application;

6 is a schematic diagram of an alternative tree network structure in accordance with the present application;

7 is a flow chart of a method of determining an optional cooperative node in accordance with the present application;

FIG. 8 is a schematic diagram of a determining device of a cooperative node according to the present application.

detailed description

The present application will be described in detail below with reference to the drawings in conjunction with the embodiments. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict.

It should be noted that the terms "first", "second" and the like in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or order.

Example 1

The method embodiment provided in Embodiment 1 of the present application can be executed in a terminal device, a gateway, or the like. For example, running on a terminal device, as shown in FIG. 1, the terminal device may include one or more (only one shown) processor 101 (the processor 101 may include, but is not limited to, a microprocessor MCU or programmable A processing device such as a logic device FPGA, a memory 103 for storing data, and a transmission device 105 for communication functions. It will be understood by those skilled in the art that the structure shown in FIG. 1 is merely illustrative and does not limit the structure of the above electronic device.

The memory 103 can be used to store software programs and modules of application software, such as program instructions/modules corresponding to the control method of the device in the present application, and the processor 101 executes various functions by running software programs and modules stored in the memory 103. Application and data processing, that is, the above method is implemented. The memory can include high speed random access memory and can also include non-volatile memory such as one or more magnetic storage devices, flash memory, or other non-volatile solid state memory. In some examples, the memory can further include memory remotely located relative to the processor, the remote memory being connectable to the terminal device over a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The transmission device is for receiving or transmitting data via a network. The above specific network example may include a wireless network provided by a communication provider of the terminal device. In one example, the transmission device includes a Network Interface Controller (NIC) that can be connected to other network devices through the base station to communicate with the Internet. In one example, the transmission device can be a Radio Frequency (RF) module for communicating with the Internet wirelessly.

In the related art, two nodes with the closest or closest physical distance are often selected as cooperative nodes. For example, the ZigBee protocol stipulates that two nodes can communicate directly within one hop range, and each other is a cooperative node; the IPv6 protocol specifies two direct The two nodes connected by the shared medium or the point-to-point link are mutually cooperative nodes; in addition, there are 6LoWPAN protocols and the like.

Almost all of the above schemes use hop count or physical distance as the criteria for selecting neighbors. The neighbors obtained in the selection mode (ie, the cooperative node) can only ensure that the information transmission between the neighbors is relatively simple and the delay is low. Therefore, when the network is abnormal, the two neighboring nodes are more likely to be affected at the same time. When using this neighbor selection method, if a failure occurs, it will affect data backup and data recovery.

In order to solve the above problems, according to the present application, a method embodiment of a method for determining a cooperative node is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings may be in a computer system such as a set of computer executable instructions. The execution is performed, and although the logical order is shown in the flowcharts, in some cases the steps shown or described may be performed in a different order than the ones described herein.

2 is a flowchart of a method for determining a coordinated node according to the present application. As shown in FIG. 2, the method includes the following steps:

Step S201: When the coordinated node needs to be allocated to the target node, the first location information of the target node is obtained.

Step S202: Select, according to the first location information, a coordinated node that meets the preset location requirement from the plurality of nodes, where the multiple nodes and the target node are located in the same network, and the preset location requirement means that the target node and the coordinated node do not have The common parent node or the lowest parent of the lowest level is closest to the root node.

According to the foregoing embodiment, when the coordinated node is required to be allocated to the target node, the first location information of the target node is acquired; and the coordinated node that meets the preset location requirement is selected for the target node from the multiple nodes based on the first location information, where The node and the target node are located in the same network. The preset location requirement means that the target node and the coordinated node do not have a common parent node or have the lowest level of the common parent node closest to the root node, so that when any node fails The cooperative node is not easy to be affected, which is beneficial to the backup and recovery of the fault data, thereby solving the technical problem that the data backup and data recovery cannot be performed when the node fails in the related technology, and the impact of the fault on the data backup and the data recovery is reduced.

Optionally, the foregoing node may be a device such as a terminal or a gateway; the execution body of the foregoing step may be a terminal, a gateway, or the like, but is not limited thereto. According to different business capabilities, the terminal device can There are two types: terminals and gateways. The terminal is a terminal device having a service capability and a network communication function; and the gateway is a terminal device that uses the service capability to implement connection and interaction between the terminal peripheral and the network and the application. When performing steps S201 and S202, it may be directly operated on the same network, or may be a tree network corresponding to the same network. If the same network is an arbitrarily structured network, it can be processed into a tree network by preprocessing (that is, the network of the tree network is a logical spanning tree).

In the embodiment of the present application, in a tree network composed of nodes, each node needs and can only have one or two cooperation nodes, and all data of the cooperation node is backed up on the node, and all the nodes are The data is also backed up on the collaboration node. When there is a node that is damaged and the link is unreachable and cannot be uploaded, the required data can be restored and uploaded from the collaboration node to the maximum extent.

It should be noted that when constructing a network, all nodes may be first coded, and the node coding may determine the affinity relationship between the nodes, and then the neighbor selection operation is started from any node until all nodes have at least one node as Neighbors; when the network topology changes, the newly added nodes need to be node-coded, and then the nodes with no neighbors after the topology change and the nodes with non-optimal nodes are all re-selected.

After performing the acquiring the first location information of the target node in step S201, the coding information may be configured for each node in the same network as follows: acquiring a tree network corresponding to the same network; being a second level in the tree network The coding information of the node configuration is Ni, i is the coding of the second-level node, i is a positive integer, the second-level node is the child node of the root node in the tree network; the coding information configured for the j-th node in the tree network Is Nkp, where j is a positive integer greater than 2, k is the encoding of the parent node of the jth node, and p is a positive integer.

Optionally, as shown in Figure 3 (the root node is N):

Step S301, setting the second-level node to Ni, where i is an incremental number;

Step S302, setting the third-level node to be Nip, i is the upper layer number directly under the node, p is an incremental number, and i is a high position relative to p;

Step S303, setting the jth level node to Nkp, k is the upper layer number directly under the node, and p is an increment number. Repeat this step until all nodes have been set up.

Specific examples of implementation in accordance with the above code are as follows:

Step 11, the node (second-level node) subordinate to the root node is N1, N2, N3, etc.;

Step 12: Encoding a node subordinate to the second-level node (third-level node), the nodes subordinate to N1 are N11, N12, N13, etc., the nodes subordinate to N2 are N21, N22, N23, etc., and the nodes subordinate to N3 are N31, N32 , N33, etc.;

Step 13: Encoding a node subordinate to the third-level node (fourth-level node), the nodes of the N11 subordinate are N111, N112, N113, etc., the nodes of the N12 subordinate are N121, N122, N123, etc., and the nodes of the N13 subordinate are N131, N132 , N133, etc., N21, N22, N23, N31, N32, N33 are also encoded in the same way;

In step 14, the fifth level, the sixth level, and the like are encoded according to the above rules until all the nodes are encoded.

The tree network structure completed according to the embodiment is shown in FIG. 4 (N is the root node), and the nodes are numbered according to the failure scenario, and the node coding can determine the affinity relationship between the nodes, so as to facilitate the implementation of the neighbor selection, thereby After the neighbor is selected, the collaborative node can back up and restore the data through communication.

Optionally, when a tree network is newly formed, all the nodes in the network are first coded according to the node coding method as above. After the coding is completed, an arbitrary node is selected to operate according to the neighbor selection method, and the cooperative node is obtained. . Then, the next node without the cooperative node is arbitrarily selected to perform neighbor selection operation until all nodes have at least one coordinated node. Each node then backs up the data at the beginning of the collaboration node and accepts the backup data of the storage coordinator.

Selecting a specific logical cooperation node as described in step S202, selecting a cooperative node that meets the preset location requirement for the target node from the plurality of nodes based on the first location information includes: acquiring a plurality of second location information of the multiple nodes Each of the plurality of nodes has a second location information; and the node that meets the preset location requirement is selected from the plurality of nodes as the coordinated node according to the plurality of second location information and the first location information.

The selecting, by the plurality of nodes, the node that meets the preset location requirement according to the plurality of second location information and the first location information to be the collaboration node includes: acquiring, by using the second location information, the first location information An encoding information and a plurality of second encoding information for indicating the plurality of second location information; comparing the bit encoding of the first encoding information and the plurality of second encoding information from a high bit, searching for a plurality of second encoding information The high bit starts to overlap with the first coded information without the target coded information having the largest number of coded bits; the node corresponding to the target coded information is used as the cooperative node.

Optionally, comparing the first coding information and each of the plurality of second coding information from a high bit, searching for a target code that has the largest number of consecutive coding bits from the upper bits and the first coding information from the upper bits. The information includes: determining a coded bit number M of the first coded information; determining whether the second coded information having the coded bit number M exists in the plurality of second coded information of the second position information; and determining the plurality of second coded information In the case where there is the second coded information having the coded bit number M, the high (M-1) bit code in the one or more second coded information having the coded bit number M and the high (M-1) bit in the first coded information are obtained. Encoding different target encoding information; in the case where it is determined that there is no second encoding information of the encoding bit number M in the plurality of second encoding information, or in the executing step, acquiring one or more second encoding digits of M When the high (M-1) bit coded in the coded information fails the target coded information different from the high (M-1) bit code in the first coded information, one or more second coded information having the coded bit number (M-1) is obtained. Medium high (M-2) bit coding and first coding The high (M-2) bits of the information encode different target coding information; in the execution step, the high (MN-1) bit code and the first coded information in the one or more second coded information having the coded bit number (MN) are obtained. When the high (MN-1) bit fails to encode different target coding information, the high (MN-2) bit code and the first coded information in the one or more second coded information having the coded bit number (MN-1) are obtained. The (MN-2) bit encodes different target coding information, where N is a positive integer greater than 0 and less than (M-1).

An embodiment of the present application is described in detail below with reference to FIG. 5, as shown in FIG.

Step S501, obtaining a node n that needs to select a coordinated node.

Step S502, searching for a node m1 that is different from the node n except for the lowest bit, and the node m1 having no cooperative node, if yes, determining that the node m1 is the coordinated node of the node n, otherwise performing the next step.

Step S503, finding that each bit except one of the node codes is different from the node n, and only one node m2 of the cooperative node, if yes, determining that the node m2 is the cooperation of the node n Node, otherwise perform the next step.

In steps S502 and S503, there is a global constraint when looking for the node m (including m1 and m2), that is, the node m needs to be the same as the number of bits of the node n.

However, when steps S502 and S503 complete the traversal of all the same nodes and there is still no suitable cooperative node, the global constraint condition of the node m becomes that the coded number of the node m is one less than the node n, and then the node selection is performed. As described in steps S504 and S505.

Step S504, searching for a node mp whose node code is the same as the leftmost x bit (ie, the high x bit) of the node n and has no cooperative node. If yes, the node mp is determined to be the cooperative node of the node n, otherwise the next step is performed.

Step S505, searching for a node mq whose node code is the same as the leftmost x bit of the node n and having only one coordinated node, and if so, determining that the node mq is the cooperative node of the node n, otherwise, x=x+1, and re Step S504 is performed.

If there is still no suitable coordinating node, the global constraint condition for node m becomes that the number of coded bits of node m is 2 bits less than that of node n, and so on until a node m that satisfies the condition is found as the neighbor of node n.

After finding the cooperative node m, if the number of coded bits encoded by the node m and the node n is the same and each bit except the lowest bit in the node code is different, the node m and the node n are mutually optimal cooperative nodes; if the above is not satisfied If required, node m and node n are not mutually optimal cooperative nodes.

Optionally, after the node is selected from the plurality of nodes for the target node based on the first location information, when the node is added to the tree network, the first node that does not have the optimal collaboration node in the tree network is obtained, where The optimal cooperative node of any node refers to a node whose coded number is the same as the coded number of bits of any node and the high (M-1) bit code is different from the high (M-1) bit code of any node, M The number of coded bits for any node. When all the cooperative nodes of a node are not the optimal cooperative nodes, the cooperative node is reselected for the next network topology change.

It should be noted that, after selecting a coordinated node that meets the preset location requirement for the target node from the plurality of nodes based on the first location information, or after re-assigning the coordinated node to the first node, each of the tree networks A node has at most two coordination nodes.

Assuming that the tree network structure is as shown in Figure 6 (N is the root node), after performing neighbor selection operations on all nodes, the neighbor pairs (that is, the nodes that are mutually cooperative nodes) are as follows:

N1 and N2, N2 and N3, N11 and N21, N12 and N22, N13 and N31, N111 and N221, N111 and N133, N112 and N311, N131 and N221, N132 and N311.

Among them, the cooperative nodes of N133 are not the optimal cooperative nodes.

Optionally, when the storage space of each node only supports backing up data of one other node, each node can only have one cooperative node. In this case, the method for selecting the coordinated node is as shown in FIG. 7:

Step S701, obtaining a node n that needs to select a coordinated node.

Step S702, searching for a node m1 in which a bit other than the lowest bit is different from the node n, and the node m1 having no cooperating node, if yes, determining that the node m1 is the coordinating node of the node n, otherwise performing the next step.

Step S703, searching for a node mp whose node code is the same as the leftmost x bit of the node n and having no cooperative node. If yes, it is determined that the node mp is the cooperative node of the node n, otherwise, x=x+1, and the steps are re-executed. S703.

Assuming that the tree network structure is shown in Figure 6, after neighbor selection operations are performed on all nodes, the neighbor pairs (according to the traversal manner, the obtained results may be different) as follows:

N1 and N2, N11 and N22, N12 and N31, N13 and N21, N111 and N221, N112 and N132, N131 and N133, wherein N3 has no cooperative nodes, and the cooperative nodes of N112, N132, N131 and N133 are not the most Excellent coordination node.

In the above embodiment, the node coding can comb the affinity relationship of the entire tree network, and the relationship between nodes can be judged by coding, which greatly reduces the efficiency of neighbor selection; when performing neighbor selection, any node can be found in the current network. The most suitable neighbor is available. The most suitable neighbor is different from the optimal neighbor. The most suitable neighbor may or may not be the best neighbor. However, the most suitable neighbor must be the node that is the most distant from the node in the current network, that is, the network. An exception occurs at the same time as the node with the least probability. The matching cooperative node can be abnormal when a node or link in the network is abnormal. At a lower probability, it affects two nodes that are neighbors at the same time, which obviously improves the validity of the backup.

Through the description of the above embodiments, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation. Based on such understanding, the technical solution of the present application, which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk, The optical disc includes a plurality of instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform the above-described methods in various embodiments of the present application.

Example 2

A determining device for a cooperative node is also provided in the present application. The device is used to implement the above embodiments and preferred embodiments, and the description thereof has been omitted. As used below, the term "module" may implement a combination of software and/or hardware of a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.

FIG. 8 is a schematic diagram of a determining device of a cooperative node according to the present application. As shown in FIG. 8, the apparatus may include: a first obtaining unit 81 and a selecting unit 82.

The first obtaining unit 81 is configured to acquire first location information of the target node when the collaboration node needs to be allocated to the target node.

The selecting unit 82 is configured to select, according to the first location information, a coordinated node that meets the preset location requirement for the target node from the multiple nodes, where the multiple nodes and the target node are located in the same network, and the preset location requirement refers to the target node. The co-node does not have a common parent node or has a lowest-level common parent node closest to the root node.

According to the foregoing embodiment, the first acquiring unit acquires first location information of the target node when the collaboration node needs to be allocated to the target node; the selection unit selects, from the plurality of nodes, the target node to meet the preset location requirement based on the first location information. Collaborative node, where multiple nodes and target sections The point is located in the same network, and the preset location requirement means that the target node and the coordinated node do not have a common parent node or the lowest level of the common parent node is closest to the root node, thereby solving the problem that the node cannot be performed when the node fails in the related art. Technical issues with data backup and data recovery reduce the impact of failures on data backup and data recovery.

Optionally, the apparatus of the present application further includes: a configuration unit, configured to configure coding information for each node in the same network after acquiring the first location information of the target node.

Optionally, each node in the tree network has at most two coordination nodes.

In the above embodiment, the selecting unit includes: an obtaining module, configured to acquire a plurality of second location information of the plurality of nodes, wherein each of the plurality of nodes has a second location information; and the selecting module is configured to The plurality of second location information and the first location information select a node that meets the preset location requirement from the plurality of nodes as the collaboration node. An acquiring module, configured to acquire multiple second location information of multiple nodes, where each node of the multiple nodes has a second location information; and a selection module, configured to use, according to the multiple second location information and the first location Information is selected from multiple nodes The node with the lowest degree of association with the target node location is a coordinated node.

Optionally, the determining submodule includes: a determining submodule, configured to determine a coded bit number M of the first coded information; and a determining submodule, configured to determine whether the number of coded bits exists in the plurality of second coded information of the second location information a second encoding information that is M; and a second obtaining sub-module, configured to: when it is determined that the second encoding information with the number of encoding bits is M in the plurality of second encoding information, obtain one or The high (M-1) bits of the plurality of second encoding information encode target encoding information different from the high (M-1) bit encoding in the first encoding information; and the third obtaining submodule is configured to determine the plurality of second encoding information In the case where the second coded information having the coded bit number M does not exist, or in the step of performing the step of obtaining the high (M-1) bit code and the first coded information in the one or more pieces of the second coded information having the coded bit number M When the (M-1) bit coded different target coded information fails, the high (M-2) bit code of the one or more second coded information having the coded bit number (M-1) is obtained and the first coded information is high ( M-2) bit coding different target coding information; fourth acquisition submodule for Performing the step of obtaining, when one or more second coded information having a coded number of bits is (MN), the high (MN-1) bit code is different from the high (MN-1) bit code of the first coded information, and the target code information is acquired. The high (MN-2) bit code of the one or more second coded information having the coded bit number (MN-1) is different from the high (MN-2) bit code of the first coded information, where N is A positive integer greater than 0 and less than (M-1).

In an optional embodiment, the apparatus of the present application further includes: a second acquiring unit, configured to add a node in the tree network after selecting the coordinated node for the target node from the plurality of nodes based on the first location information At the time, the first node of the optimal cooperative node does not exist in the tree network, wherein the optimal coordinated node of any node refers to the coded number of bits is the same as the coded number of any node and is high (M-1) Encode a node different from the high (M-1) bit encoding of any node, M is any section The number of coded bits.

It should be noted that each of the above modules may be implemented by software or hardware. For the latter, the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the above modules are in any combination. The forms are located in different processors.

Example 3

Embodiments of the present application also provide a storage medium. Optionally, in the embodiment, the foregoing storage medium may be configured to store program code for performing the following steps:

S1. Acquire first location information of the target node when the collaboration node needs to be allocated to the target node.

S2. Select, according to the first location information, a coordinated node that meets a preset location requirement from the plurality of nodes, wherein the multiple nodes and the target node are located in the same tree network, and the preset location requirement refers to the target node and the collaboration. A node does not have a common parent node or has a lowest level of a common parent node closest to the root node.

Optionally, in this embodiment, the foregoing storage medium may include, but not limited to, a USB flash drive, a Read-Only Memory (ROM), a Random Access Memory (RAM), a mobile hard disk, and a magnetic memory. A variety of media that can store program code, such as a disc or a disc.

Optionally, in this embodiment, the processor performs, according to the stored program code in the storage medium, acquiring first location information of the target node when the collaboration node needs to be allocated to the target node; The node selects a cooperative node that meets the preset location requirement for the target node, where multiple nodes and target nodes are located in the same tree network, and the preset location requirement means that the target node and the coordinated node do not have a common parent node or have The lowest level of the common parent node is closest to the root node.

For example, the specific examples in this embodiment may refer to the examples described in the foregoing embodiments and the optional embodiments, and details are not described herein again.

Obviously, those skilled in the art should understand that the above modules or steps of the present application can be implemented by a general computing device, which can be concentrated on a single computing device, or Distributed over a network of computing devices, optionally, they may be implemented in program code executable by the computing device, such that they may be stored in the storage device for execution by the computing device, and in some cases The steps shown or described may be performed in a different order than that herein, or they may be separately fabricated into individual integrated circuit modules, or a plurality of the modules or steps may be implemented as a single integrated circuit module. Thus, the application is not limited to any particular combination of hardware and software.

The above is only a preferred embodiment of the present application, and is not intended to limit the present application, and various changes and modifications may be made to the present application. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of this application are intended to be included within the scope of the present application.

Claims

A method for determining a coordinated node includes:

Obtaining first location information of the target node when a coordinated node needs to be allocated to the target node;

And selecting, according to the first location information, a collaboration node that meets a preset location requirement for the target node from the multiple nodes, where the multiple nodes and the target node are located in the same network, and the preset location requirements It is meant that the target node and the coordinated node do not have a common parent node or have a lowest level of a common parent node closest to the root node.
The method according to claim 1, wherein the selecting a coordinated node that satisfies the preset location requirement for the target node from the plurality of nodes based on the first location information comprises:

Obtaining a plurality of second location information of the plurality of nodes, wherein each of the plurality of nodes has a second location information;

And selecting, according to the plurality of second location information and the first location information, a node that meets the preset location requirement from the multiple nodes as the collaboration node.
The method according to claim 2, wherein the node that satisfies the preset location requirement is selected from the plurality of nodes according to the plurality of second location information and the first location information is the coordinated node includes :

Obtaining first encoding information for indicating the first location information and a plurality of second encoding information for indicating the plurality of second location information;

Comparing the bit codes of the first coding information and the plurality of second coding information from a high bit, searching for the number of consecutive coding bits that are consecutively non-coincident with the first coding information from a high bit in the plurality of second coding information Maximum target encoding information;

A node corresponding to the target encoding information is used as the cooperative node.
The method according to claim 3, wherein comparing the bit codes of the first encoding information and the plurality of second encoding information from a high bit, searching for the plurality of The target coding information of the second coding information that is the largest non-coincident coding number from the upper bits and the first coding information includes:

Determining a coded number of bits M of the first encoded information;

Determining, by the plurality of second encoding information of the second location information, whether the second encoding information having the number of encoding bits is M;

Obtaining a high (M-1) bit encoding in one or more second encoding information with a coded bit number M in a case where it is determined that the second encoding information having a coded bit number M exists in the plurality of second encoding information Different target encoding information than the high (M-1) bit encoding in the first encoded information;

In a case where it is determined that the second encoding information having the number of encoding bits is M does not exist in the plurality of second encoding information, or in the step of acquiring one or more second encoding information having the number of encoding bits M (M) -1) when the target encoding information different from the high (M-1) bit encoding in the first encoding information fails, obtaining one or more second encoding information having a coded number of bits (M-1) (M-2) bit encoding the target encoding information different from the high (M-2) bit encoding of the first encoding information;

Performing the step of obtaining the target code of the high (MN-1) bit code different from the high (MN-1) bit code of the first coded information in the one or more second coded information having the coded bit number (MN) When the information fails, the high (MN-2) bit code of the one or more second coded information having the coded bit number (MN-1) is different from the high (MN-2) bit code of the first coded information. The target encoding information, wherein N is a positive integer greater than 0 and less than (M-1).
The method of claim 1, wherein after the collaborative node is selected from the plurality of nodes for the target node based on the first location information, the method further comprises:

When a node is added to the same network, acquiring a first node that does not have an optimal coordination node in the same network;

Reassigning the coordinating node to the first node.
The method of claim 5 wherein the optimal coordination section of any of the nodes A point is a node whose coded number of bits is the same as the coded number of bits of any of the nodes and the high (M-1) bit code is different from the high (M-1) bit code of any of the nodes, and M is the said The number of coded bits for a node.
The method according to claim 5, wherein after selecting a cooperative node that satisfies a preset location requirement for the target node from the plurality of nodes based on the first location information, or re-being the first node After allocating the cooperating node, each node in the same network has at most two of the cooperating nodes.
The method of claim 1, wherein after acquiring the first location information of the target node, the method further comprises:

Encoding information is configured for each node in the same network.
The method of claim 8 wherein configuring the encoding information for each of the nodes in the same network comprises:

Acquiring a tree network corresponding to the same network, where the coding information configured for the second level node in the tree network is Ni, where i is the code of the second level node, and i is a positive integer. The second level node is a child node of the root node in the tree network;

The coding information configured for the jth node in the tree network is Nkp, where j is a positive integer greater than 2, k is the encoding of the parent node of the jth node, and p is a positive integer.
The method of claim 1 wherein the nodes in the same network are terminals or gateways.
The method according to any one of claims 1 to 10, wherein the determining method of the cooperative node is applied to any of the nodes in the same network.
A determining device for a cooperative node, comprising:

a first acquiring unit, configured to acquire first location information of the target node when a coordinated node needs to be allocated to the target node;

Selecting a unit, configured to use the first location information from the plurality of nodes as the destination The target node selects a collaboration node that meets the preset location requirement, where the multiple nodes and the target node are located in the same network, and the preset location requirement means that the target node and the collaboration node do not have a common The parent node or the lowest parent of the lowest level is closest to the root node.
The apparatus of claim 12, wherein the selecting unit comprises:

An acquiring module, configured to acquire a plurality of second location information of the multiple nodes, where each of the multiple nodes has a second location information;

And the selecting module is configured to select, according to the plurality of second location information and the first location information, a node that meets the preset location requirement from the multiple nodes as the collaboration node.
The apparatus of claim 13 wherein said selecting module comprises:

a first acquiring submodule, configured to acquire first encoding information for indicating the first location information and a plurality of second encoding information for indicating the plurality of second location information;

a search submodule, configured to compare a bit code of the first coded information and the plurality of second coded information from a high bit, and search for the first coded information from the upper bit and the first coded information in the plurality of second coded information Continuously do not coincide with the target coded information with the largest number of coded bits;

The operation submodule is configured to use a node corresponding to the target coding information as the coordination node.
The apparatus of claim 14, wherein the lookup sub-module comprises:

Determining a submodule, configured to determine a coded number of bits M of the first encoded information;

a determining submodule, configured to determine whether there is second encoding information having a coded bit number M among the plurality of second encoding information of the second location information;

a second acquiring submodule, configured to obtain one or more second encoding information with a coded bit number M in a case where it is determined that the second encoding information having the coded bit number M exists in the plurality of second encoding information Medium high (M-1) bit coding and high (M-1) in the first coded information Bit coding different target coding information;

a third obtaining submodule, configured to: when it is determined that the second encoding information having the number of encoding bits is not present in the plurality of second encoding information, or in the performing step, obtaining one or more encoding digits of M When the high (M-1)-bit encoding of the second encoding information fails the target encoding information different from the high (M-1)-bit encoding in the first encoding information, obtaining one of the coded bits (M-1) Or the high (M-2) bits of the plurality of second encoded information encode the target encoded information different from the high (M-2) bit encoding of the first encoded information;

a fourth obtaining submodule, configured to obtain a high (MN-1) bit encoding and a high (MN-1) of the first encoding information in one or more second encoding information with a coded bit number (MN) in an execution step When the bit coding different target encoding information fails, obtaining the high (MN-2) bit coding of the one or more second coding information having the coded bit number (MN-1) and the first coding information is high (MN - 2) Bit encoding different target encoding information, where N is a positive integer greater than 0 and less than (M-1).
The device of claim 12, wherein the device further comprises:

a second acquiring unit, configured to: after selecting a coordinated node for the target node from the plurality of nodes based on the first location information, when a node is added to the same network, acquiring the same network does not exist most The first node of the optimal cooperative node;

An allocating unit, configured to re-allocate the cooperating node for the first node.
The apparatus according to claim 16, wherein the optimal cooperative node of any of the nodes refers to the coded number of bits being the same as the coded number of bits of the any node and the high (M-1) bit coded with any of the nodes The high (M-1) bits encode different nodes, and M is the number of coded bits of any of the nodes.
The apparatus of claim 16 wherein each node in the same network has at most two of the coordinated nodes.
The device of claim 12, wherein the device further comprises:

And a configuration unit, configured to configure encoding information for each node in the same network after acquiring the first location information of the target node.
The apparatus of claim 19, wherein the configuration unit comprises:

a first configuration module, configured to acquire a tree network corresponding to the same network, where the coding information configured for the second level node in the tree network is Ni, and i is the code of the second level node, i a positive integer, the second level node is a child node of the root node in the tree network;

a second configuration module, configured to configure the coding information for the jth node in the tree network to be Nkp, where j is a positive integer greater than 2, k is a code of a parent node of the jth node, and p is A positive integer.
The apparatus of claim 12, wherein the nodes in the same network are terminals or gateways.