WMNs中基于节点可信度的机会路由改进算法

doi:10.11896/j.issn.1002-137X.2017.08.027

摘要/Abstract

摘要： 机会路由提高了WMNs的可靠性和吞吐量,但同时由于节点候选集中存在恶意节点,导致网络性能下降。对于如何及时识别、隔离网络中的恶意节点的问题,建立了一种节点可信度评估模型。基于贝叶斯网络算法,考虑到非恶意因素带来的网络异常行为,引入不确定交互因子,改进了直接信任的评估方法,利用熵为信任值的计算和更新分配权重。引入反映节点真实参与度的行为积极因子并结合信任值得出节点的可信度,对可信度处于待定状态的节点进行未来可信度的预测,以甄别潜在的恶意节点。最后将该模型应用于机会路由ExOR中,提出了一种基于节点可信度的机会路由算法BTOR。实验结果表明,该算法可以有效检测恶意节点,在各项性能指标上比原路由算法更具优势。

关键词: WMNs,机会路由,节点可信度,行为积极因子,可信度预测

Abstract: Opportunistic routing improves the reliability and throughput of WMNs,at the same time,the network performance degrades due to the existence of malicious nodes in candidate set.In order to solve the problem that how to timely identify and isolate malicious nodes,a node trustworthiness evaluation model was proposed.Based on Bayesian Networks Algorithm,considering the abnormal behavior caused by non-invasive factors,the uncertainty interaction factor is introduced to improve the estimate method of direct trust,and entropy is used to assign weights for calculation and update of trust value.The trustworthiness of the node is obtained by combining the trust value and the positive factor of behavior which is introduced to reflect the real participation of nodes,and the future trustworthiness for those nodes whose trustworthiness is uncertain is predicted to identify potential malicious nodes.Finally,the model was applied to ExOR and an opportunistic routing algorithm based on trustworthiness BTOR was proposed.The experimental results show that the algorithm can effectively detect the malicious nodes,and has advantages than original routing algorithms in performances.

Key words: WMNs,Opportunistic routing,Node trustworthiness,Behavior positive factor,Trustworthiness prediction

印新棋,吴军,莫伟伟,白光伟. WMNs中基于节点可信度的机会路由改进算法[J]. 计算机科学, 2017, 44(8): 151-156. https://doi.org/10.11896/j.issn.1002-137X.2017.08.027

YIN Xin-qi, WU Jun, MO Wei-wei and BAI Guang-wei. Improved Opportunistic Routing Algorithm Based on Node Trustworthiness for WMNs[J]. Computer Science, 2017, 44(8): 151-156. https://doi.org/10.11896/j.issn.1002-137X.2017.08.027

参考文献

[1] AKYILDIZ I F,WANG X.A survey on wireless mesh networks[J].IEEE Communications Magazine,2005,43(9):23-30.
[2] ESLAMI M,KARIMI O,KHODADADI T.A survey on wireless mesh networks:Architecture,specifications and challenges[C]∥Control and System Graduate Research Colloquium.IEEE.Shah Alam,Malaysia,2014:219-222.
[3] BISWAS S,MORRIS R.Opportunistic routing in multi-hop wire-less networks[J].ACM Special Interest Group on Data Communication,2004,34(1):69-74.
[4] BOUKERCHE A,DAREHSHOORZADEH A.OpportunisticRouting in Wireless Networks:Models,Algorithms,and Classifications[J].ACM Computing Surveys,2015,47(2):1-36.
[5] DAREHSHOORZADEH A,CERDA-ALABERN L.Distance pro- gress based opportunistic routing for wireless mesh networks[C]∥2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC).IEEE,Shanghai,China,2012:179-184.
[6] DAREHSHOORZADEH A,SANCHEZ M I,Boukerche A.Modelingand Analysis of Opportunistic Routing in Multi-hop Wireless Networks[C]∥International Symposium on Modeling,Analysis and Simulation of Computer and Telecommunication Systems.Pairs,France,2014:337-344.
[7] DAREHSHOORZADEH A,ALMULLA M,B OUKERCHE A,et al.On the number of candidates in opportunistic routing for multi-hop wireless networks[C]∥ACM International Sympo-sium on Mobility Management and Wireless Access.Barccelona,Spain,2013:9-16.
[8] SANCHEZ-IBORRA R,CANO M D.JOKER:A Novel Opportunistic Routing Protocol[J].IEEE Journal on Selected Areas in Communications,2016,34(5):1690-1703.
[9] WANG W,CHEN X,LU M,et al.Code pruning in opportunistic routing through bidirectional coding traffic comparison[J].Wireless Communications & Mobile Computing,2016,16(3):279-299.
[10] YU H,SHEN Z,MIAO C,et al.A Survey of Trust and Reputation Management Systems in Wireless Communications[J].Proceedings of the IEEE,2010,98(10):1755-1772.
[11] JADIDOLESLAMY H,AREF M R, BAHRAMGIRI H.A fuzzy fully distributed trust management system in wireless sensor networks[J].International Journal of Electronics and Communications,2016,70(1):40-49.
[12] CHEN S L,ZHANG Y Q.Robust multi-dimensional trust mo-del for improving the survivability of Ad hoc networks[J].Journal on Communications,2010,1(5):1-9.(in Chinese) 陈深龙,张玉清.增强Ad hoc网络可生存性的健壮多维信任模型[J].通信学报,2010,31(5):1-9.
[13] LI X Q,LYU M R,LIU J C.A trust model based routing protocol for secure ad hoc networks[C]∥Proc of IEEE Aerospace Conference.Big Sky,Montana,USA,2004:1266-1295.
[14] BO W,HUANG C,LI L,et al.Trust-based minimum cost opportunistic routing for Ad hoc networks[J].Journal of Systems &Software,2011,84(12):2107-2122.
[15] THORAT S A,KULKARNI P J.Opportunistic Routing inPresence of Selfish Nodes for MANET[J].Wireless Personal Communications,2015,82(2):689-708.
[16] SALEHI M,BOUKERCHE A,DAREHSHOORZADEH A,etal.Towards a novel trust-based opportunistic routing protocol for wireless networks[J].Wireless Networks,2016,22(3):927-943.
[17] BALZANO L,SRIVASTAVA M.Reputation-based framework for high integrity sensor networks[J].ACM Transactions on Sensor Networks,2008,4(3):1-15.
[18] LI N,DAS S K.A trust-based framework for data forwarding in opportunistic networks[J].Ad Hoc Networks,2013,11(4):1497-1509.
[19] ZHOU Z P,SHAO N N.A Improved trust evaluation modelbased on Bayesian for WSNs[J].Chinese Journal of Sensors and Actuators,2016,9(6):927-933.(in Chinese) 周治平,邵楠楠.基于贝叶斯的改进WSNs信任评估模型[J].传感技术学报,2016,9(6):927-933.
[20] The network simulator-ns-2[EB/OL].http:www.isi.edu/ns-nam/ns.
[21] XIA N,LI W,LUO J Z,et al.A Routing Node Behavior Prediction Algorithm based on Fluctuation type identification[J].Chinese Journal of Computers,2014,7(2):326-334.(in Chinese) 夏怒,李伟,罗军舟,等.一种基于波动类型识别的路由节点行为预测算法[J].计算机学报,2014,7(2):326-334.
[22] SHI B,LIU S F,DANG Y G,et al.Recursive solution to unbia-sed grey model and its optimization[J].Systems Engineering Theory & Practice,2011,31(8):1532-1538.(in Chinese) 石斌,刘思峰,党耀国,等.无偏灰色预测模型递推解法及其优化[J].系统工程理论与实践,2011,31(8):1532-1538.

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed