Deterministic broadcast and gossiping algorithms for Ad hoc networks

Koushik Sinha, Pradip K. Srimani

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We present in this paper three deterministic broadcast and a gossiping algorithm suitable for ad hoc networks where topology changes range from infrequent to very frequent. The proposed algorithms are designed to work in networks where the mobile nodes possessing collision detection capabilities. Our first broadcast algorithm accomplishes broadcast in O(nlog n) for networks where topology changes are infrequent. We also present an O(nlog n) worst case time broadcast algorithms that is resilient to mobility. For networks where topology changes are frequent, we present a third algorithm that accomplishes broadcast in O(Δ•n log n + n•|M|) in the worst case scenario, where |M| is the length of the message to be broadcasted and Δ the maximum node degree. We then extend one of our broadcast algorithms to develop an O(Dn log n + D 2) algorithm for gossiping in the same network model.

Original languageEnglish
Pages (from-to)115-144
Number of pages30
JournalJournal of Supercomputing
Volume37
Issue number2
DOIs
Publication statusPublished - 1 Aug 2006
Externally publishedYes

Fingerprint

Gossiping
Ad hoc networks
Ad Hoc Networks
Broadcast
Topology
Collision Detection
Vertex of a graph
Network Model
Scenarios
Range of data

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Deterministic broadcast and gossiping algorithms for Ad hoc networks. / Sinha, Koushik; Srimani, Pradip K.

In: Journal of Supercomputing, Vol. 37, No. 2, 01.08.2006, p. 115-144.

Research output: Contribution to journalArticle

Sinha, Koushik ; Srimani, Pradip K. / Deterministic broadcast and gossiping algorithms for Ad hoc networks. In: Journal of Supercomputing. 2006 ; Vol. 37, No. 2. pp. 115-144.
@article{5682d36a562340aca06713c472cf359f,
title = "Deterministic broadcast and gossiping algorithms for Ad hoc networks",
abstract = "We present in this paper three deterministic broadcast and a gossiping algorithm suitable for ad hoc networks where topology changes range from infrequent to very frequent. The proposed algorithms are designed to work in networks where the mobile nodes possessing collision detection capabilities. Our first broadcast algorithm accomplishes broadcast in O(nlog n) for networks where topology changes are infrequent. We also present an O(nlog n) worst case time broadcast algorithms that is resilient to mobility. For networks where topology changes are frequent, we present a third algorithm that accomplishes broadcast in O(Δ•n log n + n•|M|) in the worst case scenario, where |M| is the length of the message to be broadcasted and Δ the maximum node degree. We then extend one of our broadcast algorithms to develop an O(Dn log n + D 2) algorithm for gossiping in the same network model.",
author = "Koushik Sinha and Srimani, {Pradip K.}",
year = "2006",
month = "8",
day = "1",
doi = "10.1007/s11227-006-6255-3",
language = "English",
volume = "37",
pages = "115--144",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Deterministic broadcast and gossiping algorithms for Ad hoc networks

AU - Sinha, Koushik

AU - Srimani, Pradip K.

PY - 2006/8/1

Y1 - 2006/8/1

N2 - We present in this paper three deterministic broadcast and a gossiping algorithm suitable for ad hoc networks where topology changes range from infrequent to very frequent. The proposed algorithms are designed to work in networks where the mobile nodes possessing collision detection capabilities. Our first broadcast algorithm accomplishes broadcast in O(nlog n) for networks where topology changes are infrequent. We also present an O(nlog n) worst case time broadcast algorithms that is resilient to mobility. For networks where topology changes are frequent, we present a third algorithm that accomplishes broadcast in O(Δ•n log n + n•|M|) in the worst case scenario, where |M| is the length of the message to be broadcasted and Δ the maximum node degree. We then extend one of our broadcast algorithms to develop an O(Dn log n + D 2) algorithm for gossiping in the same network model.

AB - We present in this paper three deterministic broadcast and a gossiping algorithm suitable for ad hoc networks where topology changes range from infrequent to very frequent. The proposed algorithms are designed to work in networks where the mobile nodes possessing collision detection capabilities. Our first broadcast algorithm accomplishes broadcast in O(nlog n) for networks where topology changes are infrequent. We also present an O(nlog n) worst case time broadcast algorithms that is resilient to mobility. For networks where topology changes are frequent, we present a third algorithm that accomplishes broadcast in O(Δ•n log n + n•|M|) in the worst case scenario, where |M| is the length of the message to be broadcasted and Δ the maximum node degree. We then extend one of our broadcast algorithms to develop an O(Dn log n + D 2) algorithm for gossiping in the same network model.

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

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

U2 - 10.1007/s11227-006-6255-3

DO - 10.1007/s11227-006-6255-3

M3 - Article

AN - SCOPUS:33745698670

VL - 37

SP - 115

EP - 144

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

IS - 2

ER -