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. © 2013 Springer-Verlag.
CITATION STYLE
Kowalski, D. R., & Thraves Caro, C. (2013). Estimating time complexity of rumor spreading in ad-hoc networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7960 LNCS, pp. 245–256). https://doi.org/10.1007/978-3-642-39247-4_21
Mendeley helps you to discover research relevant for your work.