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.

[1]  Ling Liu,et al.  PeerTrust: supporting reputation-based trust for peer-to-peer electronic communities , 2004, IEEE Transactions on Knowledge and Data Engineering.

[2]  Emmanuelle Anceaume,et al.  Incentive-Based Robust Reputation Mechanism for P2P Services , 2006, OPODIS.

[3]  Yatindra Nath Singh,et al.  Trust Estimation in Peer-to-Peer Network Using BLUE , 2013, ArXiv.

[4]  Yatindra Nath Singh,et al.  Reputation Aggregation in Peer-to-Peer Network Using Differential Gossip Algorithm , 2015, IEEE Transactions on Knowledge and Data Engineering.

[5]  Gul A. Agha,et al.  ARA: a robust audit to prevent free-riding in P2P networks , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[6]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[7]  Y. Zhang,et al.  An Adaptive and Robust Reputation Mechanism for P2P Network , 2010, 2010 IEEE International Conference on Communications.