Cluster Overlay Broadcast (COB)

MANET routing with complexity polynomial in source-destination distance

Luke Ritchie, Hyo Sik Yang, Andrea Richa, Martin Reisslein

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper, we develop and analyze Cluster Overlay Broadcast (COB), a low-complexity routing algorithm for MANETs. COB runs on top of a one-hop cluster cover of the network, which can be created and maintained using, for instance, the Least Cluster Change (LCC) algorithm. We formally prove that the LCC algorithm maintains a cluster cover with a constant density of cluster leaders with minimal update cost. COB discovers routes by flooding (broadcasting) route requests through the network of cluster leaders with a doubling radius technique. Building on the constant density property of the network of cluster leaders, we formally prove that, if there exists a route from a source to a destination node with a minimum hop count of Δ, then COB discovers a route with at most O(Δ) hops from the source to the destination node in at most O(Δ) time and by sending at most O(Δ2) messages. We prove this result for arbitrary node distributions and mobility patterns and also show that COB adapts asymptotically optimally to the mobility of the nodes. In our simulation experiments, we examine the network layer performance of COB, compare it with Dynamic Source Routing, and investigate the impact of the MAC layer on COB routing.

Original languageEnglish (US)
Pages (from-to)653-666
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume5
Issue number6
DOIs
StatePublished - Jun 2006

Fingerprint

Network routing
Routing algorithms
Mobile ad hoc networks
Polynomials
Network layers
Wireless ad hoc networks
Broadcasting
Costs
Experiments

Keywords

  • Algorithm/protocol design and analysis
  • Message complexity
  • One-hop clustering
  • Routing protocol
  • Scalability
  • Time complexity
  • Wireless mobile ad hoc network

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Science(all)

Cite this

Cluster Overlay Broadcast (COB) : MANET routing with complexity polynomial in source-destination distance. / Ritchie, Luke; Yang, Hyo Sik; Richa, Andrea; Reisslein, Martin.

In: IEEE Transactions on Mobile Computing, Vol. 5, No. 6, 06.2006, p. 653-666.

Research output: Contribution to journalArticle

@article{3accd848f00040908aa61605d26959df,
title = "Cluster Overlay Broadcast (COB): MANET routing with complexity polynomial in source-destination distance",
abstract = "Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper, we develop and analyze Cluster Overlay Broadcast (COB), a low-complexity routing algorithm for MANETs. COB runs on top of a one-hop cluster cover of the network, which can be created and maintained using, for instance, the Least Cluster Change (LCC) algorithm. We formally prove that the LCC algorithm maintains a cluster cover with a constant density of cluster leaders with minimal update cost. COB discovers routes by flooding (broadcasting) route requests through the network of cluster leaders with a doubling radius technique. Building on the constant density property of the network of cluster leaders, we formally prove that, if there exists a route from a source to a destination node with a minimum hop count of Δ, then COB discovers a route with at most O(Δ) hops from the source to the destination node in at most O(Δ) time and by sending at most O(Δ2) messages. We prove this result for arbitrary node distributions and mobility patterns and also show that COB adapts asymptotically optimally to the mobility of the nodes. In our simulation experiments, we examine the network layer performance of COB, compare it with Dynamic Source Routing, and investigate the impact of the MAC layer on COB routing.",
keywords = "Algorithm/protocol design and analysis, Message complexity, One-hop clustering, Routing protocol, Scalability, Time complexity, Wireless mobile ad hoc network",
author = "Luke Ritchie and Yang, {Hyo Sik} and Andrea Richa and Martin Reisslein",
year = "2006",
month = "6",
doi = "10.1109/TMC.2006.73",
language = "English (US)",
volume = "5",
pages = "653--666",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Cluster Overlay Broadcast (COB)

T2 - MANET routing with complexity polynomial in source-destination distance

AU - Ritchie, Luke

AU - Yang, Hyo Sik

AU - Richa, Andrea

AU - Reisslein, Martin

PY - 2006/6

Y1 - 2006/6

N2 - Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper, we develop and analyze Cluster Overlay Broadcast (COB), a low-complexity routing algorithm for MANETs. COB runs on top of a one-hop cluster cover of the network, which can be created and maintained using, for instance, the Least Cluster Change (LCC) algorithm. We formally prove that the LCC algorithm maintains a cluster cover with a constant density of cluster leaders with minimal update cost. COB discovers routes by flooding (broadcasting) route requests through the network of cluster leaders with a doubling radius technique. Building on the constant density property of the network of cluster leaders, we formally prove that, if there exists a route from a source to a destination node with a minimum hop count of Δ, then COB discovers a route with at most O(Δ) hops from the source to the destination node in at most O(Δ) time and by sending at most O(Δ2) messages. We prove this result for arbitrary node distributions and mobility patterns and also show that COB adapts asymptotically optimally to the mobility of the nodes. In our simulation experiments, we examine the network layer performance of COB, compare it with Dynamic Source Routing, and investigate the impact of the MAC layer on COB routing.

AB - Routing algorithms with time and message complexities that are provably low and independent of the total number of nodes in the network are essential for the design and operation of very large scale wireless mobile ad hoc networks (MANETs). In this paper, we develop and analyze Cluster Overlay Broadcast (COB), a low-complexity routing algorithm for MANETs. COB runs on top of a one-hop cluster cover of the network, which can be created and maintained using, for instance, the Least Cluster Change (LCC) algorithm. We formally prove that the LCC algorithm maintains a cluster cover with a constant density of cluster leaders with minimal update cost. COB discovers routes by flooding (broadcasting) route requests through the network of cluster leaders with a doubling radius technique. Building on the constant density property of the network of cluster leaders, we formally prove that, if there exists a route from a source to a destination node with a minimum hop count of Δ, then COB discovers a route with at most O(Δ) hops from the source to the destination node in at most O(Δ) time and by sending at most O(Δ2) messages. We prove this result for arbitrary node distributions and mobility patterns and also show that COB adapts asymptotically optimally to the mobility of the nodes. In our simulation experiments, we examine the network layer performance of COB, compare it with Dynamic Source Routing, and investigate the impact of the MAC layer on COB routing.

KW - Algorithm/protocol design and analysis

KW - Message complexity

KW - One-hop clustering

KW - Routing protocol

KW - Scalability

KW - Time complexity

KW - Wireless mobile ad hoc network

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

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

U2 - 10.1109/TMC.2006.73

DO - 10.1109/TMC.2006.73

M3 - Article

VL - 5

SP - 653

EP - 666

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 6

ER -