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 journalArticlepeer-review

6 Scopus citations

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 1 2007

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 Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'MANET routing with provably low complexity through constant density clustering and route request broadcast'. Together they form a unique fingerprint.

Cite this