CN108092759A - A kind of radio sensing network node secure state evaluating method based on faith mechanism - Google Patents
A kind of radio sensing network node secure state evaluating method based on faith mechanism Download PDFInfo
- Publication number
- CN108092759A CN108092759A CN201711269049.7A CN201711269049A CN108092759A CN 108092759 A CN108092759 A CN 108092759A CN 201711269049 A CN201711269049 A CN 201711269049A CN 108092759 A CN108092759 A CN 108092759A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- assessment
- slot
- reputation value
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/006—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols involving public key infrastructure [PKI] trust models
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/20—Network architectures or network communication protocols for network security for managing network security; network security policies in general
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/04—Key management, e.g. using generic bootstrapping architecture [GBA]
Abstract
The present invention relates to a kind of radio sensing network node secure state evaluating methods based on faith mechanism, belong to field of communication technology.This method mainly includes the following steps that：Step 1) selfish node reputation value is assessed；Step 2) malicious node reputation value is assessed.Network node bulk safety state discrimination method provided by the invention, the safe condition of wireless sensor network interior joint can effectively be assessed, improve the discrimination of malicious node and non-cooperative nodes, and dependency degree of the faith mechanism for network communication is reduced, and then extends the life cycle of whole network while wireless sensor network security is improved.
Description
Technical field
The invention belongs to fields of communication technology, are related to a kind of radio sensing network node safe condition based on faith mechanism
Appraisal procedure.
Background technology
The core of application of higher wireless sensor network is detection and report event.But sensor node is usually deployed in that
The area that nobody takes into account, is fraught with risks a bit, saboteur can physically capture node, therefrom extract all information, bag
It includes the particularly critical information such as secret key, and then malicious node is disguised oneself as normal node, " latent " waits for an opportunity to destroy net in network
Network safety.Traditional Encryption Algorithm can not ensure the safety of wireless sensor network.Traditional intruding detection system is in protection nothing
While line sensor, the consumption of network energy is added, a large amount of limited storages and computing resource is occupied, reduces sensing
The service quality of device network normal work, there is contradictions in terms of resource loss for wireless sensor network security.Traditional nothing
Line sensor network mechanism is based primarily upon encryption and authentication techniques, complicated Encryption Algorithm and additional computing cost, and uncomfortable
It shares in resource-constrained wireless sensor network.In addition, such mechanism is mainly used for resisting the attack of network-external, Wu Fayou
Effect solves the problems, such as that the network internal as caused by node compromise or selfishness is attacked.
Faith mechanism is solving network internal attack, identification malicious node, selfish node, improves security of system, reliable
Property and fairness etc. have significant advantage.Under the premise of herein, there is lower computation complexity and higher network internal to attack
Resilience is hit, wireless sensor network trust Mechanism Study is come into being.In current network security technical research, pipe is trusted
Reason mechanism has become effective supplement of conventional security technology, and the safety problem of wireless sensor network is solved using faith mechanism and is
One both meaningful research topic.
At present, wireless sensor network trust management study still faces lot of challenges still in initial stage.According to nothing
Line sensor network trust mechanism framework also has numerous critical problems urgently to be resolved hurrily.Therefore, the invasion based on faith mechanism
Detecting system needs more calculating, the communication resource, and intruding detection system is always on by the present situation of counterpart node finite energy
State is not optimal selection, and how management and dispatching faith mechanism is also problem needed to be considered.By Trust Management Mechanism and its
He is safe, and energy consumption technologies are combined, and design feasible, credible, energy saving faith mechanism by extensively should for wireless sensor network
With strong guarantee is provided, there is very important realistic meaning.
The content of the invention
In view of this, it is an object of the invention to provide a kind of safe shapes of unlimited sensing network node based on faith mechanism
State appraisal procedure can effectively assess the safe condition of wireless sensor network interior joint, improve malicious node and non-cooperation section
The discrimination of point, and dependency degree of the faith mechanism for network communication is reduced, and then improving wireless sensor network safety
Property while extend whole network life cycle.
In order to achieve the above objectives, the present invention provides following technical solution：
A kind of unlimited sensing network node secure state evaluating method based on faith mechanism, comprises the following steps：
Step 1：Selfish node reputation value is assessed, when node n is in slot s tkIt is first and when establishing connection with the node m that meets
Nid (node identities) is first exchanged with each other to verify the unique legitimacy of both sides' node in a network, if the node m that meets is because item
Part limitation needs to implement selfish behavior, then node n learns whether node m rejects some or all of disappear by direct interaction
Breath, and selfish behavior is divided into three kinds of situations；
Step 2：Malicious node reputation value is assessed, and malicious node lures that cooperative node forwards into a manner of cheating other nodes
Message, malicious node embody mode there are two types of non-cooperating after receiving message：When by stealing or distorting message, two
It is by abandoning message；
The object of assessment node reputation value that assessment master nodes are met in each time slot inherent quantization, and in each time slot knot
The beam moment updates object of assessment node reputation value；If letter of the object of assessment node reputation value set by higher than assessment master nodes
Appoint threshold value, then assess master nodes selection interacted with object of assessment node, forward the messages to object of assessment node, trust its
In following moving process can by from the message that receives of assessment master nodes it is not tampered be transmitted to other relay nodes or
Destination node, the common process for completing cooperation forwarding message；Since opportunistic network discontinuity connects, assessment master nodes can not one
It is straight trace and monitor whether object of assessment node according to cooperation mode normally forwards message, therefore can be by being collected for three kinds of approach
For the information of reputation value assessment, so as to accurate quantification object of assessment node reputation value.
Further, in the step 1, three kinds of selfish behavior situations are：
Situation 1：The node m that meets only is ready to receive using message that friend's node is purpose node or using content-preference to lead
To message, then node n node m is added in into selfish node list sListn, list the affiliated community Oid of node mmAnd content-preference
ConmAnd sList is added in by the common Signature Proofs of node n and node mnThe authenticity of information.
Situation 2：It meets node m dump energiesDeficiency is then sentenced the insufficient foundation of its dump energy of section and is the need to ensure that
In slot s tkUntil finish time, node m receives the message of destination node using dump energy, and formula is：
Wherein,It is node m in slot s tkThe interior unit interval energy consumption under link idle state,It is node m in slot s tkThe interior unit interval energy consumption under link connection state,For apart from time slot
stkThe link idle time in finish time,For apart from slot s tkLink connection and node m conducts in finish time
Destination node receives the time of message；By node m in slot s tkInterior history interaction experiences determine；Node n will be saved
Point m adds in sListn, node m is listed as energy deficiency node and is only capable of survival to slot s tkUntil finish time.
Situation 3：The node m cache resources that meet are insufficient, then judge that its cache resources deficiency formula is：
Wherein,Represent the spatial cache that node m is not yet utilized,It represents in node m using node n as mesh
Node the occupied spatial cache of message,Represent the message institute using node m as purpose node cached in node n
The spatial cache of occupancy.
Node m can change the situation of inadequate buffer space in follow-up by actively forwarding message, therefore as node m
It needs to adjust spatial cache during caching deficiency,
Wherein,Represent the occupied caching of node m own messages
Space,It represents to have cached the occupied spatial cache of message for being but under the jurisdiction of other nodes in node m.
Message forwarding priority is determined according to message similarity, and calculation formula is：
Wherein,Represent that message is cached in node m and belongs to content-preference ConAMessage similarity, C (Mm∈
ConA) represent to be cached with the quantity of such message, C (M in node mn∈ConA) represent to be cached with such message in node n
Quantity；Therefore,Numerical values recited determined by the difference of node n and node m institutes buffered message content-preference, node
M forwards message successively according to the order of message similarity from low to high.
The congestion that concept transfer m is gradually generated in early period moving process need to improve forwarding message in the follow-up process
Spatial cache and accordingly reduce receive message spatial cache；If node m is in slot s tkThe interior average cache space for receiving message
ForThe average cache space of forwarding message isIt is to node n forwarding message spatial cache incrementsReceive message
Spatial cache increment isNode m is by congestion to being the time required to normal conditionCalculation formula is：Therefore, as cache insufficient selfish node should actively be forwarded during subsequent movement message with
Congestion risk is reduced, node is enable to become cooperative node again by selfish node as early as possible.
Further, node n according to the node that causes to meet be produced from without permission for the reason for by selfish node and producing cause point
SList is not added innIn and plus timestamp, it is as shown in the table：
The selfish node list sList of node nn
When node meets, it is necessary to the selfish node list sList by signature authentication is exchanged with each other, with reference to the node that meets
SList, assessment master nodes are by judging whether the node that meets is cooperative node timely replacement sList.
When object of assessment node has been claimed as selfish node, selfish node reputation value is recorded as by assessment master nodes
Set trust threshold in the time slot, until object of assessment node releases selfish behavior.
Further, the step of described a kind of radio sensing network node secure state evaluating method based on faith mechanism
In 2, three kinds are for collecting the approach of reputation value assessment information：
(1) friend's nodes recommendations：Friend's node with object of assessment node by interacting, if object of assessment node reputation value
Higher than the trust threshold set by friend's node, and cooperation forwarding obligation is completed, then friend's node being capable of trust evaluation object
Node improves object of assessment node reputation value, has certain transitivity due to trusting, and assessment master nodes, which can also trust, to be commented
Estimate object node；
(2) relay node is fed back：When relay node meets with assessment master nodes, relay node is the evaluated master of message
Body node and the downstream node after object of assessment node, if relay node obtains message eventually by object of assessment node,
Then prove that object of assessment node has fulfiled the obligation of cooperation forwarding message；
(3) destination node is fed back：After destination node receives message, by parse communicating pair node signature after
Route list rList learn cooperation forward the message relay node legal identity；Destination node can accordingly improve success
Deliver the relay node reputation value of message；In addition, destination node sends feedback information when meeting with other nodes, make other sections
The corresponding adjustment object of assessment node reputation value of point.
Further, the step of described a kind of radio sensing network node secure state evaluating method based on faith mechanism
In 2, malicious node reputation value assessment specific method is：
When node n is in slot s tkIt is interior when meeting with node m, if the selfish behavior of the unidentified node m of node n and in net
It is interacted for the first time in network, then node n will regard node m as cooperative node first, and more new node m is in the recommendation coefficients R C of this time slot
(stk)n,m, calculation formula is：
Wherein,Represent node n in slot s tkThe interior interaction total degree with friend's node,It represents
Node n is in slot s tkFriend's node interaction times of interior recommended node m；Due to assessment master nodes n can not directly by with section
Point m interactions quantify the reputation value of object of assessment node m, and node n needs are interacted with relay node l, pass through the feedback of relay node l
Whether validation of information node m, which has cooperated, forwarded message, therefore confirm that cooperating process needs tripartite's node to complete jointly, and tripartite
Node needs between any two that there are certain collision probabilities；It is met sequentially in time by node n and node m, to node m and node
L meets, then the indirect collision probability IP (st to meet to node n and node lk)n,m,l, calculation formula is：
Wherein, t (stk)residueIt represents apart from slot s tkThe time of finish time,Represent node n and node
M, the average approach interval time met again with node l；Node m is according in slot s tkInterior forwarded Message Record is to node n
Forwarding is provided and it is expected FE (stk)m, it was demonstrated that in the ability of this time slot forwarding message, calculation formula is：
Wherein, j is represented in slot s tkInterior some node that meets with node m, u are represented in slot s tkInterior nodes m's meets
Number of nodes,Represent the average forwarding message number of node m and node j, t (stk)residueIt represents apart from slot s tk
The time of end,Represent the average approach interval time in the time slot interior nodes m and node j.
According to above-mentioned parameter, master nodes n is in slot s t for assessmentkThe interior reputation value TR for calculating object of assessment node m
(stk)n,m, calculation formula is：
Wherein,Represent assessment master nodes n in slot s tkThe interior assessment visitor fed back by relay node l
Body node message dilivery quantity, ∑ C (stk)n,mRepresent node n in slot s tkThe message number of node m is inside forwarded to, and usually
∑C(stk)n,m＜ FE (stk)m, PL (stk)n,mIt represents to verify not tampered message by destination node, this message is in
After the hop count of node l successful deliveries to destination node.
In opportunistic network initial operating stage, node can only trust friend's node, when being interacted for the first time with non-friend's node, take letter
The strategy of friend's Ren Fei node, then constantly correct node in follow-up interaction and the reputation value of non-friend's node is assessed；In order to
Enough to continue to implement attack in a network, malicious node can only be served as in some periods after being considered as malicious node by part of nodes
Cooperative node, so as to improve the reputation value regarded it as the assessment master nodes of malicious node and weighed；When reputation value is assessed
During higher than trust threshold, malicious node can implement malicious attack behavior again, therefore malicious node reputation value generally exists
It is always fluctuated up and down around the trust threshold set by assessment master nodes in entire opportunistic network operation.
Assessment master nodes collect the historical behavior information quantization reputation value of object of assessment node in each time slot, so
And in order to maintain the continuation of malicious act, object of assessment node reputation value can be presented centainly in the variation of each adjacent time-slots
Continuous type；In addition, if malicious node quantity accounts for, overall number of nodes is relatively low, then assessing master nodes can be in different time-gap
It can collect and be assessed on the enough information of object of assessment node for reputation value；If malicious node quantity accounts for total body node
Quantity is more, then totally less in opportunistic network operation non-cooperative nodes behavior early period, as time slot substitutes, a large amount of malicious nodes
It will implement attack, cooperative node quantity is reduced, and assessment master nodes would become hard to be collected into subsequent timeslot on commenting
Estimate the enough information of object node, and then reputation value is assessed and generates significant error, therefore quantized reputation value can be passed through
Predict next time slot reputation value.
When assessment master nodes n each time slot finish time quantitative evaluation object node m reputation value, and using from return
Returning time series models prediction node m, predictor formula is in the reputation value of next time slot：
Wherein, TR (stk)n,m, TR (stk-1)n,m..., TR (stk-p)n,mIt is to assess master nodes n in slot s tk,
stk-1..., stk-pThe interior reputation value to object of assessment node m is assessed, and α is auto-regressive time series model parameter,To be white
Noise sequence, and obedience average is 0, variance σ2Normal distribution, p be autoregression order；According to formula (1), by autoregression
Order is p, following (k-p) a formula can be derived, shown in equation below：
OrderA=[α1 α2p … αp-1 αp]T, Then being converted into matrix form is：
TR=BA+u,
Using least square method, so as to draw solution：
A=(BT·B)-1·BTTR,
The exponent number of p is determined according to H.AKaike information order selection criteria (AIC)：
Wherein,Represent the side of object of assessment node reputation value residual error between the observed value and predicted value of different time-gap
Difference, N represents assessment reputation value quantity, it is necessary to which the value for making AIC numerical value minimum is the exponent number of p, so as to draw assessment main body section
Point n is assessed for the reputation value of object of assessment node m.
The beneficial effects of the present invention are：The safe condition of wireless sensor network interior joint can be effectively assessed, is improved
The discrimination of malicious node and non-cooperative nodes reduces dependency degree of the faith mechanism for network communication, and then improves wireless pass
Feel internet security, extend the life cycle of whole network.
Description of the drawings
In order to make the purpose of the present invention, technical solution and advantageous effect clearer, the present invention provides drawings described below and carries out
Explanation：
Fig. 1 is node reputation value assessment algorithm flow chart.
Specific embodiment
Below in conjunction with attached drawing, the preferred embodiment of the present invention is described in detail.
The present invention provides a kind of radio sensing network node secure state evaluating method based on faith mechanism, due to existing
Have in mechanism and detailed analysis not carried out to selfish behavior producing cause, lead to not to reduce node selfishness risk and selfish behavior to
Influence caused by network, so as to ensure that part messages are normally delivered using selfish behavior.It can not be constantly in for malicious node
The characteristics of malicious attack state, in order to continue its network attack, it is necessary to show certain cooperative behaviors in part-time section
It could continue to interact in a network.In order to reduce influence caused by non-cooperating behavior opens a gate to network, it is proposed that utilize time sequence
Selfish behavior is divided into subjective selfish behavior and objective selfish behavior by row prediction network node secure state evaluating method, for
Both different selfish nodes take corresponding measure to ensure message dilivery rate, and excitation selfish node is converted to cooperative node.Simultaneously
Opportunistic network is divided into multiple time slots, in each time slot internal gathering relay node and the feedback information evaluation section of destination node
Point reputation value, and auto-regressive time series model prediction node reputation value is utilized, so as to which decision node is cooperative node or malice
Node.When malicious node needs to promote its reputation value in other nodes, malicious node sound is examined using hypothesis testing method
Reputation value whether there is conspicuousness raising, so that it is guaranteed that malicious node is converted to the authenticity and validity of cooperative node.Such as Fig. 1 node sound
Shown in reputation value assessment algorithm flow chart, the specific implementation of this method includes the following steps：
Step 1) is when node n starts to communicate with node m, if node m is identified as selfish node, by node n by its
Add in sListn, indicate selfish reason and sign.According to the reason for being without permission is produced from, handed over according to corresponding measure and selfish node
Mutually, message dilivery rate is ensured.While node m reputation values are arranged to the trust threshold set by node n, and jump to step
4).If without proper notice, performed according to step 2).
Step 2) node n query nodes m whether there is in mListnIn, if node m is in mListnIn, then node n passes through vacation
If the method for inspection examines node m reputations value whether there is conspicuousness difference with set trust threshold.Illustrate if null hypothesis is refused
Node m has been in cooperation state, will interact.Otherwise null hypothesis is supported, node m reputation values are not improved, still should be regarded as
Malicious node, therefore refusal interacts.If node m is not in mListnIn, then it is performed according to step 3).
Step 3) node n collects the feedback information and friend of relay node or destination node on node m in each time slot
The recommendation information of node, prediction node m is in the reputation value of next time slot.If reputation value is less than the trust threshold set by node,
Then node n is added into mListnAnd it signs.If reputation value is handed over higher than the trust threshold set by node, node n and node m
Mutually, and step 5) is jumped to.
Step 4) is when node n meets again with node m, if node m is no longer treated as selfish node, according to step
3) continue to execute；If node m is still selfish node, node n is according to sListnThe gap information detection node of middle record
Whether m meets selfish condition, is continued to execute if meeting, and node m otherwise is added in mListm。
Step 5) node n calculates p value, and as time slot k ＞ p, the sound of next time slot node m is assessed in this time slot finish time
Reputation value, and judge its reputation value predicted and the trust threshold size set by it, determine that next time slot node m saves for cooperation
Point or malicious node.
Finally illustrate, preferred embodiment above is merely illustrative of the technical solution of the present invention and unrestricted, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (5)
1. a kind of radio sensing network node secure state evaluating method based on faith mechanism, it is characterised in that：This method bag
Include following steps：
S1：Selfish node reputation value is assessed：When node n is in slot s tkAnd it when establishing connection with the node m that meets, mutually hands over first
Nid (node identities) is changed to verify the unique legitimacy of both sides' node in a network, if the node m that meets is because condition limitation needs
Implement selfish behavior, then node n learns whether node m rejects some or all of message by direct interaction, and will
Selfish behavior is divided into three kinds of situations；
S2：Malicious node reputation value is assessed：Malicious node lures that cooperative node forwards message into a manner of cheating other nodes, dislikes
Meaning node embodies mode there are two types of non-cooperating after receiving message：First, by stealing or distorting message, second is that passing through
Abandon message；
The object of assessment node reputation value that assessment master nodes are met in each time slot inherent quantization, and at the end of each time slot
Carve update object of assessment node reputation value；If trust threshold of the object of assessment node reputation value set by higher than assessment master nodes
Value is then assessed master nodes selection and is interacted with object of assessment node, forwards the messages to object of assessment node, trust it in future
In moving process can by from the message that receives of assessment master nodes it is not tampered be transmitted to other relay nodes or purpose
Node, the common process for completing cooperation forwarding message；Due to opportunistic network discontinuity connect, assessment master nodes can not always with
Whether track monitoring object of assessment node according to cooperation mode normally forwards message, therefore is collected by three kinds of approach for reputation
It is worth the information of assessment, so as to accurate quantification object of assessment node reputation value.
2. a kind of radio sensing network node secure state evaluating method based on faith mechanism as described in claim 1,
It is characterized in that：In the step S1, three kinds of selfish behavior situations are：
Situation 1：The node m that meets only is ready to receive using friend's node as the message of purpose node or using content-preference as guiding
Node m is then added in the selfish node list sList of node n by messagen, list the affiliated community Oid of node mmAnd content-preference
ConmAnd sList is added in by the common Signature Proofs of node n and node mnThe authenticity of information；
Situation 2：It meets node m dump energiesDeficiency, then sentence the insufficient foundation of its dump energy of section be the need to ensure that when
Gap stkUntil finish time, node m receives the message of destination node using dump energy, and formula is：
Wherein,It is node m in slot s tkThe interior unit interval energy consumption under link idle state,For
Node m is in slot s tkThe interior unit interval energy consumption under link connection state,For apart from slot s tkFinish time
The interior link idle time,For apart from slot s tkLink connection and node connects node m as a purpose in finish time
Receive the time of message；By node m in slot s tkInterior history interaction experiences determine；Node n adds in node m
sListn, node m is listed as energy deficiency node and is only capable of survival to slot s tkUntil finish time；
Situation 3：The node m cache resources that meet are insufficient, then judge that its cache resources deficiency formula is：
Wherein,Represent the spatial cache that node m is not yet utilized,It represents to save for the purpose of node n in node m
The occupied spatial cache of message of point,It represents shared by the message using node m as purpose node cached in node n
Spatial cache；
Node m can change the situation of inadequate buffer space in follow-up by actively forwarding message, therefore when node m is cached
It needs to adjust spatial cache when insufficient,
Wherein, Represent the occupied spatial cache of node m own messages,It represents to have cached the occupied spatial cache of message for being but under the jurisdiction of other nodes in node m；
Message forwarding priority is determined according to message similarity, and calculation formula is：
Wherein,Represent that message is cached in node m and belongs to content-preference ConAMessage similarity, C (Mm∈ConA)
The quantity of such message, C (M have been cached in expression node mn∈ConA) represent to be cached with the number of such message in node n
Amount；Therefore,Numerical values recited determine that node m is pressed by the difference of node n and node m institutes buffered message content-preference
Message is forwarded successively according to the order of message similarity from low to high；
The congestion that concept transfer m is gradually generated in early period moving process need to improve the caching of forwarding message in the follow-up process
Space and accordingly reduce receive message spatial cache；If node m is in slot s tkThe average cache space of interior reception message isThe average cache space of forwarding message isIt is to node n forwarding message spatial cache incrementsMessage is received to delay
Depositing space increments isNode m is by congestion to being the time required to normal conditionCalculation formula is：Therefore, as cache insufficient selfish node should actively be forwarded during subsequent movement message with
Congestion risk is reduced, node is enable to become cooperative node again by selfish node as early as possible.
3. a kind of radio sensing network node secure state evaluating method based on faith mechanism as claimed in claim 2,
It is characterized in that：Node n according to the node that causes to meet be produced from without permission for the reason for selfish node and producing cause are separately added into
sListnIn and plus timestamp, it is as shown in the table：
The selfish node list sList of node nn
When node meets, it is necessary to the selfish node list sList by signature authentication is exchanged with each other, with reference to the node that meets
SList, assessment master nodes are by judging whether the node that meets is cooperative node timely replacement sList；
When object of assessment node has been claimed as selfish node, assessment master nodes by selfish node reputation value be recorded as this when
Set trust threshold in gap, until object of assessment node releases selfish behavior.
4. a kind of radio sensing network node secure state evaluating method based on faith mechanism as described in claim 1,
It is characterized in that：In the step S2, three kinds are for collecting the approach of reputation value assessment information：
(1) friend's nodes recommendations：Friend's node with object of assessment node by interacting, if object of assessment node reputation value is higher than
Trust threshold set by friend's node, and complete cooperation forwarding obligation, then friend's node can trust evaluation object node,
Object of assessment node reputation value is improved, there is certain transitivity due to trusting, assessment master nodes also can trust evaluation visitor
Body node；
(2) relay node is fed back：When relay node meets with assessment master nodes, relay node is the evaluated main body section of message
Point and the downstream node after object of assessment node, if relay node obtains message eventually by object of assessment node, are demonstrate,proved
Bright object of assessment node has fulfiled the obligation of cooperation forwarding message；
(3) destination node is fed back：After destination node receives message, by parse communicating pair node signature after road
Learn that cooperation forwards the relay node legal identity of the message by list rList；Destination node can accordingly improve successful delivery
The relay node reputation value of message；In addition, destination node sends feedback information when meeting with other nodes, make other node phases
Object of assessment node reputation value should be adjusted.
5. a kind of radio sensing network node secure state evaluating method based on faith mechanism as described in claim 1,
It is characterized in that：In the step S2, malicious node reputation value assessment specific method is：
When node n is in slot s tkWhen interior and node m meets, if the selfish behavior of the unidentified node m of node n and in a network head
Secondary interaction, then node n will regard node m first as cooperative node, more new node m is in the recommendation coefficients R C (st of this time slotk)n,m, meter
Calculating formula is：
Wherein,Represent node n in slot s tkThe interior interaction total degree with friend's node,Represent node n
In slot s tkFriend's node interaction times of interior recommended node m；Since assessment master nodes n can not be directly by handing over node m
The reputation value of mutual quantitative evaluation object node m, node n needs are interacted with relay node l, pass through the feedback information of relay node l
Confirm whether node m has cooperated and forwarded message, therefore confirm that cooperating process needs tripartite's node to complete jointly, and tripartite's node
Need between any two that there are certain collision probabilities；It is met sequentially in time by node n and node m, to node m and node l phases
It meets, then the indirect collision probability IP (st to meet to node n and node lk)n,m,l, calculation formula is：
Wherein, t (stk)residueIt represents apart from slot s tkThe time of finish time,Represent node n and node m, again with
The average approach interval time that node l meets；Node m is according in slot s tkInterior forwarded Message Record is provided to node n to be turned
Hair it is expected FE (stk)m, it was demonstrated that in the ability of this time slot forwarding message, calculation formula is：
Wherein, j is represented in slot s tkInterior some node that meets with node m, u are represented in slot s tkThe node that meets of interior nodes m
Quantity,Represent the average forwarding message number of node m and node j, t (stk)residueIt represents apart from slot s tkTerminate
Time,Represent the average approach interval time in the time slot interior nodes m and node j；
According to above-mentioned parameter, master nodes n is in slot s t for assessmentkThe interior reputation value TR (st for calculating object of assessment node mk)n,m, meter
Calculating formula is：
Wherein,Represent assessment master nodes n in slot s tkThe interior object of assessment node fed back by relay node l
Message dilivery quantity, ∑ C (stk)n,mRepresent node n in slot s tkInside it is forwarded to the message number of node m, and usually ∑ C
(stk)n,m＜ FE (stk)m, PL (stk)n,mIt represents to verify not tampered message by destination node, this message is repeated section
Point l successful deliveries to destination node hop count；
Next time slot reputation value is predicted by quantized reputation value：When assessment master nodes n is measured in each time slot finish time
Change the reputation value of object of assessment node m, and using auto-regressive time series model prediction node m next time slot reputation value,
Predictor formula is：
Wherein, TR (stk)n,m, TR (stk-1)n,m..., TR (stk-p)n,mIt is to assess master nodes n in slot s tk, stk-1...,
stk-pThe interior reputation value to object of assessment node m is assessed, and α is auto-regressive time series model parameter,For white noise sequence,
And obedience average is 0, variance σ2Normal distribution, p be autoregression order；It is p by autoregression order according to formula (1), it can
Following (k-p) a formula is derived, shown in equation below：
OrderA=[α1 α2…αp-1 αp]T, Then being converted into matrix form is：
TR=BA+u,
Using least square method, so as to draw solution：
A=(BT·B)-1·BTTR,
The exponent number of p is determined according to H.AKaike information order selection criteria (AIC)：
Wherein,Represent the variance of object of assessment node reputation value residual error between the observed value and predicted value of different time-gap, N tables
Show assessment reputation value quantity, it is necessary to the value for making AIC numerical value minimum is the exponent number of p, so as to draw assess master nodes n for
The reputation value assessment of object of assessment node m.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711269049.7A CN108092759B (en) | 2017-12-05 | 2017-12-05 | Wireless sensor network node security state evaluation method based on trust mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711269049.7A CN108092759B (en) | 2017-12-05 | 2017-12-05 | Wireless sensor network node security state evaluation method based on trust mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108092759A true CN108092759A (en) | 2018-05-29 |
| CN108092759B CN108092759B (en) | 2021-03-23 |
Family
ID=62173774
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711269049.7A Active CN108092759B (en) | 2017-12-05 | 2017-12-05 | Wireless sensor network node security state evaluation method based on trust mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108092759B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109040075A (en) * | 2018-08-08 | 2018-12-18 | 中国联合网络通信集团有限公司 | Management method, server and the system of wireless mobile sensor network interior joint |
| CN109729521A (en) * | 2019-01-02 | 2019-05-07 | 清华大学深圳研究生院 | A kind of safe machine meeting data transmission method of trust-aware |
| CN111542052A (en) * | 2020-04-24 | 2020-08-14 | 河南中医药大学 | Group trust degree-based data forwarding method and device in Internet of things |
| CN115002002A (en) * | 2022-04-02 | 2022-09-02 | 中国兵器科学研究院 | Equipment system information communication capacity evaluation method, device, equipment and medium |
| CN115801621A (en) * | 2022-11-25 | 2023-03-14 | 湖北工程学院 | Social perception network selfish node detection method and storage medium |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050030921A1 (en) * | 2003-07-25 | 2005-02-10 | Royal Holloway University Of London | Routing protocol for ad hoc networks |
| CN101014013A (en) * | 2007-02-09 | 2007-08-08 | 上海大学 | Reliability-based secure routing method of wireless sensor network |
| US20130094398A1 (en) * | 2011-09-10 | 2013-04-18 | Arnab Das | Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing |
| CN103152252A (en) * | 2013-01-29 | 2013-06-12 | 无锡南理工科技发展有限公司 | Whole-domain synergy forwarding method for wireless sensing ad-hoc network nodes |
| CN103781142A (en) * | 2013-10-28 | 2014-05-07 | 西安邮电大学 | Method for deploying application codes based on trust in wireless sensor network |
| WO2014156177A1 (en) * | 2013-03-27 | 2014-10-02 | Nec Corporation | A method of controlling a plurality of sensor nodes, computer product tangibly embodied in a machine-readable medium, and a sensor system |
| CN104221344A (en) * | 2011-01-13 | 2014-12-17 | 塔塔咨询服务有限公司 | Method and system for trust management in distributed computing systems |
| CN105392152A (en) * | 2015-10-22 | 2016-03-09 | 重庆邮电大学 | Data forwarding method for assessing reputation of selfish node |
| CN105578455A (en) * | 2016-01-27 | 2016-05-11 | 哈尔滨工业大学深圳研究生院 | Distributed dynamic reputation evaluation method in opportunity network |
| CN105873065A (en) * | 2016-03-28 | 2016-08-17 | 南京邮电大学 | Safe positioning method of wireless sensor network based on trust level evaluation |
| CN106488393A (en) * | 2016-09-30 | 2017-03-08 | 天津大学 | Cluster wireless sensor network election of cluster head model based on evolutionary Game mechanism |
| US20170195826A1 (en) * | 2016-01-06 | 2017-07-06 | King Abdulaziz University | Trust evaluation wireless network for routing data packets |
-
2017
- 2017-12-05 CN CN201711269049.7A patent/CN108092759B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050030921A1 (en) * | 2003-07-25 | 2005-02-10 | Royal Holloway University Of London | Routing protocol for ad hoc networks |
| CN101014013A (en) * | 2007-02-09 | 2007-08-08 | 上海大学 | Reliability-based secure routing method of wireless sensor network |
| CN104221344A (en) * | 2011-01-13 | 2014-12-17 | 塔塔咨询服务有限公司 | Method and system for trust management in distributed computing systems |
| US20130094398A1 (en) * | 2011-09-10 | 2013-04-18 | Arnab Das | Methods systems, and devices for robustness improvement in a mobile ad hoc network using reputation-based routing |
| CN103152252A (en) * | 2013-01-29 | 2013-06-12 | 无锡南理工科技发展有限公司 | Whole-domain synergy forwarding method for wireless sensing ad-hoc network nodes |
| WO2014156177A1 (en) * | 2013-03-27 | 2014-10-02 | Nec Corporation | A method of controlling a plurality of sensor nodes, computer product tangibly embodied in a machine-readable medium, and a sensor system |
| CN103781142A (en) * | 2013-10-28 | 2014-05-07 | 西安邮电大学 | Method for deploying application codes based on trust in wireless sensor network |
| CN105392152A (en) * | 2015-10-22 | 2016-03-09 | 重庆邮电大学 | Data forwarding method for assessing reputation of selfish node |
| US20170195826A1 (en) * | 2016-01-06 | 2017-07-06 | King Abdulaziz University | Trust evaluation wireless network for routing data packets |
| CN105578455A (en) * | 2016-01-27 | 2016-05-11 | 哈尔滨工业大学深圳研究生院 | Distributed dynamic reputation evaluation method in opportunity network |
| CN105873065A (en) * | 2016-03-28 | 2016-08-17 | 南京邮电大学 | Safe positioning method of wireless sensor network based on trust level evaluation |
| CN106488393A (en) * | 2016-09-30 | 2017-03-08 | 天津大学 | Cluster wireless sensor network election of cluster head model based on evolutionary Game mechanism |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109040075A (en) * | 2018-08-08 | 2018-12-18 | 中国联合网络通信集团有限公司 | Management method, server and the system of wireless mobile sensor network interior joint |
| CN109040075B (en) * | 2018-08-08 | 2021-03-19 | 中国联合网络通信集团有限公司 | Management method, server and system for nodes in wireless mobile sensor network |
| CN109729521A (en) * | 2019-01-02 | 2019-05-07 | 清华大学深圳研究生院 | A kind of safe machine meeting data transmission method of trust-aware |
| CN111542052A (en) * | 2020-04-24 | 2020-08-14 | 河南中医药大学 | Group trust degree-based data forwarding method and device in Internet of things |
| CN111542052B (en) * | 2020-04-24 | 2023-04-18 | 河南中医药大学 | Group trust degree-based data forwarding method and device in Internet of things |
| CN115002002A (en) * | 2022-04-02 | 2022-09-02 | 中国兵器科学研究院 | Equipment system information communication capacity evaluation method, device, equipment and medium |
| CN115002002B (en) * | 2022-04-02 | 2024-02-13 | 中国兵器科学研究院 | Equipment system information communication capability assessment method, device, equipment and medium |
| CN115801621A (en) * | 2022-11-25 | 2023-03-14 | 湖北工程学院 | Social perception network selfish node detection method and storage medium |
| CN115801621B (en) * | 2022-11-25 | 2023-10-17 | 湖北工程学院 | Social perception network selfish node detection method and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108092759B (en) | 2021-03-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108092759A (en) | A kind of radio sensing network node secure state evaluating method based on faith mechanism | |
| CN104080140B (en) | Collaboration communication method based on trust evaluation in a kind of mobile ad-hoc network | |
| Haddadou et al. | A job market signaling scheme for incentive and trust management in vehicular ad hoc networks | |
| Qin et al. | Research on trust sensing based secure routing mechanism for wireless sensor network | |
| CN102333307B (en) | Wireless sensor network (WSN) trust evaluation method based on subjective belief | |
| Jesudoss et al. | Stimulating truth-telling and cooperation among nodes in VANETs through payment and punishment scheme | |
| Mahmoud et al. | Secure and reliable routing protocols for heterogeneous multihop wireless networks | |
| CN100493088C (en) | Method for applying cooperative enhancement mechanism to adhoc network | |
| CN105578455A (en) | Distributed dynamic reputation evaluation method in opportunity network | |
| CN103957525A (en) | Malicious node detection method based on clustering trust evaluation in internet of vehicles | |
| Abd El-Moghith et al. | Towards designing a trusted routing scheme in wireless sensor networks: A new deep blockchain approach | |
| CN101801011A (en) | WSN (Wireless Sensor Network) safety routing method based on credit evaluating mechanism | |
| Guo et al. | A lightweight verifiable trust based data collection approach for sensor–cloud systems | |
| Su et al. | Trusted opportunistic routing based on node trust model | |
| Wang et al. | A node trust evaluation method of vehicle-road-cloud collaborative system based on federated learning | |
| Wei et al. | SUCCESS: A Secure User-centric and Social-aware Reputation Based Incentive Scheme for DTNs. | |
| Yu et al. | A cross-layer security monitoring selection algorithm based on traffic prediction | |
| Haddadou et al. | DTM 2: Adapting job market signaling for distributed trust management in vehicular ad hoc networks | |
| Alharthi et al. | A computational model for reputation and ensemble-based learning model for prediction of trustworthiness in vehicular ad hoc network | |
| CN102045707B (en) | Trust construction method for accelerating trust convergence | |
| Beghriche et al. | A fuzzy trust-based routing model for mitigating the misbehaving nodes in mobile ad hoc networks | |
| CN112910873A (en) | Useful workload proving method and system for block chain transaction anomaly detection | |
| Li et al. | A reputation-based secure scheme in vehicular ad hoc networks | |
| CN102523603B (en) | A kind of monitoring of isomerous wireless mesh network and method of estimation | |
| CN104702609B (en) | Mobile Ad Hoc networks route intrusion detection method based on friend's mechanism |
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 |