Data transfer has become an important issue. Natsheh and Buragga (2010, p. 312) state “Mobility of mobile ad hoc network (MANET) nodes is one of the main problems identified when MANET routing is performed.” Many protocols have been introduced to transfer data in the form of packets. The common aim of these protocols is to transfer data to the respective destination securely and without any change in the original information. Routing protocols implement algorithms that tell routers the best paths to transmit data. The important idea of this article is to compare destination sequence distance vector (DSDV) and dynamic source routing (DSR) protocols and select the best one for routing packets. The three main differences of DSDV and DSR algorithms are routing path, malicious nodes presence, and topologies.
Routing path is an important difference of DSDV and DSR routing protocols. The best ...view middle of the document...
According to Mamoun (2010), the number of out coming packets sent by the neighboring node should be counted (p. 107). When a routing protocol is disturbed, malicious nodes enter into the path between the source and destination. As a result of these nodes the packets are not transferred to its correct destination which leads to some serious problems in DSR protocol each packet a source address and a destination address so it does not depend on the intermediate nodes for net hop. Whenever a malicious node tries to deviate the packet from its original path a route error message is sent to the sender. Hence, sender can identify the malicious node and then resend the packet by removing the wrong node. Whereas in DSDV protocol when a malicious node enters between the source and destination path it cannot identify. As a result of this the packets are not transmitted to appropriate destinations and important packets are lost. Security is not provided in case DSDV protocol when malicious nodes. Therefore, DSR protocol provides security and also performs better even in the presence of malicious nodes.
Finally, different topology acts as major difference in determining the best routing protocol among DSDV and DSR. At the route discovery sending phase and route forwarding phase rebroadcasts are saved. Simple flooding is used to increase the rebroadcasts that are saved earlier. In topologies to know the rebroadcast probability network densities are considered. Compared to normal flooding method density based probability algorithm improves the saved rebroadcast under extreme density and mobility. Hence, density based probabilistic algorithm is used on DSR protocol to develop optimal strategy to route packets.
By conducting several experiments on different protocols under the conditions like routing path, malicious nodes, and topologies we can select the best routing protocol to transfer data packets. Hence, by considering the entire test results show that DSR protocol is suited in some conditions like malicious nodes and topologies (Natsheh, Buragga, & Mamoun, 2010) and DSDV protocol is used when routing path is the main point of consideration (Kumar, Kulkarni, & Gupta).