CN106332131B - A kind of clone's nodal test method and system of wireless sensor network - Google Patents
A kind of clone's nodal test method and system of wireless sensor network Download PDFInfo
- Publication number
- CN106332131B CN106332131B CN201510387230.2A CN201510387230A CN106332131B CN 106332131 B CN106332131 B CN 106332131B CN 201510387230 A CN201510387230 A CN 201510387230A CN 106332131 B CN106332131 B CN 106332131B
- Authority
- CN
- China
- Prior art keywords
- requesting node
- information
- node
- communication
- suspection
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
A kind of clone's nodal test method and system of wireless sensor network, the wireless sensor network is equipped with credit system, by generating the suspection information of the correspondence type about requesting node, generates and suspect item, the current credit value with item with suspicion of requesting node is calculated；Whether it is greater than whether requesting node described in threshold decision is clone's node by the priori credit value and the poor of the current credit value that judge the requesting node.This method utilizes the characteristics of credit system to complete detection, does not increase extra computation amount, and compared to existing SDGL detection method, the present invention does not need to carry out location Calculation, saves software and hardware resources.Also, this method combines the distinctive historical factor of credit system and other nodes judge weight, reduces False Rate.
Description
Technical field
The present invention relates to wireless sensor network technology fields, more specifically to a kind of wireless sensor network
Clone nodal test method and system.
Background technique
Wireless sensor network (wireless sensor networks, WSN) is the emerging technology for perceiving the world, and
The important component of Internet of Things front end perception.It is made of a large amount of wireless sensors, and each wireless sensor is saved as one
Point is collected the information in its effective range and is reported to system, to form information network.Meanwhile it can be carried out between node
It communicates two-by-two, and the communication behavior between node, it is necessary to meet the rule of communication of its corresponding topological mode.
It can establish credit system in wireless sensor network, it is a kind of that for synchronizing, positioning, data, which converge weighting etc.,
Effectively improve system reliability, the method for safety.In credit system, each node all has credit value, and can calculate, repair
Change and saves the credit value of itself and there is the credit value of other nodes of communication behavior therewith.The calculating process of credit value is such as
Under: after initial prestige is established, when certain node is interacted with the destination node for meeting rule of communication, believe initial credit value as priori
Observed result after reputation value, with observed object nodes ' behavior is integrated, and the current credit value about destination node is calculated.
When being interacted with this destination node next time, current credit value at this time is as the priori credit value for having rated prior distribution
It participates in the calculating of new current credit value.
Wireless sensor network is subject to a variety of malicious attacks or invasion.Cloning node attack (clones attack) is
One of most typically and the attack form of most serious in wireless sensor network physical layer refer to that attacker is produced by puppet and meet network rule
Model or existing one or more node identifications upset the communication of original sensing layer in network.Clone's node attack would generally be broken
Bad routing mechanism, distributed storage mechanism and data syncretizing mechanism, and then cause data that can not reach observer or wireless sensing
The data of network storage error of transmission, cause leakage of information and system disorders, can significantly drop to its successful detection and interception
Low sensing layer threatens, and guarantees the data acquisition and transmission safety of wireless sensor network.
Existing clone's nodal test method is many kinds of, wherein SDGL (Static Distributed Grid
Local area, the latticed part of static distribution formula) clone's nodal test, it is considered convenient for operation, and be suitble to wireless sense network
The characteristics of network.Such method disposes WSN network by gridding, determines the specific position of node deployment, when navigating to a section
When point should have region far from it, location information and grouping situation to the node are compared, and determine cloning attack.However, this
Kind detection method, needs to carry out location Calculation, expends software and hardware resources.
Summary of the invention
In view of this, being not necessarily to the present invention provides a kind of clone's nodal test method and system of wireless sensor network
Location Calculation is carried out, software and hardware resources are saved.
To achieve the above object, the invention provides the following technical scheme:
A kind of clone's nodal test method of wireless sensor network, the wireless sensor network are equipped with credit system,
This method comprises:
When receiving the communication request that any node in the sensor network is sent, saved the node as request
Whether point, the communication request for judging that the requesting node is sent meet rule of communication；
When the communication request is unsatisfactory for rule of communication, it is believed that the requesting node is clone's node, is refused described logical
Letter is requested, and the type of rule of communication is unsatisfactory for according to the communication request, reduces the credit value of the requesting node, is generated and is closed
The suspection information is issued in the suspection information of the correspondence of the requesting node type, and to other nodes；
When the communication request meets rule of communication, the paid-in suspection information about the requesting node is detected,
According to the type and number for suspecting information, generates and suspect item, calculate the current letter with item with suspicion of the requesting node
Reputation value；
Whether the difference of the priori credit value and the current credit value that judge the requesting node is greater than threshold value；
If it is, thinking that the requesting node for clone's node, refuses the communication request, reduces the requesting node
Current credit value, generate suspection information about the requesting node, and the suspection information is issued to other nodes.
Preferably, further includes:
If it is not, then updating the credit value of the requesting node, communicated；
The communication includes sending to suspect information to the requesting node, alternatively, receiving the bosom that the requesting node is sent
Doubt information.
Preferably, the paid-in suspection information about the requesting node of detection, according to the suspection information
Type and number generate and suspect item, comprising:
The type and number for the suspection information about the requesting node that detection receives when communicating with other nodes；
It generates and suspects item J, J=α1N1+α2N2+...+αmNm；
Wherein, N1The number of information, α are suspected for the 1st class about the requesting node that other described nodes are sent1For
1st class suspects the corresponding weight factor of information；
N2The number of information, α are suspected for the 2nd class about the requesting node that other described nodes are sent2It is described
2 classes suspect the corresponding weight factor of information；
…
NmThe number of information, α are suspected for the m class about the requesting node that other described nodes are sentmIt is described
M class suspects the corresponding weight factor of information；
Wherein, the N1、N2..., NmFor nonnegative integer, the m is positive integer, the α1、α2、…、αmRespectively less than 0.
Preferably, the current credit value with item with suspicion for calculating the requesting node, comprising:
The suspection item J is added in this observed result, then this observation of the requesting node are as follows:
Wherein, β1, β2..., βKThe requesting node the 1st, 2 ... after this is observed is respectively corresponded, k kind behavior occurs
Number.
Preferably, whether the communication request for judging that the requesting node is sent meets rule of communication, comprising:
Judge whether the requesting node is with group requesting node；
When the requesting node is same group node, judge that the physical address of the requesting node and local physical address are
It is no consistent；If it is, thinking the requesting node for clone's node, the communication request is unsatisfactory for rule of communication, and described
The type that communication request is unsatisfactory for rule of communication is the first kind；If it is not, then the communication request meets communication behavior rule；
When the requesting node is not same group node, judge whether the requesting node is chaos node, if it is not, then
The requesting node is thought for clone's node, and the communication request is unsatisfactory for rule of communication, and the communication request is unsatisfactory for leading to
The type of letter rule is the second class；If so, judge to mark between whether the communication behavior of the requesting node meets group, if
It is no, then it is assumed that the requesting node is clone's node, and the communication request is unsatisfactory for rule of communication, and the communication request is discontented
The type of sufficient rule of communication is the second class；If it is, the communication request meets rule of communication.
Preferably, the type that rule of communication is unsatisfactory for according to the communication request, reduces the letter of the requesting node
Reputation value generates the suspection information of the correspondence type about the requesting node, and issues the suspection to other nodes and believe
Breath, comprising:
When the type that the communication request is unsatisfactory for rule of communication is the first kind, the credit value of the requesting node is reduced
It is insincere, 1st class suspection information of the generation about the requesting node, to the publication of other described nodes about request section
1st class of point suspects information；
When the type that the communication request is unsatisfactory for rule of communication is the second class, the prestige of the requesting node is reduced
Value generates and suspects information about the 2nd class of the requesting node, to the publication of other described nodes about the requesting node the
2 classes suspect information.
Preferably, the suspection information about the requesting node is generated, and the suspection information, packet are issued to other nodes
It includes:
It generates and suspects information about the 2nd class of the requesting node, the publication of other described nodes is saved about the request
2nd class of point suspects information.
Preferably, the weight factor α2Less than the weight factor α1。
It is preferably, described to judge whether the requesting node is with group requesting node, comprising:
Classify to the group ID of the requesting node parsed, judges the group ID of the requesting node and the group of local
Whether ID is consistent.
It is preferably, described to judge whether the requesting node is chaos requesting node, comprising:
Judge whether the requesting node has chaotic region mark.
Preferably, the communication behavior for judging the requesting node marks between whether meeting group, comprising:
Whether judge in the mark of the chaotic region of the requesting node comprising the local group ID.
Preferably, other described nodes are neighbor node.
Preferably, the 1st class suspects that information is self-doubt information, and the 2nd class suspects that information is to suspect letter indirectly
Breath.
A kind of clone's nodal test system of wireless sensor network, the detection system include: judgment module, information life
At module, communication module and computing module；
The judgment module is used to receive the communication request of any node transmission, using the node as requesting node, judgement
Whether the communication request that the requesting node is sent meets rule of communication；When the communication request is unsatisfactory for rule of communication, institute
It states judgment module and determines that the communication request is unsatisfactory for the type of rule of communication, send the result information of the corresponding type to institute
State information generating module and the computing module；When the communication request meets rule of communication, detection instruction is sent to described
Computing module；
The information generating module is used for after receiving result information, generates corresponding suspection information, and by the bosom
Doubtful information is sent to the communication module；
The communication module is used to send the suspection information of information generating module generation to other nodes；Alternatively, receiving institute
The suspection information of other nodes sent is stated, and received suspection information is sent to computing module；
Computing module is used for after receiving the result information that judgment module is sent, and according to result information, reduces institute
The credit value of requesting node is stated, and saves the credit value；
Alternatively, computing module is used for after receiving the detection instruction that judgment module is sent, detect from communication module
The suspection information about the requesting node received generates according to the type and number for suspecting information and suspects item, meter
The current credit value with item with suspicion of the requesting node is calculated, and the priori credit value for calculating the requesting node is worked as with described
The difference is compared by the difference of preceding credit value with threshold value；
If the difference is greater than threshold value, the current credit value of the requesting node is reduced, and save the credit value, sent
Corresponding result information generates to information generating module and suspects information, the suspection information is sent to other by communication module
Node；If the difference is not more than threshold value, the second verification information is sent to communication module, is saved by communication module and the request
Point is communicated.
Preferably, the communication module is communicated with the requesting node, comprising: the communication module, which is sent, suspects letter
Breath is to the requesting node, alternatively, receiving the suspection information that the requesting node is sent.
Preferably, described to detect the suspection information about the requesting node received from communication module, according to institute
The type and number for suspecting information are stated, generates and suspects item, comprising:
Detect the type and number of the suspection information about the requesting node received from communication module；
It generates and suspects item J, J=α1N1+α2N2+...+αmNm；
Wherein, N1The number of information, α are suspected for the 1st class about the requesting node that other described nodes are sent1For
1st class suspects the corresponding weight factor of information；
N2The number of information, α are suspected for the 2nd class about the requesting node that other described nodes are sent2It is described
2 classes suspect the corresponding weight factor of information；
…
NmThe number of information, α are suspected for the m class about the requesting node that other described nodes are sentmIt is described
M class suspects the corresponding weight factor of information；
Wherein, the N1、N2..., NmFor nonnegative integer, the m is positive integer, the α1、α2、…、αmRespectively less than 0.
Preferably, the current credit value with item with suspicion for calculating the requesting node, comprising:
The suspection item J is added in this observed result, then this observation of the requesting node are as follows:
Wherein, β1, β2..., βKThe requesting node the 1st, 2 ... after this is observed is respectively corresponded, k kind behavior occurs
Number.
Compared with prior art, the technical scheme provided by the invention has the following advantages:
The present invention proposes a kind of clone's nodal test method and system of wireless sensor network, utilizes the spy of credit system
Point completes detection, does not increase extra computation amount, compared to existing SDGL detection method, the present invention does not need to carry out positioning meter
It calculates, saves software and hardware resources.
Also, this method combines the distinctive historical factor of credit system and other nodes judge weight, reduces erroneous judgement
Rate.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The embodiment of invention for those of ordinary skill in the art without creative efforts, can also basis
The attached drawing of offer obtains other attached drawings.
Fig. 1 is circular of the wireless sensor network about destination node credit value；
Fig. 2 is clone's nodal test method flow diagram of the wireless sensor network of the embodiment of the present invention one；
Fig. 3 is the node traffic diagram of the embodiment of the present invention two.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
As described in background, existing SDGL detection and defence policies, need to carry out location Calculation, expend software and hardware
Resource.Inventor can effectively detect the study found that the credit system using wireless sensor network carries out clone's nodal test
Clone's node in network.Thus a kind of clone's nodal test method of wireless sensor network, the wireless sensor are proposed
Network is equipped with credit system, this method comprises: when the communication request for receiving any node transmission in the sensor network
When, using the node as requesting node, whether the communication request for judging that the requesting node is sent meets rule of communication；When described
When communication request is unsatisfactory for rule of communication, it is believed that the requesting node is clone's node, refuses the communication request, and according to institute
The type that communication request is unsatisfactory for rule of communication is stated, the credit value of the requesting node is reduced, is generated about the requesting node
The correspondence type suspection information, and the suspection information is issued to other nodes；It is communicated when the communication request meets
When regular, the paid-in suspection information about the requesting node is detected, it is raw according to the type and number for suspecting information
At item is suspected, the current credit value with item with suspicion of the requesting node is calculated；Judge the priori prestige of the requesting node
Whether value and the difference of the current credit value are greater than threshold value；If it is, thinking that the requesting node for clone's node, refuses institute
Communication request is stated, the current credit value of the requesting node is reduced, generates the suspection information about the requesting node, and to it
He issues the suspection information by node.
Detection method proposed by the present invention does not increase extra computation amount using completing to detect the characteristics of credit system；It compares
In existing SDGL detection method, the present invention does not need to carry out location Calculation, saves software and hardware resources.Also, this method combines
Credit system distinctive historical factor and neighbor request node judge weight, reduce False Rate.
It is core of the invention thought above, to keep the above objects, features and advantages of the present invention more obvious easily
Understand, specific embodiments of the present invention will be described in detail with reference to the accompanying drawing.
In the following description, numerous specific details are set forth in order to facilitate a full understanding of the present invention, but the present invention can be with
Implemented using other than the one described here other way, those skilled in the art can be without prejudice to intension of the present invention
In the case of do similar popularization, therefore the present invention is not limited by the specific embodiments disclosed below.
In the following, it is abundant to disclose the present invention, before the embodiment of the present invention is described in detail, to the institute of detection method of the present invention
Applicable wireless sensor network is described:
Firstly, the credit system about wireless sensor network:
Credit system refers to, when source node is interacted with destination node, carries out base to destination node according to interaction historical information
In the evaluation of prior distribution, and predict the behavior of destination node.After interacting with destination node, source node monitoring destination node is
It is no to perform required behavior, and observed result and prior distribution are integrated, obtain the credit value based on Posterior distrbutionp.
In wireless sensor network, establishes credit system and be widely used in a variety of main skills such as synchronous, positioning, data convergence weighting
Art is a kind of to effectively improve system reliability, the method for safety.
Credit system mainly predicts the behavior of destination node according to Bayes procedure:
WhereinIt is dirichlet distribution, is the prior probability distribution based on historical data, indicates this interaction
When by the calculated destination node behavior of history observed result probability distribution,It is multinomial probability distribution, characterization
This interaction observation as a result,It is dirichlet distribution, is according to history prior distribution and this observed result meter
The Posterior probability distribution obtained.The Posterior distrbutionp function once interacted is regarded as the prior density function of interaction next time.
As shown in Figure 1, the credit value of destination node is the history prestige and this observed result according to destination node, calculate
Obtain current credit value.The circular of current credit value are as follows: false for the destination node with K dimension probability vector
If the history at its a certain moment observes result vector are as follows:This observed result are as follows:The then observed result vector after this observation are as follows:
That is:
Current credit value after this observation is the mathematic expectaion that dirichlet Posterior distrbutionp is weighted with historical factors, it may be assumed that
The credit value of priori dirichlet distribution when this numerical value is observed as next time simultaneously.
Various middle αkIt is the number that destination node kth kind behavior occurs, prestigeBe also K dimension, wherein each
Dimension represents destination node and carries out the probability for meeting specified conditions behavior, and the sum of all dimensions are equal to 1.Below to wherein parameter
It is set for illustrating.
Parameter C is referred to as priori constant, it reflects networking initial stage (or network initial stage is added in node) observation knot several times
Whether fruit can significantly affect credit value.If C is set smaller, initial n times observation is affected to prestige, if C
What is be set is larger, then initial n times observation influences prestige smaller.
Parameter bkFor initial basic vector, it reflects in network initialization procedure (or during new node networking) each section
The initial prior probability distribution of point.When network is just established, αk=0, then initial prestige beFor
B is usually taken in peer-to-peer network1=b2=...=bk=1/k.In this way, node is to each row for meeting specified conditions when initialization
For a possibility that it is all the same.If object is asymmetrical network, such as there are high weight node in network, initialize basic vector according to
Different weights are adjusted, but must satisfy condition
Parameter μ is historical factors, it reflects influence of the history value to prestige.When μ value is larger, history value is to credit value
It is affected, and when μ value is smaller, Current observation value is affected to credit value.When system is relatively stable, generally use larger
μ value to guarantee the stability of network, when system is in fluctuation status, generallys use lesser μ value and enable credit system
Enough adapt to the variation of network.
Secondly, the correlation model about wireless sensor network detection:
Network model (Network model): clone's section of the wireless sensor network described in the embodiment of the present invention two
Point detecting method belongs to SDGL detection deployment, and specific network model is as follows: setting wireless sensor network includes a large amount of sections
Point, position just do not change and (cause unless there are irresistible external force) after correct deployment, but its routing and topology side
Formula can carry out self-organizing according to the different situations of node.The data of whole network are finally pooled to a base by routing transmitting
It stands on (Base station, BS).Status of all nodes in the detection method in addition to base station is identical, that is, is detected as being distributed
Formula detection.It is all to have bi-directional transfer path in the presence of between the node communicated two-by-two.Each node knows the node object of itself
Address is managed, and understands the address space of present networks by native protocol stack.In the present invention, do not consider the problems of time synchronization,
Assume that the time of all nodes is synchronous, and give out a contract for a project between each node there is no transmission delay and collide, is i.e. hypothesis institute
Some packets should reach immediately when normally receiving.
Traffic model (Communication model): in the present invention, it is believed that base station is recognized not by energy constraint
It to be trusted objects (Trustworthy object), therefore is reliable information from base station to the information that whole network is broadcasted
(authentic message).According to the communication distance of itself as radius, other nodes established in circumference range are node
Possible communication object.
Data model (Date model): in the present invention, setting data packet is transmitted in Internet of Things contains source address
(source address) and destination address (destination address).
Challenge model (Attack model): in the present invention, it is believed that attacker passes through one or more in duplicate network
A existing point does not exist a little, that is, forges clone's node, carries out meeting the logical of protocol specification with normal trusted node completely
Letter.Other than identity duplication, in the detection-phase of the invention carried out and there is no other apparent external attack characteristics, including
Sybil attack, Worm-hole attack, black hole attack, selective forwarding attack, Denial of Service attack etc..Also, clone's node
Purpose be for potential information stealth etc., but be not precluded when clone node achieve the trust of network and then carry out
A possibility that stating attack.The present invention only captures for cloning attack initial attack person and replicates the section in small percentage of network
Point, and existing network order is upset using these nodes.
Finally, with regard to the constraint condition of wireless sensor network SDGL detection method:
Network is detected before deployment, institute's cloth node is grouped previously according to sequencing, in each group
It is common at a group ID (Group ID) that node has one, and this group of ID passes through certain not modifiable mode (such as hardware programming)
It is present on node, therefore can only be inherited in replica node without that can be modified.Node in same group can carry out two-by-two
Communication, the node in group edge can communicate with this group and neighbours' group, the point in group cannot in other groups
Node is communicated.
Initial stage is disposed in detected network, all nodes are trusted node, and there are no the presence of external replication attacks, therefore
Credit system can be correctly completed initialization and establish, and all initialization credit values also really reflect network traffic conditions.
In being detected network, before joining the network, the allocated (voluntarily generation/decoding) meets net to clone's node
The key of network agreement, the normal node that can disguise oneself as are communicated with other points.In the detection process, each position in network
A possibility that node (routing, terminal) is forged.And clone node itself and do not have the destruction to being forged a little, i.e., only
It is the duplication in identity, original node may be replaced, it is also possible to still be existed in a network.In the present invention, road is not distinguished
By node and terminal node, and the inspection of clone's node is only carried out according to the communication process two-by-two in each node in addition to base station
It surveys.Each node can calculate and adjust the credit value of itself, and calculate, modify and save therewith in the presence of communication behavior two-by-two
The credit value of other nodes.
Embodiment one
Clone's nodal test method of wireless sensor network is present embodiments provided, the wireless sensor network is equipped with
Credit system.Specifically, as shown in Fig. 2, this method comprises:
Step S0: when receiving the communication request that any node in the sensor network is sent, which is made
For requesting node, whether the communication request for judging that the requesting node is sent meets rule of communication.
In wireless sensor network, it can be communicated two-by-two between node, and the communication behavior between node, it is necessary to
Meet the rule of communication of its corresponding topological mode.When the communication request is unsatisfactory for rule of communication, step S1 is executed；When described
When communication request meets rule of communication, step S2 is executed.
Step S1: think that the requesting node for clone's node, refuses the communication request, and according to the communication request
It is unsatisfactory for the type of rule of communication, reduces the credit value of the requesting node, is generated described in the correspondence about the requesting node
The suspection information of type, and the suspection information is issued to other nodes.
In wireless sensor network, due to the difference of topological mode, the rule of communication is also different.When the communication request
When being unsatisfactory for rule of communication, it is believed that the requesting node is clone's node, refuses the communication request.In wireless sensor network
In, under a kind of constraint of rule of communication, the type for being unsatisfactory for rule of communication can have a m kind, the m according to rule of communication not
Together, value is different.
It is unsatisfactory for the type of rule of communication according to the communication request, reduces the credit value of the requesting node, generates and closes
The suspection information is issued in the suspection information of the correspondence of the requesting node type, and to other nodes.
Specifically, reducing the requesting node when the type that the communication request is unsatisfactory for rule of communication is the first kind
Credit value generates and suspects information about the 1st class of the requesting node, and issues other nodes about the requesting node
1st class suspects information；When the communication request be unsatisfactory for rule of communication type be the second class, reduce the letter of the requesting node
Reputation value generates and suspects information about the 2nd class of the requesting node, and to the publication of other nodes about the requesting node the
2 classes suspect information ..., and the rest may be inferred.
Step S2: the paid-in suspection information about the requesting node of detection, according to the type for suspecting information
And number, it generates and suspects item, calculate the current credit value of the requesting node band item with suspicion.
When the communication request meets rule of communication, what other paid-in nodes of detection were sent saves about the request
The suspection information category and number of point, generate and suspect item, calculate the current credit value of the requesting node band item with suspicion；
Specifically, suspecting that information has m kind, the suspection about the requesting node that detection receives when communicating with other nodes
The type and number of information.
It generates and suspects item J, J=α1N1+α2N2+...+αmNm；
Wherein, N1The number of information, α are suspected for the 1st class about the requesting node that other described nodes are sent1For
1st class suspects the corresponding weight factor of information；
N2The number of information, α are suspected for the 2nd class about the requesting node that other described nodes are sent2It is described
2 classes suspect the corresponding weight factor of information；
…
NmThe number of information, α are suspected for the m class about the requesting node that other described nodes are sentmIt is described
M class suspects the corresponding weight factor of information；
Wherein, the N1、N2..., NmFor nonnegative integer, in embodiments of the present invention, the N1And N2It can also be 0, i.e.,
The number for detecting the paid-in suspection information about the requesting node is 0, then generates and suspect item J=0.
The m is positive integer, the α1、α2、…、αmRespectively less than 0.
Wherein, when information with suspicion generates, this observed result needs to also consider the influence for suspecting that item generates.Specifically
, it can be according to the size for the determine the probability weight factor for suspecting information generation.The probability for suspecting that information generates is smaller, setting
Weight factor influences bigger.In the present embodiment, since the weight factor is negative value, the weight factor α2Less than described
Weight factor α1, then, weight factor α2The influence of generation is greater than weight factor α1。
As can be seen that combining the historical factor of credit system in the present embodiment, and the judgement weight of other nodes is utilized,
Reduce False Rate.
The current credit value for calculating the requesting node band item with suspicion, comprising:
The suspection item J is added in this observed result, then this observation of the requesting node are as follows:
Wherein, β1, β2..., βKThe requesting node the 1st, 2 ... after this is observed is respectively corresponded, k kind behavior occurs
Number.
Specific calculating process is as follows: firstly, history observed result:This observed result:Wherein, αkIt is the number that the requesting node history observation kth kind behavior occurs, βKIt is described
The number that kth kind behavior occurs after this observation of requesting node；When calculating current credit value, it is added and suspects item J, this observation
Value:The then result vector after this observation are as follows:
That is:
Current credit value after this observation are as follows:
From above-mentioned calculating process it can again be seen that combining the historical factor of credit system in the present embodiment, and utilize
The judgement weight of other nodes, reduces False Rate.
Step S3: whether the difference of the priori credit value and the current credit value that judge the requesting node is greater than threshold value.
As previously mentioned, wireless sensor network has credit system, established initial stage in wireless sensor network, each node
All have initial credit value, after the calculating for carrying out current credit value for the first time, initial credit value as priori credit value, with
The current credit value carries out difference operation, it may be assumed that priori credit value subtracts current credit value, and obtained difference is compared with threshold value
Compared with.In judgement next time, this current credit value calculated by as priori credit value next time, and so on.
Specifically, if so, executing step S4；If not, executing step S5.
Step S4: think that the requesting node for clone's node, refuses the communication request, reduces the requesting node
Current credit value generates the suspection information about the requesting node, and issues the suspection information to other nodes.
When the priori credit value of the requesting node and the current credit value are greater than threshold value, illustrate that communication process does not connect
It is continuous, lead to this place while being connected to the more than one information claiming the point for the node and sending, node may be cloned, at this point,
The credit value of the requesting node is reduced, and other nodes are issued and suspect information.Specifically, in the present embodiment, to other
Node issues the 2nd class and suspects information.
Step S5: the credit value of the requesting node is updated, is communicated.
When the priori credit value of the requesting node and the current credit value are not more than threshold value, then it is assumed that normally receive
The information that one node is sent, the credit value of the requesting node is updated according to normal flow, is communicated, the communication bag
It includes transmission and suspects information to the requesting node, alternatively, receiving the suspection information that the requesting node is sent.
It should be noted that the credit value of the reduction requesting node described in the present embodiment, refers to the requesting node
Credit value do subtraction, meanwhile, according to different types, the numerical value subtracted to credit value is also different, and specific value can basis
Actual conditions determine that still, the numerical value changes with the growth trend of the influence power of weight factor, that is, in a plurality of types of bosoms
It doubts in information, it is big to suspect that the corresponding weight factor of information influences, the numerical value is just big, suspects that the corresponding weight factor of information influences
Small, the numerical value is with regard to small.
Specifically, in the present embodiment, suspect that the corresponding weight factor of information is negative value, then, the numerical value is with suspection
The increase and decrease inverse change of the corresponding weight factor of information, that is, in a plurality of types of suspection information, suspect the corresponding weight of information
The factor is big, and the numerical value is just small, suspects that the corresponding weight factor of information is small, the numerical value is with regard to big.
As can be seen that, using completing to detect the characteristics of credit system, not increasing extra computation amount in the present embodiment；And it should
Method combines the distinctive historical factor of credit system and other nodes judge weight, reduces False Rate.Also, compared to existing
Some SDGL detection methods, this method do not need to carry out location Calculation, save software and hardware resources.
Embodiment two
Unlike a upper embodiment, clone's nodal test method of wireless sensor network is present embodiments provided,
Distributed trellis locally detection (SDGL) deployment for belonging to static network, in the following, the grouping and init state to network carry out
Description.
Assuming that the regional scope disposed of network is S, node is divided into according to the geographical location and sequencing of deployment N number of
Group records the ID of affiliated group in each node in advance respectively, is denoted as G1, G2, G3 ... Gn, after deployment is completed, according to
The foundation rule of credit system, will run the time of one section of initialization, for calculating the credit value of each node.In this process
In, all nodes that can establish communication send mutually information, establish topological relation.By constraint condition it is found that it is all with group
The node that node can be communicated two-by-two, and can be communicated with this group and neighbours' group considered to be in the edge of group, claims
For chaos node (chaotic node) 310, the point other than chaos node is known as internal node (inner node) 320, interior
Portion's node cannot be communicated with outer group of internal node, but can be communicated with outer group of chaos node for having neighborhood, and node is sent
What the specific region of information identified node communicates outer group.As shown in Figure 3, wherein triangle represents chaos node 310, circle
Shape represents internal node 320, and the label in the region that it can be communicated is identified on triangle.As can be seen that be located at the region G2 and
The chaos node in the region G2 that the region G3 has a common boundary, can only be communicated with the node in the region G3；It is handed over positioned at the region G2 and the region G1
The chaos node in the region G2 on boundary can only be communicated with the node in the region G1.
In the present embodiment, the specific steps are as follows:
Step S20: when receiving the communication request that any node in the sensor network is sent, which is made
For requesting node, whether the communication request for judging that the requesting node is sent meets rule of communication.
Judge whether the communication request meets rule of communication specifically, described, comprising:
Judge whether the requesting node is same group node；
Specifically, classify to the group ID of the requesting node parsed, judge the group ID of the requesting node with
Whether local group ID is consistent；If so, the requesting node is same group node；If it is not, then the requesting node is not same
Group node.
When the requesting node is same group node, judge that the physical address of the requesting node and local physical address are
It is no consistent；If it is, thinking the requesting node for clone's node, the communication request is unsatisfactory for rule of communication, and described
The type that communication request is unsatisfactory for rule of communication is the first kind, executes step S21；Lead to if it is not, then the communication request meets
Believe rule of conduct, executes step S22.
Specifically, judge the physical address of the requesting node when the requesting node is same group node, i.e., it is described to ask
The source address for seeking node, it is whether consistent with local physical address；If so, illustrating that the requesting node has cloned local physics
Address, it is believed that the requesting node is clone's node, and the communication request is unsatisfactory for rule of communication.In the present embodiment, it sets
The type that the communication request is unsatisfactory for rule of communication is the first kind.If it is not, then the communication request meets communication behavior rule
Then.
When the requesting node is not same group node, judge whether the requesting node is chaos node, if it is not, then
The requesting node is thought for clone's node, and the communication request is unsatisfactory for rule of communication, and the communication request is unsatisfactory for leading to
The type of letter rule is the second class, executes step S21；If so, judging whether the communication behavior of the requesting node meets group
Between mark, if it is not, then thinking the requesting node for clone's node, the communication request is unsatisfactory for rule of communication, and described
The type that communication request is unsatisfactory for rule of communication is the second class, executes step S21；Lead to if it is, the communication request meets
Letter rule, executes step S22.
Specifically, judging whether the requesting node is chaos node if the requesting node is not same group node.
Specifically, judging whether the requesting node has chaotic region mark；If so, the requesting node is chaos node；Such as
Fruit is no, then the requesting node is not chaos node.
If the requesting node is not chaos node, then it is assumed that having may be by multiple labeled as the non-node with group
System, so that the requesting node is clone's node within the communication range in this group, the communication request is unsatisfactory for communication rule
Then, it and sets the communication request and is unsatisfactory for the type of rule of communication as the second class.
If the requesting node is chaos node, judge to mark between whether the communication behavior of the requesting node meets group
Note, specifically, whether judging in the mark of the chaotic region of the requesting node comprising local group ID；If so, described ask
It is marked between asking the communication behavior of node to meet group；If not, the communication behavior of the requesting node be not inconsistent be combined between mark.
If the communication behavior of the requesting node is not inconsistent be combined between mark, then it is assumed that the requesting node be clone section
Point, the communication request is unsatisfactory for rule of communication, and it is the second class that the communication request, which is unsatisfactory for the type of rule of communication,.
If the communication behavior of the requesting node marks between meeting group, the communication behavior of the requesting node meets logical
Letter rule.
Step S21: when the communication request is unsatisfactory for rule of communication, it is believed that the requesting node is clone's node, is refused
The exhausted communication request, and it is unsatisfactory for according to the communication request type of rule of communication, reduce the prestige of the requesting node
Value generates the suspection information of the correspondence type about the requesting node, and issues the suspection information to other nodes；
In the present embodiment, it is unsatisfactory for the type of rule of communication according to the communication request, reduces the requesting node
Credit value generates the suspection information of the correspondence type about the requesting node, and issues the suspection to other nodes
Information, comprising:
When the type that the communication request is unsatisfactory for rule of communication is the first kind, the credit value of the requesting node is reduced
Be it is insincere, generate and suspect information about the 1st class of the requesting node, other described requesting nodes are issued and are asked about described
The 1st class of node is asked to suspect information；
When the type that the communication request is unsatisfactory for rule of communication is the second class, the prestige of the requesting node is reduced
Value generates and suspects information about the 2nd class of the requesting node, to the publication of other described nodes about the requesting node the
2 classes suspect information.
Step S22: when the communication request meets rule of communication, the detection is paid-in about the requesting node
Suspection information, according to it is described suspect information type and number, generate suspect item.
It specifically includes:
Detect the number N that paid-in the 1st class about the requesting node suspects information1；
Detect the number N that paid-in the 2nd class about the requesting node suspects information2；
It generates and suspects item J, J=α1N1+α2N2；
Wherein, N1And N2For nonnegative integer；In other embodiments of the present invention, the N1And N2It can also be 0, that is, detect
Paid-in the 1st class about requesting node suspects that information and the 2nd class suspect that the number of information is 0, then generates and suspect item J=0.
α1The corresponding weight factor of information is suspected for the 1st class；α2The corresponding weight factor of information, α are suspected for the 2nd class1、α2
Respectively less than 0.
The current credit value with item with suspicion of the requesting node is calculated using the calculation method in embodiment one.
Step S23: whether the difference of the priori credit value and the current credit value that judge the requesting node is greater than threshold value.
When the priori credit value of the requesting node and the current prestige value difference are greater than threshold value, execution step S24；Work as institute
The priori credit value and the current prestige value difference for stating requesting node execute step S25 no more than threshold value.
Step S24: think that the requesting node for clone's node, refuses the communication request, reduces the requesting node
Current credit value, generate suspection information about the requesting node, and the suspection information is issued to other nodes.
When the requesting node priori credit value and the current prestige value difference be greater than threshold value, illustrate that communication process does not connect
It is continuous, lead to this place while being connected to the more than one information claiming the point for the node and sending, node may be cloned, and refuse institute
Communication request is stated, the current credit value of the requesting node is reduced, generates the suspection information about the requesting node, and to it
He issues the suspection information by node.
Information is suspected about the 2nd class of the requesting node specifically, generating, and the suspection is issued to other nodes and is believed
Breath
Step S25: updating the credit value of the requesting node, communicated, and the communication includes sending to suspect information extremely
The requesting node, alternatively, receiving the suspection information that the requesting node is sent.
When the priori credit value of the requesting node and the current prestige value difference are not more than threshold value, the update request section
The credit value of point, is communicated, and the communication includes sending to suspect information to the requesting node, alternatively, receiving the request
The suspection information that node is sent.
As can be seen that, using completing to detect the characteristics of credit system, not increasing extra computation amount in the present embodiment；And it should
Method combines the judgement weight of the distinctive historical factor of credit system He other nodes, reduces False Rate.Also, compared to
Existing SDGL detection method, this method do not need to carry out location Calculation, save software and hardware resources.
Embodiment three
Unlike a upper embodiment, in the present embodiment, node is only communicated with the neighbor node of the node,
That is, other described nodes are neighbor node.Therefore, described issue to other nodes suspects that information is specially to issue to neighbor node
The suspection information.Also, in the present embodiment, the 1st class suspects that information is self-doubt information, between the 2nd class suspects that information is
Connect suspection information.
When the communication request meets rule of communication, the paid-in suspection about the requesting node of detection is believed
Breath generates according to the type and number for suspecting information and suspects item.
Specifically, only being communicated with neighbor node by requesting node in this present embodiment, therefore, when the communication request
When meeting rule of communication, the suspection information about the requesting node that paid-in neighbor node is sent is detected, according to described
Suspect the type and number of information, generates and suspect item.
It specifically includes:
Detect the number N for the self-doubt information about the requesting node that the neighbor node is sent1；
Detect the number N for the indirect suspection information about the requesting node that the neighbor node is sent2；
It generates and suspects item J, J=α1N1+α2N2；
Wherein, N1And N2For nonnegative integer；In other embodiments of the present invention, the N1And N2It can also be 0, that is, detect
The number for the self-doubt information and indirect suspection information about the requesting node that neighbor node is sent is 0, then generates bosom
Doubt item J=0.
α1For the corresponding weight factor of the self-doubt information；α2For the corresponding weight factor of the indirect suspection information,
α1、α2Respectively less than 0.
When information with suspicion generates, this observed result needs the influence for considering to suspect that item generates.It is right from probability
One node, the probability for issuing self-doubt information will suspect indirectly the probability of information far below publication, therefore, in the present embodiment
In, it is believed that the weight of self-doubt information is greater than suspects information indirectly, since the weight factor is negative value, make institute
State weight factor α2Less than the weight factor α1, so that self-doubt information occupies biggish weight.Introduce weight factor α1、
α2Afterwards, the suspection that neighbor node can be selected to be sent according to actual needs judges the influence specific gravity to result, to reduce mistake
Sentence probability.
The present embodiment proposes a kind of clone's nodal test method of wireless sensor network, belongs to SDGL clone's node inspection
It surveys, using completing to detect the characteristics of credit system, does not increase extra computation amount；And this method combines that credit system is distinctive to be gone through
History factor and neighbor node judging weight, reduce False Rate.Also, compared to existing SDGL detection method, the present invention is not
It needs to carry out location Calculation, saves software and hardware resources.
Example IV
The present embodiment provides a kind of detection systems corresponding with above-described embodiment, and the detection system includes: judgement mould
Block, information generating module, communication module and computing module；
The judgment module is used to receive the communication request of any node transmission, using the node as requesting node, judgement
Whether the communication request that the requesting node is sent meets rule of communication；When the communication request is unsatisfactory for rule of communication, institute
It states judgment module and determines that the communication request is unsatisfactory for the type of rule of communication, send the result information of the corresponding type to institute
State information generating module and the computing module；When the communication request meets rule of communication, detection instruction is sent to described
Computing module；
The information generating module is used for after receiving result information, generates corresponding suspection information, and by the bosom
Doubtful information is sent to the communication module；
The communication module is used to send the suspection information of information generating module generation to other nodes；Alternatively, receiving institute
The suspection information of other nodes sent is stated, and received suspection information is sent to computing module；
Computing module is used for after receiving the result information that judgment module is sent, and according to result information, reduces institute
The credit value of requesting node is stated, and saves the credit value；
Alternatively, computing module is used for after receiving the detection instruction that judgment module is sent, detect from communication module
The suspection information about the requesting node received generates according to the type and number for suspecting information and suspects item, meter
The current credit value with item with suspicion of the requesting node is calculated, and the priori credit value for calculating the requesting node is worked as with described
The difference is compared by the difference of preceding credit value with threshold value；
If the difference is greater than threshold value, the current credit value of the requesting node is reduced, and save the credit value, sent
Corresponding result information generates to information generating module and suspects information, the suspection information is sent to other by communication module
Node；If the difference is not more than threshold value, the second verification information is sent to communication module, is saved by communication module and the request
Point is communicated.
Specifically, the communication module is communicated with the requesting node, comprising: the communication module, which is sent, suspects letter
Breath is to the requesting node, alternatively, receiving the suspection information that the requesting node is sent.
Specifically, described detect the suspection information about the requesting node received from communication module, according to institute
The type and number for suspecting information are stated, generates and suspects item, comprising:
Detect the type and number of the suspection information about the requesting node received from communication module；
It generates and suspects item J, J=α1N1+α2N2+...+αmNm；
Wherein, N1The number of information, α are suspected for the 1st class about the requesting node that other described nodes are sent1For
1st class suspects the corresponding weight factor of information；
N2The number of information, α are suspected for the 2nd class about the requesting node that other described nodes are sent2It is described
2 classes suspect the corresponding weight factor of information；
…
NmThe number of information, α are suspected for the m class about the requesting node that other described nodes are sentmIt is described
M class suspects the corresponding weight factor of information；
Wherein, the N1、N2..., NmFor nonnegative integer, the m is positive integer, the α1、α2、…、αmRespectively less than 0.
Specifically, the current credit value with item with suspicion for calculating the requesting node, comprising:
The suspection item J is added in this observed result, then this observation of the requesting node are as follows:
Wherein, β1, β2..., βKThe requesting node the 1st, 2 ... after this is observed is respectively corresponded, k kind behavior occurs
Number.
In the present embodiment, the detection system does not increase extra computation amount, phase using detection is completed the characteristics of credit system
Than detecting in existing SDGL, the present invention does not need to carry out location Calculation, saves software and hardware resources.Also, this method combines
The judgement weight of the distinctive historical factor of credit system and other nodes, reduces False Rate.
Claims (15)
1. a kind of clone's nodal test method of wireless sensor network, which is characterized in that the wireless sensor network is equipped with
Credit system, this method comprises:
When receiving the communication request that any node in the sensor network is sent, using the node as requesting node,
Whether the communication request for judging that the requesting node is sent meets rule of communication；
When the communication request is unsatisfactory for rule of communication, it is believed that the requesting node is clone's node, refuses the communication and asks
It asks, and is unsatisfactory for the type of rule of communication according to the communication request, reduce the credit value of the requesting node, generate about institute
The suspection information of the correspondence type of requesting node is stated, and the suspection information is issued to other nodes；
When the communication request meets rule of communication, the paid-in suspection information about the requesting node is detected, according to
The type and number for suspecting information, generates and suspects item, calculate the current credit value with item with suspicion of the requesting node；
Whether the difference of the priori credit value and the current credit value that judge the requesting node is greater than threshold value；
If it is, thinking that the requesting node for clone's node, refuses the communication request, reduces working as the requesting node
Preceding credit value generates the suspection information about the requesting node, and issues the suspection information to other nodes.
2. the method according to claim 1, wherein priori credit value and the institute of the judgement requesting node
Whether the difference for stating current credit value is greater than after threshold value, further includes:
If it is not, then updating the credit value of the requesting node, communicated；
The communication includes sending to suspect information to the requesting node, alternatively, receiving the suspection letter that the requesting node is sent
Breath.
3. the method according to claim 1, wherein the paid-in bosom about the requesting node of detection
Information is doubted, according to the type and number for suspecting information, generates and suspects item, comprising:
The type and number for the suspection information about the requesting node that detection receives when communicating with other nodes；
It generates and suspects item J, J=α1N1+α2N2+...+αmNm；
Wherein, N1The number of information, α are suspected for the 1st class about the requesting node that other described nodes are sent1It is described
1st class suspects the corresponding weight factor of information；
N2The number of information, α are suspected for the 2nd class about the requesting node that other described nodes are sent2For the 2nd class
Suspect the corresponding weight factor of information；
…
NmThe number of information, α are suspected for the m class about the requesting node that other described nodes are sentmFor the m class
Suspect the corresponding weight factor of information；
Wherein, the N1、N2..., NmFor nonnegative integer, the m is positive integer, the α1、α2、…、αmRespectively less than 0.
4. according to the method described in claim 3, it is characterized in that, the working as with item with suspicion for calculating the requesting node
Preceding credit value, comprising:
The suspection item J is added in this observed result, then this observation of the requesting node are as follows:
Wherein, β1, β2..., βKRespectively correspond the requesting node the 1st, 2 ... after this is observed, time that k kind behavior occurs
Number.
5. the method according to claim 1, wherein the communication request that the judgement requesting node is sent is
It is no to meet rule of communication, comprising:
Judge whether the requesting node is with group requesting node；
When the requesting node is same group node, judge the requesting node physical address and local physical address whether one
It causes；If it is, thinking the requesting node for clone's node, the communication request is unsatisfactory for rule of communication, and the communication
The type that request is unsatisfactory for rule of communication is the first kind；If it is not, then the communication request meets rule of communication；
When the requesting node is not same group node, judge whether the requesting node is chaos node, if it is not, then thinking
The requesting node is clone's node, and the communication request is unsatisfactory for rule of communication, and the communication request is unsatisfactory for communication rule
Type then is the second class；If so, judge to mark between whether the communication behavior of the requesting node meets group, if it is not, then
The requesting node is thought for clone's node, and the communication request is unsatisfactory for rule of communication, and the communication request is unsatisfactory for leading to
The type of letter rule is the second class；If it is, the communication request meets rule of communication.
6. according to the method described in claim 5, it is characterized in that, described be unsatisfactory for rule of communication according to the communication request
Type reduces the credit value of the requesting node, generates the suspection information of the correspondence type about the requesting node, and
The suspection information is issued to other nodes, comprising:
When the type that the communication request is unsatisfactory for rule of communication is the first kind, the credit value for reducing the requesting node is not
It is credible, it generates and suspects information about the 1st class of the requesting node, other described nodes are issued about the requesting node
1st class suspects information；
When the type that the communication request is unsatisfactory for rule of communication is the second class, the credit value of the requesting node is reduced, it is raw
Information is suspected at the 2nd class about the requesting node, and the 2nd class to the publication of other described nodes about the requesting node is cherished
Doubt information.
7. according to the method described in claim 3, it is characterized in that, the weight factor α2Less than the weight factor α1。
8. according to the method described in claim 5, it is characterized in that, described judge whether the requesting node is with group request section
Point, comprising:
Classify to the group ID of the requesting node parsed, judges that the group ID of the requesting node and local group ID is
It is no consistent.
9. according to the method described in claim 8, it is characterized in that, described judge whether the requesting node is chaos request section
Point, comprising:
Judge whether the requesting node has chaotic region mark.
10. according to the method described in claim 9, it is characterized in that, the communication behavior for judging the requesting node whether
Meet and mark between group, comprising:
Whether judge in the mark of the chaotic region of the requesting node comprising the local group ID.
11. according to the method described in claim 6, it is characterized in that, the 1st class suspects that information is self-doubt information, institute
It states the 2nd class and suspects that information is to suspect information indirectly.
12. a kind of clone's nodal test system of wireless sensor network, which is characterized in that the detection system includes: judgement
Module, information generating module, communication module and computing module；
The judgment module is used to receive the communication request of any node transmission, using the node as requesting node, described in judgement
Whether the communication request that requesting node is sent meets rule of communication；It is described to sentence when the communication request is unsatisfactory for rule of communication
Disconnected module determines that the communication request is unsatisfactory for the type of rule of communication, sends the result information of the corresponding type to the letter
Cease generation module and the computing module；When the communication request meets rule of communication, detection instruction is sent to the calculating
Module；
The information generating module is used for after receiving result information, generates corresponding suspection information, and the suspection is believed
Breath is sent to the communication module；
The communication module is used to send the suspection information of information generating module generation to other nodes；Alternatively, receive it is described its
The suspection information of his node sent, and received suspection information is sent to computing module；
Computing module is used for after receiving the result information that judgment module is sent, and according to result information, is asked described in reduction
The credit value of node is sought, and saves the credit value；
Alternatively, computing module is used for after receiving the detection instruction that judgment module is sent, detection is received from communication module
The suspection information about the requesting node arrived generates according to the type and number for suspecting information and suspects item, calculates institute
The current credit value with item with suspicion of requesting node is stated, and calculates the priori credit value and the current letter of the requesting node
The difference is compared by the difference of reputation value with threshold value；
If the difference is greater than threshold value, the current credit value of the requesting node is reduced, and save the credit value, sends and correspond to
Result information to information generating module, generate and suspect information, the suspection information is sent to other nodes by communication module；
If the difference is not more than threshold value, send the second verification information to communication module, by communication module and the requesting node into
Row communication.
13. system according to claim 12, which is characterized in that the communication module is led to the requesting node
Letter, comprising: the communication module, which is sent, suspects information to the requesting node, alternatively, receiving the bosom that the requesting node is sent
Doubt information.
14. system according to claim 12, which is characterized in that it is described detect received from communication module about institute
The suspection information for stating requesting node generates according to the type and number for suspecting information and suspects item, comprising:
Detect the type and number of the suspection information about the requesting node received from communication module；
It generates and suspects item J, J=α1N1+α2N2+...+αmNm；
Wherein, N1The number of information, α are suspected for the 1st class about the requesting node that other described nodes are sent1It is described
1st class suspects the corresponding weight factor of information；
N2The number of information, α are suspected for the 2nd class about the requesting node that other described nodes are sent2For the 2nd class
Suspect the corresponding weight factor of information；
…
NmThe number of information, α are suspected for the m class about the requesting node that other described nodes are sentmFor the m class
Suspect the corresponding weight factor of information；
Wherein, the N1、N2..., NmFor nonnegative integer, the m is positive integer, the α1、α2、…、αmRespectively less than 0.
15. system according to claim 14, which is characterized in that it is described calculate the requesting node with item with suspicion
Current credit value, comprising:
The suspection item J is added in this observed result, then this observation of the requesting node are as follows:
Wherein, β1, β2..., βKRespectively correspond the requesting node the 1st, 2 ... after this is observed, time that k kind behavior occurs
Number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510387230.2A CN106332131B (en) | 2015-07-03 | 2015-07-03 | A kind of clone's nodal test method and system of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510387230.2A CN106332131B (en) | 2015-07-03 | 2015-07-03 | A kind of clone's nodal test method and system of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106332131A CN106332131A (en) | 2017-01-11 |
| CN106332131B true CN106332131B (en) | 2019-07-12 |
Family
ID=57726491
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510387230.2A Active CN106332131B (en) | 2015-07-03 | 2015-07-03 | A kind of clone's nodal test method and system of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106332131B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108932535B (en) * | 2018-07-13 | 2019-07-02 | 南方电网科学研究院有限责任公司 | A kind of edge calculations clone's node recognition methods based on machine learning |
| CN108924150B (en) * | 2018-07-20 | 2019-06-07 | 电子科技大学 | Edge side based on reverse transmittance nerve network clones node integrated testing method |
| CN110944383B (en) * | 2019-12-09 | 2022-01-04 | 青岛黄海学院 | Wireless sensor network safety positioning method for clone attack |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103024745A (en) * | 2012-12-05 | 2013-04-03 | 暨南大学 | Replication node detection method of wireless sensor network |
| CN103338451A (en) * | 2013-06-24 | 2013-10-02 | 西安电子科技大学 | Method for detecting distributed malicious nodes in wireless sensor network |
| CN103957547A (en) * | 2014-05-05 | 2014-07-30 | 中国科学院微电子研究所 | Node reputation evaluating method and system for wireless sensor network |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8069216B2 (en) * | 2006-12-08 | 2011-11-29 | Motorola Solutions, Inc. | Method and apparatus for alerting nodes of a malicious node in a mobile ad-hoc communication system |
| KR100969158B1 (en) * | 2008-06-30 | 2010-07-08 | 경희대학교 산학협력단 | Method of trust management in wireless sensor networks |
| US8397293B2 (en) * | 2009-12-31 | 2013-03-12 | International Business Machines Corporation | Suspicious node detection and recovery in mapreduce computing |
-
2015
- 2015-07-03 CN CN201510387230.2A patent/CN106332131B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103024745A (en) * | 2012-12-05 | 2013-04-03 | 暨南大学 | Replication node detection method of wireless sensor network |
| CN103338451A (en) * | 2013-06-24 | 2013-10-02 | 西安电子科技大学 | Method for detecting distributed malicious nodes in wireless sensor network |
| CN103957547A (en) * | 2014-05-05 | 2014-07-30 | 中国科学院微电子研究所 | Node reputation evaluating method and system for wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106332131A (en) | 2017-01-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Khan et al. | A trust based distributed intrusion detection mechanism for internet of things | |
| Stamouli et al. | Real-time intrusion detection for ad hoc networks | |
| Yuvarani et al. | Quality of Service Factor based Unfailing Route Formation in Wireless Sensor Network | |
| CN106332131B (en) | A kind of clone's nodal test method and system of wireless sensor network | |
| Babu et al. | Geometric mean based trust management system for WSNs (GMTMS) | |
| CN110049528A (en) | Mobile trust data collection method based on trust value effectiveness in a kind of Sensor Network | |
| Dagdeviren et al. | An energy-efficient distributed cut vertex detection algorithm for wireless sensor networks | |
| Singh et al. | Sensor node failure detection using check point recovery algorithm | |
| Sert et al. | An efficient fuzzy path selection approach to mitigate selective forwarding attacks in wireless sensor networks | |
| Doss et al. | Packet integrity defense mechanism in OppNets | |
| Jinarajadasa et al. | A reinforcement learning approach to enhance the trust level of MANETs | |
| Zarzoor | Securing RPL Routing Path for IoT against rank attack via utilizing layering technique. | |
| Hajiee et al. | Trust-based routing optimization using multi-ant colonies in wireless sensor network | |
| Usman et al. | A reliability-based trust model for efficient collaborative routing in wireless networks | |
| Karthik et al. | Data trustworthiness in wireless sensor networks | |
| Saleem et al. | Biological inspired secure autonomous routing mechanism for wireless sensor networks | |
| CN103581968A (en) | Excitation method and system for cooperation of data forwarding of self-government nodes of Ad hoc network | |
| Taranum et al. | Legitimate-path Formation for AODV under black hole attack in MANETs | |
| CN103888967A (en) | Ad-hoc network node credibility evaluation method based on bayesian network | |
| Liu et al. | AntiTomo: Network topology obfuscation against adversarial tomography-based topology inference | |
| Manoranjini et al. | Hybrid detector for detection of black holes in MANETs | |
| Sasirega | Trust Establishment for Detecting Aggressor Nodes and Improving Route Stability In Wsn-Iot | |
| Guo et al. | A Malicious Node Detection Model for Wireless Sensor Networks Security Based on CHSA-MNDA Algorithm | |
| Shabut et al. | Malicious insider threats in tactical MANET: The performance analysis of DSR routing protocol | |
| Gao et al. | Scale‐free topology security mechanism of wireless sensor network against cascade failure |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |