MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

  • Authors:

  • Hyo-Sik Yang;Luke Ritchie;Andréa W. Richa;Martin Reisslein

  • Affiliations:

  • Department of Computer Engineering, Sejong University, Seoul, Korea;Department of Electrical Engineering, Arizona State University, Tempe, USA 85287---5706;Department of Computer Science and Engineering, Arizona State University, Tempe, USA;Department of Electrical Engineering, Arizona State University, Tempe, USA 85287---5706

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.