期刊文献+

基于狩猎搜索的可信QoS路由算法 被引量:5

Hunting Search Based Trustworthy QoS Routing Algorithm
下载PDF
导出
摘要 提出了一种可信QoS路由算法,采用区间形式描述用户需求以适应用户QoS和信任要求的模糊性,采用基于滑动窗口和窗台的信任评估与控制机制,引入满意度函数,基于狩猎搜索寻找满足用户需求的优化路径.对提出的算法进行了仿真实现,并在多个实际网络拓扑和虚拟网络拓扑上进行了性能评价,结果表明,所提算法是可行和有效的,同现有算法相比,具有更好的性能. A trustworthy QoS routing algorithm was proposed. The interval was used to describe the user requirement in order to adapt to the fuzziness of the user QoS and trust demand. Based on the sliding window and windowsill, the trust evaluation and control mechanism were implemented. The satisfaction degree function was introduced to find the optimal path which satisfies the user requirement on the basis of the hunting search algorithm. The simulation of the proposed algorithm was realized, and the performance evaluation was done over several actual and virtual network topologies. The results showed that the proposed algorithm was both feasible and effective, and had better performance than that of the existing ones.
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2012年第10期1385-1389,共5页 Journal of Northeastern University(Natural Science)
基金 国家自然科学基金资助项目(61070162 71071028 70931001) 教育部高等学校博士学科点专项科研基金资助项目(20100042110025 20110042110024) 中央高校基本科研业务费专项资金资助项目(N110204003 N100423004)
关键词 可信路由 服务质量 狩猎搜索 路由算法 模糊性 trustworthy routing QoS (quality of service) hunting search routing algorithm fuzziness
  • 相关文献

参考文献8

  • 1Cheng W, Yu L, Xiong F, et al. Trusted network coding in wireless Ad Hoc network I C ] // IEEE Globaecom. Miami, 2010:1-5.
  • 21)ong X Y, Wang J J, Zhang Y, et al. End-to end QoS provisioning in future cognitive heterogeneous networks [ C ff IEEE International Conference on Communications Technology and Applications. Alexandria, Egypt, 2009:425 - 429.
  • 3李君,张顺颐,李翠莲,宣冶.基于智能业务识别的可信路由研究[J].电信科学,2009,25(4):45-51. 被引量:5
  • 4Zouaidi S, Mellouk A, Bourennane M, et al. Design and performance analysis of an inductive QoS routing algorithm IJ 1. Computer Commutzications, 2009, 32 (12) : 1371 1376.
  • 5林闯,田立勤,王元卓.可信网络中用户行为可信的研究[J].计算机研究与发展,2008,45(12):2033-2043. 被引量:78
  • 6Oftadeh R, Mahjoob M J. A new meta-heuristic optimization algorithm hunting search [ C ] // The Fifth International Conference on Soft Computing, Computing with Words and Perceptions in System Analysis, Decision and Control. Cyprus, 2009 : 1 - 5.
  • 7Yaghmaei M, Baradaran M, Talebian H. A fuzzy QoS routing algorithm for communication networks l C]//The 10th IEEE Singapore International Systems. Singapore, 2006.
  • 8王兴伟,邹荣珠,黄敏.基于蚂蚁算法的ABC支持型QoS单播路由机制[J].东北大学学报(自然科学版),2009,30(5):652-655. 被引量:3

二级参考文献29

共引文献83

同被引文献31

  • 1林闯,彭雪海.可信网络研究[J].计算机学报,2005,28(5):751-758. 被引量:253
  • 2王学军,郭亚军.基于G1法的判断矩阵的一致性分析[J].中国管理科学,2006,14(3):65-70. 被引量:162
  • 3杜文峰,贾维嘉,王国军,陆文彦.基于k跳回溯机制的服务切换路由重建算法[J].小型微型计算机系统,2006,27(10):1850-1855. 被引量:1
  • 4Jaln S,Fall K, Patra R. Routing in a delay tolerant network [ C ]//Proceedings of the ACM SIGCOMM 2004. New York : ACM,2004 : 145 - 157.
  • 5Jones E, Li L, Ward P. Practical routing in delay-tolerant networks [ C ]//The 2005 SIGCOMM Workshop on Delay- Tolerant Networking. New York: ACM,2005:237 - 243.
  • 6Tariq M M B, Ammar M, Zegura E. Message ferry route design for sparse ad hoc networks with mobile nodes [ C ]// Proceedings of ACM MobiHoc 2006. New York:ACM,2006: 37 - 48.
  • 7Lindgren A, Doria A, Scheln O. Probabilistic routing in intermittently connected networks [ J ]. Lecture Notes in Computer Science,2004,3126:239 - 254.
  • 8Costa P, Mascolo C, Musolesi M, et al. Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks [ J ]. Journal on Selected Areas in Communication, 2008,26 (5) :748 -760.
  • 9Pan H, Crowcroft J, Yoneki E. BUBBLE rap: social-based forwarding in delay tolerant networks [ C ]//Proceedings of ACM MobiHoc 2008. New York: ACM,2008 : 241 - 250.
  • 10Wang Fu-xiong,Xiao Zi-qian,Chen Jing-you.Research on Security of Trusted Network and Its Prospects[C]//2010 2nd International Workshop on Education Technology and Computer Science.Wuhan,China,2010:256-259.

引证文献5

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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