A Novel Analytical Method for Throughput Calculation of Wireless Ad-Hoc Networks Running Different Routing Algorithms

Abstract

Because of the increasing number of internet related applications, the role of total router transmission delay became much more important for the service quality. For this purpose, the tunneling techniques have been widely used especially for real time multimedia transmission to have less number of route constructions and to be able to forward each packet at each router without the need of reaching the upper OSI (Open Systems Interconnection) layers. But, in mobile networks, since the network experience with more changes in traffic conditions and node locations, tunnels will be reconstructed for many times and some extra delay will occur to reconstruct these tunnels. In this work, the place of the tunneling algorithm is taken by the well-known MPLS (Multi-Protocol Label Switching) protocol and for confirmation the throughput calculations are made by considering two different routing algorithms, one of which is AEABR algorithm proposed in [1] (shown in [2] that it improves the system throughput w.r.t Fastest path Routing algorithm [3] for various vehicular velocities), and the other one is Fastest Path routing algorithm [3]. In this work a novel analytical method for throughput calculation of wireless ad-hoc networks running aforementioned routing algorıthms is proposed including the effects of extra delay caused by extra Route Reconstructions (RRC).