Co-operative analysis of proactive and reactive protocols using Dijkstra´s Algorithm

Ad hoc networking provides movable devices to establish communication independent of a main infrastructure. However, the fact that there is no main infrastructure and that the devices can move randomly gives rise to various kind of problems, such as routing and security. In this system, path routing and protocol selection are the primary strategies to design any wireless network. In mobile Adhoc network (MANET) the selected protocol should have best in terms data delivery and data integrity. Hence, the performance analysis of the protocols is the main step before selecting a particular protocol. Selection of the protocols and path routing are the most common strategies that are to be focused while designing any kind of wireless networks such as MANETs, WSNs, WMNs and VANETs. MANETs A lot of challenges which are facing wireless MANETs like network stability, security, and energy. In this paper, using Dijkstra´s Algorithm and to find shortest path, and hence to carrying out the performance analysis on Adhoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), Optimized Link State Routing (OLSR) and Destination Sequenced Distance Vector (DSDV) protocols using NS2 simulator. The end-to-end delay, throughput and packet delivery ratio are the three parameters we are using for the comparison of performance of routing protocols.