首页> 外文会议>International Conference on Computational and Characterization Techniques in Engineering and Sciences >A New Incentive Based Algorithm for Avoiding Free Riding in Peer to Peer Network
【24h】

A New Incentive Based Algorithm for Avoiding Free Riding in Peer to Peer Network

机译:一种新的基于激励措施,避免对等网络的避免释放

获取原文

摘要

A peer-to-peer (P2P) network undergoes various type of cheating attacks. In recent literature, to combat this attack, various trust value-based mechanisms are employed. These mechanisms decrease the trust value of malicious nodes and counter many types of attacks. But this does not solve the problem of non-participation or free riding fully. Here, we propose an incentive based simple yet effective scheme for avoiding free riding taking trust value of nodes into account. The proposed scheme helps reducing non-participation in P2P networks. The results show that the scheme is efficient for a P2P network of few tens of nodes. With slight modifications, this mechanism can be extended for large sized networks.
机译:点对点(P2P)网络经历各种类型的作弊攻击。在最近的文献中,为了打击这次攻击,采用各种信任价值的机制。这些机制减少了恶意节点的信任价值并抵消了许多类型的攻击。但这并不能解决非参与或自由骑行的问题。在这里,我们提出了一种基于激励的简单而有效的方案,以避免逃避骑行的节点信任价值。该拟议方案有助于减少P2P网络的不参与。结果表明,该方案对于几十多个节点的P2P网络是有效的。通过略微修改,可以为大型网络扩展该机制。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号