MANET routing with provably low complexity through constant density clustering and route request broadcast

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

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.

Original languageEnglish (US)
Pages (from-to)605-621
Number of pages17
JournalWireless Personal Communications
Volume43
Issue number2
DOIs
StatePublished - Oct 2007

Fingerprint

Network routing
Mobile ad hoc networks
Broadcasting
Routing protocols

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

MANET routing with provably low complexity through constant density clustering and route request broadcast. / Yang, Hyo Sik; Ritchie, Luke; Richa, Andrea; Reisslein, Martin.

In: Wireless Personal Communications, Vol. 43, No. 2, 10.2007, p. 605-621.

Research output: Contribution to journalArticle

@article{917f665773b84c4db7d189fab0df0410,
title = "MANET routing with provably low complexity through constant density clustering and route request broadcast",
abstract = "As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.",
keywords = "1-hop clustering, Algorithm/protocol design and analysis, Message complexity, Routing protocol, Scalability, Time complexity, Wireless mobile ad hoc network",
author = "Yang, {Hyo Sik} and Luke Ritchie and Andrea Richa and Martin Reisslein",
year = "2007",
month = "10",
doi = "10.1007/s11277-007-9252-9",
language = "English (US)",
volume = "43",
pages = "605--621",
journal = "Wireless Personal Communications",
issn = "0929-6212",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - MANET routing with provably low complexity through constant density clustering and route request broadcast

AU - Yang, Hyo Sik

AU - Ritchie, Luke

AU - Richa, Andrea

AU - Reisslein, Martin

PY - 2007/10

Y1 - 2007/10

N2 - As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.

AB - As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.

KW - 1-hop clustering

KW - Algorithm/protocol design and analysis

KW - Message complexity

KW - Routing protocol

KW - Scalability

KW - Time complexity

KW - Wireless mobile ad hoc network

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

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

U2 - 10.1007/s11277-007-9252-9

DO - 10.1007/s11277-007-9252-9

M3 - Article

AN - SCOPUS:35048882839

VL - 43

SP - 605

EP - 621

JO - Wireless Personal Communications

JF - Wireless Personal Communications

SN - 0929-6212

IS - 2

ER -