Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal

Koushik Sinha, Pradip K. Srimani

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We present a deterministic broadcast algorithm for the class of mobile ad hoc networks where the mobile nodes possess collision detection capabilities. The algorithm is based on a breadth-first traversal of the network, allows multiple transmissions in the same time slot and completes broadcast in O(n log n) time in the worst case. It is mobility resilient even for networks where topology changes are very frequent. The idea of this broadcast algorithm is then extended to develop a gossiping algorithm having O((n + D)D log n) worst case run time, where D is the diameter of the network graph, which is an improvement over the existing algorithms.

Original languageEnglish
Pages (from-to)459-470
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3326
Publication statusPublished - 1 Dec 2004
Externally publishedYes

Fingerprint

Gossiping
Breadth
Mobile ad hoc networks
Mobile Ad Hoc Networks
Broadcast
Collision Detection
Topology
Graph in graph theory
Vertex of a graph

Keywords

  • Ad hoc networks
  • Breadth-first broadcast
  • Deterministic broadcast
  • Gossiping
  • Mobile computing

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

@article{ac3e89db56e34481aea26475f255bd02,
title = "Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal",
abstract = "We present a deterministic broadcast algorithm for the class of mobile ad hoc networks where the mobile nodes possess collision detection capabilities. The algorithm is based on a breadth-first traversal of the network, allows multiple transmissions in the same time slot and completes broadcast in O(n log n) time in the worst case. It is mobility resilient even for networks where topology changes are very frequent. The idea of this broadcast algorithm is then extended to develop a gossiping algorithm having O((n + D)D log n) worst case run time, where D is the diameter of the network graph, which is an improvement over the existing algorithms.",
keywords = "Ad hoc networks, Breadth-first broadcast, Deterministic broadcast, Gossiping, Mobile computing",
author = "Koushik Sinha and Srimani, {Pradip K.}",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "3326",
pages = "459--470",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal

AU - Sinha, Koushik

AU - Srimani, Pradip K.

PY - 2004/12/1

Y1 - 2004/12/1

N2 - We present a deterministic broadcast algorithm for the class of mobile ad hoc networks where the mobile nodes possess collision detection capabilities. The algorithm is based on a breadth-first traversal of the network, allows multiple transmissions in the same time slot and completes broadcast in O(n log n) time in the worst case. It is mobility resilient even for networks where topology changes are very frequent. The idea of this broadcast algorithm is then extended to develop a gossiping algorithm having O((n + D)D log n) worst case run time, where D is the diameter of the network graph, which is an improvement over the existing algorithms.

AB - We present a deterministic broadcast algorithm for the class of mobile ad hoc networks where the mobile nodes possess collision detection capabilities. The algorithm is based on a breadth-first traversal of the network, allows multiple transmissions in the same time slot and completes broadcast in O(n log n) time in the worst case. It is mobility resilient even for networks where topology changes are very frequent. The idea of this broadcast algorithm is then extended to develop a gossiping algorithm having O((n + D)D log n) worst case run time, where D is the diameter of the network graph, which is an improvement over the existing algorithms.

KW - Ad hoc networks

KW - Breadth-first broadcast

KW - Deterministic broadcast

KW - Gossiping

KW - Mobile computing

UR - http://www.scopus.com/inward/record.url?scp=33745300633&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745300633&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:33745300633

VL - 3326

SP - 459

EP - 470

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -