International Journal of Computer Applications
Today, Wireless Sensor Networks (WSNs) have gained grate popularity and are widely used in variety of areas due to their unique features. WSNs are deployed in an ad-hoc manner and consist of a large number of tiny sensor nodes. The sensor nodes communicate with each other through the routes established by the routing algorithms. Routing is considered as a challenging task in WSNs because it can highly affect the overall performance of these networks. This paper focuses on performance evaluation of two popular routing algorithms: Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR).