RPSF: A Routing Protocol with Selective Forwarding for Mobile Ad-Hoc Networks

  • Authors:

  • Q. Jiang;R. A. Finkel;D. Manivannan;M. Singhal

  • Affiliations:

  • Department of Computer Science, University of Kentucky, Lexington, USA 40506;Department of Computer Science, University of Kentucky, Lexington, USA 40506;Department of Computer Science, University of Kentucky, Lexington, USA 40506;Department of Computer Science, University of Kentucky, Lexington, USA 40506

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many existing reactive routing algorithms for mobile ad-hoc networks use a simple broadcasting mechanism for route discovery which can lead to a high redundancy of route-request messages, contention, and collision. Position-based routing algorithms address this problem but require every node to know the position and velocity of every other node at some point in time so that route requests can be propagated towards the destination without flooding the entire network. In a general ad-hoc network, each node maintaining the position information of every other node is expensive or impossible. In this paper, we propose a routing algorithm that addresses these drawbacks. Our algorithm, based on one-hop neighborhood information, allows each node to select a subset of its neighbors to forward route requests. This algorithm greatly reduces the number of route-request packets transmitted in the route-discovery process. We compare the performance of our algorithm with the well known Ad-hoc On-demand Distance Vector (AODV) routing algorithm. On average, our algorithm needs less than 12.6% of the routing-control packets needed by AODV. Simulation results also show that our algorithm has a higher packet-delivery ratio and lower average end-to-end delay than AODV.