CN107295536A - A kind of parallel diagnosis method of testing - Google Patents

A kind of parallel diagnosis method of testing Download PDF

Info

Publication number
CN107295536A
CN107295536A CN201710544051.4A CN201710544051A CN107295536A CN 107295536 A CN107295536 A CN 107295536A CN 201710544051 A CN201710544051 A CN 201710544051A CN 107295536 A CN107295536 A CN 107295536A
Authority
CN
China
Prior art keywords
node
diagnostic test
diagnosis
max
sensitive information
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.)
Granted
Application number
CN201710544051.4A
Other languages
Chinese (zh)
Other versions
CN107295536B (en
Inventor
王丽丹
张小菲
曾煜棋
程宝雷
林政宽
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou University
Original Assignee
Suzhou University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Suzhou University filed Critical Suzhou University
Priority to CN201710544051.4A priority Critical patent/CN107295536B/en
Publication of CN107295536A publication Critical patent/CN107295536A/en
Application granted granted Critical
Publication of CN107295536B publication Critical patent/CN107295536B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W24/00Supervisory, monitoring or testing arrangements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Testing Or Calibration Of Command Recording Devices (AREA)
  • Investigating Or Analysing Biological Materials (AREA)

Abstract

The present invention relates to a kind of sensor network fault nodal parallel diagnostic test method and system, by setting up based on the diagnostic test structure for treating diagnosis node, treat many wheel sensitive informations of diagnosis node peripheral part node progress to compare, judged to treat whether diagnosis node is malfunctioning node according to sensitive information result of the comparison.Using the parallel diagnosis method of testing and system of the present invention, unnecessary test can be largely reduced, it is to avoid occur signal conflict when signal is transmitted during diagnostic test, can also effectively reduce the time of diagnostic test.

Description

A kind of parallel diagnosis method of testing
Technical field:
The present invention relates to the sensor node in wireless sensor network field, more particularly to a kind of wireless sensor network Fault diagnosis method of testing.
Background technology:
Wireless sensor network is constituted by being deployed in substantial amounts of sensor node in monitored area, passes through side wireless communication One multihop self-organizing network of formula formation.Wireless sensor network can be used for monitoring and protection, medical treatment and nursing, the target of environment The field such as tracking and military detecting.In the most random placement of sensor node external environment out of office, network node quantity is huge, sensing Device type is various, network topology dynamic and the limited characteristic of node resource cause node that various failures occur often. Fault detect in wireless sensor network refers to that, when sensor node breaks down, the data that node is collected are probably It is incorrect, so as to cause wireless sensor network to the false judgment of monitoring information, particularly detection precise requirements compared with High application field, the accuracy of information is vital, so be to the fault detect of wireless sensor network must can not Few, it is also to be worth research.
Research on node failure detection algorithm has had a lot, is broadly divided into five classes:Based on majority vote rule Algorithm, the algorithm based on intermediate value strategy, the algorithm based on decision-making Diffusion Strategy, the algorithm based on weighting, the calculation based on sub-clustering Method.
When we think the node failure of some in awareness network whether state, traditional system diagnostics needs to receive breath network In all test result, then can judge the state of the node, in actual application, the testing time of this method is long And the electricity of consumption great deal of nodes.And based on majority vote rule algorithm, due to needing to treat all neighbours' sections around diagnosis node Point assists the node to be tested, and the use time of diagnostic test is directly proportional to neighbor node number.Meanwhile, the diagnosis of this method is surveyed Examination reliability is easily influenceed by neighbor node failures whether state.
Although the research of wireless sensor network fault diagnostic techniques has had significant progress, develop including certainly Diagnose, based on sub-clustering, based on polytype diagnostic mode including test etc..But as application of higher wireless sensor network is led The expansion in domain, the diversity and complexity of deployed environment bring new challenge, therefore research to the performance of fault diagnosis algorithm The new fault diagnosis algorithm for being applied to wireless sensor network under complex environment is significantly.In addition, in view of sensing The property of finite energy of device node itself, during system diagnostics is carried out on a large scale, it is unnecessary how to efficiently reduce Testing time, it is to avoid meaningless energy loss is also very important.
The content of the invention
This application provides a kind of fault diagnosis method of testing of the sensor node in wireless sensor network, it is only necessary to treats The test result of diagnosis node peripheral part node, largely reduces unnecessary test, and by using designed by the present invention Diagnostic test structure, it is to avoid during diagnostic test signal transmit when occur signal conflict, in addition, the present invention diagnostic test Method with parallel processing, can effectively reduce the time of diagnostic test.
In a first aspect, this application provides a kind of parallel diagnosis method of testing, this method comprises the following steps:
(1) determine to treat diagnosis node;
(2) judge whether to need to set up diagnostic test structure for the band diagnosis node, if it is, performing step (3), such as It is really no, directly perform step (4);
(3) set up based on the diagnostic test structure for treating diagnosis node;
(4) diagnostic test is performed according to diagnostic test structure;
(5) judged to treat whether diagnosis node is malfunctioning node according to diagnostic test results.
Preferably, the foundation specifically includes following steps based on the diagnostic test structure for treating diagnosis node:
By treating diagnosis node SuOr the maximum number of plies L of diagnostic test structure described in defaultmaxWith maximum child node number Cmax, wherein 1≤Cmax≤|N(Su) |, N (Su) it is to treat diagnosis node SuNeighbor node set.Generate SuCandidate's child node Collection, selects CmaxThe most node of individual neighbor node numberAs the first layer set of node of deagnostic structure;
For i-th layer of node SI, j, wherein 2≤i≤LmaxAnd 1≤j≤Cmax, determine node SI, jCandidate's child node collection AI, j.If | AI, j| >=1 and i < Lmax- 1, then in AI, jIn select that the candidate's child node conduct for possessing most neighbor nodes SI+1, jOr one candidate's child node of random selection is used as SI+1, j;If | AI, j| >=1 and i=Lmax- 1, then randomly choose one Candidate's child node is used as SI+1, j;If | AI, j|=0 or i=Lmax, then just stop choosing SI, jChild node.
Preferably, by SuWhole neighbor nodes candidate's child node collection is added to generate SuCandidate's child node collection.
Preferably, node S is determinedI, jCandidate's child node collection AI, jSpecially directly use SI, jNeighborhood generation AI, j
Preferably, node S is determinedI, jCandidate's child node collection AI, jSpecific method is:
To all and node SI, jAdjacent node y, node is put into if node y meets following two condition by node y SI, jCandidate's child node collection AI, jIn:
(1) node y and node SuDistance be equal to node SI, jWith node SuDistance add 1;
(2) node y and node SuI-th layer of deagnostic structure in except node SI, jOutside all nodes it is all non-conterminous.
Preferably, it is described to be specially according to the execution diagnostic test of diagnostic test structure:
First round diagnostic test:To 1 all≤j≤CmaxAndBy S3r-1, jTo S3r-2, jSensed Information compares, wherein, ljRepresent SuDeagnostic structure in jth arrange the actual maximum number of plies;
Second wheel diagnostic test:To 1 all≤j≤CmaxAndBy S3r, jTo S3r-1, jCarry out sensing letter Breath compares;
Third round diagnostic test:To 1 all≤j≤CmaxAndBy S3r+1, jTo S3r, jCarry out sensing letter Breath compares;
The sensitive information is more specific to be:
Node x is sent to node y compares request and sensing moment t;
Node x and y senses environmental information to obtain the sensing value v of oneself in moment t simultaneouslyxWith vy
Node y is by vyIt is sent to node x;
Node x is received after y measured value, by vxWith vyCompare, if | vx-vy|≤θ, wherein θ are the thresholds being previously set It is worth, then sensitive information comparative result C (x, y)=0;If | vx-vy| > θ, then sensitive information comparative result C (x, y)=1.
It is described to be judged to treat whether diagnosis node is that malfunctioning node is specially according to diagnostic test results:
To 1 all≤j≤Cmax, by S1, jCollect the sensitive information comparative result that three-wheel is completed before jth is listed in Then the comparative result is sent to Su;SuSelect sensing Since the first continuous 0 most that first node layer arranged of number of starting to S in information comparative resultuCarry out sensitive information ratio Compared with;If sensitive information result of the comparison is 0, S is judgeduIt is malfunctioning node;Otherwise, it is determined that SuIt is fault-free node.
Preferably, the environmental information includes temperature, humidity.
Second aspect, this application provides a kind of parallel diagnosis test system that 1-8 either method is required for perform claim System, the system includes:
Determining module, for determining to treat diagnosis node;
Judge module, diagnostic test structure is set up for judging whether to need for the band diagnosis node, if it is, logical Know that diagnostic test structure sets up module to set up based on the diagnostic test structure for treating diagnosis node, if it is not, then notifying diagnosis to survey Die trial block performs diagnostic test;
Diagnostic test structure sets up module, for setting up based on the diagnostic test structure for treating diagnosis node;
Diagnostic test module, for performing diagnostic test according to diagnostic test structure;
Diagnostic result judge module, for being judged to treat whether diagnosis node is malfunctioning node according to diagnostic test results.
Brief description of the drawings
Fig. 1 is parallel diagnosis method of testing flow chart of the present invention
Fig. 2 is based on the deagnostic structure schematic diagram for treating diagnosis node
Fig. 3 is the flow chart of the diagnostic test structure in structural map 2
Fig. 4 is the first round test schematic diagram of the embodiment of the present invention
Fig. 5 is the second wheel test schematic diagram of the embodiment of the present invention
Fig. 6 is the third round test schematic diagram of the embodiment of the present invention
Fig. 7 is the fourth round test schematic diagram of the embodiment of the present invention
Embodiment
Describe the specific embodiment of present inventive concept in detail now with reference to accompanying drawing.
First, the implication of the term for being used in the present invention is defined as follows:In wireless sensor network, if two Sensor node p and node q distance is within mutual communication radius, then it is adjacent just to claim the two nodes, that is, is saved Point p is the hop node apart from node q.We claim node p and node q distance to be k-hop, represent the fewest number of hops between p and q For k.Dis (p, q) is made to represent the distance between node p and node q.
As shown in figure 1, after the parallel diagnosis method of testing of the present invention starts, it is necessary first to determine whether to treat diagnosis section Point sets up diagnostic test structure, if it is not required, then directly starting diagnostic test, if it is desired, then construction is based on treating diagnosis section The diagnostic test structure of point;After the diagnostic test structure is constructed, diagnostic test is carried out using the diagnostic test structure.
Fig. 2 show it is exemplary based on the diagnostic test structural representation for treating diagnosis node, wherein, SuTo treat diagnosis section Point, the exemplary diagnostic test structure is one five layers of structure, the nodes that each layer includes can with it is identical can not also Together, S is madeI, jRepresent the node of i-th layer of jth row in the diagnostic test structure, niAll node numbers of i-th layer of expression.
The method for building up of above-mentioned diagnostic test structure is explained referring to Fig. 3.
We define the candidate's child node collection set up and used in the diagnostic test configuration process first, i.e.,:If node x is Treat diagnosis node Su, then x candidate's child node integrate all neighbor node collection as node x;If node x is to treat diagnosis node Su's I-th node layer (2≤i≤L in deagnostic structuremax- 1), then the selection mode of node x candidate's child node collection is as follows:
To all node ys adjacent with node x, node y is put into node x's if node y meets following two condition Candidate's child node is concentrated:
(1) node y and node SuDistance be equal to node x and node SuDistance add 1.
(2) node y and node SuI-th layer of deagnostic structure in all nodes in addition to node x it is all non-conterminous.
It is node S to make AuDeagnostic structure in x same layer all sets of node, and N (x) for node x neighbours save Point set, the generation code of node x candidate's child node collection is described as follows:
Input:Node x, treats diagnosis node Su
Output:Node x candidate's child node collection B
Referring to Fig. 3, setting up the method for the diagnostic test structure includes:
1. by treating diagnosis node SuOr the maximum number of plies L of diagnostic test structure described in defaultmaxWith maximum child node Number Cmax, wherein 1≤Cmax≤|N(Su) |, generate SuCandidate's child node collection, select CmaxThe individual most nodes of neighbor node number As the first layer set of node of deagnostic structure;Wherein, SuCandidate's child node integrate as node SuIt is all Neighbor node collection.
2. since the second layer, i-th layer of node S is selected as steps described belowI, j, wherein 2≤i≤LmaxAnd 1≤j≤ Cmax.We use set AI, jRepresent node SI, jCandidate's child node collection, as node SI, jIn the presence of, with above-mentioned candidate's child node collection Production method produce or directly use SI, jNeighborhood generation AI, j;If | AI, j| >=1 and i < Lmax- 1, then in AI, j In select that the candidate's child node for possessing most neighbor nodes as SI+1, jOr one candidate's child node conduct of random selection SI+1, j;If | AI, j| >=1 and i=Lmax- 1, then randomly choose candidate's child node and be used as SI+1, j;If | AI, j|=0 or i= Lmax, then just stop choosing SI, jChild node.
Assuming that Lmax=5 and CmaxWhen=4, Fig. 2 is shown for node SuThe exemplary diagnostic test structure set up, It will be appreciated by those skilled in the art that the diagnostic test structure is an exemplary diagnostic test structure, rather than uniquely Diagnostic test structure.
According to described in above-mentioned steps on treating diagnosis node SuDiagnostic test structure, can further perform diagnosis Operation, to obtain SuFailure whether state.The present invention is carried out using the temporal correlation of wireless sensor network sensitive information Diagnostic test.So-called temporal correlation, refers to what is gathered in physical space apart from two close nodes close at the time of Information can be same or like.C (x, y) is made to represent that node x carries out sensitive information result of the comparison to node y, if sensitive information phase Closely, then C (x, y)=0 is made;If conversely, sensitive information difference is larger, making C (x, y)=1.When node x wants to carry out with node y Sensitive information compares, then node x is sent to node y compares request and sensing moment t, and then x and y senses ring in moment t simultaneously Environment information is to obtain the sensing value v of oneselfxWith vy(such as sensing temperature, humidity), and y sends vyTo x.When x receives y measurement After value, by vxWith vyCompare, if | vx-vy|≤θ, wherein θ are the threshold values being previously set, then illustrate x and y measured value Difference be that is, sensitive information is close in the difference range of permission, then C (x, y)=0;If | vx-vy| > θ, i.e. sensitive information Difference is larger, then C (x, y)=1.
Make ljRepresent SuDeagnostic structure in jth arrange the actual maximum number of plies.The process of diagnostic test is detailed below, The process one is divided into four-wheel, sequentially carries out.All diagnostic tests in each round can be carried out parallel simultaneously.
First round diagnostic test:To 1 all≤j≤CmaxAndBy S3r-1, jTo S3r-2, jSensed Information compares.That is, carrying out sensing letter to 1+3i node layers to the 2+3i node layers of all diagnostic test structures Breath compares, i=0, and 1,2 ....
Second wheel diagnostic test:To 1 all≤j≤CmaxAndBy S3r, jTo S3r-1, jCarry out sensing letter Breath compares.That is, carrying out sensitive information to 2+3i node layers to the 3+3i node layers of all diagnostic test structures Compare, i=0,1,2 ....
Third round diagnostic test:To 1 all≤j≤CmaxAndBy S3r+1, jTo S3r, jCarry out sensing letter Breath compares.That is, carrying out sensitive information to 3+3i node layers to the 4+3i node layers of all diagnostic test structures Compare, i=0,1,2 ....
Fourth round diagnostic test:To 1 all≤j≤Cmax, S first1, jCollect the sensing that three-wheel is completed before this is listed in Information comparative resultThen the comparative result is sent to Su。SuThe first node layer of that most row of continuous 0 number since the first in sensitive information comparative result is selected to SuCarry out Sensitive information compares.If sensitive information result of the comparison is 0, S is judgeduIt is malfunctioning node;Otherwise, it is determined that SuIt is fault-free section Point.
As shown in figure 4, Bold arrows represent the diagnostic operation of first round execution.Because the maximum number of plies of each row is divided herein Not Wei 5,3,4,5, so in the first round simultaneously use node S2,1Test node S1,1, use node S2,2Test node S1,2, use node S2,3Test node S1,3, use node S2,4Test node SIsosorbide-5-Nitrae, use node S5,1Test node S4,1, use node S5,4Test node S4,4
As shown in figure 5, Bold arrows represent the diagnostic operation that the second wheel is performed.Node S is used in second wheel simultaneously3,1Test Node S2,1, use node S3,2Test node S2,2, use node S3,3Test node S2,3, use node S3,4Test node S2,4
As shown in fig. 6, Bold arrows represent the diagnostic operation that third round is performed.Node S is used in third round simultaneously4,1Test Node S3,1, use node S4,3Test node S3,3, use node S4,4Test node S3,4
As shown in fig. 7, the test result sequence of four row nodes is respectively:< 0,0,0,0 >, < 0,0 >, < 0,1,0 >, The > of < 0,0,1,0.Obviously in first row, four continuous 0 and continuous 0 number are begun with this four sequences most from first place It is many, therefore selection node S1,1Diagnosis node S is treated to testu.It must be noted that, it is assumed that it is the > of < 1,1,0,0,1 to have a sequence, Because the first place numeral of sequence is 1, the sequence continuous 0 number since the first is 0.
Present invention also provides a kind of parallel diagnosis test system, the system includes:
Determining module, for determining to treat diagnosis node;
Judge module, diagnostic test structure is set up for judging whether to need for the band diagnosis node, if it is, logical Know that diagnostic test structure sets up module to set up based on the diagnostic test structure for treating diagnosis node, if it is not, then notifying diagnosis to survey Die trial block performs diagnostic test;
Diagnostic test structure sets up module, for setting up based on the diagnostic test structure for treating diagnosis node;
Diagnostic test module, for performing diagnostic test according to diagnostic test structure;
Diagnostic result judge module, for being judged to treat whether diagnosis node is malfunctioning node according to diagnostic test results.
Diagnostic test of the diagnostic test mode of the present invention for treating diagnosis node only needs to collect the node periphery merogenesis The test result of point, largely reduces unnecessary test, and the diagnostic test method is surveyed using the diagnosis designed by the present invention Structure is tried, the problem of occurring signal conflict when signal can be avoided to transmit during diagnostic test.
In addition, the time of parallel processing, effectively reduction diagnostic test is capable of in the diagnostic test of the diagnostic test method.Due to Diagnostic test needs to collect based on the diagnostic test results in deagnostic structure, while road wheel is entered in the diagnostic test in a parallel fashion Test, so the time of diagnostic test be approximately equal to signal transmission used in the time, that is, with treating in diagnostic test structure The distance of the farthest node of diagnostic test nodal distance, is then tested the spent time plus single diagnosis again, and diagnosis is surveyed Total cost time of examination is shorter.
Above example is merely to illustrate the present invention, and not limitation of the present invention, about the common skill of technical field Art personnel, without departing from the spirit and scope of the present invention, can also make a variety of changes and modification, therefore all etc. Same technical scheme falls within scope of the invention, and scope of patent protection of the invention should be defined by the claims.

Claims (9)

1. a kind of sensor network fault nodal parallel diagnostic test method, this method comprises the following steps:
(1) determine to treat diagnosis node;
(2) judge whether to need to set up diagnostic test structure for the band diagnosis node, if it is, step (3) is performed, if It is no, directly perform step (4);
(3) set up based on the diagnostic test structure for treating diagnosis node;
(4) diagnostic test is performed according to diagnostic test structure;
(5) judged to treat whether diagnosis node is malfunctioning node according to diagnostic test results.
2. parallel diagnosis method of testing as claimed in claim 1, it is characterised in that:
The foundation specifically includes following steps based on the diagnostic test structure for treating diagnosis node:
By treating diagnosis node SuOr the maximum number of plies L of diagnostic test structure described in defaultmaxWith maximum child node number Cmax, Wherein 1≤Cmax≤|N(Su) |, N (Su) it is to treat diagnosis node SuNeighbor node set, by SuNeighbor node concentrate select CmaxIndividual nodeAs the first layer set of node of deagnostic structure;
For i-th layer of node SI, j, wherein 2≤i≤LmaxAnd 1≤j≤Cmax, determine node SI, jCandidate's child node collection AI, j
If | AI, j| >=1 and i < Lmax- 1, then in AI, jIn select that the candidate's child node conduct for possessing most neighbor nodes SI+1, jOr one candidate's child node of random selection is used as SI+1, j;If | AI, j| >=1 and i=Lmax- 1, then randomly choose one Candidate's child node is used as SI+1, j;If | AI, j|=0 or i=Lmax, then just stop choosing SI, jChild node.
3. parallel diagnosis method of testing as claimed in claim 2, it is characterised in that:
Determine node SI, jCandidate's child node collection AI, jSpecially directly use SI, jNeighborhood generation AI, j
4. parallel diagnosis method of testing as claimed in claim 2, it is characterised in that:
Determine node SI, jCandidate's child node collection AI, jSpecific method is:
To all and node SI, jAdjacent node y, node S is put into if node y meets following two condition by node yI, j's Candidate's child node collection AI, jIn:
(1) node y and node SuDistance be equal to node SI, jWith node SuDistance add 1;
(2) node y and node SuI-th layer of deagnostic structure in except node SI, jOutside all nodes it is all non-conterminous.
5. any parallel diagnosis method of testing as described in claim 2-4, it is characterised in that:
It is described to be specially according to the execution diagnostic test of diagnostic test structure:
First round diagnostic test:To 1 all≤j≤CmaxAndBy S3r-1, jTo S3r-2, jCarry out sensitive information ratio Compared with, wherein, ljRepresent SuDeagnostic structure in jth arrange the actual maximum number of plies;
Second wheel diagnostic test:To 1 all≤j≤CmaxAndBy S3r, jTo S3r-1, jCarry out sensitive information ratio Compared with;
Third round diagnostic test:To 1 all≤j≤CmaxAndBy S3R+1, jTo S3r, jCarry out sensitive information ratio Compared with.
6. parallel diagnosis method of testing as claimed in claim 5, it is characterised in that:
The sensitive information is more specific to be:
Node x is sent to node y compares request and sensing moment t;
Node x and y senses environmental information to obtain the sensing value v of oneself in moment t simultaneouslyxWith vy
Node y is by vyIt is sent to node x;
Node x is received after y measured value, by vxWith vyCompare, if | vx-vy|≤θ, wherein θ are the threshold values being previously set, then Sensitive information comparative result C (x, y)=0;If | vx-vy| > θ, then sensitive information comparative result C (x, y)=1.
7. parallel diagnosis method of testing as claimed in claim 6, it is characterised in that:
It is described to be judged to treat whether diagnosis node is that malfunctioning node is specially according to diagnostic test results:
To 1 all≤j≤Cmax, by S1, jCollect the sensitive information comparative result that three-wheel is completed before jth is listed in Then the comparative result is sent to Su;SuSelect sensing Since the first continuous 0 most that first node layer arranged of number of starting to S in information comparative resultuCarry out sensitive information ratio Compared with;If sensitive information result of the comparison is 0, S is judgeduIt is malfunctioning node;Otherwise, it is determined that SuIt is fault-free node.
8. parallel diagnosis method of testing as claimed in claim 6, it is characterised in that:
The environmental information includes temperature, humidity.
9. a kind of sensor network fault nodal parallel diagnostic test system that 1-8 either method is required for perform claim, should System includes:
Determining module, for determining to treat diagnosis node;
Judge module, diagnostic test structure is set up for judging whether to need for the band diagnosis node, if it is, notifying to examine Disconnected test structure sets up module to set up based on the diagnostic test structure for treating diagnosis node, if it is not, then notifying diagnostic test mould Block performs diagnostic test;
Diagnostic test structure sets up module, for setting up based on the diagnostic test structure for treating diagnosis node;
Diagnostic test module, for performing diagnostic test according to diagnostic test structure;
Diagnostic result judge module, for being judged to treat whether diagnosis node is malfunctioning node according to diagnostic test results.
CN201710544051.4A 2017-07-05 2017-07-05 Parallel diagnosis test method Active CN107295536B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710544051.4A CN107295536B (en) 2017-07-05 2017-07-05 Parallel diagnosis test method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710544051.4A CN107295536B (en) 2017-07-05 2017-07-05 Parallel diagnosis test method

Publications (2)

Publication Number Publication Date
CN107295536A true CN107295536A (en) 2017-10-24
CN107295536B CN107295536B (en) 2020-07-07

Family

ID=60100386

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710544051.4A Active CN107295536B (en) 2017-07-05 2017-07-05 Parallel diagnosis test method

Country Status (1)

Country Link
CN (1) CN107295536B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101516099A (en) * 2009-04-07 2009-08-26 华中科技大学 Test method for sensor network anomaly
CN101867486A (en) * 2010-06-08 2010-10-20 江苏大学 Wireless sensor network fault diagnosis method
CN101959218A (en) * 2009-10-25 2011-01-26 苏州大学 Method for detecting event region based on splay tree
CN102170648A (en) * 2011-01-28 2011-08-31 北京浩阳华夏科技有限公司 Passive diagnosis method of wireless sensor network
CN102802182A (en) * 2012-08-09 2012-11-28 无锡赛睿科技有限公司 Fault diagnosis device and method for wireless sensor network
CN103491651A (en) * 2013-09-25 2014-01-01 河海大学 Abnormal/fault positioning detection method based on binomial tree model
US20140362711A1 (en) * 2013-06-11 2014-12-11 Jin Jiang Performance monitor, evaluation and diagnosis system for wireless sensor networks
CN104486113A (en) * 2014-12-11 2015-04-01 重庆邮电大学 Fault link positioning method based on active greed and passive greed in sensor network
US9363626B2 (en) * 2014-01-27 2016-06-07 City University Of Hong Kong Determining faulty nodes within a wireless sensor network

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101516099A (en) * 2009-04-07 2009-08-26 华中科技大学 Test method for sensor network anomaly
CN101959218A (en) * 2009-10-25 2011-01-26 苏州大学 Method for detecting event region based on splay tree
CN101867486A (en) * 2010-06-08 2010-10-20 江苏大学 Wireless sensor network fault diagnosis method
CN102170648A (en) * 2011-01-28 2011-08-31 北京浩阳华夏科技有限公司 Passive diagnosis method of wireless sensor network
CN102802182A (en) * 2012-08-09 2012-11-28 无锡赛睿科技有限公司 Fault diagnosis device and method for wireless sensor network
US20140362711A1 (en) * 2013-06-11 2014-12-11 Jin Jiang Performance monitor, evaluation and diagnosis system for wireless sensor networks
CN103491651A (en) * 2013-09-25 2014-01-01 河海大学 Abnormal/fault positioning detection method based on binomial tree model
US9363626B2 (en) * 2014-01-27 2016-06-07 City University Of Hong Kong Determining faulty nodes within a wireless sensor network
CN104486113A (en) * 2014-12-11 2015-04-01 重庆邮电大学 Fault link positioning method based on active greed and passive greed in sensor network

Also Published As

Publication number Publication date
CN107295536B (en) 2020-07-07

Similar Documents

Publication Publication Date Title
CN102340811B (en) Method for carrying out fault diagnosis on wireless sensor networks
CN101959218B (en) Method for detecting event region based on splay tree
Sugiarto et al. Data classification for air quality on wireless sensor network monitoring system using decision tree algorithm
CN103023589A (en) Indoor passive motion detection method and device
CN107332691A (en) A kind of method for detecting failure nodes of wireless sensor network
CN107426741A (en) A kind of wireless sensor network fault diagnosis method based on immune mechanism
CN101459914A (en) Wireless sensor network node coverage optimization method based on ant colony algorithm
CN109698724A (en) Intrusion detection method, device, equipment and storage medium
CN103533571A (en) FEDAV (fault-tolerant event detection algorithm based on voting)
Mohapatra et al. Artificial immune system based fault diagnosis in large wireless sensor network topology
CN104902509A (en) Abnormal data detection method based on top-k(sigma) algorithm
CN104125572B (en) The Sybil attack detection methods cooperated based on node
Zhang et al. Cooperative sensor anomaly detection using global information
Saihi et al. Decentralized fault detection in wireless sensor network based on function error
Xu et al. Distributed fault diagnosis of wireless sensor networks
CN107295536A (en) A kind of parallel diagnosis method of testing
CN101750150B (en) Power station boiler air pre-heater hot spot detection method based on infrared sensor array
CN106130780A (en) A kind of IP network Fault Locating Method based on static Bayesian model
CN110266527B (en) Sensor node fault classification alarm method and device based on spatial correlation
Weber et al. Diagnosability evaluation for a system-level diagnosis algorithm for wireless sensor networks
CN111479235A (en) Formalization method for detecting wireless sensor network node
CN110446223A (en) A kind of wireless sensor network covering hole detection method and system
Khelifi et al. Design and experimental implementation of monitoring system in wireless sensor networks
Surya et al. Deployment of backup sensors in wireless sensor networks for structural health monitoring
Banerjee et al. Performance analysis of distributed intermittent fault diagnosis in wireless sensor networks using clustering

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