CN103701939A - Data exchange system and method thereof - Google Patents

Data exchange system and method thereof Download PDF

Info

Publication number
CN103701939A
CN103701939A CN201410018024.XA CN201410018024A CN103701939A CN 103701939 A CN103701939 A CN 103701939A CN 201410018024 A CN201410018024 A CN 201410018024A CN 103701939 A CN103701939 A CN 103701939A
Authority
CN
China
Prior art keywords
node
data
trust
evaluating
evaluating data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201410018024.XA
Other languages
Chinese (zh)
Other versions
CN103701939B (en
Inventor
王进
陈建平
顾翔
王有元
陈亮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong three hop Technology Investment Co., Ltd.
Original Assignee
Nantong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nantong University filed Critical Nantong University
Priority to CN201410018024.XA priority Critical patent/CN103701939B/en
Publication of CN103701939A publication Critical patent/CN103701939A/en
Application granted granted Critical
Publication of CN103701939B publication Critical patent/CN103701939B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Computer And Data Communications (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention provides a data exchange method. The data exchange method comprises the following steps: a first node in network acquires a trust vector set of a plurality of second nodes which are to be subjected to data interaction by feedback nodes, determines the trust values of the plurality of second nodes according to the trust vector set, determines interaction object nodes which are to be subjected to data interaction from the plurality of second nodes according to the trust values, and performs data interaction with the determined interaction object nodes. The invention also provides a data interaction system. According to the invention, the erroneous judgment times can be reduced effectively, thereby improving the reliability and usability of data interaction of network nodes.

Description

Data exchange system and method thereof
Technical field
The present invention relates to network information processing technology, relate in particular to a kind of data interaction system and method thereof in peer-to-peer network.
Background technology
In peer to peer environment, between the main body of not knowing each other mutually, often need to carry out data interaction and complete a certain activity, such as network trading, pp file transmission download etc.In network, data volume is very huge, and true and false data mix.How the unworthy or false data of filtering from mass data, obtain and utilize valuable True Data, for effective utilization of peer-to-peer network, are very important.
The service transacting of peer to peer environment of take is example, and the subject identity of service can be divided into service requester and ISP.When a requestor faces a plurality of alternative ISP, credible, reliable ISP of requestor's how to confirm also obtains quality services to it, is the key technical problem in peer-to-peer network.
Service evaluation data for ISP are to determine a basis for estimation of ISP's the credible and degree of reliability.But, the complexity of society, the virtual property of network and non-direct contact etc., make to have authentic assessment data, incomplete objective appraisal data and the falseness various situations such as evaluating data (hereinafter to be referred as " unreal evaluating data ") maliciously for ISP's evaluating data.If left, unreal evaluating data exists, and people just cannot distinguish or confirm ISP's real service quality so, causes the chaotic of network trading and service environment and destroys.Therefore,, in web services environment, be necessary unreal evaluating data to filter.
In the problem of filtering at unreal evaluating data at present, mostly adopted the filter method based on irrelevance, the main thought of these class methods is: the evaluating data difference degree with evaluating data person to same ISP, go to portray the size of irrelevance, think that the large node of irrelevance is exactly malicious node.This hypothesis and actual conditions are not inconsistent, and easily cause erroneous judgement.In fact, directly simply divide node into honest node and malicious node, can not summarize the behavioural characteristic of node in real system completely, can cause erroneous judgement.For example: if the service that certain node provides is an e-book, some users like this book, and some users but do not like, this species diversity is that subjectivity by user produces mostly; But if to slander this e-book be a virus document to certain node, giving goes on business comments, and this is likely malice evaluating data.Therefore subjective assessment data and malice evaluating data very likely can show consistency, make both evaluating data similarities very large, cause algorithm erroneous judgement.Equally, part of nodes is reluctant to provide valuable evaluating data to certain reciprocal process, and the evaluating data of selective system acquiescence, presents passivity.This evaluating data itself without malice, but in the process of filtering at evaluating data, with the collusion of malicious node formation advantage, also can make the algorithm based on evaluating data irrelevance lose efficacy.Therefore, the effect of existing unreal evaluating data filter method is unsatisfactory.
Summary of the invention
The object of the present invention is to provide data exchange system and method thereof, improve the validity of data interaction.
According to an aspect of the present invention, provide data interactive method, having comprised: in the first node acquisition network in network, feedback node will be to having carried out the trust vector set of a plurality of Section Points of data interaction; First node according to trust vector set determine the trust value of a plurality of Section Points; First node, according to definite trust value, is determined the interactive object node that will carry out data interaction from a plurality of Section Points; First node and definite interactive object node carry out data interaction.
In some embodiments, wherein trust vector set according to feedback node the evaluating data vector set to each Section Point
Figure BDA0000457763710000025
and the feedback degree of belief of each feedback node determines, wherein
Figure BDA0000457763710000022
one of feedback node r ito Section Point p jevaluating data vector; And/or the trust value of wherein determining Section Point comprises: to each the node r in trust vector set i, select to retain evaluating data and the corresponding node that confidence level is higher; With according to the evaluating data of the respective nodes of selecting, determine the trust value of Section Point.
In some embodiments, select to retain evaluating data that confidence level is higher and the step of corresponding node can comprise: each node in the set of identification trust vector
Figure BDA0000457763710000023
whether comprise insecure evaluating data; With node corresponding to unreliable evaluating data in the set of deletion trust vector.
In above-mentioned steps, according to the evaluating data of the node of selecting, determine that the step of the trust value of Section Point can comprise:
According to
Figure BDA0000457763710000024
exceptional value threshold range is set, deletes in set higher than the evaluating data of anomaly evaluation high thresholdhigh with lower than the evaluating data of anomaly evaluation threshold value lower limit; To the set after suppressing exception thresholding, extract any two groups of evaluating datas and do and differ from and divide into groups; For the evaluating data of grouping, be chosen in each node to more one group of proportion in the trust evaluation set TrustTable of Section Point; With one group of evaluating data to selection, get weighted average, obtain feeding back degree of belief Γ f, from TrustTable inquiry, obtain direct degree of belief Γ d, according to direct degree of belief Γ dwith feedback degree of belief Γ f, determine the trust value trust of Section Point j.
In some embodiments, can also comprise: the trust value trust that further judges Section Point jwhether be greater than predetermined value, if judgment result is that trust value is greater than predetermined value, first node determines that this Section Point is interactive object node, and carries out data interaction with interactive object node.
According to a further aspect in the invention, a kind of data interaction system is provided, comprise: the first node in network, a plurality of feedback nodes that can communicate by letter with first node, and can with the Section Point of first node and feedback node data interaction, wherein, first node comprises degree of belief determining unit, in acquisition network, feedback node will be to carrying out the trust vector set of a plurality of Section Points of data interaction, and according to trust vector, the trust value of a plurality of Section Points is determined in set; With data interaction unit, according to definite trust value, from a plurality of Section Points, determine the interactive object node that will carry out data interaction, and carry out data interaction with definite interactive object node.
In some embodiments, degree of belief determining unit according to feedback node the evaluating data vector set to each Section Point
Figure BDA0000457763710000035
and the feedback degree of belief of each feedback node determines, wherein
Figure BDA0000457763710000032
one of feedback node r ito Section Point p jevaluating data vector.Wherein, degree of belief determining unit also can be to each the node r in trust vector set i, select to retain evaluating data and the corresponding node that confidence level is higher; With according to the evaluating data of the respective nodes of selecting, determine the trust value of Section Point.
In some embodiments, degree of belief determining unit can be identified each node in trust vector set
Figure BDA0000457763710000033
whether comprise insecure evaluating data, and delete node corresponding to unreliable evaluating data in trust vector set.
In some embodiments, degree of belief determining unit is also carried out following operation:
According to exceptional value threshold range is set, deletes in set higher than the evaluating data of anomaly evaluation high thresholdhigh with lower than the evaluating data of anomaly evaluation threshold value lower limit; To the set after suppressing exception thresholding, extract any two groups of evaluating datas and do and differ from and divide into groups; For the evaluating data of grouping, be chosen in each node to more one group of proportion in the trust evaluation set TrustTable of Section Point; With one group of evaluating data to selection, get weighted average, obtain feeding back degree of belief Γ f, from TrustTable inquiry, obtain direct degree of belief Γ d, according to direct degree of belief Γ dwith feedback degree of belief Γ f, determine the trust value trust of Section Point j.
In some embodiments, data interaction unit can judge the trust value trust of Section Point jwhether be greater than predetermined value, if judgment result is that trust value is greater than predetermined value, first node determines that this Section Point is interactive object node, and carries out data interaction with interactive object node.
In some embodiments, data interaction system also comprises trust table data cell, stores the trust value of first node to Section Point, and after data interaction, upgrades trust value, and trust value is sent to first node and feedback node.
Erroneous judgement number of times when the present invention can effectively be reduced in and carry out data interaction between network node, thus the mutual reliabilty and availability of network node data promoted.
Accompanying drawing explanation
Fig. 1 is the data interaction architectural schematic of one embodiment of the present invention;
Fig. 2 is the method flow schematic diagram of the data interaction of one embodiment of the present invention.
Fig. 3 is the data interaction system schematic diagram of one embodiment of the present invention.
Embodiment
Below in conjunction with drawings and the specific embodiments, the present invention is described in further detail.
As shown in Figure 1, data interactive method provided by the invention can be applied in peer to peer environment.Hereinafter, service requester is as first node 100, and ISP is as first node 300, and for service requester (first node 100), providing is feedback node 200 to ISP's (first node 300) evaluating data feedback.The node type that is appreciated that first node 100, first node 300 and feedback node 200 is not what fix, can be according to the interior perhaps other factors alternative types of data interaction.
This peer to peer environment does not have core super node, thereby evaluating data is not to launch around ISP.At service requester, obtain in the process of service, service requester active collection Feedback Evaluation data, the Feedback Evaluation data of collecting are filtered and identified, and then ISP's degree of belief is estimated, the ISP node high to degree of belief obtains service, and the actual reciprocal process of this service is made to evaluating data.Meanwhile, dynamically update the trusted status to ISP, for forwarding TrustTable next time, provide trusted status foundation, TrustTable comprises trust vector, service requester, the trust estimation that ISP and service requester are made ISP.
The generation of Feedback Evaluation data and forwarding are carried out as follows.Feedback Evaluation is data from Feedbacks Peers, Feedbacks Peers does not participate in certain other mutual nodes in network, the service node (being the node of request service) that is provided in mutual node feeds back dependent credit message, is mainly trust vector.Feedbacks Peers processes ISP's evaluating data vector set, and wherein evaluating data vector representation is
Figure BDA0000457763710000042
as mentioned below, by the evaluating data vector calculation vector of establishing trust.Evaluating data vector is stored in LocalHistoryArray, comprises service requester r i, ISP p j, and r ito p jthe evaluating data ratings that the service providing provides.
Suppose node r ito p jset D={d at the evaluating data providing in mutual for nearest h time 1, d 2..., d h, d wherein k∈ [0,1], k ∈ [1, h], h≤10.Element in set D derives from LocalHistoryArray, arranges in chronological order d 1from the current once mutual evaluation producing more of a specified duration, d hexpression is from the evaluation of current recent mutual generation.
Figure BDA0000457763710000043
represent node r ito p jelement in the evaluating data set D providing in mutual for nearest h time merges the evaluating data obtaining.Merge and carry out as follows:
ratings i j = Σ k = 1 h d k × γ ( k ) k , h ≠ 0 0 , h = 0
In conjunction with the cognitive process of psychology of human society, from current, recently should can reflect the authentic assessment data cases of present node to the service of receiving alternately.Therefore, to de novo interbehavior, give more weights, reduce the early weight of interaction experiences, at the superior historical factor gamma (k) decaying in time of evaluating data, γ (k) ∈ [0,1].Wherein h is r ito same node p jthe number of evaluating data history vectors.Historical factor gamma (k) computing formula is as follows:
γ ( k ) = 1 , k = h γ ( k - 1 ) = γ ( k ) - 1 h , 1 ≤ k ≤ h
In peer to peer environment, between node, status is equal to, and does not serve as third party's node of agency, also just there is no reliable feedback person, and broadcast feedback information is unique selection.Each node adopts the mode of fixed time broadcast, forwards the TrustTable record of oneself to credible neighbours.
For the degree of belief to ISP is estimated, calculation services supplier's degree of belief comprises 2 parts: direct degree of belief and feedback degree of belief, and by the estimation with the stack degree of establishing trust of feedback degree of belief result by direct degree of belief.The direct trust evaluation data that directly degree of belief is ISP, after feedback degree of belief is service requester and ISP's interaction data, the trust evaluation data of service requester to ISP's feedback.
The directly calculating of degree of belief:
Figure BDA0000457763710000053
node r ito p jfusion at the evaluating data collection providing in mutual for nearest h time.As described above.
The calculating of feedback degree of belief: gather at trust vector TrustTable in, N wherein ifor ratings filters the passive evaluating data after (explanation sees below), i ∈ [1, t], S jto be the subjective assessment data after ratings filtration, j ∈ [1, k], B kto be the malice evaluating data after ratings filtration, k ∈ [1, m], H pto be the honest evaluating data after ratings filtration, p ∈ [1, n].Trust vector is weighted and on average obtains feeding back degree of belief.The passive evaluating data of wherein identifying, malice evaluating data is corrupt data, and weight is 0, and subjective assessment data weighting is 0.5, and honest evaluating data weight is 1.Weighted average calculation formula is as follows:
Γ f = ( Σ i = 1 t N i * 0 + Σ k = 1 m B k * 0 + Σ j = 1 l S j * 0.5 + Σ p = 1 n H p * 1 ) / ( j + p )
The estimation of degree of belief: be by direct degree of belief and feedback degree of belief are superposeed, according to formula trust j=w 1* Γ d+ w 2* Γ foperation, w 1and w 2be respectively weight separately, meet w 1+ w 2=1,
w 1∈[0,1],w 2∈[0,1]。(w 1and w 2be empirical parameter, in this example, adopt w 1=w 2=0.5)
Dynamically update trusted status, node completes the Evaluation and Prediction of degree of belief according to Mathematical Modeling, dynamically carries out recalculating of trust value.Node A and Node B mutual (a for example service transacting) before, will be estimated the trust value as the Node B of evaluating data object as the node A of evaluating data main body.If trust j<0.5, is considered as not physical node, reselects evaluating data object.Otherwise, can complete mutual.After completing alternately, node A need to upgrade the trust value to B in TrustTable.
If this alternately the Feedback Evaluation data based on feedback person as judgement basis, node A will provide the trust state value of the main body of feedback to it in TrustTable inquiry while upgrading it to the trust value of Node B, if sincere node is accepted feedback person's Feedback Evaluation, otherwise refusal feedback person's Feedback Evaluation.
The trust messages of the present invention's feedback is obtained by broadcast.If node is physical node not around, refusal, from the Feedback Evaluation data of this neighbor node, to the not physical node identifying, is revised node trusted status.Specifically, node A carries out filter analysis to the trust state of own neighbor node, if own neighbor node is physical node not, its trust state is set to insincere, and after refusal from the Feedback Evaluation data of this neighbor node.
Node regularly forwards TrustTable to adjacent trusted node, only accepts the Feedback Evaluation data that trusted node provides simultaneously.If receive the feedback that neighbor node provides indiscriminately, be easy to because neighbor node is physical node not, the feedback providing that receives physical node is not also real data not, thus easily generation is refused trust service or is accepted the situation of bad service.Thereby node trusted status has very strong actual use value.
As shown in Figure 2, data filtering method according to an embodiment of the present invention comprises:
Node A searches for the service of obtaining (step S201), wherein nodes set ρ={ p from network 1, p 2... p ncan provide a certain service to node A.Node A picks out node p from set ρ j(1≤j≤n) (step S202).
It is p that node A extracts ISP from TrustTable jtrust vector set φ.Each vector in this trust vector set φ
Figure BDA0000457763710000061
represent r inode is to p jthe evaluating data that the service that node provides provides is
Figure BDA0000457763710000062
(S203).
To the r in the trust vector set φ extracting in step S203 i, identify it and provide no for passive evaluating data (step S204).If r iin TrustTable to node p arbitrarily jthe evaluating data providing is all the same, judges that evaluating data is passive evaluating data, this node r ifor passive node; Otherwise, carry out next r ithe judgement of node.So continue, to the last a r inode judgement is complete.If each node r iall different to the evaluating data that other node provides arbitrarily in TrustTable, think and there is no passive evaluating data in the evaluating data of this trust vector set φ, in set also without passive node.
If in step S204, the evaluating data in set φ while being judged as non-passive evaluating data, further judge all the other each evaluating datas
Figure BDA0000457763710000064
value; Otherwise in delete step S204 by set the evaluating data in φ
Figure BDA0000457763710000065
be judged as the node r of passive evaluating data i, more further judge other evaluating data
Figure BDA0000457763710000066
value.In experimentation, with
Figure BDA0000457763710000067
the concentrated scope of value as range of normal value, by checking, this scope is set to 80%, contributes to the filtration of these exceptional values, and which piece that concentrates on of whole evaluation set can be described, is convenient to like this find out abnormity point, meanwhile, can not delete other evaluations again by mistake.
If wherein 80%
Figure BDA0000457763710000071
value is all more than or equal to 0.5, and evaluating data exceptional value thresholding is set to first threshold scope, and for example 0.9 and 0.2; If wherein 80%
Figure BDA0000457763710000072
value is all less than 0.5, and Second Threshold scope is set, and for example 0.8 and 0.1.
According to the setting of step S204, delete in set φ higher than the evaluating data of the anomaly evaluation data gate limit value upper limit with lower than the evaluating data of anomaly evaluation data gate limit value lower limit
Figure BDA0000457763710000073
thereby deleted abnormal evaluating data (S205).The evaluating data staying may include part subjective assessment data, honest evaluating data and malice evaluating data.Because not all subjective node is all abnormal, most of or honest, thereby thereby identify subjective node by setting threshold scope.The evaluating data that subjective node provides, can be subject to the restriction of the subjective factors such as the ken of node own, to same service, may have larger difference.Therefore, in this example, extra high evaluating data and low especially evaluating data are all rejected away, distinguished point is deleted, contribute to the follow-up processing to data, can not affect because of distinguished point the calculating of mean value, thereby reach the object of identification.
Evaluating data in the definite set of step S205 includes honest evaluating data, malice evaluating data, part subjective assessment data.Not deleting all subjective assessment data, why delete those abnormal nodes, is because above-mentioned abnormal nodes can cause very large impact for choosing of standard.
Extract any two evaluating datas do poor.Two evaluating datas (a, b), suppose that wherein a is standard, are the poor number Sab that obtains.From evaluating data set, extract an evaluating data c again, be poor relatively Sac with standard a, if Sac<Sab, a and c be a set, otherwise c and b are a set; From evaluating data set, extract an evaluating data d again, be poor Sad, if Sad<min{Sac; Sab}, if Sac<Sab, d and c are in a set; if Sac>Sab, d and b are in a set; If Sad>max{Sac, Sab}, if Sac<Sab, d and b are in a set, if Sac>Sab, d and c are in a set; If Sad is situated between, judgement more close who, corresponding and who belong to a set together.So until all extracted evaluating data.
Two groups of evaluating datas that are divided into like this, the difference of corresponding evaluating data can meet the difference of respectively organizing desk evaluation data and be tending towards 0.Because, if along with the number of evaluating increases, evaluate on the same group set and should derive from same class service requester, only there is random error in the evaluation that same ISP is provided, because of but can meet the difference of respectively organizing desk evaluation data and trend towards 0, if the satisfied difference of respectively organizing desk evaluation data trends towards 0, illustrate in two groups of evaluation set that are divided into, each group evaluation is all to derive from the same class attribute service evaluation person of ((sincerity) with a high credibility or (maliciously) with a low credibility), realize honest evaluation and malice and evaluated the classification of two class data, be divided into A and B group (step S206).
To the A of step S206 and B group evaluating data, select to retain one group of data that evaluation proportion in TrustTable of providing is large as the evaluation (S207) of believable node (service requester).One group of evaluating data that step S207 is retained processes to obtain feeding back degree of belief Γ f, direct degree of belief Γ dfrom TrustTable inquiry, obtain estimation egress p jtrust value trust j(step S208), computational methods are as the estimation step of above-mentioned degree of belief.
If the node p of estimation jtrust value trust j>=0.5, node A and p jstart transaction.Otherwise, reselect node, turn back to step S202 (step S209).
Node A and node p jcomplete after transaction, provide evaluating data, preserve evaluating data (step S210).Again to p jfeedback node 200 carries out trusted status classification, and overall process finishes.
In the analogue system of example, be provided with 42 nodes, in honest evaluating data: subjective assessment data: malice evaluating data: the ratio that passive evaluating data is 7:7:4:3 generates, and each node independently completes interactive history at random.On the evaluating data basis generating, a pair of node (the A of random choose, B), wherein the trust value of node A estimation Node B, moves respectively the inventive method, the filter method based on irrelevance and does not have filter algorithm to calculate trust value, the distance that irrelevance refers between evaluating data is algorithm of the present invention, do not have filter algorithm to refer to: a pair of node of random choose, without method of the present invention, filter evaluating data, directly initiate request, calculate False Rate, take False Rate as performance index.False Rate is that node A allows node A to the Node B that poor service is provided, initiate the shared proportion of number of times of request service by the definite trust value of said method of the present invention mistakenly.Test has been carried out 10 times altogether, experimental condition: require above-mentioned node to generate by corresponding proportion, ratio refers to node ratio, the generation of evaluating data is random, each node independently completes interactive history at random, the generation that is to say evaluating data is random, can guarantee that like this each node equiprobability of experiment participates in mutual.Strengthen credibility, generate in proportion node, independently complete at random interactive history, filter evaluating data.Do accordingly 1000 and take turns, count False Rate, said process is repeated 10 times, average, obtain final False Rate 5.1%, 20.4%, 50.9% and illustrated that improvement algorithm can effectively reduce erroneous judgement number of times, thereby can promote the reliabilty and availability of system.
According to a further aspect in the invention, a kind of data interaction system is provided, comprise as shown in Figure 3: the first node 100 in network, a plurality of feedback nodes 200 that can communicate by letter with first node 100, and can with the Section Point 300 of first node 100 and feedback node 200 data interactions.Wherein, first node 100 comprises degree of belief determining unit 101, obtains the 200 pairs of trust vector set that will carry out a plurality of Section Points 300 of data interaction of feedback node in network, and according to trust vector, the trust value of a plurality of Section Points 300 is determined in set; With data interaction unit 102, according to definite trust value, from a plurality of Section Points 300, determine the interactive object node that will carry out data interaction, and carry out data interaction with definite interactive object node.
Degree of belief determining unit 101 is according to the evaluating data vector set of 200 pairs of each Section Points 300 of feedback node
Figure BDA0000457763710000081
and the feedback degree of belief of each feedback node 200 determines, wherein
Figure BDA0000457763710000091
one of feedback node 200 r ito Section Point 300p jevaluating data vector.Wherein, degree of belief determining unit 101 also can be to each the node r in trust vector set i, select to retain evaluating data and the corresponding node that confidence level is higher; With according to the evaluating data of the respective nodes of selecting, determine the trust value of Section Point 300.Determine the method for Section Point 300 trust values as described above.
In addition, degree of belief determining unit 101 can be identified each node in trust vector set
Figure BDA0000457763710000092
whether comprise insecure evaluating data, and delete node corresponding to unreliable evaluating data in trust vector set.RM as described above.
Degree of belief determining unit 101 each node in carry out the set of identification trust vector whether comprise the insecure evaluating data police, can carry out following operation:
According to
Figure BDA0000457763710000094
exceptional value threshold range is set, deletes in set higher than the evaluating data of anomaly evaluation high thresholdhigh with lower than the evaluating data of anomaly evaluation threshold value lower limit; To the set after suppressing exception thresholding, extract any two groups of evaluating datas and do and differ from and divide into groups; For the evaluating data of grouping, be chosen in each node to more one group of proportion in the trust evaluation set TrustTable of Section Point 300; With one group of evaluating data to selection, get weighted average, obtain feeding back degree of belief Γ f, from TrustTable inquiry, obtain direct degree of belief Γ d, according to direct degree of belief Γ dwith feedback degree of belief Γ f, determine the trust value trust of Section Point 300 j.
Data interaction unit 102 can judge the trust value trust of Section Point 300 jwhether be greater than predetermined value, if judgment result is that trust value is greater than predetermined value, first node 100 determines that this Section Point 300 is interactive object node, and carries out data interaction with interactive object node.
Data interaction system also comprises trust table data cell 103, store the trust value of 100 pairs of Section Points 300 of first node, and after data interaction, upgrade the trust value to the Section Point 300 of this data interaction, and trust value is sent to first node 100 and feedback node 200.
Erroneous judgement number of times when the present invention can effectively be reduced in and carry out data interaction between network node, thus the mutual reliabilty and availability of network node data promoted.

Claims (10)

1. data interactive method, comprising:
In first node in network (100) acquisition network, feedback node (200) will be to carrying out the trust vector set of a plurality of Section Points (300) of data interaction;
Described first node (100) is determined the trust value of described a plurality of Section Point (300) according to described trust vector set;
Described first node (100), according to described trust value, is determined the interactive object node that will carry out data interaction from described a plurality of Section Points (300);
Described first node (100) carries out data interaction with described definite interactive object node.
2. data interactive method according to claim 1, wherein said trust vector set is the evaluating data vector set to Section Point described in each (300) according to described feedback node (200)
Figure FDA0000457763700000012
and feedback degree of belief of feedback node (200) is determined described in each, wherein
Figure FDA0000457763700000011
one of described feedback node (200) r ito described Section Point (300) p jevaluating data vector; And/or
The trust value of wherein said definite described Section Point (300) comprising:
To node r described in each in described trust vector set i, select to retain evaluating data and the corresponding node that confidence level is higher; With
According to the evaluating data of the respective nodes of described selection, determine the trust value of described Section Point (300).
3. data interactive method according to claim 2, wherein said selection retains evaluating data that confidence level is higher and the step of corresponding node comprises:
Identify each node in described trust vector set whether comprise insecure evaluating data; With
Delete node corresponding to unreliable evaluating data in described trust vector set, and/or
Described according to the evaluating data of the node of described selection, determine that the step of the trust value of described Section Point (300) comprising:
According to
Figure FDA0000457763700000014
exceptional value threshold range is set, deletes in set higher than the evaluating data of anomaly evaluation high thresholdhigh with lower than the evaluating data of anomaly evaluation threshold value lower limit;
To the described set after described suppressing exception thresholding, extract any two groups of evaluating datas and do and differ from and divide into groups;
For the evaluating data of described grouping, be chosen in each node to more one group of proportion in the trust evaluation set TrustTable of described Section Point (300); With
To one of described selection group of evaluating data, get weighted average, obtain described feedback degree of belief Γ f, from described TrustTable inquiry, obtain direct degree of belief Γ d, according to described direct degree of belief Γ dwith feedback degree of belief Γ f, determine the trust value trust of described Section Point (300) j, and/or
Further judge the trust value trust of described Section Point (300) jwhether be greater than predetermined value,
If judgment result is that described trust value is greater than predetermined value, described first node (100) determines that this Section Point (300) is described interactive object node, and carries out data interaction with described interactive object node.
4. data interactive method according to claim 2, wherein said evaluating data vector according to node r ito p jelement in the evaluating data set D providing in mutual for nearest h time merges and obtains, and described fusion is carried out as follows:
ratings i j = &Sigma; k = 1 h d k &times; &gamma; ( k ) k , h &NotEqual; 0 0 , h = 0
Wherein, h is r ito same node p jthe number of evaluating data history value, γ (k) is the historical factor, determines as follows:
&gamma; ( k ) = 1 , k = h &gamma; ( k - 1 ) = &gamma; ( k ) - 1 h , 1 &le; k &le; h
5. data interactive method according to claim 4, wherein said feedback degree of belief obtains in the following manner:
In the trust vector set TrustTable of described feedback node (200), establish
Figure FDA0000457763700000025
in, N wherein ifor passive evaluating data, i ∈ [1, t], S jto be subjective assessment data, j ∈ [1, k], B kmalice evaluating data, k ∈ [1, m], H phonest evaluating data, p ∈ [1, n], described feedback degree of belief Γ fby the weighted average of described passive evaluating data, malice evaluating data, subjective assessment data and honest evaluating data is obtained.
6. data interactive method according to claim 5, wherein said Γ fweighted average mode be:
&Gamma; f = ( &Sigma; i = 1 t N i * 0 + &Sigma; k = 1 m B k * 0 + &Sigma; j = 1 l S j * 0.5 + &Sigma; p = 1 n H p * 1 ) / ( j + p )
7. data interactive method according to claim 6, wherein said Section Point (300) degree of belief trust jobtain in the following manner:
trust j=w 1×Γ d+w 2×Γ f
Wherein, w 1and w 2be respectively weight coefficient, meet w 1+ w 2=1, w 1∈ [0,1], w 2∈ [0,1].
8. according to the data interactive method described in claim 1-7 any one, also comprise: described first node (100) and described interactive object node complete after data interaction, generate the evaluating data to described interactive object node.
9. a data interaction system, comprise: the first node in network (100), a plurality of feedback nodes (200) that can communicate by letter with first node (100), and can with the Section Point (300) of described first node (100) and feedback node (200) data interaction
Wherein, described first node (100) comprising:
Degree of belief determining unit (101), in acquisition network, feedback node (200) will be to carrying out the trust vector set of a plurality of Section Points (300) of data interaction, and according to trust vector, the trust value of a plurality of Section Points (300) is determined in set; With
Data interaction unit (102) according to described definite trust value, is determined the interactive object node that will carry out data interaction, and is carried out data interaction with definite interactive object node from described a plurality of Section Points (300).
10. data interaction system according to claim 9, wherein said data interaction system also comprises trust table data cell (103), store the trust value of described first node (100) to described Section Point (300), and after described data interaction, upgrade described trust value, and described trust value is sent to described first node (100) and feedback node (200).
CN201410018024.XA 2014-01-16 2014-01-16 Method for interchanging data Active CN103701939B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410018024.XA CN103701939B (en) 2014-01-16 2014-01-16 Method for interchanging data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410018024.XA CN103701939B (en) 2014-01-16 2014-01-16 Method for interchanging data

Publications (2)

Publication Number Publication Date
CN103701939A true CN103701939A (en) 2014-04-02
CN103701939B CN103701939B (en) 2017-07-28

Family

ID=50363333

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410018024.XA Active CN103701939B (en) 2014-01-16 2014-01-16 Method for interchanging data

Country Status (1)

Country Link
CN (1) CN103701939B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106911660A (en) * 2016-08-02 2017-06-30 中国移动通信集团设计院有限公司 A kind of approaches to IM and device
WO2021135857A1 (en) * 2020-01-02 2021-07-08 支付宝(杭州)信息技术有限公司 Method and device for updating trusted node information

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101714976B (en) * 2009-10-15 2012-10-31 浙江大学 Method for resisting malicious behaviors of nodes in P2P network
CN102244587B (en) * 2011-07-15 2013-07-31 杭州信雅达数码科技有限公司 Method for trust evaluation of nodes in network
CN103237023B (en) * 2013-04-16 2016-01-13 安徽师范大学 A kind of dynamic trust model constructing system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106911660A (en) * 2016-08-02 2017-06-30 中国移动通信集团设计院有限公司 A kind of approaches to IM and device
CN106911660B (en) * 2016-08-02 2020-12-08 中国移动通信集团设计院有限公司 Information management method and device
WO2021135857A1 (en) * 2020-01-02 2021-07-08 支付宝(杭州)信息技术有限公司 Method and device for updating trusted node information

Also Published As

Publication number Publication date
CN103701939B (en) 2017-07-28

Similar Documents

Publication Publication Date Title
JP7441582B2 (en) Methods, devices, computer-readable storage media and programs for detecting data breaches
US11830004B2 (en) Blockchain transaction safety
Pham et al. Anomaly detection in the bitcoin system-a network perspective
Isacenkova et al. Inside the scam jungle: A closer look at 419 scam email operations
García-Recuero Discouraging abusive behavior in privacy-preserving online social networking applications
CN107357790B (en) Abnormal message detection method, device and system
CN111355697B (en) Detection method, device, equipment and storage medium for botnet domain name family
WO2016022720A2 (en) Method and apparatus of identifying a transaction risk
CN107895038B (en) Link prediction relation recommendation method and device
CN106302104B (en) User relationship identification method and device
CN108985954B (en) Method for establishing association relation of each identifier and related equipment
WO2013097026A1 (en) Systems and methods for visualizing social graphs
CN109905399B (en) Social media individual abnormal user detection method based on self network structure evolution
KR102086936B1 (en) User data sharing method and device
Kamhoua et al. Preventing colluding identity clone attacks in online social networks
Zhang et al. Privacy Risk in Anonymized Heterogeneous Information Networks.
Bródka et al. Profile cloning detection in social networks
CN109088788A (en) Data processing method, device, equipment and computer readable storage medium
Puri et al. Application of ensemble Machine Learning models for phishing detection on web networks
CN103701939A (en) Data exchange system and method thereof
CN103810248A (en) Method and device for searching for interpersonal relationship based on photos
Revathi et al. Profile similarity communication matching approaches for detection of duplicate profiles in online social network
CN102790707A (en) Method and device for classifying object
Solanki et al. Website phishing detection using heuristic based approach
Shekokar et al. Security against sybil attack in social network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20190912

Address after: 510000 No. 1101, No. 246, 248, 250, Wushan Road, Guangzhou City, Guangdong Province, self-compiled 08 locations

Patentee after: Guangdong three hop Technology Investment Co., Ltd.

Address before: 226019 Jiangsu Province, Nantong City Chongchuan District sik Road No. 9

Patentee before: Nantong University