Analytical evaluation of the overhead generated by a routing scheme with subnets for MANETs

  • Authors:
  • Johann López;Steluţa Gheorghiu;José M. Barceló

  • Affiliations:
  • Technical University of Catalonia, Department of Computer Architecture, Barcelona, Spain;Technical University of Catalonia, Department of Computer Architecture, Barcelona, Spain;Technical University of Catalonia, Department of Computer Architecture, Barcelona, Spain

  • Venue:
  • Proceedings of the Third international EURO-NGI network of excellence conference on Wireless systems and mobility in next generation internet
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most of the current topological based routing algorithms used in MANETs treat all the nodes in the network like independent peers, making them not scalable with respect to the number of nodes in the network. Since hierarchical routing techniques have been known to afford scalability in large networks (e.g. Internet), and taking advantage of the existence of scenarios in which the nodes of a MANET can be aggregated in a natural manner, we propose a two level hierarchical routing scheme for MANETs. In this paper we present the main components and an analytical performance evaluation of our proposal, with the number of control packets per second as the metric of our interest. The evaluation shows a significant overhead reduction from Θ(N2) to Θ(N). However, a trade-off between the # of nodes in the network and the complexity of the system has to be achieved.