Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
On the Performance of Probabilistic Flooding in Mobile Ad Hoc Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
Search Algorithms for Unstructured Peer-to-Peer Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
A study of information dissemination under multiple random walkers and replication mechanisms
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Random walk with jumps in large-scale random geometric graphs
Computer Communications
| Hi-index | 0.00 |
Flooding is well known to be the "fastest" way to propagate information throughout a network (achieve 100% coverage), at the expense of typically unacceptably large message-forwarding overhead; when the overhead is controlled or limited, then the achieved coverage is reduced. A Single Random Walker (SRW) is another popular mechanism for information dissemination that is very "slow" compared to flooding but utilizes less overhead and can potentially achieve better coverage than flooding. The latter may be attributed to the better "stretching" properties (ability to visit further away network regions) of the SRW and is particularly observed if coverage is defined as the set of network nodes which are at most L hops away from a network node which received the information (notion of L- coverage, L ≥ 0). Randomly Replicated Random Walkers (RRRWs) are considered in this paper as a broad class of information dissemination mechanisms whose members are defined by a given value of the (first) replication probability; clearly a SWR corresponds to the RRRWs with zero (first) replication probability, while for values of the (first) replication probability close to one a large number of information disseminating agents (RWs) are generated resembling the operation of flooding. By considering various performance metrics (such as the achieved coverage for a given message-forwarding budget and the time required to spend the available message-forwarding budget), and by considering various network topologies (such as Random Geometric, Erdös- Rényi and Clustered environments), we show that the class of RRRWs can "fill" the performance space, between the performance induced by flooding and the SRW, thus offering a richer set of information dissemination strategies that can better match desirable performance constraints or objectives.