Abstract
Rumor spreading is a fundamental communication process: given a network topology modeled by a graph and a source node with a message, the goal is to disseminate the source message to all network nodes. In this work we give a new graph-based formula that is a relatively tight estimate of the time complexity of rumor spreading in ad-hoc networks by popular Push&Pull protocol. We demonstrate its accuracy by comparing it to previously considered characteristics, such as graph conductance or vertex expansion, which in some cases are even exponentially worse than our new characterization.
This is a preview of subscription content, log in via an institution to check access.
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
Avin, C., Borokhovich, M., Censor-Hillel, K., Lotker, Z.: Order optimal information spreading using algebraic gossip. In: Proceedings of PODC 2011, pp. 363–372 (2011)
Censor-Hillel, K., Haeupler, B., Kelner, J.A., Maymounkov, P.: Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. In: Proceedings of STOC 2012, pp. 961–970 (2012)
Censor-Hillel, K., Shachnai, H.: Partial information spreading with application to distributed maximum coverage. In: Proceedings of PODC 2010, pp. 161–170 (2010)
Censor-Hillel, K., Shachnai, H.: Fast information spreading in graphs with large weak conductance. In: Proceedings of SODA 2011, pp. 440–448 (2011)
Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proceedings of STOC 2010, pp. 399–408 (2010)
Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumour spreading and graph conductance. In: Proceedings of SODA 2010, pp. 1657–1663 (2010)
Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumor spreading in social networks. Theor. Comput. Sci. 412(24), 2602–2610 (2011)
Demers, A., Greene, D., Houser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. SIGOPS Oper. Syst. Rev. 22, 8–32 (1988)
Doerr, B., Fouz, M.: Asymptotically optimal randomized rumor spreading. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 502–513. Springer, Heidelberg (2011)
Doerr, B., Fouz, M., Friedrich, T.: Social networks spread rumors in sublogarithmic time. In: Proceedings of STOC 2011, pp. 21–30 (2011)
Dolev, S., Schiller, E., Welch, J.L.: Random walk for self-stabilizing group communication in ad hoc networks. IEEE Trans. Mob. Comput. 5(7), 893–905 (2006)
Elsässer, R.: On the communication complexity of randomized broadcasting in random-like graphs. In: Proceedings of SPAA 2006, pp. 148–157 (2006)
Fountoulakis, N., Panagiotou, K., Sauerwald, T.: Ultra-fast rumor spreading in social networks. In: Proceedings of SODA 2012, pp. 1642–1660 (2012)
Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proceedings of STACS 2011, pp. 57–68 (2011)
Giakkoupis, G., Sauerwald, T.: Rumor spreading and vertex expansion. In: Proceedings of SODA 2012, pp. 1623–1641 (2012)
Hromkovic, J., Klasing, R., Pelc, A., Ruzicka, P., Unger, W.: Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series. Springer (2010)
Karp, R.M., Schindelhauer, C., Shenker, S., Vocking, B.: Randomized rumor spreading. In: Proceedings of FOCS 2000, pp. 565–574 (2000)
Mosk-Aoyama, D., Shah, D.: Fast distributed algorithms for computing separable functions. IEEE Transactions on Information Theory 54(7), 2997–3007 (2008)
Sauerwald, T.: On mixing and edge expansion properties in randomized broadcasting. Algorithmica 56, 51–88 (2010)
Sauerwald, T., Stauffer, A.: Rumor spreading and vertex expansion on regular graphs. In: Proceedings of SODA 2011, pp. 462–475 (2011)
Sinclair, A.: Algorithms for random generation and counting - a Markov chain approach. Progress in theoretical computer science. Birkhäuser (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kowalski, D.R., Thraves Caro, C. (2013). Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks. In: Cichoń, J., Gȩbala, M., Klonowski, M. (eds) Ad-hoc, Mobile, and Wireless Network. ADHOC-NOW 2013. Lecture Notes in Computer Science, vol 7960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39247-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-39247-4_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39246-7
Online ISBN: 978-3-642-39247-4
eBook Packages: Computer ScienceComputer Science (R0)