Movatterモバイル変換


[0]ホーム

URL:


CN109495892A - Method is determined based on the wireless Mesh netword secure routing path of dynamic prestige - Google Patents

Method is determined based on the wireless Mesh netword secure routing path of dynamic prestige
Download PDF

Info

Publication number
CN109495892A
CN109495892ACN201811488771.4ACN201811488771ACN109495892ACN 109495892 ACN109495892 ACN 109495892ACN 201811488771 ACN201811488771 ACN 201811488771ACN 109495892 ACN109495892 ACN 109495892A
Authority
CN
China
Prior art keywords
node
credit value
source node
syn
dir
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.)
Pending
Application number
CN201811488771.4A
Other languages
Chinese (zh)
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.)
Civil Aviation University of China
Original Assignee
Civil Aviation University of China
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 Civil Aviation University of ChinafiledCriticalCivil Aviation University of China
Priority to CN201811488771.4ApriorityCriticalpatent/CN109495892A/en
Publication of CN109495892ApublicationCriticalpatent/CN109495892A/en
Pendinglegal-statusCriticalCurrent

Links

Classifications

Landscapes

Abstract

Translated fromChinese

一种基于动态信誉的无线Mesh网络安全路由路径确定方法。首先采用动态信誉机制评价节点行为,根据节点直接信誉值与推荐信誉值计算节点综合信誉值,整合节点历史综合信誉值与当前综合信誉值计算节点动态信誉值;然后结合动态信誉机制与路由机制建立安全路由路径,将动态信誉值数学期望小于阈值的节点判定为恶意节点,在路由过程中将其隔离。实验结果表明,与现有技术相比,本发明方法具有较高的恶意节点识别率,并能有效提高网络吞吐量,抵御内部恶意节点攻击。

A secure routing path determination method for wireless Mesh networks based on dynamic reputation. Firstly, the dynamic reputation mechanism is used to evaluate the node behavior, and the comprehensive reputation value of the node is calculated according to the direct reputation value and the recommended reputation value of the node, and the dynamic reputation value of the node is calculated by integrating the historical comprehensive reputation value and the current comprehensive reputation value of the node. Then, the dynamic reputation mechanism and routing mechanism are combined to establish Safe routing path, the node whose mathematical expectation of dynamic reputation value is less than the threshold is determined as malicious node, and it is isolated in the routing process. The experimental results show that, compared with the prior art, the method of the present invention has a higher identification rate of malicious nodes, and can effectively improve the network throughput and resist internal malicious node attacks.

Description

Method is determined based on the wireless Mesh netword secure routing path of dynamic prestige
Technical field
The invention belongs to technical field of network security, pacify more particularly to a kind of wireless Mesh netword based on dynamic prestigeSystem-wide is by determining method of path.
Background technique
With the development of network technology, wireless Mesh netword (wirelss mesh network, WMN) is widely used inMultiple fields.The opening of WMN transmission medium and the dynamic of network topology structure, so that the network is easily by internal maliceThe attack of node.Simultaneously because internal malicious node can use legal authorization and be pretended, traditional routed path determination sideMethod can not be accurately identified in routing procedure, be destroyed during route transmission so as to cause bulk information.Therefore,How effectively to identify that malicious node is resisted in routing procedure to internal attack, becomes the heat of current WMN Security routing Mechanism StudyPoint problem.
Sarma proposes a kind of security routing (secure hierarchical and based on secured hierarchical and roleRole based routing protocol for mobile wireless sensor network, SHaRP), to routingThe quality safety value of calculate node credit value and link, is selected safe according to calculated result while control information is encryptedRouted path.Bounouni etc. proposes a kind of node credit value and contribution margin mixing confirmation method (new hybridAcknowledgment approach, NHACK), contribution system is combined using the prestige value calculating method based on monitoring confirmation technologyContribution margin of the operator node in route establishment process is counted, selects safe and efficient routing road according to node credit value and contribution marginDiameter.Wu Jun etc. proposes a kind of credible chance routing forwarding model based on feedback credibility, passes through feedback credibility model evaluationNodes ' behavior, and then identify the malicious node in wireless Mesh netword, realize the defence of collusion attack in routing procedure.
However existing method is not comprehensive enough to the evaluation of node in routing procedure, lacks timeliness and dynamic, does not haveOverall merit is made to node in conjunction with node historical behavior and current behavior, causes the identification of malicious node in routing procedure inadequateAccurately.
Summary of the invention
To solve the above-mentioned problems, the wireless Mesh netword peace based on dynamic prestige that the purpose of the present invention is to provide a kind ofSystem-wide is by determining method of path.
In order to achieve the above object, the wireless Mesh netword secure routing path provided by the invention based on dynamic prestige is trueThe method of determining includes the following steps carried out in order:
1) routing information request RREQ is generated by source node j, and broadcasts to its neighbor node;
2) after the arbitrary node i in neighbor node receives solicited message RREQ, local credit value database is inquired, search hasThe data packet forwarding information for closing source node j calculates the direct credit value T of source node j according to query resulti;jdir, and savedIn local credit value database;
3) threshold value of credit value mathematic expectaion is set as β;Calculate the mathematic expectaion E of the direct credit value of source node j(Ti;jdir), if E (Ti;jdir) < β determines source node j then for malicious node and is isolated;If E (Ti;jdir) > β or no footEnough data carry out the mathematic expectaion E (T of the direct credit value of source node ji;jdir) calculating, then perform the next step and judged suddenly;
4) node i broadcasts credit value query information to its neighbor node, it is desirable that it provides the recommendation about source node jBreath starts recommendation reputation value calculating process;
5) after any common neighbor node of node i and source node j receive credit value query information as recommended node m,It inquires local credit value database and feeds back to node i for query result as recommendation information;
6) node i arranges the recommendation information that all neighbor nodes received are fed back, and calculates the recommendation of source node jCredit value Ti:jind
7) node i calculates the synthesis prestige of source node j according to the above-mentioned direct credit value being calculated and recommendation reputation valueValue Ti;jsynAnd the current composite credit value NewT as source node ji:jsyn, gone through in conjunction with source node j in credit value databaseHistory integrates credit value OldTi:jsynCalculate the dynamic credit value DynT of source node ji:jsyn
8) the mathematic expectaion E (DynT of source node j dynamic credit value is calculatedi:jsyn), if E (DynTi:jsyn) < β, then node iDetermine that source node j for malicious node and is isolated;If E (DynTi:jsyn) > β, then determine source node j for trusted node and to itsSend route response message RREP;
9) after source node j receives response message RREP, step 2)-step 8) is executed to judge whether node i is credible sectionPoint;If node i is determined as trusted node by source node j, data transmitting is carried out as the next-hop node in routing, it is noThen it is isolated;
10) circulation executes step 2)-step 9), until finding out source node j to routing satisfactory between destination nodePath.
In step 2), the direct credit value T of the calculating source node ji;jdirMethod be combined with subjective logic reasonBy i.e. Ti;jdir=(bi:jdir, di:jdir, ui:jdir, a), wherein a indicates that node i inclines to believe in the degree of source node j, uniformly takesValue is 0.5;bi:jdir、di:jdirAnd ui:jdirNode i is respectively indicated to the trusting degree of source node j, distrust degree and is not knownDegree, their calculation formula are as follows:
Wherein, si:jIndicate the quantity that source node j successfully forwarded from the data packet that node i receives;fi:jExpression source sectionThe quantity that point j is abandoned from the data packet that node i receives.
In step 3), the mathematic expectaion E (T of the direct credit value of source node ji;jdir) calculation formula it is as follows:
In step 6), the recommendation reputation value T of the source node ji:jind=(bi:jind, di:jind, ui:jind, a),In, it is 0.5 that a, which unifies value,;bi:jind、di:jindAnd ui:jindCalculation formula it is as follows:
Wherein, bm:jdir、dm:jdirAnd um:jdirRespectively indicate recommended node m to the trusting degree of source node j, distrust journeyDegree and uncertainty degree, the same formula of their calculation method (1);The quantity of n expression recommended node;hmIndicate any one recommendationThe weight factor of node m, calculation method are as follows:
Wherein, E (Ti:mdir) node i is represented to the mathematic expectaion of the direct credit value of recommended node m.
In step 7), the synthesis credit value T of the source node ji;jsyn=(bi:jsyn, di:jsyn, ui:jsyn, a);ItsIn, it is 0.5 that a, which unifies value,;bi:jsyn、di:jsynAnd ui:jsynCalculation formula it is as follows:
In step 7), the dynamic credit value DynT of the source node ji:jsynCalculation formula is as follows:
DynTi:jsyn=τ × ω1×OldTi:jsyn2×NewTi:jsyn (6)
Wherein, OldTi:jsynIndicate the comprehensive credit value of the history of source node j, set node integrate credit value calculating cycle as10s, then the history of source node j integrates credit value OldTi:jsynThe synthesis credit value for being source node j before 10s;NewTi:jsynTableShow the current composite credit value of source node j;ω1And ω2Respectively indicate the comprehensive credit value of history and current composite letter of source node jThe weight factor of reputation value, since the current composite credit value of node credit value more comprehensive than history has higher reference value, becauseThis ω1And ω2Meet: 0 < ω12< 1, ω12=1;τ is decay factor, indicates the decaying journey of history credit value at any timeDegree, 0 < τ < 1.
In step 8), the mathematic expectaion E (DynT of the source node j dynamic credit valuei:jsyn) calculation formula is as follows:
Compared with prior art, the wireless Mesh netword secure routing path provided by the invention based on dynamic prestige determinesMethod malicious node discrimination with higher, and network throughput can be effectively improved, resist internal malicious node attack.
Detailed description of the invention
Fig. 1 is that the wireless Mesh netword secure routing path provided by the invention based on dynamic prestige determines method flowFigure.
Specific embodiment
With reference to the accompanying drawing and specific embodiment the present invention is described further, but following embodiments are absolutely not to this hairIt is bright to have any restrictions.
As shown in Figure 1, the wireless Mesh netword secure routing path provided by the invention based on dynamic prestige determines methodIncluding the following steps carried out in order:
1) routing information request RREQ is generated by source node j, and broadcasts to its neighbor node;
2) after the arbitrary node i in neighbor node receives solicited message RREQ, local credit value database is inquired, search hasThe data packet forwarding information for closing source node j calculates the direct credit value T of source node j according to query resulti;jdir, and savedIn local credit value database;
The direct credit value T of the calculating source node ji;jdirMethod combine Subjective Logic Theory, i.e. Ti;jdir=(bi:jdir, di:jdir, ui:jdir, a), wherein a indicates that node i inclines to believe in the degree of source node j, and unified value is 0.5;bi:jdir、di:jdirAnd ui:jdirNode i is respectively indicated to the trusting degree of source node j, distrust degree and uncertainty degree, itCalculation formula it is as follows:
Wherein, si:jIndicate the quantity that source node j successfully forwarded from the data packet that node i receives;fi:jExpression source sectionThe quantity that point j is abandoned from the data packet that node i receives.
3) threshold value of credit value mathematic expectaion is set as β;Calculate the mathematic expectaion E of the direct credit value of source node j(Ti;jdir), if E (Ti;jdir) < β determines source node j then for malicious node and is isolated;If E (Ti;jdir) > β or no footEnough data carry out the mathematic expectaion E (T of the direct credit value of source node ji;jdir) calculating, then perform the next step and judged suddenly;
Mathematic expectaion E (the T of the direct credit value of source node ji;jdir) calculation formula it is as follows:
4) node i broadcasts credit value query information to its neighbor node, it is desirable that it provides the recommendation about source node jBreath starts recommendation reputation value calculating process;
5) after any common neighbor node of node i and source node j receive credit value query information as recommended node m,It inquires local credit value database and feeds back to node i for query result as recommendation information;
6) node i arranges the recommendation information that all neighbor nodes received are fed back, and calculates the recommendation of source node jCredit value Ti:jind
The recommendation reputation value T of the source node ji:jind=(bi:jind, di:jind, ui:jind, a), wherein a unifies valueIt is 0.5;bi:jind、di:jindAnd ui:jindCalculation formula it is as follows:
Wherein, bm:jdir、dm:jdirAnd um:jdirRespectively indicate recommended node m to the trusting degree of source node j, distrust journeyDegree and uncertainty degree, the same formula of their calculation method (1);The quantity of n expression recommended node;hmIndicate any one recommendationThe weight factor of node m, calculation method are as follows:
Wherein, E (Ti:mdir) node i is represented to the mathematic expectaion of the direct credit value of recommended node m, the bigger expression of value pushes awayThe credibility for recommending node m is higher, corresponding weight factor hmBigger, the recommendation information of recommended node m is in final recommendationShared specific gravity is also bigger in reputation value.
7) node i calculates the synthesis prestige of source node j according to the above-mentioned direct credit value being calculated and recommendation reputation valueValue Ti;jsynAnd the current composite credit value NewT as source node ji:jsyn, gone through in conjunction with source node j in credit value databaseHistory integrates credit value OldTi:jsynCalculate the dynamic credit value DynT of source node ji:jsyn
The synthesis credit value T of the source node ji;jsyn=(bi:jsyn, di:jsyn, ui:jsyn, a);Wherein, a unifies valueIt is 0.5;bi:jsyn、di:jsynAnd ui:jsynCalculation formula it is as follows:
The dynamic credit value DynT of the source node ji:jsynCalculation formula is as follows:
DynTi:jsyn=τ × ω1×OldTi:jsyn2×NewTi:jsyn (6)
Wherein, OldTi:jsynIndicate the comprehensive credit value of the history of source node j, set node integrate credit value calculating cycle as10s, then the history of source node j integrates credit value OldTi:jsynThe synthesis credit value for being source node j before 10s;NewTi:jsynTableShow the current composite credit value of source node j;ω1And ω2Respectively indicate the comprehensive credit value of history and current composite letter of source node jThe weight factor of reputation value, since the current composite credit value of node credit value more comprehensive than history has higher reference value, becauseThis ω1And ω2Meet: 0 < ω12< 1, ω12=1;τ is decay factor, indicates the decaying journey of history credit value at any timeDegree, 0 < τ < 1.
8) the mathematic expectaion E (DynT of source node j dynamic credit value is calculatedi:jsyn), if E (DynTi:jsyn) < β, then node iDetermine that source node j for malicious node and is isolated;If E (DynTi:jsyn) > β, then determine source node j for trusted node and to itsSend route response message RREP;
Mathematic expectaion E (the DynT of the source node j dynamic credit valuei:jsyn) calculation formula is as follows:
9) after source node j receives response message RREP, step 2)-step 8) is executed to judge whether node i is credible sectionPoint;If node i is determined as trusted node by source node j, data transmitting is carried out as the next-hop node in routing, it is noThen it is isolated;
10) circulation executes step 2)-step 9), until finding out source node j to routing satisfactory between destination nodePath.

Claims (7)

CN201811488771.4A2018-12-062018-12-06Method is determined based on the wireless Mesh netword secure routing path of dynamic prestigePendingCN109495892A (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CN201811488771.4ACN109495892A (en)2018-12-062018-12-06Method is determined based on the wireless Mesh netword secure routing path of dynamic prestige

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CN201811488771.4ACN109495892A (en)2018-12-062018-12-06Method is determined based on the wireless Mesh netword secure routing path of dynamic prestige

Publications (1)

Publication NumberPublication Date
CN109495892Atrue CN109495892A (en)2019-03-19

Family

ID=65698315

Family Applications (1)

Application NumberTitlePriority DateFiling Date
CN201811488771.4APendingCN109495892A (en)2018-12-062018-12-06Method is determined based on the wireless Mesh netword secure routing path of dynamic prestige

Country Status (1)

CountryLink
CN (1)CN109495892A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN111314336A (en)*2020-02-112020-06-19中国科学院信息工程研究所Dynamic transmission path construction method and system for anti-tracking network
US20220207048A1 (en)*2020-12-282022-06-30EMC IP Holding Company LLCSignal of trust access prioritization
CN115209404A (en)*2021-04-082022-10-18南京航空航天大学Unmanned aerial vehicle self-organizing network malicious node detection algorithm based on supervised learning and clustering algorithm

Citations (5)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN101222331A (en)*2007-01-092008-07-16华为技术有限公司 Method and system for two-way authentication in authentication server and mesh network
US8149748B2 (en)*2006-11-142012-04-03Raytheon CompanyWireless data networking
CN103841553A (en)*2014-03-272014-06-04福建师范大学Method for routing security and privacy protection of mixed wireless Mesh network
CN104038928A (en)*2014-03-262014-09-10宋晓宇Method for calculating trust values of wireless Mesh network nodes
WO2018099806A1 (en)*2016-12-022018-06-07Philips Lighting Holding B.V.Relaying messages of unreachable nodes via the neighbor network to target mesh network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
US8149748B2 (en)*2006-11-142012-04-03Raytheon CompanyWireless data networking
CN101222331A (en)*2007-01-092008-07-16华为技术有限公司 Method and system for two-way authentication in authentication server and mesh network
CN104038928A (en)*2014-03-262014-09-10宋晓宇Method for calculating trust values of wireless Mesh network nodes
CN103841553A (en)*2014-03-272014-06-04福建师范大学Method for routing security and privacy protection of mixed wireless Mesh network
WO2018099806A1 (en)*2016-12-022018-06-07Philips Lighting Holding B.V.Relaying messages of unreachable nodes via the neighbor network to target mesh network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
杨宏宇: "无线Mesh网络恶意节点检测模型", 《清华大学学报(自然科学版)》*

Cited By (3)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN111314336A (en)*2020-02-112020-06-19中国科学院信息工程研究所Dynamic transmission path construction method and system for anti-tracking network
US20220207048A1 (en)*2020-12-282022-06-30EMC IP Holding Company LLCSignal of trust access prioritization
CN115209404A (en)*2021-04-082022-10-18南京航空航天大学Unmanned aerial vehicle self-organizing network malicious node detection algorithm based on supervised learning and clustering algorithm

Similar Documents

PublicationPublication DateTitle
Luo et al.Blockchain enabled trust-based location privacy protection scheme in VANET
Jhaveri et al.Sensitivity analysis of an attack-pattern discovery based trusted routing scheme for mobile ad-hoc networks in industrial IoT
Li et al.RGTE: A reputation-based global trust establishment in VANETs
Zhang et al.Blockchain-empowered efficient data sharing in Internet of Things settings
Singh et al.Fuzzy based advanced hybrid intrusion detection system to detect malicious nodes in wireless sensor networks
WO2020000924A1 (en)Message reliability evaluation method for aggregating two trust evaluations in internet of vehicles
CN108810155B (en) A method and system for evaluating the reliability of vehicle location information in the Internet of Vehicles
CN109495892A (en)Method is determined based on the wireless Mesh netword secure routing path of dynamic prestige
CN107404718B (en)Malicious node detection method for wireless sensor network
Zhang et al.Preserving privacy against external and internal threats in WSN data aggregation
CN107888422A (en)The analysis method of community network trusted node interlayer interaction
CN111311932A (en)Intelligent traffic light timing method based on vehicle networking block chain
Suganthi et al.An advanced fitness based routing protocol for improving QoS in VANET
CN105848242A (en)Safety route optimization method based on trust perception in wireless sensor network
Vargheese et al.Design of fuzzy logic control framework for qos routing in manet
CN105141528A (en)Internet of things trusted routing method based on Core-Selecting and reputation mechanism
Ramalingam et al.Fork-Hook encryption policy based secured Data Centric Routing Gateway for proactive trust ware data transmission in WBSN
Ghodichor et al.Secure routing protocol to mitigate attacks by using blockchain technology in MANET
Muruganandam et al.A Survey: Comparative study of security methods and trust manage solutions in MANET
Ahmad et al.Packet integrity defense mechanism in OppNets
Man et al.Cache pollution detection method based on GBDT in information‐centric network
CN105682096A (en)Internet of things credible route selection method and system based on AGV and reputation system
CN106412888B (en)Appearance based on performance feedback invades method for routing
HuangA Data‐Driven WSN Security Threat Analysis Model Based on Cognitive Computing
CN101969405A (en)Safe routing method based on credibility in P2P (Peer-to-Peer) environment

Legal Events

DateCodeTitleDescription
PB01Publication
PB01Publication
SE01Entry into force of request for substantive examination
SE01Entry into force of request for substantive examination
WD01Invention patent application deemed withdrawn after publication

Application publication date:20190319

WD01Invention patent application deemed withdrawn after publication

[8]ページ先頭

©2009-2025 Movatter.jp