Reducing end-to-end delay in multi-path routing algorithms for mobile ad hoc networks

  • Authors:

  • Nastooh Taheri Javan;Mehdi Dehghan

  • Affiliations:

  • Ad Hoc Network Labratoary, Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran;Ad Hoc Network Labratoary, Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran

  • Venue:
  • MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find node-disjoint paths to achieve higher fault tolerance capability. By using node-disjoint paths, it is expected that the end-to-end delay in each path should be independent of each other. However, because of natural properties of wireless media and medium access mechanisms in ad hoc networks, the end-to-end delay between any source and destination depends on the pattern of communication in the neighborhood region. In this case some of the intermediate nodes should be silent to reverence their neighbors and this matter increases the average of end-to-end delay. To avoid this problem, multi-path routing algorithms can use zone-disjoint paths instead of node-disjoint paths. Two routes with no pair of neighbor nodes are called zone-disjoint paths. In this paper we propose a new multi-path routing algorithm that selects zone-disjoint paths, using omni-directional antenna. We evaluate our algorithm in several different scenarios. The simulation results show that the proposed approach is very effective in decreasing delay and packet loss.