Performance analysis of Mesh routing Algorithm for routing metrics link capacity and delay against inter-arrival time dependencies

Routing in Wireless Mesh Algorithm is concerned with finding “good” source destination paths and has been an active research area since many years. Much of the work is focused on the improvement of global resources, or on the performance of individual transfers. Either case, the routing problem can be casted as a multi-objective with objectives such as load-balancing, end-to-end delay, and path capacity. But if real-time applications are needed then the bounded end-to-end delay as an QoS parameter can be used. This can be found by the Mesh routing Algorithm (MRA). But there is also a need to find the effect of changing the link capacity(rate of link) and the effect of changing inter-arrival time between two packets for these capacity values. This paper does the analysis of the MRA algorithm to see the effect of changing these parameters and find the PDR(Packet Delivery Ratio) and bounded end-to-end delay. Through extensive simulation we have observed that the PDR of a network changes as the link capacity and the inter-arrival time between the packets and also between two nodes changes.