Performance Comparison between Acknowledgement Schemes in MANET

Abstract

Since mobile communication services are consistent with the ideal communication style—that is, communication with anyone, anywhere, at any time—the need for communication services is growing quickly. The quantity of links and the dependability of each link that makes up the path determine its availability. The practice of identifying routes across a network with the smallest distance or other cost measure is known as "shortest path routing." An example of a sophisticated, global, multilevel network with millions of routers is the Internet's data packet routing system. The choice of the shortest path routing algorithm is based on directing traffic from the source to the destination, optimizing network performance, and lowering costs. Shortest path routing has the potential to improve network performance, but its effectiveness is partly dependent on the routing protocol's functioning and the settings chosen. Efficient route establishment between two nodes is the main objective of such an ad-hoc network routing protocol in order to ensure timely message delivery. Route construction should be done with a minimum of cost, overhead and bandwidth consumption. In this paper, we compare and analyze the performance of two papers and to justify the best one of their performance of shortest path routing algorithm.