PERFORMANCE ANALYSIS OF ROUTING ALGORITHMS IN MESH TOPOLOGY

Abstract

This work implements an improved XY routing protocol for analyzing the performance of wireless mesh topology. The wireless mesh topology has become a popular interconnection architecture for constructing massively parallel multiprocessors. The examined partially adaptive XY routing algorithms for different network sizes based on 2D wireless mesh topology. But it has a routing problem such as highest priority of QUEUE, more number of retransmission and takes delay time to receive the packet. So there is a need for novel system to overcome the drawbacks of deadlock.The additional implements both odd even turn model and delay tolerant model. It makes message routing very minimal. In additionally, this comparison results in a smaller fluctuation of the network performance with respect to different traffic patterns. In addition, the node failure scenario is also considered so that if the path contains that node, then new alternate path from the failure node to the destination is recalculated or taken from cache if previous path information is stored. The result comparative shows that the OddEven Turn XY routing algorithm for best measuring of node throughput, average latency, average extra delay, efficiency, and packet lost and network throughput.