CN104125108A - Fault diagnosis device and method thereof and setting method of back-off time - Google Patents

Abstract

The embodiment of the invention provides a fault diagnosis device and a method thereof and a setting method of back-off time. The fault diagnosis device comprises a time start-up unit, a root node determination unit and a diagnosis control unit. The time start-up unit is used for starting back-off time of diagnosis nodes in allusion to a doubt node when the doubt node needs diagnosis. The root node determination unit is used for determining a root node according to countdown of the back-off time. The root node is one of the multiple diagnosis nodes of the doubt node that the back-off time is ended first. The diagnosis control unit is used for controlling the root node to start to establish a diagnostic tree, receiving a diagnostic message sent by a node in the diagnostic tree and reporting the diagnosis result to a gateway. Through the embodiment of the invention, a unified diagnosis result can be obtained at the gateway, and communication overhead of a system can be reduced.

Description

The method to set up of trouble-shooter and method and back off time

Technical field

The present invention relates to Network Fault Diagnosis Technique field, particularly the method to set up of a kind of trouble-shooter and method and back off time.

Background technology

Network, when breaking down, need to start network fault diagnosis process and fix a breakdown, for example, can comprise link failure diagnosis and nodal fault diagnostics.At present, when a suspection node need to be diagnosed, a plurality of diagnosis node of this suspection node may all start diagnostic procedure, set up separately diagnostic tree and report diagnostic result.

But, in realizing process of the present invention, inventor finds that the defect of prior art is: in the situation that suspecting that node need to be diagnosed, owing to cannot guaranteeing to only have a diagnosis node to report diagnostic result, thereby at gateway (GW, Gateway) locate to obtain unified diagnostic result, a plurality of diagnostic procedures of while are activated and a plurality of diagnosis node reports diagnostic message also can bring excessive communication overhead to system.

Summary of the invention

The embodiment of the present invention provides the method to set up of a kind of trouble-shooter and method and back off time, and object is to obtain unified diagnostic result at gateway, reduces the communication overhead of system simultaneously.

According to the embodiment of the present invention aspect, a kind of trouble-shooter is provided, described trouble-shooter comprises:

Time start unit, when suspecting that node need to be diagnosed, starts diagnosis node for the back off time of described suspection node; Wherein, by a plurality of neighbor nodes of described suspection node are divided into different groups, described back off time is set;

Root node determining unit, determines root node according to the countdown to described back off time; Described root node is the diagnosis node that in a plurality of diagnosis node of described suspection node, back off time finishes at first;

Diagnosis control unit, controls described root node startup and sets up diagnostic tree, and receive the diagnostic message that the node in described diagnostic tree sends, and diagnostic result is reported to gateway.

Another aspect according to the embodiment of the present invention, provides a kind of method for diagnosing faults, and described method for diagnosing faults comprises:

When suspecting that node need to be diagnosed, start diagnosis node for the back off time of described suspection node; Wherein, by a plurality of neighbor nodes of described suspection node are divided into different groups, described back off time is set;

According to the countdown to described back off time, determine root node; Described root node is the diagnosis node that in a plurality of diagnosis node of described suspection node, back off time finishes at first;

Control described root node startup and set up diagnostic tree, and receive the diagnostic message that the node in described diagnostic tree sends, and diagnostic result is reported to gateway.

According to another aspect of the embodiment of the present invention, a kind of method to set up of back off time is provided, described method to set up comprises:

A plurality of neighbor nodes of node are divided into different groups;

For neighbor node on the same group not, different back off times is set.

The beneficial effect of the embodiment of the present invention is: when suspecting that node need to be diagnosed, start diagnosis node for the back off time of suspecting node, according to the countdown to back off time, determine root node, and start and set up diagnostic tree by this root node, receive the diagnostic message that the node in diagnostic tree sends, and diagnostic result is reported to gateway.Thus, can obtain unified diagnostic result at gateway, reduce the communication overhead of system simultaneously.

Explanation and accompanying drawing with reference to hereinafter, disclose specific implementations of the present invention in detail, and having indicated principle of the present invention can adopted mode.Should be appreciated that, embodiments of the present invention in scope not thereby be restricted.In the spirit of claims and the scope of clause, embodiments of the present invention comprise many changes, revise and are equal to.

The feature of describing and/or illustrating for a kind of execution mode can be used in same or similar mode in one or more other execution mode, combined with the feature in other execution mode, or substitutes the feature in other execution mode.

Should emphasize, term " comprises/comprises " existence that refers to feature, whole, step or assembly while using herein, but does not get rid of the existence of one or more further feature, whole, step or assembly or additional.

Accompanying drawing explanation

Fig. 1 is a formation schematic diagram of the trouble-shooter of the embodiment of the present invention 1;

Fig. 2 is another formation schematic diagram of the trouble-shooter of the embodiment of the present invention 1;

Fig. 3 is the schematic diagram after the neighbor node to a node of the embodiment of the present invention 1 divides into groups;

Fig. 4 is the t of the embodiment of the present invention 1 ₁, t ₂, t ₃, t ₄with BO ₁, BO ₂be related to schematic diagram;

Fig. 5 is another formation schematic diagram of the trouble-shooter of the embodiment of the present invention 1;

Fig. 6 is another schematic diagram after the neighbor node to a node of the embodiment of the present invention 1 divides into groups;

Fig. 7 is a structural representation of the detection bag of the embodiment of the present invention 1;

Fig. 8 is a schematic flow sheet of the method for diagnosing faults of the embodiment of the present invention 2;

Fig. 9 is another schematic flow sheet of the method for diagnosing faults of the embodiment of the present invention 2;

Figure 10 is the schematic flow sheet of method to set up of the back off time of the embodiment of the present invention 3;

Figure 11 is the exemplary plot of method to set up of the back off time of the embodiment of the present invention 3;

Figure 12 is another exemplary plot of method to set up of the back off time of the embodiment of the present invention 3;

Figure 13 is a schematic diagram of the network node of the embodiment of the present invention 4;

Figure 14 is another schematic diagram of the network node of the embodiment of the present invention 4.

Embodiment

Below in conjunction with accompanying drawing, various execution modes of the present invention are described.These execution modes are exemplary, are not limitations of the present invention.In order to enable those skilled in the art to easily to understand principle of the present invention and execution mode, embodiments of the present invention be take Wireless Ad hoc network or wireless sensor network and are described as example.But it should be noted, the invention is not restricted to this, embodiments of the present invention go for all communication systems that have network failure.

Embodiment 1

The embodiment of the present invention provides a kind of trouble-shooter, and Fig. 1 is a formation schematic diagram of the trouble-shooter of the embodiment of the present invention.As shown in Figure 1, this trouble-shooter 100 comprises: time start unit 101, root node determining unit 102 and diagnosis control unit 103.

Wherein, time start unit 101, when suspecting that node need to be diagnosed, starts diagnosis node and suspects the back off time of node for this; Root node determining unit 102 is according to the countdown of back off time is determined to root node, and root node is the diagnosis node that in a plurality of diagnosis node of this suspection node, back off time finishes at first; Diagnosis control unit 103 is controlled root node startup and is set up diagnostic tree, and receives the diagnostic message that the node in this diagnostic tree sends, and diagnostic result is reported to gateway.

In the present embodiment, trouble-shooter 100 can be a part of diagnosis node, and the one or more diagnosis node in network can have this trouble-shooter 100, and the formation of other parts of diagnosis node can be with reference to prior art.For example, each diagnosis node in network all can have this trouble-shooter 100; And suspect that node can have the formation identical with diagnosis node.Thus, between each node in network, can form distributed structure.

But the invention is not restricted to this, for example trouble-shooter 100 can also be the parts that are independent of diagnosis node, can be the equipment of a plurality of diagnosis node of network central control system, forms thus centralized structure in network.Or a part for trouble-shooter 100 can be positioned in diagnosis node, and another part forms centralized equipment.Those skilled in the art can determine concrete enforcement scene according to actual conditions.In following embodiment, only take this trouble-shooter to be included in one or more diagnosis node as example describes.

In the present embodiment, in diagnostic procedure, can there be two kinds of nodes: diagnosis node (DN, Detection Node) and suspection node (SN, Suspect Node).For example, when node A cannot communicate by letter with Node B, node A can suspect that B breaks down, and A can start one for the diagnostic procedure of B; A is called diagnosis node DN, and B is called suspection node SN.Diagnosis node is to suspect one or more neighbor nodes of node, that is to say, the set of diagnosis node can be a subset suspecting the neighbor node set of node.

When suspecting that Node B need to be diagnosed, may there are a plurality of diagnosis node (for example, except node A, also having node C, D).In the specific implementation, diagnosis node A, C, D can start back off time by time start unit 101 separately and start countdown; For example, root node determining unit 102 in the diagnosis node that then countdown finishes at first (node A) can determine that this node A is root node (RN, Root Node), and for example, root node determining unit 102 in other diagnosis node (node C, D) can to determine node C, D be not root node (can stop the countdown of back off time, specifically can with reference to aftermentioned content).

Thus, can carry out diagnosis control in the diagnosis control unit 103 in diagnosis node A, by this root node A, be started and set up diagnostic tree, the node joining in diagnostic tree sends to this root node A by diagnostic message separately, and node A the most at last diagnostic result reports GW.Thereby can obtain unified diagnostic result at gateway, reduce the communication overhead of system simultaneously.As for specifically how to carry out the foundation of diagnostic tree and specifically how to collect diagnostic message and how to send diagnostic result, can be with reference to prior art, the present invention no longer describes in detail.

In the present embodiment, back off time can set in advance.For a node in network, can back off time be set for a plurality of neighbor nodes of this node.Back off time can arrange after a plurality of neighbor nodes of this node are divided into different groups, and neighbor node does not on the same group arrange different back off times.

In the specific implementation, if there is gateway node in the neighbor node of suspection node, that is to say that gateway is a neighbor node of this suspection node,, when this gateway is diagnosed this suspection node, this gateway can be defined as to root node.For example, can directly determine that this gateway is root node, by this gateway, set up diagnostic tree; Also can for this gateway setting, be less than the back off time of other nodes, make this gateway finish at first back off time.

In the specific implementation, as for how back off time is set, can to each neighbor node, be distributed unitedly by this node, also can oneself be calculated separately by each neighbor node.The invention is not restricted to this, each neighbor node oneself of only take in the present embodiment calculates separately for the back off time of this node and describes as example.

Fig. 2 is another formation schematic diagram of the trouble-shooter of the embodiment of the present invention.As shown in Figure 2, this trouble-shooter 200 comprises: time start unit 101, root node determining unit 102 and diagnosis control unit 103.As mentioned above.

As shown in Figure 2, this trouble-shooter 200 can also comprise: grouped element 204.This grouped element 204 is divided into different groups according to communication distance by a plurality of neighbor nodes of suspecting node.

In the specific implementation, grouped element 204 specifically can be for: according to communication distance, a plurality of neighbor nodes of one node are divided into first group and second group; Wherein, the neighbor node in first group and the communication distance of this node are less than or equal to the distance of setting, and such as R/2, R/3, R/4 etc., the neighbor node in second group and the communication distance of this node are greater than the distance of described setting.Wherein, the communication range that R is this node.

In addition, also can divide into groups by receiving the signal strength signal intensity of this node, wherein, the signal strength signal intensity that neighbor node in first group receives this node is more than or equal to the signal strength threshold of setting, such as-50dBm ,-60dBm ,-70dBm etc., the signal strength signal intensity that the neighbor node in first group receives this node is less than the signal strength threshold of described setting.

When being divided into more than two groups, as be divided into first group, second group, the 3rd group, neighbor node in first group and the communication distance of this node are less than or equal to R/4, neighbor node in second group and the communication distance of this node are greater than R/4 and are less than or equal to R/2, and the neighbor node in the 3rd group and the communication distance of this node are greater than R/2.Remaining group technology is no longer given an example, similarly.

For example, each node in network can for example, obtain the received signal strength indicator (RSSI between own and neighbor node by periodically intercepting (adopting Hello bag) mechanism, Received Signal Strength Indication) information, and then obtain the communication distance between this node and neighbor node, then a plurality of neighbor nodes can be divided into groups.

It should be noted that, the method of dividing into groups by communication distance is above only the specific embodiment of the present invention, but the invention is not restricted to this, for example can also for example, according to other information (communication quality), divide into groups, or neighbor node is for example divided into, more than 2 groups (3 groups, 4 groups etc.), can determines concrete enforcement scene according to actual conditions.

Fig. 3 is the schematic diagram after the neighbor node to a node of the embodiment of the present invention divides into groups.As shown in Figure 3,1. node is this node, and 6. 5. 4. 3. 2. node be its neighbor node.Can by with node 1. distance be less than or equal to the communication range that R/2(R is node) region (region A in figure) be called main region PZ(Primary Zone); In node communication range 1., and 1. apart from the region (region B in figure) that is greater than R/2, be called secondary regions SZ(Secondary Zone with node).Thus, neighbor node can be divided into groups (for example, corresponding first group of the neighbor node in PZ region, corresponding second group of the neighbor node in SZ region).

In the present embodiment, after a plurality of neighbor nodes of a node are divided into different groups, can different back off times be set to neighbor node on the same group not.Thus, can, so that the back off time of the neighbor node of different groups can not finish simultaneously, according to the countdown of back off time, come definite root node to be one.

As shown in Figure 2, this trouble-shooter 200 can also comprise: set of time unit 205,205 pairs of this set of time unit not neighbor node on the same group arrange different back off times.Wherein, for a plurality of neighbor nodes in each group, corresponding back off time can be for a plurality of; For example the back off time of each neighbor node is different.Therefore the back off time of each group can form a period of time scope.

And, the formed time range non-overlapping copies of back off time of different groups.Take below and be divided into two groups as example, the setting of back off time is described.In the present embodiment, can a back off time BO(Backoff be set for each neighbor node according to following rule).

For example, set of time unit 205 can adopt following formula that back off time is set:

t ₀≤t ₁≤BO ₁≤t ₂<t ₃≤BO ₂≤t ₄

Wherein, BO ₁the back off time that neighbor node for first group (for example in Fig. 3 4. 5.) arranges, BO ₂it is the back off time that neighbor node for second group (for example in Fig. 3 2. 3. 6.) arranges; Wherein, t ₁, t ₂, t ₃, t ₄predetermined time, t ₀for this diagnosis node detects the moment of suspecting node failure.

In the specific implementation, can adopt following rule to realize:

BO ₁=t ₁+(t ₂-t ₁)·F(Hop,NN)

BO ₂=t ₃+(t ₄-t ₃)·F(Hop,NN)

F (Hop, NN) be a value at the function of [0,1], F (Hop, NN) is directly proportional to the jumping figure Hop of this neighbor node, is inversely proportional to neighbours' quantity of this neighbor node.

In the specific implementation, t ₀=t ₁in time, shows once fault being detected, to start the countdown of back off time when this node; t ₀<t ₁time show that this node is after fault being detected, time delay a period of time starts the countdown of back off time again.T ₁=t ₂time, this node can be usingd backoff time of MAC layer CSMA/CA mechanism as oneself back off time; Backoff mechanism in MAC layer is that particular content can be with reference to prior art in order to guarantee to avoid channel confliction.For t ₃, t ₄can with t ₁, t ₂situation identical.

In the specific implementation, if there is gateway node in the neighbor node of suspection node, can be that this gateway distributes t ₀to t ₁between back off time, make this gateway finish at first the countdown of back off time, become root node and start and set up diagnostic tree.

In one embodiment, F (HopNN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;\mathrm{arctg}\left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5].

In another embodiment, F (HopNN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\sin \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Or, $F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\cos \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5]; And if order

Fig. 4 is the t of the embodiment of the present invention ₁, t ₂, t ₃, t ₄with BO ₁, BO ₂be related to schematic diagram.As shown in Figure 4, BO1 is [t ₁, t ₂] between certain value, BO2 is [t ₃, t ₄] between certain value.If have a diagnosis node at least, [t in the scope of distance suspection node R/2 ₂, t ₃] guaranteed during this period of time to only have a diagnosis node can start the process of establishing of diagnostic tree.

In the specific implementation, t ₂and t ₃between interval time be a parameter.Can set t ₂and t ₃between be spaced apart " data packet transmission 3 jump times "; Also can set t ₂and t ₃between interval be " data packet transmission 9 jump times ".

For example, for the scene shown in Fig. 3,1. the neighbor node 4. set of time unit 205 in 5. can adopt BO for node ₁=t ₁+ (t ₂-t ₁) F (Hop, NN) arranges back off time T4, T5; Neighbor node 2. 3. the set of time unit 205 in 6. can 1. adopt BO for node ₂=t ₃+ (t ₄-t ₃) F (Hop, NN) arranges back off time T2, T3, T6.And the set of time unit 205 of node in 1. also can arrange back off time for oneself for its neighbor node.

It should be noted that only the setting of back off time in the present invention to be schematically illustrated above, but the invention is not restricted to this, such as adopting suitable distortion etc. according to actual conditions, can adopt other formula.

Fig. 5 is another formation schematic diagram of the trouble-shooter of the embodiment of the present invention.As shown in Figure 5, this trouble-shooter 500 comprises: time start unit 101, root node determining unit 102, diagnosis control unit 103, grouped element 204 and set of time unit 205, as mentioned above.

As shown in Figure 5, this trouble-shooter can also comprise: node selected cell 505, when there is no neighbor node for first group, from second group, select a neighbor node as the neighbor node of first group; And set of time unit 205 is also used to this neighbor node of selecting that the back off time of corresponding first group is set.

Particularly, when node selected cell 505 can all be greater than R/2 in the distance of all neighbor nodes and this diagnosis node, from distance, be all greater than and the neighbor node of R/2, select a neighbor node as the neighbor node of first group.

As shown in Figure 5, this trouble-shooter can also comprise: time transmitting element 506.The back off time that this time transmitting element 506 arranges set of time unit 205 sends to the neighbor node of selecting, and makes neighbor node store this back off time.

Wherein, this node selected cell 505 can the nearest neighbor node of this diagnosis node of chosen distance; Or when there is the identical neighbor node of a plurality of distances, this node selected cell 505 is selected the wherein neighbor node of jumping figure minimum; Or when there is the neighbor node that a plurality of distances are identical and a plurality of jumping figures are identical, this node selected cell 505 is from wherein choosing at random a neighbor node.

Fig. 6 is another schematic diagram after the neighbor node to a node of the embodiment of the present invention divides into groups.As shown in Figure 6,1. node is this node, and 6. 3. 2. node be its neighbor node.Can by with node 1. distance be less than or equal to the communication range that R/2(R is node) region (region A in figure) be called main region PZ; In node communication range 1., and 1. apart from the region (region B in figure) that is greater than R/2, be called secondary regions SZ with node.

As shown in Figure 6, in the A of region, there is no neighbor node, and in the B of region, there is neighbor node 2. 3. 6..In the specific implementation, for accompanying drawing 6 for example at PZ(region A) in there is no the situation of node, this node is when 1. discovering neighbor node is all greater than R/2 with oneself distance, 1. this node selects a node (for example node 2.) that distance oneself is nearest.If there is the neighbor node that a plurality of distances are identical, select the wherein neighbor node of jumping figure minimum; If also have the neighbor node that a plurality of jumping figures are identical, therefrom choose at random.

Selecting this neighbor node (for example node 2.) afterwards, node 1. can be for 2. this neighbor node arranges the BACKOFF time in [t1, t2], and this time is sent to this neighbor node.

In the present embodiment, time start unit 101 specifically can be for: in diagnosis node not from suspecting that node receives a plurality of while intercepting bag (Hello bag) continuously, startup starts countdown for the back off time of this suspection node, and it is local as local suspection node LSN(Local Suspect Node this can be suspected to node is stored in).

In the present embodiment, diagnosis control unit 103 can also be for: after root node determining unit 102 is determined root node, control this root node broadcast and detect bag DP(Detection Packet); Make other diagnosis node when back off time countdown does not finish and receives this detection bag, no longer carry out the countdown of back off time.Wherein, other diagnosis node refer to except being defined as the one or more diagnosis node the diagnosis node of root node.

In the specific implementation, for example, when node A finds that existing continuous K the Hello bag of its neighbor node B is not received, node A thinks that Node B need to diagnose, and Node B is stored in to this locality, remembers and is LSN(Local SN).If the back off time BO timing of node A finishes, can set up diagnostic tree and broadcast one and detect bag DP; If node A has just received the detection bag DP that other nodes send when BO countdown does not finish, no longer carry out BO countdown, and this detection bag DP is continued to broadcast (again receiving that DP wraps, and no longer broadcasts if it is pointed out that the node joining in diagnostic tree).

In the specific implementation, this detection bag DP can comprise source address, suspect the identification information of node and the identification information of root node.In addition, can also comprise frame type (Frame Type) and retain position (Reserved).

Fig. 7 is a structural representation of the detection bag of the embodiment of the present invention.As shown in Figure 7, can comprise: the source address (can represent with GS) of DP bag; Frame type (FT, Frame Type), shows that this bag is detection packet; Suspect node identification (can represent with SN ID); Root node sign (can represent with RN ID); And reservation position (can represent with Reserved).

In the present embodiment, when a node is received after DP, if find that the SN ID of this DP is identical with the LSN of local storage, the address that GS of this DP can be changed into oneself is continued this DP of broadcast afterwards; If find that SN ID is identical with certain neighbor node in local neighbor table, continue this DP of broadcast; If find that SN ID, not in local neighbor table, does not broadcast this DP(and illustrates that this node is not the neighbor node of SN).

From above-described embodiment, when suspecting that node need to be diagnosed, start diagnosis node for the back off time of suspecting node, according to the countdown to back off time, determine root node, and start and set up diagnostic tree by this root node, receive the diagnostic message that the node in diagnostic tree sends, and diagnostic result is reported to gateway.Thus, can obtain unified diagnostic result at gateway, reduce the communication overhead of system simultaneously.

Embodiment 2

The embodiment of the present invention provides a kind of method for diagnosing faults, corresponding to the trouble-shooter of embodiment 1.Fig. 8 is a schematic flow sheet of the method for diagnosing faults of the embodiment of the present invention, and as shown in Figure 8, this method for diagnosing faults comprises:

Step 801, when suspecting that node need to be diagnosed, starts diagnosis node and suspects the back off time of node for this;

Step 802, determines root node according to the countdown to this back off time; The diagnosis node that in a plurality of diagnosis node that this root node is this suspection node, back off time finishes at first;

Step 803, controls this root node startup and sets up diagnostic tree, and receive the diagnostic message that the node in diagnostic tree sends, and diagnostic result is reported to gateway.

In the present embodiment, back off time can be predetermined.For each diagnosis node, a plurality of neighbor nodes of this diagnosis node can be divided into different groups, and neighbor node on the same group is not arranged to different back off times.

Particularly, a plurality of neighbor nodes of diagnosis node being divided into different groups specifically can comprise: according to communication distance, a plurality of neighbor nodes are divided into a plurality of different groups.For example, can be divided into first group and second group; Neighbor node in first group and the communication distance of this diagnosis node are less than or equal to R/2, and the neighbor node in second group and the communication distance of this diagnosis node are greater than R/2; Wherein, the communication range that R is this diagnosis node.

In one embodiment, implementing scene can be as shown in Figure 3.All there is neighbor node in first group (for example region A in Fig. 3) and second group (for example region B in Fig. 3).Can be respectively neighbor node on the same group be not arranged to different back off times.

In another embodiment, implementing scene can be as shown in Figure 6.When the distance of all neighbor nodes and this diagnosis node is all greater than R/2, can select a neighbor node as the neighbor node of first group.Wherein, selecting a neighbor node specifically can comprise as the neighbor node of described first group: the neighbor node that this diagnosis node of chosen distance is nearest; Or, when there is the identical neighbor node of a plurality of distances, select the wherein neighbor node of jumping figure minimum; Or, when there is the neighbor node that a plurality of distances are identical and a plurality of jumping figures are identical, from wherein choosing at random a neighbor node.

In the present embodiment, this method for diagnosing faults can also comprise: the back off time of setting is sent to this neighbor node of selecting, make this neighbor node storage back off time.

In the present embodiment, in step 801 when suspecting that node need to be diagnosed, startup diagnosis node specifically can comprise for the back off time of this suspection node: when this diagnosis node is not received a plurality of Hello bag continuously from this suspection node, start back off time and start countdown, and this suspection node is stored in local as local suspection node.

In the present embodiment, after step 802 is determined root node, this method for diagnosing faults can also comprise: control this root node broadcast and detect bag; Make other diagnosis node when back off time countdown does not finish and receives detection bag, no longer carry out the countdown of back off time.Wherein, detecting bag can comprise source address, suspect the identification information of node and the identification information of root node.The structure that detects bag can be with reference to the content of accompanying drawing 7.

In the present embodiment, this method for diagnosing faults can also comprise: when some diagnosis node, receive and detect after bag, if find the identification information of suspection node of this detection bag and this locality of local storage, suspect that node is identical, the source address of this detection bag is changed into the address of this diagnosis node oneself, then continue broadcast and detect bag; If find that the identification information of the suspection node that detection is wrapped is identical with certain neighbor node in local neighbor table, continue to broadcast to detect and wrap; If find that the identification information that detects the suspection node wrapping is not in local neighbor table, do not broadcast and detect bag.

Fig. 9 is another schematic flow sheet of the method for diagnosing faults of the embodiment of the present invention, and as shown in Figure 9, this method for diagnosing faults comprises:

Step 901, diagnosis node is counted suspecting the Hello bag of node transmission.

Step 902, judges whether not receive continuously K the Hello bag that this suspection node sends; If do not received continuously, perform step 903.

Step 903, diagnosis node thinks that this suspection node needs diagnosis, opens back off time and starts countdown.

Step 904, judges whether the countdown of back off time finishes; If countdown finishes, perform step 905, otherwise execution step 907.

Particularly, can judge that this diagnosis node is for the back off time BO of this suspection node; If BO is greater than 0, this back off time does not also finish, execution step 907; If BO is less than or equal to 0, this back off time finishes, execution step 905.

Step 905, determines that this diagnosis node is root node, opens and sets up diagnostic tree broadcast detection bag DP.

Step 906, collects diagnostic message and reports diagnostic result to gateway.

Step 907, judges whether the detection bag DP that receives that other nodes send; If receive and detect bag DP, perform step 908, otherwise execution step 904.

Step 908, stops back off time countdown, the diagnostic tree this detection bag of the continuation broadcast DP that add other nodes to set up.

In addition,, if receive the identification information of suspection node that the node that detects bag DP finds this detections bag DP not in local neighbor table, show that this node is not the neighbor node of this suspections node, so do not broadcast this detection and wrap DP.And the node that has joined diagnostic tree again receives and detects after bag, also can no longer broadcast this detection bag.

The scene shown in Fig. 3 of take below describes as example.In scene as shown in Figure 3, suppose for node 1., for neighbor node, to be 2. 3. 4. 5. 6. provided with back off time, be respectively T2, T3, T4, T5, T6.Concrete method to set up can reference example 1 or embodiment 3.

When 1. node need to be diagnosed as suspection node, 6. 5. 4. 3. 2. node start to start back off time countdown as diagnosis node.For example, for one of them diagnosis node (node is 5.), if T5=0(finishes back off time the earliest), can determine that 5. this node is root node, 5. this node starts to set up diagnostic tree and sends detection bag DP.

For example, for other diagnosis node (node is 2. 3. 4. 6.), if receive the detection bag DP that 5. this node sends, stop the countdown of back off time, add this diagnostic tree and continue this detection bag of broadcast DP.Thus, can 5. set up diagnostic tree by node, collect diagnostic message and send to gateway.

From above-described embodiment, when suspecting that node need to be diagnosed, start diagnosis node for the back off time of suspecting node, according to the countdown to back off time, determine root node, and start and set up diagnostic tree by this root node, receive the diagnostic message that the node in diagnostic tree sends, and diagnostic result is reported to gateway.Thus, can obtain unified diagnostic result at gateway, reduce the communication overhead of system simultaneously.

Embodiment 3

The embodiment of the present invention provides a kind of method to set up of back off time, can be used as a part of embodiment 2 or prepares process in advance, divides identical content with the setting unit of back off time in embodiment 1, repeats no more herein.

Figure 10 is the schematic flow sheet of method to set up of the back off time of the embodiment of the present invention, and as shown in figure 10, this method to set up comprises:

Step 1001, is divided into different groups by a plurality of neighbor nodes of node;

Step 1002, for neighbor node on the same group not, arranges different back off times.

In the present embodiment, for arbitrary node, a plurality of neighbor nodes of this node can be divided into different groups, then back off time is set.Thus, can, so that the back off time of the neighbor node of different groups can not finish simultaneously, according to the countdown of back off time, come definite root node to be one.

In the specific implementation, in step 1001, a plurality of neighbor nodes of node are divided into different groups, specifically can comprise: according to communication distance, a plurality of neighbor nodes are divided into a plurality of different groups.For example, can be divided into first group and second group, the neighbor node in first group and the communication distance of this node are less than or equal to R/2, and the neighbor node in second group and the communication distance of this node are greater than R/2; Wherein, the communication range that R is this node.

It should be noted that, the method of dividing into groups by communication distance is above only the specific embodiment of the present invention, but the invention is not restricted to this, for example can also for example, according to other information (communication quality), divide into groups, or neighbor node is for example divided into, more than 2 groups (3 groups, 4 groups etc.), can determines concrete enforcement scene according to actual conditions.

In the specific implementation, in step 1002, can adopt following rule that back off time is set:

t ₀≤t ₁≤BO ₁≤t ₂<t ₃≤BO ₂≤t ₄

Wherein, BO ₁the back off time arranging for the neighbor node of first group, BO ₂it is the back off time arranging for the neighbor node of second group; t ₁, t ₂, t ₃, t ₄it is predetermined time.

In the specific implementation, can adopt following rule to realize:

BO ₁=t ₁+(t ₂-t ₁)·F(Hop,NN)

BO ₂=t ₃+(t ₄-t ₃)·F(Hop,NN)

F (Hop, NN) be a value at the function of [0,1], F (Hop, NN) is directly proportional to the jumping figure Hop of node, is inversely proportional to neighbours' quantity of node.

In one embodiment, F (Hop, NN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;\mathrm{arctg}\left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5].

In another embodiment, F (HopNN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\sin \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Or, $F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\cos \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5]; And if order

It should be noted that above formula is only to the schematically illustrating of back off time setting in the present invention, but the invention is not restricted to this, can also adopt suitable distortion etc. according to actual conditions, can adopt other formula.

In the present embodiment, arranging of back off time can be carried out on this node, and this method to set up can also comprise: the back off time of setting is sent to each neighbor node, make each neighbor node store respectively corresponding back off time.

In addition, arranging of back off time can also be carried out on each neighbor node, by each neighbor node, the back off time for this node is set separately.Take below each neighbor node arranges separately for the back off time of this node and describes as example.

Figure 11 is the exemplary plot of method to set up of the back off time of the embodiment of the present invention, take the scene shown in Fig. 3 as example, shows the situation that all has neighbor node in first group and second group.As shown in figure 11, this method to set up comprises:

Step 1101, starts Hello process.

Step 1102, the distance between computing node.

Particularly, can carry out the distance between computing node by the RSSI information comprising in Hello bag, but the invention is not restricted to this.

Step 1103, for a neighbor node of this node, judges whether the distance of this node and this neighbor node is less than R/2; If it is perform step 1104; If not performing step 1105.

Step 1104, this neighbor node adopts formula BO ₁=t ₁+ (t ₂-t ₁) F (Hop, NN) arranges back off time.

Step 1105, this neighbor node adopts formula BO ₂=t ₃+ (t ₄-t ₃) F (Hop, NN) arranges back off time.

For example, in the scene shown in Fig. 3,5. 4. neighbor node can adopt BO ₁=t ₁+ (t ₂-t ₁) F (Hop, NN) arranges for node back off time 1..Wherein, F (Hop, NN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;\mathrm{arctg}\left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5].

Or F (Hop, NN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\sin \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Or, $F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\cos \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5]; And if order hop is node jumping figure 4. or 5., and NN is node neighbours' quantity 4. or 5..

And 6. 3. 2. neighbor node can adopt BO ₂=t ₃+ (t ₄-t ₃) F (Hop, NN) arranges for node back off time 1..Wherein, F (Hop, NN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;\mathrm{arctg}\left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5].

Or F (Hop, NN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\sin \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Or, $F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\cos \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5]; And if order hop is node jumping figure 2., 3. or 6., and NN is node neighbours' quantity 2., 3. or 6..

Figure 12 is another exemplary plot of method to set up of the back off time of the embodiment of the present invention, take the scene shown in Fig. 3 and Fig. 6 as example, shows the situation that may there is no neighbor node in first group.As shown in figure 12, this method to set up comprises:

Step 1201, starts Hello process.

Step 1202, the distance between computing node, and be divided into first area and second area according to distance.

Step 1203, judges in first area, whether there is neighbor node; If there is no neighbor node, perform step 1205; If there is neighbor node, perform step 1204.

Step 1204, the neighbor node of this node arranges respectively back off time according to grouping.

Particularly, can back off time be set according to the step 1103 in Figure 11 to step 1105.

Step 1205, this node is selected a node from neighbor node, adopts the formula of first area for this neighbor node arranges back off time, adopts BO ₁=t ₁+ (t ₂-t ₁) F (Hop, NN).

Concrete, can the nearest neighbor node of this node of chosen distance; Or, when there is the identical neighbor node of a plurality of distances, select the wherein neighbor node of jumping figure minimum; Or, when there is the neighbor node that a plurality of distances are identical and a plurality of jumping figures are identical, from wherein choosing at random a neighbor node.

Step 1206, this node sends to this back off time the neighbor node of this selection.

Step 1207, the neighbor node of this selection receives after this back off time, and this back off time is stored in to this locality.

For example, in the scene shown in Fig. 6,1. node can select a neighbor node (for example node 2.), and then 1. node can adopt BO ₁=t ₁+ (t ₂-t ₁) F (Hop, NN) arranges node back off time 2..

Wherein, F (Hop, NN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;\mathrm{arctg}\left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5].

Or F (Hop, NN) can adopt following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\sin \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Or, $F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\cos \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5]; And if order hop is node jumping figure 2., and NN is node neighbours' quantity 2..

Then, 2. 1. node can send to node this back off time, by node, 2. adopts this back off time receiving to replace the back off time oneself calculating before, and the back off time after this renewal is stored in to this locality.

From above-described embodiment, by a plurality of neighbor nodes of node are divided into different groups, and neighbor node on the same group is not arranged to different back off times.Can, so that the back off time of the neighbor node of different groups can not finish simultaneously, guarantee to be one according to the root node of back off time countdown.

Embodiment 4

The embodiment of the present invention also provides a kind of network node, and described network node comprises trouble-shooter as described in Example 1.Figure 13 is a schematic diagram of the network node of the embodiment of the present invention, as shown in figure 13, in network, can have a plurality of network nodes 1301,1302,1303 etc., one or more network nodes (for example network node 1301) can have time start unit 101, root node determining unit 102 and diagnosis control unit 103.

In addition,, as modified example, trouble-shooter of the present invention can also be centralized.Figure 14 is another schematic diagram of the network node of the embodiment of the present invention, as shown in figure 14, can have a plurality of network nodes 1301,1302,1303 etc.In addition, in network, can also there is trouble-shooter 1304, this trouble-shooter 1304 has time start unit 101, root node determining unit 102 and diagnosis control unit 103, and network node 1301,1302,1303 etc. is controlled, and realizes the failure diagnosis to network node.

Apparatus and method more than the present invention can be realized by hardware, also can be realized by combination of hardware software.The present invention relates to such computer-readable program, when this program is performed by logical block, can make this logical block realize device mentioned above or component parts, or make this logical block realize the whole bag of tricks mentioned above or step.The invention still further relates to for storing the storage medium of above program, as hard disk, disk, CD, DVD, flash memory etc.

Invention has been described for the concrete execution mode of above combination, but it will be apparent to those skilled in the art that these descriptions are all exemplary, is not limiting the scope of the invention.Those skilled in the art can make various variants and modifications to the present invention according to spirit of the present invention and principle, and these variants and modifications also within the scope of the invention.

About comprising the execution mode of above embodiment, following remarks is also disclosed:

(remarks 1) a kind of trouble-shooter, described trouble-shooter comprises:

Time start unit, when suspecting that node need to be diagnosed, starts diagnosis node for the back off time of described suspection node;

Root node determining unit, determines root node according to the countdown to described back off time; Described root node is the diagnosis node that in a plurality of diagnosis node of described suspection node, back off time finishes at first;

Diagnosis control unit, controls described root node startup and sets up diagnostic tree, and receive the diagnostic message that the node in described diagnostic tree sends, and diagnostic result is reported to gateway.

(remarks 2), according to the trouble-shooter described in remarks 1, wherein, described trouble-shooter also comprises:

Grouped element, is divided into different groups by a plurality of neighbor nodes of described suspection node.

(remarks 3) according to the trouble-shooter described in remarks 2, wherein, described grouped element specifically for: according to communication distance, described a plurality of neighbor nodes are divided into first group and second group;

Neighbor node in described first group and the communication distance of described suspection node are less than or equal to R/2, and the neighbor node in described second group and the communication distance of described suspection node are greater than R/2; Wherein, described R is the communication range of described suspection node.

(remarks 4), according to the trouble-shooter described in remarks 1 to 3 any one, wherein, described trouble-shooter also comprises:

Set of time unit, arranges described back off time according to the different group that a plurality of neighbor nodes of described suspection node are divided into; Wherein, the formed time range non-overlapping copies of the back off time of different groups.

(remarks 5), according to the trouble-shooter described in remarks 4, wherein, described set of time unit adopts following rule that back off time is set:

t ₀≤t ₁≤BO ₁≤t ₂<t ₃≤BO ₂≤t ₄

Wherein, BO ₁the back off time arranging for the neighbor node of described first group, BO ₂it is the back off time arranging for the neighbor node of described second group; t ₁, t ₂, t ₃, t ₄predetermined time, t ₀for described diagnosis node detects moment of described suspection node failure.

(remarks 6) according to the trouble-shooter described in remarks 5, wherein,

BO ₁=t ₁+(t ₂-t ₁)·F(Hop,NN)

BO ₂=t ₃+(t ₄-t ₃)·F(Hop,NN)

F (Hop, NN) be a value at the function of [0,1], described F (Hop, NN) is directly proportional to the jumping figure Hop of node, is inversely proportional to neighbours' quantity of node.

(remarks 7), according to the trouble-shooter described in remarks 6, wherein, described F (Hop, NN) adopts following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;\mathrm{arctg}\left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5].

(remarks 8), according to the trouble-shooter described in remarks 6, wherein, described F (Hop, NN) adopts following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\sin \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Or, $F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\cos \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5]; And if order

(remarks 9), according to the trouble-shooter described in remarks 3, wherein, described trouble-shooter also comprises:

Node selected cell at the neighbor node of described first group while being empty, is selected a neighbor node as the neighbor node of described first group from second group; And, for the described neighbor node of selecting arranges the back off time of corresponding described first group.

(remarks 10) according to the trouble-shooter described in remarks 9, wherein, suspects the neighbor node that node is nearest described in described node selected cell chosen distance;

Or when there is the identical neighbor node of a plurality of distances, described node selected cell is selected the wherein neighbor node of jumping figure minimum;

Or when there is the neighbor node that a plurality of distances are identical and a plurality of jumping figures are identical, described node selected cell is from wherein choosing at random a neighbor node.

(remarks 11), according to the trouble-shooter described in remarks 9 or 10, wherein, described trouble-shooter also comprises:

Time transmitting element, sends to described neighbor node by the back off time of setting, makes described neighbor node store and use described back off time.

(remarks 12) is according to the trouble-shooter described in remarks 1, wherein, described time start unit is not specifically for when described diagnosis node is received a plurality of Hello bag continuously from described suspection node, start described back off time and start countdown, and this suspection node is stored in local as local suspection node.

(remarks 13), according to the trouble-shooter described in remarks 12, wherein, described diagnosis control unit also detects bag for controlling described root node broadcast; Make other diagnosis node when back off time countdown does not finish and receives described detection bag, no longer carry out the countdown of back off time.

(remarks 14), according to the trouble-shooter described in remarks 13, wherein, described detection bag comprises source address, the identification information of described suspection node and the identification information of described root node.

(remarks 15) a kind of method for diagnosing faults, described method for diagnosing faults comprises:

When suspecting that node need to be diagnosed, start diagnosis node for the back off time of described suspection node;

According to the countdown to described back off time, determine root node; Described root node is the diagnosis node that in a plurality of diagnosis node of described suspection node, back off time finishes at first;

Control described root node startup and set up diagnostic tree, and receive the diagnostic message that the node in described diagnostic tree sends, and diagnostic result is reported to gateway.

(remarks 16), according to the method for diagnosing faults described in remarks 15, wherein, described method for diagnosing faults also comprises:

A plurality of neighbor nodes of described suspection node are divided into different groups, and neighbor node on the same group is not arranged to different back off times.

(remarks 17), according to the method for diagnosing faults described in remarks 16, wherein, is divided into different groups by a plurality of neighbor nodes of described diagnosis node and specifically comprises:

According to communication distance, described a plurality of neighbor nodes are divided into first group and second group; Neighbor node in described first group and the communication distance of described suspection node are less than or equal to R/2, and the neighbor node in described second group and the communication distance of described suspection node are greater than R/2; Wherein, described R is the communication range of described suspection node.

(remarks 18), according to the method for diagnosing faults described in remarks 17, wherein, described method for diagnosing faults also comprises:

When the distance of all neighbor nodes and described suspection node is all greater than R/2, select a neighbor node as the neighbor node of described first group.

(remarks 19) according to the method for diagnosing faults described in remarks 18, wherein, selects a neighbor node and specifically comprises as the neighbor node of described first group:

Described in chosen distance, suspect the neighbor node that node is nearest;

Or, when there is the identical neighbor node of a plurality of distances, select the wherein neighbor node of jumping figure minimum;

Or, when there is the neighbor node that a plurality of distances are identical and a plurality of jumping figures are identical, from wherein choosing at random a neighbor node.

(remarks 20), according to the method for diagnosing faults described in remarks 18 or 19, wherein, described method for diagnosing faults also comprises:

The back off time of setting is sent to described neighbor node, make described neighbor node store and use described back off time.

(remarks 21), according to the method for diagnosing faults described in remarks 15, wherein, when suspecting that node need to be diagnosed, startup diagnosis node specifically comprises for the back off time of described suspection node:

When described diagnosis node is not received a plurality of Hello bag continuously from described suspection node, start described back off time and start countdown, and this suspection node is stored in local as local suspection node.

(remarks 22), according to the method for diagnosing faults described in remarks 21, wherein, described method for diagnosing faults also comprises:

Control described root node broadcast and detect bag; Make other diagnosis node when back off time countdown does not finish and receives described detection bag, no longer carry out the countdown of back off time.

(remarks 23), according to the method for diagnosing faults described in remarks 22, wherein, described detection bag comprises source address, the identification information of described suspection node and the identification information of described root node.

(remarks 24), according to the method for diagnosing faults described in remarks 22, wherein, described method for diagnosing faults also comprises:

When some diagnosis node are received after described detection bag, if find the identification information of suspection node of described detection bag and this locality of local storage, suspect that node is identical, the source address of described detection bag is changed into the address of described diagnosis node oneself, then continue the described detection bag of broadcast;

If find that the identification information of suspection node of described detection bag is identical with certain neighbor node in local neighbor table, continue the described detection bag of broadcast;

If find the identification information of suspection node of described detection bag, not in local neighbor table, do not broadcast described detection bag.

The method to set up of (remarks 25) a kind of back off time, described method to set up comprises:

A plurality of neighbor nodes of node are divided into different groups;

Neighbor node on the same group is not arranged to different back off times, wherein the formed time range non-overlapping copies of the back off time of different groups.

(remarks 26), according to the method to set up described in remarks 25, wherein, is divided into different groups by a plurality of neighbor nodes of node and specifically comprises: according to communication distance, described a plurality of neighbor nodes are divided into a plurality of different groups.

(remarks 27) is according to the method to set up described in remarks 26, wherein, according to communication distance, described a plurality of neighbor nodes are divided into first group and second group, neighbor node in described first group and the communication distance of described node are less than or equal to R/2, and the neighbor node in described second group and the communication distance of described node are greater than R/2; Wherein, the communication range that described R is described node.

(remarks 28), according to the method to set up described in remarks 25 to 27 any one, wherein, adopts following rule that back off time is set: t ₀≤ t ₁≤ BO ₁≤ t ₂<t ₃≤ BO ₂≤ t ₄;

Wherein, BO ₁the back off time arranging for the neighbor node of first group, BO ₂it is the back off time arranging for the neighbor node of second group; t ₁, t ₂, t ₃, t ₄it is predetermined time.

(remarks 29) according to the method to set up described in remarks 28, wherein,

BO ₁=t ₁+(t ₂-t ₁)·F(Hop,NN)

BO ₂=t ₃+(t ₄-t ₃)·F(Hop,NN)

F (Hop, NN) be a value at the function of [0,1], described F (Hop, NN) is directly proportional to the jumping figure Hop of node, is inversely proportional to neighbours' quantity of node.

(remarks 30), according to the method to set up described in remarks 29, wherein, described F (Hop, NN) adopts following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;\mathrm{arctg}\left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5].

(remarks 31), according to the method to set up described in remarks 29, wherein, described F (Hop, NN) adopts following formula:

$F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\sin \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Or, $F(\mathrm{Hop},\mathrm{NN})=\mathrm{\&alpha;}\&CenterDot;(\cos \left(\frac{\mathrm{Hop}}{\mathrm{NN}}\right)+1)+\mathrm{\&epsiv;}$

Wherein, ε is that value is at the random parameter of [0,0.5]; And if order

(remarks 32), according to the method to set up described in remarks 27, wherein, described event method to set up also comprises:

When the distance of all neighbor nodes and described node is all greater than R/2, select a neighbor node as the neighbor node of described first group.

(remarks 33) a kind of network node, described network node comprises the trouble-shooter as described in remarks 1 to 14 any one.

(remarks 34) a kind of computer-readable program, wherein when carrying out described program in network node, described program makes computer in described network node, carry out the method for diagnosing faults as described in any one in remarks 15 to 24, or the method to set up of the back off time as described in remarks 25 to 31 any one.

(remarks 35) a kind of storage medium that stores computer-readable program, wherein said computer-readable program makes computer in network node, carry out the method for diagnosing faults as described in any one in remarks 15 to 24, or the method to set up of the back off time as described in remarks 25 to 31 any one.

Claims (15)

1. a trouble-shooter, described trouble-shooter comprises:

Time start unit, when suspecting that node need to be diagnosed, starts diagnosis node for the back off time of described suspection node; Wherein, by a plurality of neighbor nodes of described suspection node are divided into different groups, described back off time is set;

Root node determining unit, determines root node according to the countdown to described back off time; Described root node is the diagnosis node that in a plurality of diagnosis node of described suspection node, back off time finishes at first;

Diagnosis control unit, controls described root node and starts and set up diagnostic tree, and receives the diagnostic message that the node in described diagnostic tree sends, and diagnostic result is reported to gateway.

2. trouble-shooter according to claim 1, wherein, described trouble-shooter also comprises:

Grouped element, is divided into a plurality of different groups according to communication distance by a plurality of neighbor nodes of described suspection node.

3. trouble-shooter according to claim 2, wherein, described grouped element is divided into first group and second group according to communication distance by a plurality of neighbor nodes of described suspection node;

Neighbor node in described first group and the communication distance of described suspection node are less than or equal to R/2, and the neighbor node in described second group and the communication distance of described suspection node are greater than R/2; Wherein, described R is the communication range of described suspection node.

4. according to the trouble-shooter described in claims 1 to 3 any one, wherein, described trouble-shooter also comprises:

Set of time unit, arranges described back off time according to different groups, wherein the formed time range non-overlapping copies of the back off time of different groups.

5. trouble-shooter according to claim 4, wherein, described set of time unit adopts following rule that described back off time is set:

t ₀≤t ₁≤BO ₁≤t ₂<t ₃≤BO ₂≤t ₄

Wherein, BO ₁the back off time arranging for the neighbor node of first group, BO ₂it is the back off time arranging for the neighbor node of second group; t ₁, t ₂, t ₃, t ₄predetermined time, t ₀for described diagnosis node detects moment of described suspection node failure.

6. trouble-shooter according to claim 5, wherein,

BO ₁=t ₁+(t ₂-t ₁)·F(Hop,NN)

BO ₂=t ₃+(t ₄-t ₃)·F(Hop,NN)

F (Hop, NN) be a value at the function of [0,1], described F (Hop, NN) is directly proportional to the jumping figure Hop of node, is inversely proportional to neighbours' quantity NN of node.

7. trouble-shooter according to claim 3, wherein, described trouble-shooter also comprises:

Node selected cell when the neighbor node of described first group is while being empty, is selected a neighbor node as the neighbor node of described first group from described second group; And, for the described neighbor node of selecting arranges the back off time of corresponding described first group.

8. trouble-shooter according to claim 7, wherein, described trouble-shooter also comprises:

Time transmitting element, sends to described back off time the described neighbor node of selecting, and makes described neighbor node store and use described back off time.

9. trouble-shooter according to claim 1, wherein, described diagnosis control unit also detects bag for controlling described root node broadcast; Make other diagnosis node when back off time countdown does not finish and receives described detection bag, no longer carry out the countdown of back off time.

10. a method for diagnosing faults, described method for diagnosing faults comprises:

When suspecting that node need to be diagnosed, start diagnosis node for the back off time of described suspection node; Wherein, by a plurality of neighbor nodes of described suspection node are divided into different groups, described back off time is set;

According to the countdown to described back off time, determine root node; Described root node is the diagnosis node that in a plurality of diagnosis node of described suspection node, back off time finishes at first;

Control described root node and start and set up diagnostic tree, and receive the diagnostic message that the node in described diagnostic tree sends, and diagnostic result is reported to gateway.

The method to set up of 11. 1 kinds of back off times, described method to set up comprises:

A plurality of neighbor nodes of node are divided into different groups;

For neighbor node on the same group not, different back off times is set, wherein the formed time range non-overlapping copies of the back off time of different groups.

12. methods to set up according to claim 11, wherein, are divided into different groups by a plurality of neighbor nodes of node and specifically comprise: according to communication distance, a plurality of neighbor nodes of node are divided into a plurality of different groups.

13. methods to set up according to claim 12, wherein, are divided into first group and second group according to communication distance by described a plurality of neighbor nodes;

Neighbor node in described first group and the communication distance of described node are less than or equal to R/2, and the neighbor node in described second group and the communication distance of described node are greater than R/2; Wherein, the communication range that described R is described node.

14. according to claim 11 to the method to set up described in 13 any one, wherein, adopts following rule that described back off time is set:

t ₀≤t ₁≤BO ₁≤t ₂<t ₃≤BO ₂≤t ₄

Wherein, BO ₁the back off time arranging for the neighbor node of first group, BO ₂it is the back off time arranging for the neighbor node of second group; t ₁, t ₂, t ₃, t ₄it is predetermined time; t ₀for diagnosis node detects the moment of suspecting node failure.

15. methods to set up according to claim 14, wherein,

BO ₁=t ₁+(t ₂-t ₁)·F(Hop,NN)

BO ₂=t ₃+(t ₄-t ₃)·F(Hop,NN)

F (Hop, NN) be a value at the function of [0,1], described F (Hop, NN) is directly proportional to the jumping figure Hop of node, is inversely proportional to neighbours' quantity of node.