Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Probabilistic heuristics for disseminating information in networks
IEEE/ACM Transactions on Networking (TON)
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Information dissemination dynamics in delay tolerant network: a bipartite network approach
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
| Hi-index | 0.00 |
Random walk-based approaches are suitable for information dissemination in mobile and opportunistic environments that are inherently dynamic and typically large-scale. Multiple random walkers have been proposed in the recent past as a suitable mechanism to significantly reduce termination time when covering a network topology. In this paper, the multiple random walkers mechanism is studied and analyzed under a different and novel perspective that allows for further understanding of network coverage when employing multiple random walkers in a network. Given that under this mechanism the number of movements is significantly increased (proportional to the number of random walkers) -- and sometimes not as effective as expected due to frequent revisits that do not improve coverage as shown in this paper -- a replication mechanism is introduced that is capable of reducing the number of movements by reducing initial revisits. Simulation results considering geometric random graph topologies -- which are suitable for modeling mobile environments -- are also presented supporting the analytical findings and shedding more light on various aspects of both the aforementioned mechanisms.