A greedy-based stable multi-path routing protocol in mobile ad hoc networks

  • Authors:

  • Wenjing Yang;Xinyu Yang;Shusen Yang;Dongxu Yang

  • Affiliations:

  • Dept. of Computer Science and Technology, Xi'an Jiaotong University, Xi'an 710049, China and Xi'an Communication Institute, Xi'an 710106, China;Dept. of Computer Science and Technology, Xi'an Jiaotong University, Xi'an 710049, China;Dept. of Computer Science and Technology, Xi'an Jiaotong University, Xi'an 710049, China;Dept. of Computer Science and Technology, Xi'an Jiaotong University, Xi'an 710049, China

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the increasing popularity of multimedia, there is a growing tendency in mobile ad hoc networks (MANETs) to establish stable routes with long route lifetimes, low control overhead and high packet delivery ratios. According to recent analytical result, the lifetime of a route, which can reflect the route stability, depends on the length of the route and the lifetime of each link in the route. This paper presents a Greedy-based Backup Routing (GBR) protocol that considers both route length and link lifetime to achieve high route stability. In GBR, the primary path is constructed primarily based on a greedy forwarding mechanism, whereas the local-backup path for each link is established according to the link lifetime. Both analytical and simulation results demonstrate that GBR has excellent performance in terms of route lifetime, packet delivery ratio, and control overhead.