Estimating time complexity of rumor spreading in ad-hoc networks

Dariusz R. Kowalski, Christopher Thraves Caro

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationAd-hoc, Mobile, and Wireless Network - 12th International Conference, ADHOC-NOW 2013, Proceedings
Pages245-256
Number of pages12
DOIs
StatePublished - Sep 27 2013
Externally publishedYes
Event12th International Conference on Ad-hoc, Mobile and Wireless Networks, ADHOC-NOW 2013 - Wroclaw, Poland
Duration: Jul 8 2013Jul 10 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7960 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Ad-hoc, Mobile and Wireless Networks, ADHOC-NOW 2013
CountryPoland
CityWroclaw
Period7/8/137/10/13

Keywords

  • asynchronous model
  • conductance
  • Push&Pull protocol
  • Rumor spreading
  • synchronous model
  • vertex expansion

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Estimating time complexity of rumor spreading in ad-hoc networks'. Together they form a unique fingerprint.

Cite this