Skip to Main Content
Mobile Ad-hoc networks are characterized by constant topology changes, in the absence of fixed infrastructure and lack of any centralized control. Traditional routing algorithms prove to be inefficient in such a changing environment. Ad-hoc routing protocols such as Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks. Extensive research has been done in comparing the different proposed ad-hoc routing protocols under varying network scenarios. Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons. In this survey paper we had analyzed the performance of the routing algorithms under various networks conditions.