Performance Study of End-to-End Traffic-Aware Routing

  • Authors:

  • Raad S. Al-Qassas;Lewis M. Mackenzie;Mohamed Ould-Khaoua

  • Affiliations:

  • University of Glasgow, UK;University of Glasgow, UK;University of Glasgow, UK

  • Venue:
  • ANSS '06 Proceedings of the 39th annual Symposium on Simulation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider finding the shortest path from source to destination in building a route. However, this can lead to some network nodes being more overloaded than the others. In MANETs resources, such as node power and channel bandwidth are often at a premium and, therefore, it is important to optimise their use as much as possible. Consequently, a traffic-aware technique to distribute the load is very desirable in order to make good utilisation of nodes' resources. A number of traffic aware techniques have recently been proposed and can be classified into two categories: end-to-end and on-the-spot. The performance merits of the existing end-to-end traffic aware techniques have been analysed and compared against traditional routing algorithms. There has also been a performance comparison among the existing on-the-spot techniques. However, there has so far been no similar study that evaluates and compares the relative performance merits of end-to-end techniques. In this paper we describe an extensive performance evaluation of two end-to-end techniques, based on degree of nodal activity and traffic density, using measures based on throughput, end-to-end delay and routing overhead.