Efficient Optimal Route Stability Routing Protocol in MANET Using Gauss-Markov Mobility Model

Bhabani Sankar Gouda Department of CSE

National Institute of Science and Technology

Brahmapur, Odisha bhabani012@rediffmail.com

Pinaki Prasad Panigrahi Department of CSE

National Institute of Science and Technology

Brahmapur, Odisha pinaki.panigrahi@rediffmail.com

Rabindra Kumar Shial Department of CSE

National Institute of Science and Technology

Brahmapur, Odisha rkshial@yahoo.com

Abstract— In Mobile Ad-hoc Network (MANET), routing is the most important issue for communication. Numbers of routing protocols are available for communication in MANET, but optimality is the key issue in routing to improve the performance of MANET. Reactive protocols do not preserve routing information at the network node level, if there is no communication between the nodes. Reverse Reactive protocol determines a route to a specific destination when a particular packet is intends to send. We proposed an optimal route stability routing protocol based route discovery approach, which is used to find an optimal route to the destination with lower communication overhead than flooding based reverse route discovery mechanism. In this proposed work, Optimal Route Stability Routing Protocol (ORSRP) which is a reactive routing based approach uses the reverse route calculation in route request (RREQ), route reply(RREP), route cache (RCAC) and route error (RRER) in order to find out the optimal path. Extensive simulations have been carried out using NS2 network simulator and the obtained result shows that the performance of ORSRP is better than the other existing routing protocol.

Keywords—Mobile Ad-Hoc Networks, Reactive Routing Protocol, Ns2, Route Discovery.

I. INTRODUCTION In the next generation of wireless communication systems, there will be a drastic need for the rapid deployment of independent mobile users for rescue operations, disaster relief, and military operations. Wireless ad-hoc networks are self-organizing and self configuration of multi-hop wireless networks, where to interpret the network changes dynamically due to mobility of nodes [1]. The reactive routing protocol algorithm creates routes between nodes on request of source nodes with network flexibility to allow nodes to enter and leave the network at any point of time. The newly created routes remain active only as long as data packets are travelling along the paths from the source to the destination. A routing procedure is always needed to find an optimal path to send the packets between the source and the destination [2].Wireless ad-hoc networks are self-organizing and self configuration of multi-hop wireless networks, where to interpret the network changes dynamically due to mobility of nodes [1].

II. RELATED WORK Numerous frameworks have been proposed in mobile Ad-hoc network for performance-based routing protocol. Few of them

are frameworks are simulated. This framework uses the concept of reverse reactive routing to find an optimal path between source and destination. Khan et al. [4] conclude that when the MANET setup for a small amount of time, then AODV is better because of low initial packet loss. DSR is not prefers because of its packet loss. On the other hand if we have to use the MANET for a longer duration so we can use both protocols, because after sometimes both have the same behavior. AODV have very good packet receiving ratio in comparison to DSR. At the end, they concluded that the combined performance of both AODV and DSR routing protocol could be the best solution for routing in MANET. In [5], OPNET 14.5 was used for simulation. The simulation study for MANET network under five routing protocols AODV, DSR, OLSR, TORA and GRP were deployed using FTP traffic analyzing. These protocols were tested with three QOS parameters. From their analysis, the OLSR outperforms others in both delay and throughput.

III. ROUTING PROTOCOL Mobile ad-hoc networks, also well-known as short-term

networks, are autonomous systems of mobile nodes forming network in the absence of centralized access point. Absence of fixed infrastructure poses several types of challenges for this type of networking. Among these challenges routing is one of them. Routing protocols of mobile ad-hoc network lean to need different approaches from existing protocols, since most of the existing Internet protocols were proposed to support routing in a network with fixed structure. The proposed routing protocol for find an optimal path in MANET using the following route discovery approaches.

3.1 Gauss-Markov Mobility Model In mobility management, the Gauss-Markov mobility model introduced in is a relatively simple memory-based model with a single tuning parameter, which determines the amount of memory and variability in node movement. In the Gauss-Markov model, each mobile node is assigned an initial speed and direction, as well as an average speed and direction. At set intervals of time, a new speed and direction are calculated for each node, which follow the new course until the next time step. This cycle repeats through the duration of the simulation.

2013 Third International Conference on Advances in Computing and Communications

978-0-7695-5033-6/13 $26.00 © 2013 IEEE

DOI 10.1109/ICACC.2013.95

445

3.2 Optimal Path Finding Approach We study the problem of selecting an optimal route in

terms of transition probability and link available time. Finally we calculate optimal path between source and destination node by four steps, which execute and forwarding RREQ (route request) packets, RREP (route reply) packet, Route Cache (RCAC) and RRER (route error) packets. Experiments have been carried out using NS2 as network simulator ware and results encouraging.

3.2.1 Reverse Route Calculation in RREQ In wireless ad-hoc network each node will create a reverse route table when it receives a RREQ (route request), the RREQ is discards if it has already been processed. It records and indicates the route to the source node; otherwise the source address and the broadcast ID from RREQ resolve is there buffered to prevent it from being processed again [9]. In this case, we have use three variable (New, Next and Count) to indicate how to make reverse route calculation in RREQ. The Next is distance the node calculates at the first time when it receives RREQ or the distance at current time. The New is distance the node calculates when it receives RREQ again. Once an intermediate node receives a RREQ, the node sets up a reverse route entry for the source node in its reverse route table. Count is the distance between source and destinations node when it receives RREP.

Fig. 1. Structure of Mobile Ad hoc Network

By using the reverse route a Next node can send a RREP to the source node. Reverse route entry also has life time field. RREQ reaches to the destination, In order to respond to RREQ a Next node should have in its route table unexpired entry for the destination and sequence number of destination at least as great as in RREQ (for loop prevention). If both conditions are meet & the IP address of the destination matches with that in RREQ the node responds to RREQ by sending a RREP. If conditions are not satisfied, then node increments the hop count in RREQ and broadcasts to its neighbours. Ultimately the RREQ will make to the destination.

Fig. 2. Node RREQ Broadcasting and Updating Reverse route tables in

RREQ

3.2.2 Reverse Route Calculation in RREP We have used the similar calculation mechanism to find the optimal path in forwarding RREP. The simply difference is that the distance we calculate in RREP is from the node forwarding RREP to the destination node.

Fig. 3. Reverse route entry and Calculates distance in RREP

As shown in Fig. 3, the destination node (node K) receives the RREQ from node I and then creates the RREP and unicasts it to node I. Node I forwards this RREP to node G according to the reverse route table created by forwarding the RREQ.

Fig. 4(a) Update reverse route table in RREP. 4(b) and 4(c) optimal path between source and destination.

When node G receives the RREP from node I, it creates the reverse route entry and calculates the Next, which indicates the next hop is node I when the message whose destination node is node K arrives at node G. And then, when node G receives RREP from node K, it will calculates the New and finds that New < Next, as shown in Fig. (a), (b) and (c), node G updates the route table, and Count the no. of hop then finally optimal path is found.

3.2.3 Reverse Route Calculation in RRER We have used the similar calculation mechanism to find the optimal path in forwarding RERR. The simply difference is that When a node detects a link break (for example, receives a link layer feedback signal from the MAC protocol, does not receive passive acknowledgments, does not receive hello packets for a certain period of time, etc.), it performs a one hop data broadcast to its immediate neighbours.

Fig.5. (a) Update Reverse route table in RERR .5(b) Reverse route error entry and calculates all distances in RERR.5(c) Optimal path

communication between S to K

446

As shown in Fig. 5(a), the destination node (node K) moves out of a range and does not receives the RREQ from node I and then creates the RERR and unicasts it to node I. Node I forwards this RERR to node G according to the reverse route table created by forwarding the RREQ. As shown in Fig 5 (b), the destination node (node K) specifies in the data header that the link is disconnected from I and thus the packet is candidate for alternate routing. Upon receiving this packet, neighbour nodes that have an entry for the destination in their alternate route table, unicast the packet to their next hop node. Node K receives the RREQ from node J and then creates the RERR and unicasts it to node J. Node J forwards this RERR to node G according to the reverse route table created by forwarding the RREQ.As shown in Fig 5(c) the destination node (node K) receives RREQ and count hops, when node G receives the RREP from node K; it creates the reverse route entry and calculates the Next, which indicates the next hop is node S when the message whose destination node is node G arrives at node S. And then, when node G receives RREP from node K, it will calculates the New and finds that New < Next and calculate the minimum length of hops and choose lower Count hop and get the Optimal Path.

3.2.4 Route Stability and Route Cache(RCAC)

Stable routes: To maximize throughput and reduce traffic latency in a network, it is essential to ensure dependable source-destination connections over time [7], [8]. A designated route should therefore be selected based on some information of the nodes motion and on a possibility model of the path future availability. Efficient route repair: If an estimate time of the path duration is available, the service disruption due to route failure can be avoided by creating an alternative path before the current one splits [3]. Note that having various information on the path duration avoids waste of radio resources due to preallocation of backup paths.

Fig.6. Updated Routing table through Cache (RCAC)

We focus that AODV finds new routes by making a route request transmit which travels through various intermediate nodes before reaching the destination node in MANET. as a result by providing all the nodes with an extra cache and by making changes in the RREQ packet such as to enable them to carry the information about the nodes through which they pass, intermediate nodes can save the information about the network topology contained in the RREQ packets. This can reduces the time and overhead to find new routes in cases of

route failure. From now on, we will call the AODV with cache enabled as Optimal Route Stability Reactive Protocol.

IV. PERFORMANCE EVALUATION We have performed simulations to evaluate several performance metrics of our schemes. First, we would like to see how obtained optimal path of route discovered by reverse route calculation reduced. Then we compare our schemes with DSR in terms of packet delivery ratio, routing overhead and end-to-end delay.

4.1 Simulation Environment To evaluate and compare the effectiveness of these routing protocols with existing proposed models [9], we performed extensive simulations in NS2. The simulation parameters are listed in table.

TABLE I. SIMULATION PARAMETERS

Experiment Parameter

Experiment Value Description

Simulation time 400 S Simulation duration Terrain

Dimension (1500 * 1500) m X,Y Dimensions

No. of mobile nodes

50 No of nodes in a network

Node Placement Random Waypoint Change Direction in a randomly

Mobility Speed 0-15 mps Mobility of nodes Mobility Model Random Mobility directions Routing Protocol ORSRP

,AODV,DSR,DSDV,RAODV Optimal Path-finding

MAC Protocol Wireless Protocol

4.2 Results and Analysis

i. Packet Loss: This is the number of packets lost due to incorrect or unavailable routes and MAC layer collisions.

Fig. 7. Shows packet Loss Ratio in three different protocol

ii. Packet Delivery Percentage: It is the ratio between the numbers of packets received by the application layer of destination nodes to the number of packets sent by the application layer of source nodes.

Fig. 8. Show Packet Sent Vs Receive in three different protocols

447

iii. Routing Packet Overhead: This is the ration between the total control packets generated to the total data packets during the simulation time.

Fig.9. Shows Routing protocols Overhead of three different protocols

iv. Throughput: It is the average rate of successful message delivery over a communication channel.

Fig.10. Shows Throughput Ratio of three different protocols

v. Average End to End Delay: End-to-end delay refers to the time taken for a packet to be transmitted across a network from source to destination.

Fig.11. Shows Average End to End delay of three different protocols

vi. Path Optimality: The ratio between the numbers of hops of the shortest path to the number of hops in the actual path taken by the packets.

Fig.12. Shows Shortest path Vs. Actual path of three protocols

V. CONCLUSIONS This study was conducted to propose a reactive routing protocol, consists of three steps to find the optimal path. Initially, we calculate the shortest path to the source node and create reverse route table. In second, we filter these paths to obtain optimal path for communication in mobile ad-hoc network by calculating distance to the destination ode. In third step a comparative analysis conducted in between three different protocols in term of packet delivery ratio, routing overhead, throughput and average end to end delay. To support the proposed protocol, we simulated using NS2 simulator on the Linux platform. Finally, for average end to end delay, DSR is lower than AODV, for the nodes equal to 10 and ORSRP to increase the reliability of the reactive routing protocol.

REFERENCES

[1] Jie Li, Member, IEEE, Hisao Kameda, and Keqin Li, Senior Member, IEEE “ Optimal Dynamic Mobility Management for PCS Networks “,1EEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 3, JUNE 2000.

[2] Giovanna Carofiglio , Carla-Fabiana Chiasserini,Michele Garetto,Emilio Leonardi “ Route stability in MANETs under the Random Direction Mobility Model “ September 2009 IEEE Transactions on Mobile Computing , Volume 8 Issue 9.

[3] C.Perkins, E.Belding-Royer, S.Das “Ad hoc On-Demand Distance Vector (AODV) Routing” Feb.2003. http://www.ietf.org/internet-drafts/draftietf-manet-aodv-13.txt.

[4] J. khan, s. I. Hyder and S. M. Fakar “Modeling and simulation of dynamic intermediate nodes nnd performance analysis in MANETS reactive routing protocols”, International Journal of Grid and Distributed Computing Vol. 4, No. 1, March 2011.

[5] R. Al-Ani, “Simulation and performance analysis evaluation for variant MANET routing protocols”, International Journal of Advancements in Computing Technology, Volume 3, Number 1, February 2011.

[6] S. Barakovic, S. Kasapovic, and J. Barakovic, “Comparison of MANET routing protocols in different traffic and mobility models”, Telfor Journal, Vol. 2, No. 1, 2010.

[7] Giovanna Carofiglio, Member, “Route Stability in Manet’s transaction on mobile computing, vol 8, no.9, September 2009.

[8] Kamal Kant, “Stable Link Based Multicast Routing Scheme for MANET”, 2010 International Conference on Computational Intelligence and Communication Networks.

[9] B.S.Gouda, C.K.Behera “ A route discovery approach to find an optimal path in MANET using reverse reactive routing protocol “, National Conference on Computing and Communication Systems (NCCCS), 2012, 21-22 Nov. 2012.

448