A Novel Routing Algorithm for Ad Hoc Networks Based on the Downstream Nodes Information

  • Authors:

  • Junjie Chen;Chang'en Zhou;Deli Chen;Bin Huang;Jiajun Hong;Chao Zhou;Xiao Yang

  • Affiliations:

  • -;-;-;-;-;-;-

  • Venue:
  • MINES '09 Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 02
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Reactive routing protocol (such as DSR) is preferred in Ad Hoc networks. In DSR protocol, the relay node would search its cache for an alternate route to the destination to salvage packets when link failed and would abandon the packets if not found. This paper introduced a novel routing algorithm based on the downstream nodes' information called DSR-DI. If the alternate route to destination was not found, DSR-DI would search the relay node's cache for the route to anyone of the downstream nodes of the failure route to generate a new route to salvage packets. Also if the cache had no routes to the downstream nodes, the relay node, instead of the source node, would initiate a route discovery in local area, to find any route to one of the downstream nodes to improve the packets salvaging ratio. Simulation results showed DSR-DI could effectively control overhead and improve the packets delivery ratio.