Low-Latency routing in ad hoc wireless networks using finite horizons

  • Authors:

  • Amer Filipovic;Amitava Datta;Chris McDonald

  • Affiliations:

  • The University of Western Australia, Crawley, WA, Australia;The University of Western Australia, Crawley, WA, Australia;The University of Western Australia, Crawley, WA, Australia

  • Venue:
  • ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

An ad-hoc wireless network is a cooperative body of mobile wireless nodes that is capable of sustaining multi-hop communication. DSR is a well known routing protocol that has been proven to be robust and reliable in forming such networks. The protocol inherently has a large control packet and byte overhead, so it makes extensive use of its caching strategy to optimise its performance. However, large control packets severely restrict the protocol’s ability to scale to larger networks. In addition, the source controlled routing paradigm introduces high latency when scaled. In this paper we address this problem by presenting a hybrid protocol, called Finite Horizon Routing (FHR), which improves upon the existing routing strategy of DSR and makes it more resilient to link failures in oversized networks. FHR partially removes the large control packet problem of DSR. Through our simulations we show that the reliability, total overhead, and latency can be improved by up to 10%, 23% and 53% respectively.