期刊文献+

机会分流中一种改进声誉机制的评价算法

An Evaluation Algorithm for Improvement of Reputation Mechanism in Opportunistic Offloading
下载PDF
导出
摘要 在SoWatch(Social-based Watchdog system)基础上,提出一种基于节点历史数据量期望与方差和转发数据时间延迟的声誉评价算法(EVRA,Expectation Variance based Reputation Algorithm)。控制中心基于转发节点的历史数据分流量,给予声誉评价;目的节点基于转发节点完成数据分流的时间给予声誉评价。通过综合考虑目的节点与控制中心的声誉评价,真实地反映转发节点在数据分流中的贡献。为了验证EVRA的有效性,EVRM分别与SoWatch、无声誉机制Prophet转发路由协议进行比较。实验结果表明,与SoWatch机制相比,EVRA平均数据分流时间降低了15%,平均跳数降低10%。EVRA比无声誉机制的Prophet平均完成数据分流时间降低了30%和平均完成数据分流的跳数降低25%。 Based on the SoWatch(Social-based Watchdog system),an EVRA(Expectation Variance based Reputation Algorithm)is proposed,which is based on historical data expectation,variance,and time delay of data forwarding.The control center provides a reputation score based on the historical data of the forwarding node.The destination node provides the reputation score of nodes by evaluating their performances during the real-time forwarding process.The weighted calculation of the previous evaluation scores is conducted to truly represent the contribution of the forwarding node in the opportunistic network.To test the performance of the proposed algorithm,it is compared with other rivals,including the non-incentive Prophet path protocol and SoWatch incentive mechanism.There are a lot of experimentation in demonstrate that,compared with the SoWatch mechanism,EVRA reduces the average data offload time by 15%and the average hop count by 10%.Comparison with Prophet,a typical non-incentive mechanism path protocol,the EVRA mechanism reduced the average data offload time by 30%and the average completed data offloaded hops by 25%.
作者 李成双 李建波 李英 LI Cheng-shuang;LI Jian-bo;LI Ying(College of Computer Science and Technology,Qingdao University,Qingdao 266071,China)
出处 《青岛大学学报(自然科学版)》 CAS 2018年第4期29-34,共6页 Journal of Qingdao University(Natural Science Edition)
基金 国家自然科学基金项目(批准号:61502261)资助 山东省重点研发计划项目(批准号:2016GGX101032)资助 山东省教育厅高校科技计划项目(批准号:J14LN85)资助
关键词 机会分流 声誉机制 SoWatch PROPHET opportunity offloading reputation mechanism SoWatch Prophet
  • 相关文献

参考文献2

二级参考文献16

  • 1Sergio Marti,T J Giuli,Kevin Lai,Mary Baker.Mitigating routing misbehavor in mobile ad hoc networks[A].In Proceedings of MOBICOM 2000[C].Boston,2000.255-265.
  • 2Levente Buttyan,Jean-Pierre Hubaux.Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks[R].Technical Report DSC/2001/046,EPFL-DI-ICA,August 2001.
  • 3S Buchegger,JL Boudec.Performance analysis of the CONFIDANT protocol:cooperation of nodes-fairness In dynamic ad-hoc networks[A].In Proceeding of IEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC)[C].Lausanne,2002.226-236.
  • 4S Buchegger,JL Boudec.Nodes bearing grudges:towards routing security,fairness,and robustness in mobile ad hoc networks[A].In Proceedings of the Tenth Euromicro Workshop on Parallel,Distributed and Network-based Processing[C].Canary Islands,Spain,2002.403-410.
  • 5David B Johnson,David A Maltz,Yih-Chun Hu,Jorjeta G Jetcheva.The Dynamic Source Routing Protocol for Mobile Ad Hoc Network[S].draft-ietf-manet-dsr-07.txt,2002.
  • 6Pietro Michiardi,Refik Molva.CORE:A collaborative reputation mechanism to enforce node cooperation in mobile Ad hoc networks[A].The Sixth IFIP Conference on Security Communications and Multimedia (CMS 2002)[C].Portoroz,Slovenia,2002.107-121.
  • 7Hao Yang,Xiaoqiao Meng,Songwu Lu.Self-organized network-layer security in mobile ad hoc networks[A].Proceedings of the ACM Workshop on Wireless Security[C].Atlanta,GA,USA,2002.11-20.
  • 8C Perkins,E Royer,S Das.Ad Hoc on-Demand Distance Vector Routing[S].Internet Draft,draft-ietf-manet-aodv-10.txt,2002.
  • 9S Yi,P Naldurg,R Kravets.Security-Aware Ad-Hoc Routing for Wireless Networks[R].UIUCDCS-R-2001-2241 Technical Report,2001.
  • 10P Resnick,K Kuwabara,R Zeckhauser,E Friedman.Reputation systems[J].Communications of the ACM,2000,43(12):45-48.

共引文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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