Abstract
Consider k particles, 1 red and k–1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly red particles are now available to infect more white ones. When is it the case that all white will become red? It turns out that this simple question is an instance of information propagation between random walks and has important applications to mobile computing where a set of mobile hosts acts as an intermediary for the spread of information.
In this paper we model this problem by k concurrent random walks, one corresponding to the red particle and k–1 to the white ones. The infection timeT k of infecting all the white particles with red color is then a random variable that depends on k, the initial position of the particles, the number of nodes and edges of the graph, as well as on the structure of the graph.
We easily get that an upper bound on the expected value of T k is the worst case (over all initial positions) expected meeting timem * of two random walks multiplied by Θ (log k). We demonstrate that this is, indeed, a tight bound; i.e. there is a graph G (a special case of the “lollipop” graph), a range of values k<n (such that \(\sqrt{n} -- k = \Theta ( \sqrt{n} ) \)) and an initial position of particles achieving this bound.
When G is a clique or has nice expansion properties, we prove much smaller bounds for T k . We have evaluated and validated all our results by large scale experiments which we also present and discuss here. In particular, the experiments demonstrate that our analytical results for these expander graphs are tight.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work has been partially supported by the IST/FET Programme of the European Union under contract number IST-2001-33116 (FLAGS) and within the 6FP under contract 001907 (DELIS).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs. Unpublished manuscript, http://stat-www.berkeley.edu/users/aldous/book.html (1999)
Alon, N.: Eigenvalues and Expanders. Combinatorica 6, 83–96 (1986)
Aspnes, J., Hurwood, W.: Spreading rumors rapidly despite an adversary. In: Proc. 15th ACM Symposium on Principles of Distributed Computing, PODC 1996 (1996)
Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: Distributed Communication and Control Algorithms for Ad-hoc Mobile Networks. The Journal of Parallel and Distributed Computing (JPDC), Special Issue on Mobile Ad-hoc Networking and Computing 63, 58–74 (2003)
Chatzigiannakis, I., Nikoletseas, S.: Design and Analysis of an Efficient Communication Strategy for Hierarchical and Highly Changing Ad-hoc Mobile Networks. In: Zomaya, A., Kumar, M. (eds.) ACM/Baltzer Mobile Networks Journal (MONET), Special Issue on Parallel Processing Issues in Mobile Computing (to appear in 2004) (accepted)
Chatzigiannakis, I., Nikoletseas, S., Spirakis, P.: An Efficient Communication Strategy for Ad-hoc Mobile Networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 285–299. Springer, Heidelberg (2001); Also Brief Announcement in Proc. 20th Annual Symposium on Principles of Distributed Computing – PODC 2001, pp. 320– 322. ACM Press, New York (2001)
Coppersmith, D., Tetali, P., Winkler, P.: Collisions among random walks on a graph. SIAM J. Disc. Math. 6(3), 363–374 (1993)
Dimitriou, T., Nikoletseas, S., Spirakis, P.: Analysis of the Information Propagation Time among Mobile Hosts. In: The Proceedings of the 3rd International Conference on Ad-Hoc Networks & Wireless, AD HOC NOW (2004), http://www.cti.gr/RD1/nikole/english/psfiles/infection.ps
Even, S., Monien, B.: On the number of rounds needed to disseminate information. In: Proc. 1st ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 (1989)
Feller, W.: An Introduction to Probability Theory and its Applications. John Wiley, New York (1957)
Kephard, J., White, S.: Directed-Graph Epidemiological Models of Computer Viruses. In: Proc. IEEE Symposium on Security and Privacy (1991) Also IBM Technical Report
Jerrum, M.R., Sinclair, A.: Conductance and the rapid mixing property of Markov chains: The approximation of the permanent resolved. In: Proc. 20th ACM Symposium on Theory of Computing (STOC), pp. 235–244 (1988)
Liggett, T.: Stochastic Interacting Systems: Contact, Voter and Exclusion Processes. Springer, Heidelberg (1999)
Mehlhorn, K., Naher, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)
Nikoletseas, S., Prasinos, G., Spirakis, P., Zaroliagis, C.: Attack Propagation in Networks. In: The Theory of Computing Systems (TOCS) Journal, Special Issue on the Thirteenth (13th) Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001) (accepted)
Ostrofsky, R., Yung, M.: How to Withstand Mobile Virus Attacks. In: Proc. 10th ACM Symposium on Principles of Distributed Computing PODC 1991, pp. 51–59 (1991)
Norris, J.R.: Markov Chains. Cambridge University Press, Cambridge (1997)
Sunderam, V.S., Winkler, P.: Disc. Appl. Math. 42, pp. 75–86 (1993)
Tetali, P., Winkler, P.: Simultaneous reversible Markov chains. In: Miklos, D., Sos, V.T., Szonyi, T. (eds.) Combinatorics, Paul Erdõs is Eighty, Janos Bolyai Mathematics Institute, Budapest, vol. 1, pp. 433–452 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dimitriou, T., Nikoletseas, S., Spirakis, P. (2004). Analysis of the Information Propagation Time Among Mobile Hosts. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2004. Lecture Notes in Computer Science, vol 3158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28634-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-28634-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22543-0
Online ISBN: 978-3-540-28634-9
eBook Packages: Springer Book Archive