Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks

Koushik Sinha, Suranjan Ghose, Pradip K. Srimani

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O (n log n) for ad hoc networks where the nodes possess collision detection capabilities; n is the total number of nodes in the network. The algorithm is based on a breadth-first traversal of the network and allows multiple simultaneous transmissions by the nodes. The idea of this broadcast algorithm is then extended to develop a mobility resilient deterministic gossiping algorithm having O (D n log n) worst-case run time (D is the diameter of the network graph), which is an improvement over the existing algorithms. Simulation results show that on an average, the time for completing the broadcast or gossiping is significantly lower than the theoretical worst-case time requirement.

Original languageEnglish
Pages (from-to)922-938
Number of pages17
JournalJournal of Parallel and Distributed Computing
Volume68
Issue number7
DOIs
Publication statusPublished - 1 Jul 2008
Externally publishedYes

Fingerprint

Gossiping
Mobile ad hoc networks
Mobile Ad Hoc Networks
Broadcast
Vertex of a graph
Collision Detection
Breadth
Ad hoc networks
Ad Hoc Networks
Time Complexity
Requirements
Graph in graph theory
Simulation

Keywords

  • Ad hoc networks
  • All-to-all broadcast
  • Breadth-first broadcast
  • Deterministic broadcast
  • Gossiping
  • MANET

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks. / Sinha, Koushik; Ghose, Suranjan; Srimani, Pradip K.

In: Journal of Parallel and Distributed Computing, Vol. 68, No. 7, 01.07.2008, p. 922-938.

Research output: Contribution to journalArticle

Sinha, Koushik ; Ghose, Suranjan ; Srimani, Pradip K. / Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks. In: Journal of Parallel and Distributed Computing. 2008 ; Vol. 68, No. 7. pp. 922-938.
@article{1a803cfa29ba4e76b818cf6ab863ede5,
title = "Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks",
abstract = "We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O (n log n) for ad hoc networks where the nodes possess collision detection capabilities; n is the total number of nodes in the network. The algorithm is based on a breadth-first traversal of the network and allows multiple simultaneous transmissions by the nodes. The idea of this broadcast algorithm is then extended to develop a mobility resilient deterministic gossiping algorithm having O (D n log n) worst-case run time (D is the diameter of the network graph), which is an improvement over the existing algorithms. Simulation results show that on an average, the time for completing the broadcast or gossiping is significantly lower than the theoretical worst-case time requirement.",
keywords = "Ad hoc networks, All-to-all broadcast, Breadth-first broadcast, Deterministic broadcast, Gossiping, MANET",
author = "Koushik Sinha and Suranjan Ghose and Srimani, {Pradip K.}",
year = "2008",
month = "7",
day = "1",
doi = "10.1016/j.jpdc.2008.01.008",
language = "English",
volume = "68",
pages = "922--938",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "7",

}

TY - JOUR

T1 - Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks

AU - Sinha, Koushik

AU - Ghose, Suranjan

AU - Srimani, Pradip K.

PY - 2008/7/1

Y1 - 2008/7/1

N2 - We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O (n log n) for ad hoc networks where the nodes possess collision detection capabilities; n is the total number of nodes in the network. The algorithm is based on a breadth-first traversal of the network and allows multiple simultaneous transmissions by the nodes. The idea of this broadcast algorithm is then extended to develop a mobility resilient deterministic gossiping algorithm having O (D n log n) worst-case run time (D is the diameter of the network graph), which is an improvement over the existing algorithms. Simulation results show that on an average, the time for completing the broadcast or gossiping is significantly lower than the theoretical worst-case time requirement.

AB - We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O (n log n) for ad hoc networks where the nodes possess collision detection capabilities; n is the total number of nodes in the network. The algorithm is based on a breadth-first traversal of the network and allows multiple simultaneous transmissions by the nodes. The idea of this broadcast algorithm is then extended to develop a mobility resilient deterministic gossiping algorithm having O (D n log n) worst-case run time (D is the diameter of the network graph), which is an improvement over the existing algorithms. Simulation results show that on an average, the time for completing the broadcast or gossiping is significantly lower than the theoretical worst-case time requirement.

KW - Ad hoc networks

KW - All-to-all broadcast

KW - Breadth-first broadcast

KW - Deterministic broadcast

KW - Gossiping

KW - MANET

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

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

U2 - 10.1016/j.jpdc.2008.01.008

DO - 10.1016/j.jpdc.2008.01.008

M3 - Article

AN - SCOPUS:44449112106

VL - 68

SP - 922

EP - 938

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 7

ER -