CN111510321B - Network fault processing method, device, computer equipment and storage medium - Google Patents
Network fault processing method, device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN111510321B CN111510321B CN202010189558.4A CN202010189558A CN111510321B CN 111510321 B CN111510321 B CN 111510321B CN 202010189558 A CN202010189558 A CN 202010189558A CN 111510321 B CN111510321 B CN 111510321B
- Authority
- CN
- China
- Prior art keywords
- node
- hop distance
- distance value
- communication transmission
- transmission mode
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0631—Management of faults, events, alarms or notifications using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis
- H04L41/065—Management of faults, events, alarms or notifications using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis involving logical or physical relationship, e.g. grouping and hierarchies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- 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
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application relates to a network fault processing method, a network fault processing device, computer equipment and a storage medium. The method comprises the following steps: acquiring a first hop distance value corresponding to each of at least two communication transmission modes, wherein the first hop distance value is a hop distance value corresponding to a path for data transmission with a root node; when the first adjacent node is detected to be a fault node with a fault, eliminating a hop distance value related to the fault node from the first hop distance value to obtain a second hop distance value; determining a target transmission path from the transmission paths corresponding to the second hop distance values; and carrying out network data transmission according to the target transmission path. By adopting the method, the fault recovery can be realized more quickly.
Description
Technical Field
The present invention relates to the field of communications networks, and in particular, to a network fault handling method, apparatus, computer device, and storage medium.
Background
With the high-speed development of the Internet of things, a network with low construction cost and high performance becomes a scientific research direction. The random topology-based network with the server as the center meets the requirement of reducing the network construction cost and the requirement of equipment irregular update on flexibility, and is a preferred scheme for constructing the Internet of things. However, in such a large composite system, network failure is catastrophic. In particular, in recent years, the number of devices connected to a network has increased at a high rate, and it is expected that in the near future, daily necessities will be equipped with microcontrollers and can transmit information via a wireless network. In general, in order to ensure connectivity and scale, a large number of internet of things gateways need to be put into use, and the number of system failures is inevitably increased due to a large amount of data generated by the gateways. As the internet of things equipment permeates into daily life, if a fault coping mechanism is not considered in advance, great loss is caused.
Currently, most conventional internet of things systems have a restart mechanism to cope with the failure. When a fault occurs, the system can be restarted from the root node, and automatically recover from an abnormal working state. But such an approach results in long network failure recovery times.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a network failure processing method, apparatus, computer device, and storage medium that enable faster failure recovery.
A method of network failure handling, the method comprising:
acquiring a first hop distance value corresponding to each of at least two communication transmission modes, wherein the first hop distance value is a hop distance value corresponding to a path for data transmission with a root node;
when the first adjacent node is detected to be a fault node with a fault, eliminating a hop distance value related to the fault node from the first hop distance value to obtain a second hop distance value;
determining a target transmission path from the transmission paths corresponding to the second hop distance values;
and carrying out network data transmission according to the target transmission path.
A network failure handling apparatus, the apparatus comprising:
The acquisition module is used for acquiring a first hop distance value corresponding to each communication transmission mode in at least two communication transmission modes, wherein the first hop distance value is a hop distance value corresponding to a path for data transmission with a root node;
the detection module is used for eliminating the hop distance value related to the fault node from the first hop distance value when the first adjacent node is detected to be the fault node with the fault, so as to obtain a second hop distance value;
a determining module, configured to determine a target transmission path from the transmission paths corresponding to the second hop distance values;
and the data transmission module is used for carrying out network data transmission according to the target transmission path.
A computer device comprising a memory storing a computer program and a processor which when executing the computer program performs the steps of:
acquiring a first hop distance value corresponding to each of at least two communication transmission modes, wherein the first hop distance value is a hop distance value corresponding to a path for data transmission with a root node;
when the first adjacent node is detected to be a fault node with a fault, eliminating a hop distance value related to the fault node from the first hop distance value to obtain a second hop distance value;
Determining a target transmission path from the transmission paths corresponding to the second hop distance values;
and carrying out network data transmission according to the target transmission path.
A computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:
acquiring a first hop distance value corresponding to each of at least two communication transmission modes, wherein the first hop distance value is a hop distance value corresponding to a path for data transmission with a root node;
when the first adjacent node is detected to be a fault node with a fault, eliminating a hop distance value related to the fault node from the first hop distance value to obtain a second hop distance value;
determining a target transmission path from the transmission paths corresponding to the second hop distance values;
and carrying out network data transmission according to the target transmission path.
According to the network fault processing method, the network fault processing device, the computer equipment and the storage medium, the hop distance value corresponding to the data transmission between the first communication transmission mode and the fault node is eliminated from the first hop distance value corresponding to each communication transmission mode, and the second hop distance value for the data transmission between the second communication transmission mode and the root node is obtained, so that the target transmission path is determined to carry out communication, namely the network node supports multiple communication transmission modes, the limitation of the traditional single communication transmission technology is broken through, when a fault is detected, the data transmission can be carried out by selecting other communication transmission modes, the data transmission time is saved, and the fault recovery can be carried out more quickly.
Drawings
FIG. 1 is an application environment diagram of a network failure handling method in one embodiment;
FIG. 2 is an application environment diagram of a network failure handling method in another embodiment;
FIG. 3 is a flow diagram of a network failure handling method in one embodiment;
FIG. 4 is a schematic diagram of an application environment in the event of a failure in one embodiment;
FIG. 5 is a graph of the number of supported communication transports as a function of probability in one embodiment;
FIG. 6 is a graph of total data and average network throughput as a function of one embodiment;
FIG. 7 is a graph of total data and average packet delay as a function of time in one embodiment;
FIG. 8 is a block diagram of a network failure handling device in one embodiment;
fig. 9 is an internal structural diagram of a computer device in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
The network fault processing method provided by the application can be applied to an application environment shown in fig. 1. Including a root node 102, a neighboring node 104, and a current node 106. The root node 102, neighboring node 104, and current node 106 are all internet of things devices. The root node 102 and the neighboring node 104 may be servers, or may be a routing device, an internet of things gateway, or the like, which is not limited thereto. The current node 106 may be a server, a routing device, an internet of things gateway or terminal, etc. The root node 102 and the neighboring node 104 support at least one communication transport. The current node supports at least two communication transmission modes. The neighboring node 104 may also be the current node, and then both the root node 102 and the current node 106 are neighboring nodes to the neighboring node 104. Both the neighboring node and the current node are relative concepts. The terminal may be, but not limited to, various personal computers, notebook computers, smartphones, tablet computers and portable wearable devices, and the server may be implemented by a separate server or a server cluster formed by a plurality of servers.
In one embodiment, as shown in fig. 2, an application environment diagram of a network failure processing method in another embodiment is shown. Fig. 2 is an internet of things system. Included in fig. 2 are root nodes, node 1, node 2, node 3, node 4, node 5, and other nodes. Taking the current node as the node 4 as an example, the neighboring nodes are the node 1, the node 5 and other nodes. Taking the current node as the node 2 as an example, the adjacent nodes of the node 2 are the root node and the node 5. And (2) calculating information of the hop distance, wherein n is the node identification of the current node, h is the hop distance value, and t is the communication transmission mode identification. For example, <0, t1> is the hop distance value between node 0 and the root node via the communication transmission scheme t1 is 0. <1, t1> is the hop distance value between node 1 and the root node through the communication transmission mode t1 is 1.
In one embodiment, as shown in fig. 3, a network fault handling method is provided, and the method is applied to the current node 106 in fig. 1 for illustration, and includes the following steps:
The communication transmission mode refers to a mode of transmitting through different communication protocols. The types of communication transmission modes may be at least two. For example, the communication transmission method may be at least one of a WIFI (Wireless Fidelity ) transmission method, a bluetooth transmission method, and a ZigBee (ZigBee) transmission method, but is not limited thereto. The hop short distance value refers to a distance value between hops between two nodes. Can be regarded as the length of the transmission path. The first hop distance value is a first hop distance value between the current node and the root node calculated by adopting a certain communication transmission mode. For example, the first hop distance value obtained by WIFI is a1, a2 … an; the first hop distance values b1 and b2 … bm obtained by the bluetooth method are not limited thereto. The first hop distance value may refer to a minimum hop distance value corresponding to each transmission mode between the current node and the root node.
In particular, the data transmission may be a data transmission performed without a direct connection. For example, in fig. 2, node 3 may be in data communication with the root node. The first hop distance value between each communication transmission mode and the root node can be obtained through calculation after the network topology is constructed.
In the internet of things system, each internet of things device has only one data input interface in the same communication transmission mode, and a plurality of data output interfaces in one communication transmission mode can be provided. For example, only one bluetooth input interface, or only one wifi input interface. For example, a mobile phone can be connected with only one wifi device at the same time, but cannot be connected with the device 1 and the device 2 at the same time, that is, only one data interface of the same communication input mode of the mobile phone can be provided. However, if the mobile phone supports two communication transmission modes, such as bluetooth and wifi, the mobile phone may actually connect to the device 1 through bluetooth and connect to the device 2 through wifi. However, if the mobile phone is used as a routing device and a hotspot is opened, a plurality of other internet of things devices can be connected to the mobile phone, that is, the same communication transmission mode of the mobile phone can have a plurality of data output interfaces. Therefore, when the current node supports at least two communication transmission modes, a first hop distance value between the current node and the root node corresponding to each communication transmission mode can be obtained.
In this embodiment, the root node sends the short-hop calculation information to all neighboring nodes. The hop distance calculation information contains < n, h, t >, representing the hop distance value h of the root node 0 when the node n uses the technique t. The node sends the computed information (or no path but broadcast information) to all possible path floods, and the information is not forwarded by the received nodes. If a node receives information, the corresponding field is checked to find out the word < root,0, t > and the root refers to the node identification of the root node, the representative node can directly receive the information from the root node, and the representative node knows that the representative node is the node of an adjacent root. The routing strategy is similar to the distance vector strategy in that each node knows about neighboring nodes, and greedy finds the shortest path to the root node.
And step 304, when the first adjacent node is detected to be the fault node with the fault, eliminating the hop distance value related to the fault node from the first hop distance value to obtain a second hop distance value.
The adjacent node refers to a node which is directly in communication connection with the current node. The elimination means that the hop distance value associated with the failed node is set to an infinite value, or the hop distance value associated with the failed node is deleted, or the hop distance value associated with the failed node is set to be unusable, or the like, without being limited thereto. The "exclude" operation is used to disable the current node from transmitting information to the failed node.
Specifically, when the current node detects that the adjacent node is a fault node with a fault, the hop distance value related to the fault node is removed from the first hop distance value, and a second hop distance value is obtained. For example, node 3 is adjacent to node 2, and node 2 is connected to the root node, then when node 2 fails, node 3 may also communicate with the root node by connecting to other nodes via the same communication transmission scheme as that used for node 2.
In this embodiment, as shown in fig. 4, an application environment diagram when a fault occurs in one embodiment is shown. When node 3 detects that the neighboring node is a failed node, it needs to disconnect from the failed node and re-seek a path to connect with the root node. Then node 3 cannot be connected to the failed node by the t1 communication transmission mode, and the t3 communication transmission mode needs to be changed to be connected to node 1 so as to communicate with the root node. Similarly, the available node 4 needs to be connected with the node 2 by using the t1 communication transmission mode. Taking the current node as node 3 as an example, the adjacent node of node 3 is the fault node, then node 3 needs to exclude the hop distance values associated with the fault node, and the remaining hop distance values are available hop distance values.
Specifically, the current node may determine a minimum hop distance value from the second hop distance values, and use a transmission path corresponding to the minimum hop distance value as the target transmission path. And the minimum hop distance value is the shortest path value between the current node and the root node after avoiding the fault node. The data transmission time can be further reduced by adopting the minimum hop distance value. Alternatively, the current node may determine an arbitrary hop distance value from the second hop distance values, and use the hop distance value as the target transmission path. Then the current node determines a minimum hop distance value from the second hop distance values. When there is only one second hop distance value, the transmission path corresponding to the second hop distance value is the target transmission path.
Specifically, as shown in fig. 4, the transmission path between the node 4 and the root node is node 4→node 2→the root node. And the current node performs data transmission of the Internet of things according to the target transmission path.
According to the network fault processing method, different communication transmission modes have different communication distances, working frequencies, transmission nodes and the like, so that different first hop distance values can be obtained through the different communication transmission modes, the first hop distance value corresponding to each communication transmission mode is obtained, when the adjacent node is detected to be a faulty node, the hop distance value related to the faulty node is removed from the second hop distance value to obtain the second hop distance value, a target transmission path is determined according to the second hop distance value to realize network data transmission, a path can be independently selected when a certain node fails, a system does not need to be restarted, all routing information does not need to be updated, the fault recovery can be carried out more quickly, the normal operation of the system can be maintained, the throughput of the system is ensured, and the delay of data packets is reduced.
In one embodiment, when the neighboring node is detected as a failed node, excluding the hop distance value associated with the failed node to obtain a second hop distance value, including: when detecting that the adjacent node is a fault node with a fault, determining a first communication transmission mode for carrying out data transmission with the fault node;
and eliminating the hop distance value corresponding to the data transmission between the first communication transmission mode and the fault node from the first hop distance value to obtain a second hop distance value for the data transmission between the second communication transmission mode and the root node, wherein the second communication transmission mode is different from the first communication transmission mode.
The number of the second communication transmission methods is not limited, and may be 1, 2, 3, or the like.
Specifically, the current node supports at least two communication transmission modes, and can be in communication connection with the root node through the at least two communication transmission modes. An internet of things device has only one data input interface through a communication transmission mode. For example, node 3 can only connect to node 2 via bluetooth, but cannot connect to node 4 via bluetooth at the same time. When the current node detects that the adjacent node is a fault node with faults, a first communication transmission mode for carrying out data transmission with the fault node is determined. And removing the hop distance value corresponding to the data transmission with the fault node through the first transmission mode from the first hop distance value, so as to obtain a second hop distance value for the data transmission with the root node through the second transmission mode.
According to the network fault processing method, the hop distance value corresponding to the data transmission between the first communication transmission mode and the fault node is removed from the first hop distance value, and the second hop distance value for the data transmission between the second communication transmission mode and the root node is obtained, wherein the second communication transmission mode is different from the first communication transmission mode, namely, the network node supports multiple communication transmission modes, the limitation of the traditional single communication transmission technology is broken through, when a fault is detected, the data transmission can be carried out by selecting other communication transmission modes, the data transmission time is saved, and meanwhile, the effectiveness of a network system is improved, such as the throughput of an Internet of things system is improved, and the delay of a data packet is reduced.
In one embodiment, the network failure processing method further includes: when the number of communication transmission modes is one, restarting the Internet of things from the root node.
Specifically, when the number of communication transmission modes is only one, that is, the current node can only be connected with the adjacent node, so that data transmission with the root node is realized. When the adjacent node fails, the current node cannot be connected with the adjacent node through the communication transmission mode, and data transmission with the root node cannot be performed. Therefore, network transmissions can only be resumed by restarting from the root node.
In one embodiment, obtaining a first hop distance value corresponding to each of at least two communication transmission modes includes: obtaining hop distance calculation information corresponding to each communication transmission mode; transmitting corresponding hop distance calculation information to adjacent nodes corresponding to the communication transmission mode to obtain reference hop distance values corresponding to the adjacent nodes for data transmission; acquiring a target hop distance value corresponding to data transmission between the adjacent node and the root node; and obtaining a first hop distance value corresponding to each communication transmission mode according to the reference hop distance value and the target hop distance value.
Specifically, the current node supports at least two communication transmission modes, and obtains hop distance calculation information corresponding to each communication transmission mode. The current node sends corresponding hop distance calculation information to the adjacent node corresponding to the communication transmission mode, and a corresponding reference hop distance value is obtained when the current node performs data transmission with the adjacent node. For example, a vector storing routing information, i.e., hop distance calculation information < n, h, t > is used to update the state with neighboring nodes and is packed into a stack. A node is fetched from the stack top, the change vector < n, h, t >, n represents the node identification of the current node, t represents the communication transmission mode identification, and the information is sent to all adjacent nodes of the current node, namely, until the stack is empty. The current node acquires a target hop distance value corresponding to the data transmission between the adjacent node and the root node. And the current node obtains a first hop distance value corresponding to each communication transmission mode according to the sum of the reference hop distance value and the target hop distance value.
In this embodiment, a first minimum hop distance value corresponding to each communication transmission mode is determined from first hop distance values corresponding to each communication transmission mode.
According to the network fault processing method, the hop distance calculation information corresponding to each communication transmission mode is obtained, the reference hop distance value corresponding to the data transmission of the adjacent node is obtained, and after the target hop distance value is obtained, the first hop distance value corresponding to each communication transmission mode can be obtained through calculation, and then multiple communication transmission paths can be obtained for selection, so that the effectiveness of the Internet of things system is improved.
In one embodiment, the computational addressing method of the adjacent node is as follows: let a matrix M be the distance matrix. When the current node X receives a packet to be sent to the destination address D, it calculates the distances between all available neighboring nodes Y1, Y2 … Yi and the destination address D and sends the packet to the neighboring node Y nearest to the destination address M 。
Wherein Y is M Refers to the node identification of the nearest neighbor node to the target address, Y i Refers to the node identification of the available neighboring node corresponding to the current node. Y is Y i ∈C x Refers to that the node Yi belongs to the same Internet of things system C x Is included in the node (a). Note that the next node should be less distant from the target address than the current node X.
M(X,D)>M(Y M ,D)
If X is already the closest one to the target address among all available neighbors, we call the current node X the local closest point to a target address D.
In one embodiment, the determining manner of the adjacent node includes: acquiring a connection relation between each communication transmission mode in at least two communication transmission modes and each node in the Internet of things; constructing an adjacency matrix according to the connection relation, wherein the adjacency matrix is used for representing whether data transmission can be carried out with the node through each communication transmission mode; and taking the node corresponding to the preset value in the adjacent matrix as the adjacent node.
Wherein the adjacency matrix is used to indicate whether the two nodes share an ac topology and whether one is within the propagation range of the other.
Specifically, the current node may acquire an interface connection relationship with each node in the internet of things through each of at least two communication transmission modes. The current node constructs an adjacency matrix adj_g (t, k) according to the connection relation. Wherein t represents a communication transmission mode, and k represents a node identification value. For example, the communication transmission mode may include t1, t2, and t3 …, which are not limited thereto, and the nodes in the internet of things include k1 and k2 …, which are not limited thereto. The values in the adjacency matrix may have 0 and 1,0 indicating unconnected and 1 indicating connected. That is, if entry < t1, k1> =1, i.e., a certain value in the adjacency matrix is 1, this indicates that the current node can transmit data to node k1 through technology t1, and that node k1 is within the coverage of the current node under the t1 technology. The page indicates that two nodes can directly communicate under the same technology and support the same technology. That is, the current node can only transmit data to a node < t, k > =1, which is a neighboring node of the current node.
According to the network fault processing method, the connection relation between the network fault processing method and each node in the Internet of things is obtained through each of at least two communication transmission modes; constructing an adjacency matrix according to the connection relation, wherein the adjacency matrix is used for representing whether data transmission can be carried out with the node through each communication transmission mode; and taking the node corresponding to the preset value in the adjacent matrix as the adjacent node, and determining the adjacent node through the adjacent matrix, so as to determine the hop distance value between the adjacent node and the hop distance value, and determine the transmission path.
In one embodiment, the network failure processing method further includes: when the fault node is repaired or a preset time period is passed, obtaining hop distance calculation information corresponding to a communication transmission mode; and constructing route information according to the hop distance calculation information.
The preset time period may be, for example, 1 minute, 2 minutes, 5 minutes, or 10 minutes, and the like, but is not limited thereto. The hop distance calculation information refers to information for calculating a hop distance value between nodes. The hop distance calculation information may be < n, h, t >. Wherein n is a node identifier corresponding to a node sending the information, namely the adjacent node in the above description, h is a hop distance value, and t is a communication transmission mode. The routing information is used for representing node identification, communication transmission mode and hop distance value information.
Specifically, after the repair of the fault node is completed, or when a preset time period elapses, the root node sends the hop distance calculation information corresponding to the communication transmission mode to the adjacent node, and the adjacent node sends the hop distance calculation information corresponding to the communication transmission mode to the adjacent node. The current node can acquire the hop distance calculation information corresponding to the communication transmission mode sent by the adjacent node. And the current node constructs routing information according to the hop distance calculation information.
According to the network fault processing method, when the repair of the fault node is completed or the preset time length is passed, the hop distance calculation information corresponding to the communication transmission mode is obtained, the route information is constructed according to the hop distance calculation information, the route information can be reconstructed after the fault is recovered, and the network topology is not updated when the fault is generated, so that the response time of the fault is reduced.
In one embodiment, the network failure handling method further comprises: and when the added second adjacent node is detected, transmitting the hop distance calculation information to the second adjacent node so that the second adjacent node constructs a routing table according to the hop distance calculation information.
The second adjacent node may be a node that has previously joined the internet of things, but has subsequently been joined again after being offline, or may be a node that has never previously joined the internet of things, etc. without being limited thereto.
Specifically, when the current node detects the added second adjacent node, the hop distance calculation information is sent to the second adjacent node, so that the second adjacent node constructs routing information according to the hop distance calculation information. For example, a new node accesses, and a neighboring node, i.e., the current node, will send calculation information containing < n, h, t > to the new node. And the newly added node constructs a routing table according to the received hop distance calculation information.
According to the network fault processing method, when the added second adjacent node is detected, the hop distance calculation information is sent to the second adjacent node, so that the second adjacent node constructs the routing information according to the hop distance calculation information, and therefore when a new node is added into the Internet of things, the routing information only needs to be updated in the new node, and restarting from the root node is not needed, and delay and throughput reduction can be avoided.
In one embodiment, when a node receives a data packet, the hop distances are compared among the identities of all the same communication transmission modes. Two nodes D are arranged<d 1 ,d 2 ,……d L >And Y<y 1 ,y 2 ,……y L >The jump distance between two points is CD. For k is less than or equal to L, there are:
if the newly received hop distance is smaller, the node information will be updated.
In one embodiment, based on the actual user environment, an ieee802.11b protocol communication connection protocol is adopted, a MATLAB is utilized to simulate a fault recovery process of a multi-technology network system, another simulation is made based on a traditional communication topology using one technology, a time scale is expanded to be hours, a program is executed, and the influence of the number T of communication transmission modes on network availability is observed. The system is provided with n gateways, each gateway being capable of generating data d every t seconds. In the whole system, the number of supportable communication transmission modes is T. We assume that the life expectancy of each gateway can meet an exponential distribution of h, extending the time scale to hours, observing the performance of the system when the variables are changed.
The number of gateways n is changed and the index is observed. Let T remain unchanged, at the same time let the probability p=0.5, the data volume d=12, the number of communication transmission modes t=5, the time h=100, the packet delay and the network average throughput at this time are observed after 1000-2000 hours of operation. As the number of communication transmission modes T increases, the communication of multiple technologies may make the network work more efficient. And as T increases, efficiency tends towards an upper limit for each communication technology. When t=5, the network throughput curve is very close to the curve in the case of no failure after 1000-2000 hours of operation. Since the average time to recover from a failure is typically much shorter than the time to failure, we assume that each failure will be recovered within 10 hours, which can also be explained by the application of 5 techniques to the overall network system, this diversity can give the gateway a sufficient alternative path at the time of failure. Some gateways fail and the performance of the overall system is not greatly affected.
In one embodiment, as shown in fig. 5, a graph of the number of communication transports supported in one embodiment as a function of probability is provided. As can be seen from the figure, the more communication transmission modes are, the greater the probability of successful transmission is. Assuming that a local area network has a dimension L, each node is connected with 2L nodes, and each node uses coordinates <x1,x2,……xL>And (3) representing. Is provided with a node X<x1,x2,……xL>And Y<y1,y2,……yL>Let the path between two nodes be x, assuming that none of the other nodes are in [0, x]Within the range, then the probability that X and Y are the nearest neighbors is (1-X) n-2 Otherwise, assuming that the next node of the X-to-Y path is Z and the paths of X and Z are Z, the probability distribution function with respect to Z is (1- (X-Z)) n-2 ,(0<z<x)。
Thus, the path values of X and other 2L-2 neighboring nodes satisfy the probability distribution function p=2z. The path values of the X and the next hop node can be obtained
Where a represents the aper series equation, since the aper term is always negative, it is available:
in one embodiment, as shown in FIG. 6, a graph of the total amount of data and average network throughput in one embodiment is shown. As can be seen from the figure, the larger the number of communication transmission modes is, the larger the average network throughput is.
In one embodiment, shown in FIG. 7, a graph of total data and average packet delay as a function of one embodiment is provided. As can be seen from the figure, the larger the number of communication transmission modes is, the smaller the average packet delay is. As T and d increase, the average packet delay tends to decrease. Simulation results show that the average data packet delay curve and the ideal fault-free curve have little difference. The same assumption is made about the time to fail, and when one node of the system fails, the packet delay must be increased because at least one optimal path is affected, which is unavoidable. In conventional single technology systems, one system would destroy the entire communication function, and in contrast, the delay is very small, which is basically negligible in practical applications. The number of T-based gateways is exponentially distributed, resulting in a delay that will increase at a relatively slow log rate. The increase in network throughput can be achieved without incurring too great a cost. As the range expands, the requirements of the device for the communication technology increase, in which case the present invention has great advantages over conventional single technology communication systems. Note that the increasing number of gateways also maximizes the bandwidth used for each technology. The delay rise is large because the number of gateways increases to increase the number of failures. In a typical communication path, when one gateway fails, all the resulting propagation delays will be amplified, but if the gateway is scattered in the various layers based on T, the amplification benefit will be minimized.
In one embodiment, a network failure handling method includes:
step a1, obtaining the connection relation between each communication transmission mode in at least two communication transmission modes and each node in the Internet of things.
And a step a2, constructing an adjacency matrix according to the connection relation, wherein the adjacency matrix is used for representing whether data transmission can be carried out with nodes in the Internet of things or not through each communication transmission mode.
And a step a3, using the node corresponding to the preset value in the adjacent matrix as the adjacent node.
And a4, acquiring hop distance calculation information corresponding to each communication transmission mode in at least two communication transmission modes.
And a5, transmitting corresponding hop distance calculation information to the adjacent nodes corresponding to each communication transmission mode, and obtaining a reference hop distance value corresponding to the adjacent nodes for data transmission.
And a step a6, obtaining a target hop distance value corresponding to the data transmission between the adjacent node and the root node.
And a step a7, obtaining a first hop distance value corresponding to each communication transmission mode according to the reference hop distance value and the target hop distance value, wherein the first hop distance value is the hop distance value corresponding to the path for carrying out data transmission with the root node.
And a step a8, when the first adjacent node is detected to be the failed node, determining a first communication transmission mode for carrying out data transmission with the failed node.
And a9, removing the hop distance value corresponding to the data transmission with the fault node through the first communication transmission mode from the first hop distance value to obtain a second hop distance value for the data transmission with the root node through the second communication transmission mode, wherein the second communication transmission mode is different from the first communication transmission mode.
And a step a10, determining a target transmission path from the transmission paths corresponding to the second hop distance values.
And a step a11, performing network data transmission according to the target transmission path.
And a step a12, when the repair of the fault node is completed or when the preset time length is passed, obtaining the hop distance calculation information corresponding to the communication transmission mode.
And a step a13, constructing routing information according to the hop distance calculation information.
And a step a14, when the added second adjacent node is detected, transmitting hop distance calculation information to the second adjacent node so that the second adjacent node constructs routing information according to the hop distance calculation information.
And a step a15, restarting the Internet of things from the root node when the number of communication transmission modes is one.
According to the network fault processing method, different communication transmission modes comprise different communication distances, working frequencies, transmission nodes and the like, so that different first hop distance values can be obtained through different communication transmission modes, the first hop distance value corresponding to each communication transmission mode is obtained, when the adjacent node is detected to be a faulty node, the hop distance value related to the faulty node is removed from the second hop distance value to obtain the second hop distance value, a target transmission path is determined according to the second hop distance value to realize network data transmission, a path can be independently selected when a certain node fails, a system does not need to be restarted, all routing information does not need to be updated, normal operation of the system can be kept, throughput of the system is guaranteed, and delay of a data packet is reduced.
It should be understood that, although the steps in the diagrams of fig. 2 to 4 are sequentially shown as indicated by arrows, the steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 2 to 4 may include a plurality of steps or stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the execution of the steps or stages is not necessarily sequential, but may be performed in turn or alternately with at least some of the other steps or stages.
In one embodiment, as shown in fig. 8, a block diagram of a network failure handling device in one embodiment is shown. A network failure handling apparatus, comprising: an acquisition module 802, a detection module 804, a determination module 806, and a data transmission module 808, wherein:
an obtaining module 802, configured to obtain a first hop distance value corresponding to each of at least two communication transmission modes, where the first hop distance value is a hop distance value corresponding to a path of data transmission with a root node;
the detection module 804 is configured to, when detecting that the first neighboring node is a failed node, exclude a hop distance value related to the failed node from the first hop distance value, and obtain a second hop distance value;
a determining module 806, configured to determine a target transmission path from the transmission paths corresponding to the second hop distance values;
and the data transmission module 808 is configured to perform network data transmission according to the target transmission path.
According to the network fault processing device, different communication transmission modes comprise different communication distances, working frequencies, transmission nodes and the like, so that different first hop distance values can be obtained through the different communication transmission modes, the first hop distance value corresponding to each communication transmission mode is obtained, when the adjacent node is detected to be a faulty node, the hop distance value related to the faulty node is removed from the second hop distance value to obtain the second hop distance value, a target transmission path is determined according to the second hop distance value to realize network data transmission, a path can be independently selected when a certain node fails, a system does not need to be restarted, all routing information does not need to be updated, normal operation of the system can be kept, fault recovery can be performed more quickly, throughput of the system is guaranteed, and delay of data packets is reduced.
In one embodiment, the detecting module 804 is configured to determine, when detecting that the neighboring node is a failed node, a first communication transmission manner for performing data transmission with the failed node; and eliminating the hop distance value corresponding to the data transmission between the first communication transmission mode and the fault node from the first hop distance value to obtain a second hop distance value for the data transmission between the second communication transmission mode and the root node, wherein the second communication transmission mode is different from the first communication transmission mode.
According to the network fault processing device, the hop distance value corresponding to the data transmission between the first communication transmission mode and the fault node is removed from the first hop distance value, and the second hop distance value for the data transmission between the second communication transmission mode and the root node is obtained, wherein the second communication transmission mode is different from the first communication transmission mode, namely, the network node supports multiple communication transmission modes, the limitation of the traditional single communication transmission technology is broken through, when a fault is detected, the data transmission can be carried out by selecting other communication transmission modes, the data transmission time is saved, and meanwhile, the effectiveness of a network system is improved, such as the throughput of an Internet of things system is improved, and the delay of a data packet is reduced.
In one embodiment, the network failure handling apparatus further comprises a restart module. And the restarting module is used for restarting the Internet of things from the root node when the number of the communication transmission modes is one. When the number of the communication transmission modes is only one, namely the current node can only be connected with the adjacent node, the data transmission with the root node is realized. When the adjacent node fails, the current node cannot be connected with the adjacent node through the communication transmission mode, and data transmission with the root node cannot be performed. Therefore, network transmissions can only be resumed by restarting from the root node.
In one embodiment, the obtaining module 802 is configured to obtain hop distance calculation information corresponding to each communication transmission mode; transmitting corresponding hop distance calculation information to adjacent nodes corresponding to the communication transmission mode to obtain reference hop distance values corresponding to the adjacent nodes for data transmission; acquiring a target hop distance value corresponding to data transmission between the adjacent node and the root node; and obtaining a first hop distance value corresponding to each communication transmission mode according to the reference hop distance value and the target hop distance value.
According to the network fault processing device, the hop distance calculation information corresponding to each communication transmission mode is obtained, the reference hop distance value corresponding to the data transmission of the adjacent node is obtained, and after the target hop distance value is obtained, the first hop distance value corresponding to each communication transmission mode can be obtained through calculation, and then multiple communication transmission paths can be obtained for selection, so that the effectiveness of the Internet of things system is improved.
In one embodiment, the obtaining module 802 is configured to obtain a connection relationship between each of the at least two communication transmission modes and each node in the internet of things; constructing an adjacency matrix according to the connection relation, wherein the adjacency matrix is used for representing whether data transmission can be carried out with the node through each communication transmission mode; and taking the node corresponding to the preset value in the adjacent matrix as the adjacent node.
The network fault processing device is connected with each node in the Internet of things by acquiring the connection relation between each communication transmission mode in at least two communication transmission modes; constructing an adjacency matrix according to the connection relation, wherein the adjacency matrix is used for representing whether data transmission can be carried out with the node through each communication transmission mode; and taking the node corresponding to the preset value in the adjacent matrix as the adjacent node, and determining the adjacent node through the adjacent matrix, so as to determine the hop distance value between the adjacent node and the hop distance value, and determine the transmission path.
In one embodiment, the obtaining module 802 is further configured to obtain hop distance calculation information corresponding to the communication transmission mode when the repair of the failed node is completed or when a preset duration has elapsed; and constructing route information according to the hop distance calculation information.
According to the network fault processing device, when the repair of the fault node is completed or the preset time length is passed, the hop distance calculation information corresponding to the communication transmission mode is obtained, the route information is constructed according to the hop distance calculation information, the route information can be reconstructed after the fault is recovered, and the network topology is not updated when the fault is generated, so that the response time of the fault is reduced.
In one embodiment, the network failure handling apparatus further comprises a sending module. And the sending module is used for sending the hop distance calculation information to the second adjacent node when the added second adjacent node is detected, so that the second adjacent node constructs a routing table according to the hop distance calculation information.
According to the network fault processing device, when the added second adjacent node is detected, the hop distance calculation information is sent to the second adjacent node, so that the second adjacent node constructs the routing information according to the hop distance calculation information, therefore, when a new node is added into the Internet of things, the routing information only needs to be updated in the new node, and the restart from the root node is not needed, and delay and throughput reduction can be avoided.
For specific limitations of the network fault handling apparatus, reference may be made to the above limitation of the network fault handling method, and no further description is given here. The respective modules in the above-described network failure processing apparatus may be implemented in whole or in part by software, hardware, or a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, a computer device is provided, which may be a terminal, and the internal structure thereof may be as shown in fig. 9. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The communication interface of the computer device is used for carrying out wired or wireless communication with an external terminal, and the wireless mode can be realized through WIFI, an operator network, NFC (near field communication) or other technologies. The computer program is executed by a processor to implement a network failure handling method. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be keys, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by those skilled in the art that the structure shown in fig. 9 is merely a block diagram of a portion of the structure associated with the present application and is not limiting of the computer device to which the present application applies, and that a particular computer device may include more or fewer components than shown, or may combine some of the components, or have a different arrangement of components.
In one embodiment, a computer device is provided, comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps of the method in each of the embodiments described above when the computer program is executed.
In one embodiment, a computer readable storage medium is provided, on which a computer program is stored which, when executed by a processor, implements the steps of the method in the various embodiments described above.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, or the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples merely represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the invention. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application is to be determined by the claims appended hereto.
Claims (10)
1. A method of network failure handling, the method comprising:
acquiring hop distance calculation information corresponding to each communication transmission mode in at least two communication transmission modes; transmitting the corresponding hop distance calculation information to adjacent nodes corresponding to each communication transmission mode to obtain a reference hop distance value corresponding to the adjacent nodes for data transmission; acquiring a target hop distance value corresponding to data transmission between the adjacent node and the root node; obtaining a first hop distance value corresponding to each communication transmission mode according to the reference hop distance value and the target hop distance value; the first hop distance value is a hop distance value corresponding to a path for data transmission with the root node; the current node supports at least two communication transmission modes;
When detecting that a first adjacent node is a fault node with a fault, determining a first communication transmission mode for carrying out data transmission with the fault node;
removing a hop distance value corresponding to data transmission between the first communication transmission mode and the fault node from the first hop distance value to obtain a second hop distance value for data transmission between the second communication transmission mode and the root node, wherein the second communication transmission mode is different from the first communication transmission mode;
determining a target transmission path from the transmission paths corresponding to the second hop distance values;
and carrying out network data transmission according to the target transmission path.
2. The method according to claim 1, wherein the communication transmission mode is at least one of WIFI transmission mode, bluetooth transmission mode, and ZigBee transmission mode.
3. The method of claim 1 wherein a first minimum hop distance value for each of said communication transmission modes is determined from said first hop distance values for each of said communication transmission modes.
4. A method according to claim 3, wherein the determining means of the neighboring node comprises:
Acquiring a connection relation between each communication transmission mode in at least two communication transmission modes and each node in the Internet of things;
constructing an adjacency matrix according to the connection relation, wherein the adjacency matrix is used for representing whether data transmission can be carried out with nodes in the Internet of things or not through each communication transmission mode;
and taking the node corresponding to the preset value in the adjacent matrix as the adjacent node.
5. The method according to any one of claims 1 to 4, further comprising:
when the fault node is repaired or a preset time period is passed, obtaining hop distance calculation information corresponding to the communication transmission mode;
and constructing routing information according to the hop distance calculation information.
6. The method according to any one of claims 1 to 4, further comprising:
and when the added second adjacent node is detected, transmitting hop distance calculation information to the second adjacent node so that the second adjacent node constructs routing information according to the hop distance calculation information.
7. The method according to any one of claims 1 to 4, wherein determining the target transmission path from the transmission paths corresponding to the second hop distance values includes:
And determining a minimum hop distance value from the second hop distance value, and taking a transmission path corresponding to the minimum hop distance value as the target transmission path.
8. A network failure handling apparatus, the apparatus comprising:
the acquisition module is used for acquiring hop distance calculation information corresponding to each communication transmission mode in at least two communication transmission modes; transmitting the corresponding hop distance calculation information to adjacent nodes corresponding to each communication transmission mode to obtain a reference hop distance value corresponding to the adjacent nodes for data transmission; acquiring a target hop distance value corresponding to data transmission between the adjacent node and the root node; obtaining a first hop distance value corresponding to each communication transmission mode according to the reference hop distance value and the target hop distance value; the first hop distance value is a hop distance value corresponding to a path for data transmission with the root node; the current node supports at least two communication transmission modes;
the detection module is used for determining a first communication transmission mode for carrying out data transmission with a fault node when detecting that a first adjacent node is the fault node with the fault; removing a hop distance value corresponding to data transmission between the first communication transmission mode and the fault node from the first hop distance value to obtain a second hop distance value for data transmission between the second communication transmission mode and the root node, wherein the second communication transmission mode is different from the first communication transmission mode;
A determining module, configured to determine a target transmission path from the transmission paths corresponding to the second hop distance values;
and the data transmission module is used for carrying out network data transmission according to the target transmission path.
9. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 7 when the computer program is executed.
10. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 7.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910983147X | 2019-10-16 | ||
| CN201910983147 | 2019-10-16 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111510321A CN111510321A (en) | 2020-08-07 |
| CN111510321B true CN111510321B (en) | 2023-05-16 |
Family
ID=71875690
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010189558.4A Active CN111510321B (en) | 2019-10-16 | 2020-03-18 | Network fault processing method, device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111510321B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009053477A1 (en) * | 2007-10-26 | 2009-04-30 | Siemens Aktiengesellschaft | Method, system and network nodes for network reconfiguration in a multi-hop wireless communication network |
| CN105744587A (en) * | 2016-01-27 | 2016-07-06 | 中国铁道科学研究院电子计算技术研究所 | Data transmission method and device for linear wireless sensor network |
| CN109327255A (en) * | 2018-09-26 | 2019-02-12 | 中国民航管理干部学院 | A kind of method for routing and system for unmanned plane ad hoc network |
Family Cites Families (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2002064515A (en) * | 2000-08-23 | 2002-02-28 | Funai Electric Co Ltd | Information transmission system and information transmission method |
| US20030063613A1 (en) * | 2001-09-28 | 2003-04-03 | Carpini Walter Joseph | Label switched communication network and system and method for path restoration |
| CN101442479B (en) * | 2007-11-22 | 2011-03-30 | 华为技术有限公司 | Method, equipment and system for updating route in P2P peer-to-peer after node failure |
| CN102075360A (en) * | 2011-01-19 | 2011-05-25 | 中国人民解放军信息工程大学 | Aggregation equivalence class-based network fault distributed processing method |
| JPWO2015146066A1 (en) * | 2014-03-28 | 2017-04-13 | 日本電気株式会社 | Wireless terminal, metering device, and communication control method |
| CN104375057A (en) * | 2014-11-07 | 2015-02-25 | 国网上海市电力公司 | Automatic underground power line fault positioning and warning system |
| JP2017017543A (en) * | 2015-07-01 | 2017-01-19 | 日本電気株式会社 | Communication device, control method therefor, and program |
| US10341930B2 (en) * | 2015-11-23 | 2019-07-02 | Electronics And Telecommunications Research Institute | Mobile ad-hoc routing apparatus and method |
| CN105451165B (en) * | 2015-12-01 | 2019-12-06 | 中国通信建设集团设计院有限公司 | near field communication method and device based on multiple protocols |
| EP3410776A4 (en) * | 2016-05-11 | 2019-05-22 | Guangdong OPPO Mobile Telecommunications Corp., Ltd. | Communication method, terminal device and network device |
| CN108023748B (en) * | 2016-11-03 | 2023-08-01 | 紫石能源有限公司 | Micro-grid communication control method, device and system |
| CN106657269B (en) * | 2016-11-16 | 2020-05-15 | 西安诺瓦星云科技股份有限公司 | File transmission method |
| CN107529196A (en) * | 2017-08-24 | 2017-12-29 | 深圳市盛路物联通讯技术有限公司 | A kind of method and system of the data transmission of internet of things based on dummy node |
| CN107809782B (en) * | 2017-09-08 | 2021-07-30 | 深圳市盛路物联通讯技术有限公司 | Internet of things data transmission method and storage medium |
| CN108770031B (en) * | 2018-03-21 | 2022-05-17 | 洪贵顺 | Dynamic path planning method, dynamic path planning system, and storage medium |
| CN108521319B (en) * | 2018-04-09 | 2021-11-02 | 王洪 | Buoy redundant communication method based on cloud storage |
| CN109743758B (en) * | 2018-12-28 | 2023-04-07 | 广东中兴新支点技术有限公司 | Multi-link communication method, communication device and communication system |
| CN109922485B (en) * | 2019-02-02 | 2022-06-17 | 四川速宝网络科技有限公司 | Intelligent network bridge acceleration method and system based on dual communication equipment |
| CN109787838B (en) * | 2019-02-25 | 2022-02-18 | 武汉晟联智融微电子科技有限公司 | Method for avoiding fault relay node in multi-hop network |
-
2020
- 2020-03-18 CN CN202010189558.4A patent/CN111510321B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009053477A1 (en) * | 2007-10-26 | 2009-04-30 | Siemens Aktiengesellschaft | Method, system and network nodes for network reconfiguration in a multi-hop wireless communication network |
| CN105744587A (en) * | 2016-01-27 | 2016-07-06 | 中国铁道科学研究院电子计算技术研究所 | Data transmission method and device for linear wireless sensor network |
| CN109327255A (en) * | 2018-09-26 | 2019-02-12 | 中国民航管理干部学院 | A kind of method for routing and system for unmanned plane ad hoc network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111510321A (en) | 2020-08-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3353952B1 (en) | Managing groups of servers | |
| KR102072148B1 (en) | System and method for handling link loss in a network | |
| JP2012174081A (en) | Information processing system | |
| US7715395B2 (en) | System and method for expanding the range of a mesh network | |
| EP1519520B1 (en) | Management node device, node device, network configuration management system, network configuration management method, node device control method, management node device control method | |
| Ranga et al. | A hybrid timer based single node failure recovery approach for WSANs | |
| WO2013052161A1 (en) | Unifying connected dominating set using localized two hop information with a flexible dominating factor | |
| Fan et al. | Reliability-aware controller placements in software defined networks | |
| US9569319B2 (en) | Methods for improved server redundancy in dynamic networks | |
| CN111510321B (en) | Network fault processing method, device, computer equipment and storage medium | |
| Du et al. | Application-oriented fault detection and recovery algorithm for wireless sensor and actor networks | |
| US20120195205A1 (en) | Network Topologies for Energy Efficient Networks | |
| CN109981437B (en) | Multi-data center intercommunication method based on VPC and related equipment | |
| CN116055446B (en) | Cross-network message forwarding method, electronic equipment and machine-readable storage medium | |
| US7830791B2 (en) | Method and system for routing network communications | |
| JP5487420B2 (en) | File duplication necessity determination method, communication apparatus, computer program, and peer-to-peer communication system | |
| CN112671649A (en) | Path selection method and device based on Internet of things transmission fault detection | |
| Akram et al. | Design and analysis of a breadth first search based connectivity robustness estimation approach in wireless sensor networks | |
| JP2002152252A (en) | Path calculation device and path calculation method used therefor, and recording medium with its control program recorded | |
| US10277700B2 (en) | Control plane redundancy system | |
| US10148555B2 (en) | Multi-chassis LAG access node determination system | |
| JP2016171543A (en) | Device, system, method and program for communication | |
| Leão et al. | Latency and lifetime optimization for k-anycast routing algorithm in wireless sensor networks | |
| US11736385B1 (en) | Distributed flooding technique | |
| US11223557B1 (en) | Multicast traffic disruption prevention system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |