On the Performance of the HSLS Routing Protocol for Mobile Ad hoc Networks

  • Authors:

  • G. Koltsidas;G. Dimitriadis;F.-N. Pavlidou

  • Affiliations:

  • Department of Electrical and Computer Engineering, Telecommunications Division, Aristotle University of Thessaloniki, Thessaloniki, Greece;Department of Electrical and Computer Engineering, Telecommunications Division, Aristotle University of Thessaloniki, Thessaloniki, Greece;Department of Electrical and Computer Engineering, Telecommunications Division, Aristotle University of Thessaloniki, Thessaloniki, Greece

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

The area of mobile ad hoc networks has recently attracted much scientific interest, as a very appealing research area with many open issues and still unsolved problems. One of the main issues that concerns researchers is the development of routing algorithms that present good performance and face a hostile environment. Many routing protocols have been proposed, attempting to minimize routing overhead, or to reduce the energy consumed by nodes in order to maximize their lifetime. A critical issue, though, is the development of routing protocols that have the ability to maintain their good characteristics at an acceptable level as the network population grows, an ability known as scalability. FSR, ZRP, HierLS and FSLS protocol family are only a sample of scalable algorithms that have been proposed so far. The HSLS protocol is a member of the FSLS family that is proved to scale the best among the algorithms of the FSLS protocol family. In this paper we propose a mechanism to enhance the already good characteristics of the HSLS protocol aiming at the reduction of routing overhead of the original protocol. This new scheme, which we called AFHSLS, exploits the so-called border nodes, in order to deliver routing packets to their destinations. The new algorithm is proved through simulations to significantly reduce routing overhead, with minor or practically no effect on other metrics, such as packet delivery ratio and delay of data packets.