International Journal of Computer Applications (0975 – 8887) Volume 146 – No.11, July 2016 39 Performance Analysis of Routing Protocols in Mobile Wireless Sensor Network Pallavi S. Katkar Department of Computer Science, Shivaji University Kolhapur, India Vijay R. Ghorpade, PhD D. Y. Patil College of Engineering and Technology Kolhapur, India ABSTRACT A sensor network is nothing but the collection of number of wireless mobile nodes. Each node route the packet as well as forward the packet until the destination. Many routing protocol have been developed in mobile networks. Protocol selection is the main purpose of the wireless network and selected protocol must be best in all aspects of the mobile network. In this paper, simulation performance analysis is carried out on Adhoc On-demand Distance Vector (AODV), Destination Sequenced Distance Vector (DSDV) and Optimized Link State Routing (OLSR) protocol using NS3 simulator. The metrics used for performance evaluation are Throughput, Packet Delivery Ratio and Delay. General Terms Purpose of this paper is to cover mobile wireless sensor network routing protocols, Mobile Ad-hoc networks and Network simulator NS3. Keywords Adhoc On-demand Distance Vector (AODV), Destination sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR) and Mobile wireless sensor network. 1. INTRODUCTION Wireless sensor network consist of number of tiny sensor nodes [1], each node can monitor physical as well as environmental conditions like a change in climate, pressure, temperature, earthquake. There is no standard protocol for mobile wireless sensor network so often protocols are adopted from Mobile Ad-hoc Networks. A sensor network normally constitutes a wireless ad-hoc network, such that each sensor supports a multi-hop routing algorithm and node functions [2]. The idea of ad hoc networking is sometimes also called infrastructure less networking [3]. Protocol selection and routing the path is the main design goal of any wireless network. Routing protocol in mobile ad-hoc network was developed based on the design goals of minimal control overhead, minimal processing overhead, multi-hop routing capability, dynamic topology maintenance and loop prevention [4]. In wireless sensor networks, routing protocol depends according to the selection of network application and routing strategy. Many more routing protocols are available for mobile wireless sensor network out of that AODV, DSDV and OLSR these three protocols are analyzed here with the help of simulation. 2. ROUTING PROTOCOL The main routing protocols are of two types i.e. Protocol operation type and Network structure type. Routing protocol can be classified in to three categories namely, proactive, reactive and hybrid protocol depending on how the source sends a route to the destination [1]. In proactive (table-driven) routing protocol; information broadcast to each neighboring node. Each node keeps information about neighborhood nodes, reachable node and the number of hops in their respective routing table. Each node continuously maintain route between pair of nodes. Reactive (on-demand) this routing protocol called as On-demand protocol because routes are established on demand as they are needed. Once path established; a route is maintain as long as it is needed. 2.1 Ad-hoc On-demand Distance Vector (AODV) AODV is the reactive routing protocol that uses some characteristics of proactive routing protocol i.e., hop-to-hop routing methodology [6] AODV allows for construction of the routes and it is not necessary for other nodes to keep these routes when they are not in active communication. ROUTE REQUEST is used to initiate the route finding process. ROUTE REPLY is used to finalize the routes. When the request reaches a node with route to destination, it creates again a REPLY which contains the number of hops that are requiring the destination. All nodes that participate in forwarding this reply to the source node create a forward route to destination. This route created from each node from source to destination is a hop-by-hop state and not the entire route as in source routing. ROUTE ERROR is used to notify the network of a link breakage in an active route. 2.2 Destination Sequenced Distance Vector (DSDV) DSDV is table driven, hop-by-hop distance vector routing protocol based on Bellman-Ford Routing algorithm [7]. The Main purpose of this algorithm is to solve the routing loop problem. Each node maintains a routing table and each entry in the routing table contains a sequence number, sequence number are generally even if the link is present otherwise odd numbers are used. The stations periodically transmit their routing tables to their immediate neighbors. If some significant change occurs in that case station transmit its routing table for latest updates. So, the update is both time- driven and event-driven. The routing table updates can be sent in two ways: a “full dump” or an “incremental” update. 2.3 Optimized Link State Routing (OLSR) OLSR is an optimization of pure link state algorithm [8] and uses the concept of Multi Point Relays (MPR). MPR are the selected nodes which forward broadcast the message during the flooding processes. This technique reduces the message overhead. In OLSR, link state information only created by the nodes which are elected as MPR and this helps to minimize the number of control message. The MPR node can exchange information links only between itself and its MPR selector. The MPR set is selected such that it covers all nodes that are two hops away.