Computer Science ›› 2017, Vol. 44 ›› Issue (8): 151-156.doi: 10.11896/j.issn.1002-137X.2017.08.027

Previous Articles     Next Articles

Improved Opportunistic Routing Algorithm Based on Node Trustworthiness for WMNs

YIN Xin-qi, WU Jun, MO Wei-wei and BAI Guang-wei   

  • Online:2018-11-13 Published:2018-11-13

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

[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]
[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.

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .