Performance Analysis of Different Ad Hoc Routing Protocols under Different Mobility Conditions

Abstract

A mobile ad hoc network is a collection of wireless nodes, all of which may be mobile, dynamically create a wireless network themselves without using any infrastructure. Ad hoc wireless networks come into being solely by peer-to-peer interactions among their constituent mobile nodes, and it is only such interaction, that are used to provide the necessary control and administrative functions supporting such networks. Each node must be able to function as a router as well to relay packets generated by other nodes. As the nodes move in and out of range with respect to other nodes, including those that are operating as routers, the resulting topology changes must somehow be communicated to all other nodes. The limited bandwidth of wireless channels and their generally hostile transmission characteristics impose additional constraints on how much administrative and control information may be exchanged, and how often. Ad hoc routing protocols make routing decisions based on individual node mobility even for applications such as disaster recovery, battlefield combat, conference room interaction and collaborative computing etc. In this thesis, the performance analysis is done for three routing protocols AODV, DSR and DSDV by using three different mobility models on the basis of parameters packet delivery ratio, throughput, end to end delay and normalized routing load. The performance is analyzed into two parts by using NS2 simulator. In first part, for all protocols have a varying number of mobile nodes but with fixed maximum speed of nodes for three mobility models. In second part, number of mobile nodes is fixed with varying speed of mobile nodes for mobility models. The results of simulations shows that random waypoint mobility model is best than others models, and appropriate performance of routing protocol AODV and other protocols in all mobility’s models with different parameters is analyzed.