Performance Comparison of Ad-hoc Routing Protocols for Networks with Node Energy Constraints

A major issue with ad-hoc networks is energy consumption since nodes are sometimes mobile and battery-operated. In this paper we have compared the performance of ad-hoc routing protocols during a network wherever every taking part mobile node contains a given battery life and can shut-down once a threshold is reached. we have studied 2 routing protocols, Dynamic supply Routing (DSR), and Destination-Sequenced Distance-Vector Routing (DSDV), by examination the node termination rate further because the overall goodput of the network. From the simulations we have a tendency to determine that in high node density, DSR performs higher than DSDV. The performance gap is attenuated by smaller range of nodes within the network or a lot of path loss and shadowing variance.