Simulating cheated results acceptance rates for gossip-based volunteer computing
by Nils Kopal; Henner Heck; Arno Wacker
International Journal of Mobile Network Design and Innovation (IJMNDI), Vol. 7, No. 1, 2017

Abstract: In this article, we present two different methods to estimate the dissemination rates of cheated results for decentralised distribution algorithms designed for volunteer computing networks. First, we define gossip-based protocols and present a short taxonomy that is based on data sizes for categorisation of distribution algorithms. We show three different distribution algorithms that are suitable for volunteer computing based on gossip-based protocols. Here, we additionally present an attacker model showing different attack possibilities on such algorithms. To minimise the impact of cheaters on a volunteer computing job, we introduce cheat detection mechanisms based on positive and negative verification of computation results. Finally, to minimise the amount of needed cheat detection computations, we either use simulations with the help of cellular automatons and a mathematical model to estimate the dissemination rates of cheated results. With the help of our methods, the cheat detection rate can be adjusted in a way that the speed up is maximal and the computation overhead for the cheat detection is minimal.

Online publication date: Wed, 08-Mar-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Network Design and Innovation (IJMNDI):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email