A COMPARATIVE ANALYSIS FOR PERFORMANCE OF THE TORA ROUTING ALGORITHM

Abstract

The Temporarily Ordered Routing Algorithm (TORA) routing algorithm is a loop-free adaptive routing protocol that eliminates loops. The TORA routing algorithm makes use of a route reversal mechanism to achieve this goal. In this paper, we discuss and discuss the performance of the proposed algorithm and improvised TORA and find out how the new proposed algorithm is better as compared to previous implementations in terms of PDR, throughput, goodput, packet delivery ratio, residual energy. The work was observed using a well-established simulator refereed as NS2 and a series of simulations based on Design of Experiments (DoE) were undertaken. The results indicated that the proposed TORA is better than the conventional and references TORA based routing algorithms. It is suggested that an extensive testing bed should be developed so that deeper analysis of its performance can be done using current data and computationally intensive applications such as big data and deep learning models.

Keywords: MANETs, TORA, Routing, Packet Delivery Ratio, Design of Experiment, residual energy.