IJASCSE Vol 1, Issue 3, 2012

Oct. 31

Stable and Reliable Route Identification Scheme for Efficient DSR Route Cache in Mobile Ad Hoc Networks
S. Sathish, Assistant Professor, Department of Computer Science, Periyar University, Salem, K. Thangavel, Professor, Department of Computer Science, Periyar University, Salem, M. Padmapriya, Research Scholar, Department of Computer Science, Periyar University, Salem,

Abstract - Reactive routing protocol, DSR in MANET, discover routes based on demand with route cache mechanism. DSR adapts source routing and aggressive utilize of route caches. DSR lacks in determining route validity in route caches using fixed time interval for cache invalidation. Entry in cache is only for a specified time and removed when time expired. Existing work presented a dynamic mechanism to enhance cache strategies for reducing number of stale route entries and their dissemination with Expected Link Expiration Time (ELET) and updated route reply method is used to prevent dissemination of stale routes. In dynamically changing ad hoc mobile scenario, route stability and the reliability of the route becomes a major concern in DSR. However, existing work lacked in addressing the issues of route stability and reliability factors. The proposed work presents a Stable and Reliable Route Identification (SRRI) scheme for DSR protocol. Route stability is achieved with node transmission range control procedure. Route reliability is maintained in terms of bandwidth requirement to discover the required route. In addition the routing overhead for the bandwidth consumption is minimized with pre cache history vector of route bandwidth maintained in node caches. Simulation is carried out with varied number of nodes and different mobility www.ijascse.in

rate in multi-radio range transmission of mobile ad hoc network using NS-2 random mobility model. The performance of the proposed SRRI scheme is measured in terms of reliable and stable routes for the ad hoc network, with node mobility rate, bandwidth consumption, routing overhead, packet delivery ratio. Keywords: MANET, Cache, SRRI DSR, Route

I .INTRODUCTION A mobile ad hoc network is a mobile, multi-hop wireless network with no stationary infrastructure. Dynamic topologies due to mobility and limited bandwidth and battery power make the routing problem in ad hoc networks more challenging than traditional wired networks. A key to designing efficient routing protocols for such networks lies in keeping the routing overhead minimal. A new class of on-demand routing protocols (e.g., DSR, AODV, TORA) attempt to reduce routing overhead by only maintaining routes between nodes taking part in data communication. In these protocols, the source discovers routes on-demand by initiating a route discovery process. A. Route Discovery in DSR

Page 1

IJASCSE Vol 1, Issue 3, 2012

Oct. 31

When a source node originates a new packet addressed to a destination node, it will search its Route Cache for a source route. If no route is found in the cache, the sender initializes Route Discovery by broadcasting a Route Request (RREQ) packet (Figure. 1), containing destination node address, unique request identification, and an initial empty list which together uniquely identify this Route Discovery.

cache (Figure 2) rather than forwarding the route request. If the destination node receives the multiple RREQ propagated from different routes, it replies to all RREQ by RREP. As a result of single route discovery to a destination node leads to multiple routes for it. The RREP can be delivered to the initiator by simply reversing the node list, by using a route to the initiator in its own cache, or piggybacking the packet on a new Route Request to the original initiator. When the initiator receives the RREP, it adds the source route in its route cache for use in sending subsequent packets to the destination and for future use.

Figure 1: Node N1 Sends RREQ B. Route Reply in DSR A node receiving the RREQ [1], if it is not the intended destination, appends its address to the node list and forwards the packet. However, first it checks whether it has recently seen another RREQ from the same source node with the same request identification and target address, or whether its own address has already presented in the traveled node list of this RREQ. If either check is true, the node silently drops this packet. When the RREQ packet reaches the destination node, this node returns a Route Reply (RREP) to the source node (Fig. 2) with a copy of the node list from the RREQ. If an intermediate node receiving the RREQ contains the route to the destination in its Route Cache then this node returns a RREP to the source node from its own route www.ijascse.in

Figure 2: Nodes N5, N3 Sends RREP C. Caching Mechanism The majority of work related to route caches in mobile ad hoc networks focused on Dynamic Source Routing (DSR). DSR is an on-demand protocol that uses source routing and makes aggressive use of route caches. The current specification of DSR lacks a mechanism to determine the validity of routes in the route caches. DSR uses fixed time interval for cache invalidation, i.e., entry in cache appoints a fixed time and removed when time expired. This mechanism is not efficient as waiting too long to invalidate route introduces Page 2

IJASCSE Vol 1, Issue 3, 2012

Oct. 31

information and does not require any external support. stale route cache and its dissemination. Also not waiting long enough removes the routes from cache which are still valid and causes unnecessary retransmission of route request and route reply. The weakness of this scheme is that it cannot adapt to the change of the network topology. Because of these, setting the timeout close to the expected link expiration time is considered to improve the performance. Since the actual lifetime of a link highly depends on node mobility, to achieve good performance, dynamic caching schemes are desired. D. Expected Link Expiration Time Existing Work suggested scheme to develop and analyze enhanced cache strategies for reducing number of stale route entries and their dissemination. The basic idea of the scheme is to use the Expected Link Expiration Time (ELET) [6] as its cache timeout and preventing the distribution of stale information by updated route reply. The ELET is a measure of time duration in which a node will become out of transmission range of another node. ELET is determined dynamically by the Enhanced DSR (EDSR) when it receives RREQ from nearby node using the cross layer information. Cross layer design refers to protocol stack that intercommunicate the useful information to collectively achieve the desired optimization goal by allowing the different protocols to share information related to the network status. Therefore, cross layer based cache mechanism in which DSR computes timeout value of individual links by utilizing received signal strength from physical layer. This method uses locally available network This paper has been organized as follow, section II describes the related work, section III describes the proposed work, section IV illustrates the results and discussions and finally section V concludes the paper.

II. RELATED WORK In paper[5], the authors proposes a novel MANETs routing protocol by using a link lifetime based multipath mechanism to improve route stability, which is called Link lifetime based Backup Routing protocol (LBR). During the local backup paths setup, LBR conduct a local optimization, which guarantees the backup path to have the maximum lifetime in local area. These mechanisms predict the timeout of a route cache using pre determined parameters. However, predetermined value of timeout may work for certain scenarios but may not work well for all. In [3], a smart packet is generated periodically which travels through the network, collects topology information, and the nodes update their route caches. Route entries then contain new routes reflecting the most recent topology changes. In [6] the authors presented a cross-layer approach for predicting the route cache lifetime. The author assigns timeouts of individual links in route cache by utilizing RSSI values received from physical layer. This scheme requires RSSI thresholds for link timeout on every node of the ad hoc network. In this method the timeout value directly depends on thresholds value selected. In [4], the authors developed a caching strategy that permits nodes to update their cache, when the topology of the network changes. To achieve it, all Page 3

www.ijascse.in

IJASCSE Vol 1, Issue 3, 2012

Oct. 31

reachable nodes that have cached a broken link are notified when it fails. Based on it, the proposed algorithm notifies all reachable nodes that have cached the link in a distributed manner. In this work, timeout for route cache entry is not used, thus if nodes become unreachable in some cases then they will not remove the stale route from their caches. III. PROPOSED WORK Proposed work present a Stable and Reliable Route Identification (SRRI) scheme for DSR protocol in extremely dynamic mobile node communication setting. Route stability is accomplished with node transmission range control process, in which transmission range of every node in DSR cache is updated occasionally to discover the node accessibility for link broadcast with other nodes. Route reliability is sustained in terms of bandwidth requirement to determine the required route with enhanced DSR as is justified in the existing work. Furthermore the routing overhead for the bandwidth consumption is reduced with pre cache account vector of route bandwidth preserved in node caches. A. Stability Based DSR Routing In MANET A new routing paradigm can be obtained by considering the route stability as routing metric. Stability based routing aims at choosing routes which are more stable in time. The Signal Stability based Routing performs on demand route discovery by selecting longer-lived routes based on signal strength and location stability. The signal strength criteria allow the protocol to differentiate www.ijascse.in

between strong and weak channels. Each channel is characterized as strong or weak by the average signal strength at which packets are exchanged between the hosts at either end of the channel. In SRRI based DSR route discovery, a source initiates a route discovery request when it has data to send to a destination which is not in the routing table. The routesearch is broadcast to all neighboring hosts. These hosts propagate the broadcast if (1) it is received over a strong channel and (2) the request has not been propagated previously (to avoid looping). The route-search packet stores the address of each intermediate host in the route taken. The destination chooses the route recorded in the first arriving request, since this route is probably shorter and less congested than routes for slower arriving requests. The destination returns the route-reply along the selected route, and each intermediate node includes the new next-hop, destination pairs in its routing table.

B. Reliability Based DSR Routing In MANET In order to reduce the broadcast storm and routing overhead, an intermediate node can re-broadcast a second RREQ packet only if it has higher reliability and stability than the first RREQ packet, otherwise the RREQ will be discarded. When the first RREQ packet enabled reaches the destination node, the node starts the timer interval and during that time it examines the reliability and stability of every arrived RREQ packet. When the timer interval expired, the destination node selects the RREQ packet that has the highest QOS function and sends the route reply (RREP) packet carrying the route information to the source node. When another RREQ Page 4

IJASCSE Vol 1, Issue 3, 2012

Oct. 31

packet with the same preference arrives after the threshold time interval, it will not be considered and do not process it further. C. Stable and Reliable Identification (SRRI) Route

bandwidth consumption is minimized with pre cache history vector of route bandwidth maintained in node caches.

D. PROCEDURE FOR SRRI SRRI Procedure Procedure SRRI (For each node from source to Destination) For Node 1 to Total Number of Nodes Do If GT = 1 & GR = 1

We have developed an ad hoc routing protocol by introducing a Stable and Reliable Route Identification (SRRI) scheme to the widely used DSR routing protocol. This routing metric is concerned with finding optimal paths between the source and the destination nodes that can avoid the congested regions in the network. It focuses on multiple objectives to be optimized, such as Bandwidth consumption (which refers to the number of bits per second (bps) that can be sent along the path between the source and the destination nodes) and signal strength. In this modification, we include the local availability of the bandwidth at a node in addition to the hop count metric to maximize the end-to-end throughput in MANETs and at the same time to control the end-to-end delay time. SRRI helps the routing protocol to determine the available bandwidth at the node in order to improve the network performance by avoiding routing traffic through the congested areas. Route stability is achieved with node transmission range control procedure, in which transmission range of every node in DSR cache is updated periodically to identify the node availability for link transmission with other nodes. Route reliability is maintained in terms of bandwidth requirement to discover the required route with enhanced DSR as is explained in the existing work. In addition the routing overhead for the www.ijascse.in

Else Error End If End For Node 1 to Total Number of Nodes Do End End TR Transmission Range PT Power of Transmitter GT Gain of Transmitter GR Receiver Gain HT Height of Transmitter HR Height or Receiver D Distance between two consecutive nodes at time T L Signal Loss P Power R Success Rate T Time

IV. RESULTS AND DISCUSSION We chose the popular network simulator NS2 as the simulator primarily to implement methods because it is widespread use in the academic community and the Page 5

IJASCSE Vol 1, Issue 3, 2012

Oct. 31

comprehensive manuals and tutorials that are freely available. It is possible to simulate a mobile multi-hop ad hoc wireless network in ns-2 using simulated 802.11 MAC layer. A. Packet Delivery Ratio Packet delivery ratio is the ratio of the number of data packets received by a destination over the number of data packets delivered by the corresponding source.

Figure 4: Mobility Vs Routing Overhead The above Figure 4 shows the routing overhead of SRRI and ELET with different number of mobile nodes and mobility speeds, respectively. As shown in Figure 4 routing overhead increases as the number of mobile nodes or the mobility speed increases. The routing overhead for ELET is higher than SRRI. C. Bandwidth Consumption The number of packets can be sent along the path between the source and the destination nodes. These metrics was chosen due to these performance metrics was well known in showing the routing performance of the selected protocol.

Figure 3: Mobility Vs Packet Delivery Ratio The Figure 3 shows the packet delivery ratio of SRRI and ELET with different number of mobility speeds. We can observe that SRRI transmits and receives more data packet than ELET. The ELET path may break easily. SRRI will always choose the most stable and reliable path, the chance of link breakage for SRRI is lower than ELET since ELET didnt consider the stability of the selected path. B. Routing Overhead Routing Overhead can be termed as the total number of overhead packets is transmitted per second. This metric indicates the routing cost.

Figure 5: Mobility Vs BandwidthConsumption

The Figure 5 shows the bandwidth consumption of SRRI and ELET with different number of mobility Page 6

www.ijascse.in

IJASCSE Vol 1, Issue 3, 2012

Oct. 31

REFERENCES speeds. As shown in Figure bandwidth consumption increases as the number of mobility speed increases. Bandwidth consumption for ELET is higher than SRRI. SRRI consumes less bandwidth. This is because discovery of reliable and stable path in SRRI based DSR. V. CONCLUSION In this work, we have presented a new mechanism, Stable and Reliable Route Identification (SRRI) scheme for DSR protocol in highly dynamic mobile node communication scenario. To reduce the stale cache information and its dissemination, SRRI scheme dynamically computes the ELET and adds this value when a route is discovered by source node. SRRI considers with multiple constraints such as routing overhead, bandwidth, and signal strength to find the most feasible route from the source node to the destination node. It also selects the most stable links which leads to longer-lived routes and reduces route maintenance. The simulation results show that SRRI scheme can considerably improve the performance. It achieved the route stability and reliability with node transmission range control procedure and bandwidth requirement. SRRI scheme attains data delivery ratio about 99.5 % in MANET. Compared with ELET, proposed SRRI scheme achieves 18% better result in Bandwidth consumption and 5% to 9% better result in Routing overhead. We can conclude that our proposed SRRI scheme provides the improvement in terms of data delivery ratio with lower routing overhead and Bandwidth consumption for route reliability and stability in mobile ad hoc networks. [1] Johnson, D., Maltz, D., Hu, Y.-C, The Dynamic Source Routing for mobile ad hoc networks. IETF Internet Draft (2004), http://www.ietf.org/internetdrafts/ draftietf-manet-dsr-10.txt [2] Srivastava, V., Motani, M., Crosslayer design: a survey and the road ahead, IEEE Communication Magazine 43(12), pp. 11121119, 2005 [3] Ashokraj, N., Arun, C., Murugan, K. Route Cache Optimization Mechanism Using Smart Packets For On-Demand Routing Protocol in MANET, In International Conference on Information Technology (ICIT), pp. 141146, 2008. [4] Garrido, J., Marandin, D: A Linkcache Invalidation Mechanism for Dynamic Source Routing (DSR) in Ad Hoc Networks. In: 18th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, pp. 37 (2007) [5] Wen Jing Yang, Xinyu Yang, Shusen Yang, Yage Gong, Improving Route Stability In Mobile Ad Hoc Networks Based On Link Lifetime, Journal Of Communications, Vol. 6, No. 3, May 2011. [6] Gaurav Bhatia , Vivek Kumar, An Enhanced DSR Caching Scheme Based on Cross Layer Information, In Springer-Verlag Berlin Heidelberg 2011, pp. 191203, 2011. [7] The Network Simulator ns-2, http://www.isi.edu/nsnam/ns/.

www.ijascse.in

Page 7