International Journal of Smart Sensor and Adhoc Network


A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralized administration, in which all nodes potentially contribute to the routing process. A user can move anytime in an ad hoc scenario and, as a result, such a network needs to have routing protocols which can adopt dynamically changing topology. To accomplish this, a number of ad hoc routing protocols have been proposed and implemented, which include Dynamic Source Routing (DSR), ad hoc on-demand distance vector (AODV) routing, and temporally ordered routing algorithm (TORA). In this paper, we analyze the performance differentials to compare the above-mentioned commonly used ad hoc network routing protocols. We report the simulation results of four different scenarios for wireless ad hoc networks having thirty nodes. The performances of proposed networks are evaluated in terms of number of hops per route, retransmission attempts, traffic sent, traffic received and throughput with the help of OPNET simulator. Channel speed 11Mbps and simulation time 20 minutes were taken. For this above simulation environment, TORA shows better performance over the two on-demand protocols, that is, DSR and AODV.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.