期刊文献+

基于信任度评估的移动自组织网络路由协议 被引量:4

Routing Protocol for Mobile Ad Hoc Network Based on Trust Degree Evaluation
下载PDF
导出
摘要 针对移动自组织网络路由的可靠运行和安全保障问题,提出一种基于Dempster-Shafer证据理论的节点信任评估模型。利用历史交互信息计算直接信任度,通过邻居节点的推荐度量值获取间接信任度。对直接和间接信任度进行权重修正后根据Dempster组合规则合成,得到节点全局信任度。利用该模型对优化链络状态路由协议的多点中继技术进行优化,设计改进的路由协议TOLSR。仿真结果表明,TOLSR协议能发现和抑制网络的自私节点和恶意节点,有效提高移动自组织网络的可靠性,证明了该信任度评估模型的有效性和合理性。 Specific to reliability and security problems in Mobile Ad Hoc Network( MANET),a trust evaluation model based on Dempster-Shafer( D-S) evidence theory is proposed. Direct trust degree is calculated w ith historical interaction information and indirect trust is obtained from neighbor nodes' commendations. The direct trust degree and indirect trust are combined according to Dempster combination rule after being amended w ith w eight,to obtain node's comprehensive trust finally. On this basis,it optimizes the M ulti-point Relaying( M PR) technology in Optimized Link State Routing Protocol( OLSR),and proposes an improved routing protocol( TOLSR). Simulation result show s that the model can discoveries selfish nodes and malicious nodes,thus effectively improves the reliability of M ANET,w hich also proves the validity and rationality of the trust evaluation model.
出处 《计算机工程》 CAS CSCD 北大核心 2015年第4期135-139,共5页 Computer Engineering
基金 中国科学院先导科技专项基金资助项目"服务于海云计算的无线传输技术研究"(XDA06011100) 上海市科委科技小巨人培育企业基金资助项目(13HX1180800) 上海市经信委战略性新兴产业基金资助项目(BY2JJXA1001)
关键词 移动自组织网络 自私节点 DEMPSTER-SHAFER证据理论 信任度评估 优化链路状态路由协议 多点中继节点 Mobile Ad Hoc Network(MANET) selfish node Dempster-Shafer(D-S) evidence theory trust degree evaluation Optimized Link State Routing Protocol(OLSR) M ulti-point Relaying(M PR) node
  • 相关文献

参考文献12

  • 1Abolhasan M,Wysocki T, Dutkiewicz E. A Review of Routing Protocols for Mobile Ad Hoc Networks[ J ] Ad Hoc Networks ,2004,2( 1 ) : 1-22.
  • 2Clausen T, Jacquet P, Adjih C, et al. Optimized Link State Routing Protocol(OLSR) [ S ]. RFC 3626,2003.
  • 3Robert J M, Otrok H, Chriqi A. RBC-OLSR : Reputation- based Clustering OLSR Protocol for Wireless Ad Hoc Networks [ J ] Computer Communications, 2012,35 ( 4 ) : 487 -499.
  • 4Ahn J H,Lee T J. Multipoint Relay Selection for Robust Broadcast in Ad Hoc Networks [ J ]. Ad Hoc Networks, 2014,17(1 ) :82-87.
  • 5Qayyum A,Viennot L, Laouiti A. Multipoint Relaying: An Efficient Technique for Flooding in Mobile Wireless Networks, RR-3898 [ R ] INRIA, 2000.
  • 6张信明,曾依灵,干国政,陈国良.用遗传算法寻找OLSR协议的最小MPR集[J].软件学报,2006,17(4):932-938. 被引量:24
  • 7Gong Wei, You Zhiyang, Chen Danning, et al. Trust Based Routing for Misbehavior Detection in Ad Hoc Networks [ J ]. Journal of Networks, 2010, 44 ( 5 ) : 551-558.
  • 8王博,陈训逊.ad hoc网络中一种基于信任模型的机会路由算法[J].通信学报,2013,34(9):92-104. 被引量:12
  • 9徐从富,耿卫东,潘云鹤.面向数据融合的DS方法综述[J].电子学报,2001,29(3):393-396. 被引量:77
  • 10Kamvar S D, Schlosser M T, Garcia-Molina H. The Eigentrust Algorithm for Reputation Management in P2P Networks [ C ]//Proceedings of the 12th International Conference on World Wide Web. New York, USA: ACM Press ,2003:640-651.

二级参考文献67

共引文献126

同被引文献35

  • 1董萍,钱焕延,兰少华.移动自组织网络多径机会路由算法[J].南京理工大学学报,2013,37(3):337-343. 被引量:3
  • 2Folino F,Pizzuti C.An Evolutionary Multiobjective Approach for Community Discovery in Dynamic Networks[J].IEEE Transactions on Knowledge and Data Engineering,2014,26(8):1838-1852.
  • 3Newman M E J,Xiao Zhang,Nadakuditi R R.Spectra of Random Graphs with Community Structure and Arbitrary Degrees[J].Physical Review E,2014,89(4).
  • 4Pons P,Latapy M.Computing Communities in Large Networks Using Random Walks[C]//Proceedings of ISCIS’11.Berlin,Germany:Springer-Verlag,2011:191-218.
  • 5Ravi K,Guha R,Raghavan P,et al.Propagation of Trust and Distrust[C]//Proceedings of the 13th International Conference on World Wide Web.New York,USA:ACM Press,2004:403-412.
  • 6Freeman L C.The Development of Social Network Analysis with an Emphasis on Recent Events[J].The SAGE Handbook of Social Network Analysis,2011,21(3):26-39.
  • 7刘馥源,林友芳.复杂网络中组织结构发现算法[EB/OL].[2014-04-12].http://www.paper.edu.cn/html/releasepaper/2012/12/43/.
  • 8Hao Ma,Zhou Dengyong,Chao Liu,et al.Recommender Systems with Social Regularization[C]//Proceedings of the 4th ACM International Conference on Web Search and Data Mining.New York,USA:ACM Press,2011:287-296.
  • 9Boden B,Ester M,Seidl T.Density-based Subspace Clustering in Heterogeneous Networks[J].Machine Learning and Knowledge Discovery in Databases,2014,8724:149-164.
  • 10Ranjbar A,Maheswaran M.Using Community Structure to Control Information Sharing in Online Social Networks[J].Computer Communications,2014,41(5):11-21.

引证文献4

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部