An Adjusted Free-Market-Inspired Approach to Mitigate Free-Riding Behavior in Peer-to-Peer Fog Computing

Peer-to-peer (P2P) architecture is increasingly gaining attention as a potential solution for the scalability problem facing the Internet of Things (IoT). It can be adopted for the fog computing layer to sustain the massive flow of data from constrained IoT nodes to the cloud. The success of a P2P-based system is entirely dependent on the continuity of resource sharing among individual nodes. Free riding is a severe problem that contradicts this main principle of P2P systems. It is understood that peers tend to consume resources from other peers without offering any in return. This free riding behavior can decrease system scalability and content availability, resulting in a decline in performance. Significant efforts have been made to hinder this behavior and to encourage cooperation amongst peers. To this end, we propose AFMIA, an Adjusted Free-Market-Inspired Approach that considers resources as goods that have dynamic prices based on the amount of supply and demand. Peers have wealth that can be increased by providing resources and spent by consuming them. The experimental results indicate that the proposed algorithm can successfully improve fairness without compromising on success rates.

[1]  H. Kurdi,et al.  A Neural Network-Based Trust Management System for Edge Devices in Peer-to-Peer Networks , 2019, Computers, Materials & Continua.

[2]  Thinh P. Nguyen,et al.  A Global Contribution Approach to Maintain Fairness in P2P Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[3]  Yatindra Nath Singh,et al.  Simplified Biased Contribution Index (SBCI): A Mechanism to Make P2P Network Fair and Efficient for Resource Sharing , 2017, J. Parallel Distributed Comput..

[4]  Mihaela van der Schaar,et al.  Peer-to-Peer Multimedia Sharing based on Social Norms , 2011, Signal Process. Image Commun..

[5]  Heba Kurdi,et al.  AuthenticPeer++: A Trust Management System for P2P Networks , 2017, 2017 European Modelling Symposium (EMS).

[7]  Yatindra Nath Singh,et al.  A Reputation Based Framework to Avoid Free-riding in Unstructured Peer-to-Peer network , 2013, ArXiv.

[8]  Jia Liu,et al.  A mechanism of bandwidth allocation for peer-to-peer file-sharing networks via particle swarm optimization , 2018, J. Intell. Fuzzy Syst..

[9]  Mehdi Dehghan,et al.  GaMe‐PLive: a new game theoretic mechanism for P2P live video streaming , 2016, Int. J. Commun. Syst..

[10]  Mehdi Dehghan,et al.  A new incentive scheduling mechanism for live video streaming in mesh-based P2P networks , 2016, 2016 8th International Symposium on Telecommunications (IST).

[11]  Heba Kurdi,et al.  EERP: An enhanced EigenTrust algorithm for reputation management in peer-to-peer networks , 2018, EUSPN/ICTH.

[12]  Oluwafolake E. Ojo,et al.  Ayo game approach to mitigate free riding in peer-to-peer networks , 2020, J. King Saud Univ. Comput. Inf. Sci..

[13]  Syed Hassan Ahmed,et al.  HealthyBroker: A Trustworthy Blockchain-Based Multi-Cloud Broker for Patient-Centered eHealth Services , 2019, Electronics.

[14]  Thouraya Louati,et al.  PGTrust: a decentralized free-riding prevention model for DG systems , 2016, Cluster Computing.

[15]  Heba Kurdi,et al.  HonestPeer: An enhanced EigenTrust algorithm for reputation management in P2P systems , 2015, J. King Saud Univ. Comput. Inf. Sci..

[16]  Dan Liao,et al.  A Game Theoretic Analysis of Public Goods Allocation in P2P Networks , 2015, KSII Trans. Internet Inf. Syst..

[17]  Sathiamoorthy Manoharan,et al.  A demerit point strategy to reduce free-riding in BitTorrent , 2013, Comput. Commun..

[18]  Yongdong Wu,et al.  Incentive Mechanism Design for Heterogeneous Peer-to-Peer Networks: A Stackelberg Game Approach , 2014, IEEE Transactions on Mobile Computing.

[19]  Mehdi Dehghan,et al.  A token-based incentive mechanism for video streaming applications in peer-to-peer networks , 2017, Multimedia Tools and Applications.

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

[21]  Yuh-Jzer Joung,et al.  Cooperating with free riders in unstructured P2P networks , 2012, Comput. Networks.

[22]  Masahiro Sasabe Analysis of optimal piece flow in tit-for-tat-based P2P streaming , 2018, Comput. Networks.

[23]  José-Luis Pérez-de-la-Cruz,et al.  COINS: COalitions and INcentiveS for effective Peer-to-Peer downloads , 2013, J. Netw. Comput. Appl..

[24]  Heba Kurdi,et al.  AuthenticPeer: A Reputation Management System for Peer-to-Peer Wireless Sensor Networks , 2015, Int. J. Distributed Sens. Networks.

[25]  Jing Jin,et al.  A free rider aware topological construction strategy for search in unstructured P2P networks , 2016, Peer-to-Peer Netw. Appl..

[26]  Syed Hassan Ahmed,et al.  A lightweight trust management algorithm based on subjective logic for interconnected cloud computing environments , 2018, The Journal of Supercomputing.

[27]  Mehdi Kargahi,et al.  InFreD: Intelligent Free Rider Detection in collaborative distributed systems , 2017, J. Netw. Comput. Appl..

[28]  Lina Altoaimy,et al.  Overcoming Free-Riding Behavior in Peer-to-Peer Networks Using Points System Approach , 2019, ANT/EDI40.

[29]  Michal Feldman,et al.  Overcoming free-riding behavior in peer-to-peer systems , 2005, SECO.