On the efficiency and trustworthiness of DHT-based P2P search algorithms in mobile wireless networks
Laura Galluccio, Sergio Palazzo, Corrado Rametta · 2009
Support of P2P communities in mobile environments is a challenging task. To this purpose numerous algorithms have been recently proposed to speed up resource search throughout the network. Among these, structured DHT approaches seem very promising since they allow for a successful resource search by keeping complexity low. One of these techniques denoted as Georoy, was recently proposed with the aim of fitting the logical and physical topologies in a wireless mobile network so as to speed up the resource retrieval process. In this paper, taking inspiration from Georoy, we present G+, which is an extension suitable for usage in a real mobile system where resources can be epidemically replicated into the network by exploiting nodes' movement, thus speeding up the search process. We also address the problem of provision of trusted contents by introducing a punishment policy which allows to penalize misbehaving providers. To the best of our knowledge this is the first paper where feasibility and applicability of a P2P algorithm for mobile scenarios to a real system are addressed with a specific focus on retrieval of replicated contents and providers' trust.