Proceedings of the National Conference on Mobile and Adhoc Networks, 29th & 30th October 2010

Analysis of Multipath Routing Protocol for Route Recovery and Bandwidth Utilization in MANET
Jagadeesan. D., 2Prof. Dr. S. K. Srivatsa 1 Research Scholar - SCSVMV University, Asst. Professor in CSE, Adhiparasakthi College of Engg., Kalavai E-mail: Jagadeesan.scsvmv.phd@gmail.com 2 Rtd. Professor, Anna University, Sr. Professor - St. Joseph's College of Engineering, Chennai
Abstract: Ad-hoc networks are wireless networks where nodes communicate with each other using multi-hop links. There is no stationary infrastructure or base station for communication. Each node itself acts as a router for forwarding and receiving packets to/from other nodes. Routing in ad-networks has been a challenging task ever since the wireless networks came into existence. Routing is mainly classified into static routing and dynamic routing. Static routing refers to the routing strategy being stated manually or statically, in the router. Static routing maintains a routing table usually written by a networks administrator. The routing table doesnt depend on the state of the network status, i.e., whether the destination is active or not. Dynamic routing refers to the routing strategy that is being learnt by an interior or exterior routing protocol. This routing mainly depends on the state of the network i.e., the routing table is affected by the activeness of the destination. The major disadvantage with static routing is that if a new router is added or removed in the network then it is the responsibility of the administrator to make the necessary changes in the routing tables. But this is not the case with dynamic routing as each router announces its presence by flooding the information packet in the network so that every router within the network learn about the newly added or removed router and its entries. Similarly this is the same with the network segments in the dynamic routing. In this paper, we specifically examine the issues of multipath routing in MANETs. Multipath routing allows the establishment of multiple paths between a single source and single destination node. It is typically proposed in order to increase the reliability of route discovery and bandwidth utilization. Keywords: MANET, Multipath, Routing, Route Discovery and bandwidth 1. INTRODUCTION 1.1 Mobile Ad hoc Network (MANET) A mobile ad-hoc network (MANET) is a transitory infrastructure less multi-hop wireless network wherein the nodes can move randomly. With multi-hop packet forwarding, the limited wireless transmission range of each node has been extended by such networks. Therefore, they become compatible for the scenarios wherein predeployed infrastructure support is not available. [1]. The MANET is a self-configuring network of mobile nodes connected by wireless links, to form an arbitrary topology. The nodes are free to move randomly. Thus the network's wireless topology may be unpredictable and may change rapidly. Minimal configuration, quick deployment and absence of a central governing authority make ad hoc networks suitable for emergency situations like natural disasters, military conflicts, emergency medical situations etc [2]. The primary application areas for MANETs are in domains where there is no readily available infrastructure and where networks of various sizes must be configured quickly and dynamically. Another major application area lies in the field of vehicular ad-hoc networks (VANETs); here, direct communication between vehicles without the need for a cellular infrastructure permits flexible civilian applications such as traffic monitoring and emergency assistance services but also have significant applications in the defense sector [3]. 1.2. Routing in MANET A routing protocol is a protocol that specifies how routers communicate with each other, disseminating information that enables them to select routes then any two nodes on a computer network, the choice of the route
1

Dr. Mahalingam College of Engineering and Technology, Pollachi.

18

Proceedings of the National Conference on Mobile and Adhoc Networks, 29th & 30th October 2010

being done by routing algorithms. Each router has a priori knowledge only of networks attached to it directly. A routing protocol shares this information first among immediate neighbors, and then throughout the network. This way, routers gain knowledge of the topology of the network. The term routing protocol may refer specifically to one operating at layer three of the OSI model, which similarly disseminates topology information between routers. 1.3. Characteristics of Routing Protocol The specific characteristics of routing protocols include the manner in which they either prevent routing loops from forming or break them up if they do the manner in which they select preferred routes, using information about hop costs the time they take to converge how well they scale up many other factors 1.4. Categories of MANET Routing Mobile ad hoc networks can be classified into two main categories: Proactive or table-driven routing protocols and Reactive or on-demand routing protocols. Hybrid routing 1.4.1. Table-Driven Routing Protocols Table-driven routing protocols attempt to maintain consistent, up-to-date routing information from each node to every other node in the network. The routing information is kept in a number of different tables and they respond to changes in network topology by propagating updates throughout the network in order to maintain a consistent, Network view. The areas in which these protocols differ are the way the routing information is updated, detected and the type of information kept at each routing table. 1.4.2. On-Demand Routing Protocols On-demand routing protocols were designed to reduce the overheads in TableDriven protocols by maintaining information for active routes only. When a node requires a route to a destination, it initiates a route discovery process within the network. This process is completed once a route is found or

all possible route permutations have been examined. Once a route has been established, it is maintained by a route maintenance procedure until either the destination becomes inaccessible along every path from the source or until the route is no longer desired. Route discovery usually occurs by flooding a route request packets through the network. When a node with a route to the destination (or the destination itself) is reached a route reply is sent back to the source node using link reversal if the route request has traveled through bidirectional links or by piggy-backing the route in a route reply packet via flooding. [4]. 1.4.3. Hybrid protocol Hybrid methods combine proactive and reactive methods to find efficient routes, without much control overhead. It divides the network into routing zones. The routing zone of a node X includes all nodes within hop distance at most d from node X. All nodes at hop distance exactly d are said to be the peripheral nodes of node X's routing zone. The parameter d is the zone radius. 1.5. Issues in MANET Routing The following are some of the main issues. [5]. Unpredictability of environment: Unreliability of wireless medium: Resource-constrained nodes: Dynamic topology 2. UTILIZATION OF BANDWIDTH 2.1. Global State Routing (GSR) Global State Routing (GSR) is based on the Link State Routing (LSR) method. In the LSR routing method, each node floods the link state information into the whole network (global flooding) once it realizes that links change between itself and its neighbours. The link state information includes the delay to each of its neighbours. A node will know the whole topology when it obtains all link information. LSR routing works well in networks with static topologies. When links change quickly, however, frequent global flooding will inevitably lead to huge control overhead. Unlike the traditional LSR method, GSR does not flood the link state packets.

Dr. Mahalingam College of Engineering and Technology, Pollachi.

19

Proceedings of the National Conference on Mobile and Adhoc Networks, 29th & 30th October 2010

Instead, every node maintains the link state table based on up-to-date LSR information received from neighboring nodes, and periodically exchanges its LSR information with its neighbors only (no global flooding). Before sending an LSR packet, a node assigns the LSR packet a unique sequence number to identify the newest LSR information. LSR information is disseminated as the LSR packets with larger sequence numbers replace the ones with smaller sequence numbers. The drawbacks of GSR are the large size of the update messages, which consume a considerable amount of bandwidth, and the latency of the LSR information propagation, which depends on the LSR information update interval time. ``Fisheye'' technology can be used to reduce the size of update messages. In this case, every node maintains highly accurate network information about the immediate neighbouring nodes, with progressively fewer details about farther nodes. 2.2. Dynamic Source Routing (DSR) The Dynamic Source Routing (DSR) protocol uses the source routing approach (every data packet carries the whole path information in its header) to forward packets. Before a source node sends data packets, it must know the total path to the destination. Otherwise, it will initiate a route discovery phase by flooding a Route REQuest (RREQ) message. The RREQ message carries the sequence of hops it passed through in the message header. Any nodes that have received the same RREQ message will not broadcast it again. Once an RREQ message reaches the destination node, the destination node will reply with a Route REPly (RREP) packet to the source. The RREP packet will carry the path information obtained from the RREQ packet. When the RREP packet traverses backward to the source, the source and all traversed nodes will know the route to the destination. Each node uses a route cache to record the complete route to desired destinations. Route failure is detected by the failure of message transmissions. Such a failure will initiate a route error message to the source. When the source and the intermediate nodes receive the error message, they will erase all the paths that use the broken link

from their route cache. The path calculated in DSR is loop-free since loops can be detected easily and erased by the source routing. A few optimizations are proposed for DSR. DSR is simple and loop-free. However, it may waste bandwidth if every data packet carries the entire path information. The response time may be large since the source node must wait for a successful RREP if no routing information to the intended destination is available. In addition, if the destination is unreachable from the source node due to a network partition, the source node will continue to send RREQ messages, possibly congesting the network. 2.3 Ad hoc On-Demand Distance Vector (AODV) Routing Since DSR includes the entire route information in the data packet header, it may waste bandwidth and degrade performance, especially when the data contents in a packet are small. Ad hoc On-Demand Distance Vector (AODV) Routing tries to improve performance by keeping the routing information in each node. The main difference between AODV and DSR is that DSR uses source routing while AODV uses forwarding tables at each node. In AODV, the route is calculated hop by hop. Therefore, the data packet need not include the total path. The route discovery mechanism in AODV is very similar to that in DSR. In AODV, any node will establish a reverse path pointing toward the source when it receives an RREQ packet. When the desired destination or an intermediate node has a fresh route (based on the destination sequence number) to the destination, the destination/intermediate node responds by sending a route reply (RREP) packet back to the source node using the reverse path established when the RREQ was forwarded. When a node receives the RREP, it establishes a forward path pointing to the destination. The path from the source to the destination is established when the source receives the RREP. AODV saves bandwidth and performs well in a large MANET since a data packet does not carry the whole path information. As in DSR, the response time may be large if the source node's routing table

Dr. Mahalingam College of Engineering and Technology, Pollachi.

20

Proceedings of the National Conference on Mobile and Adhoc Networks, 29th & 30th October 2010

has no entry to the destination and thus must discover a path before message transmission. Furthermore, the same problems exist as in DSR when network partitions occur. 3. RELATED WORK Byung-Seok Kang et al [8] have proposed a location-based hybrid routing protocol to improve data packet delivery and to reduce control message overhead in mobile ad hoc networks. In mobile environments, where nodes move continuously at a high speed, it is generally difficult to maintain and restore route paths. Therefore, their study suggests a new flooding mechanism to control route paths. The essence of their proposed scheme is its effective tracking of the destinations location based on the beacon messages of the main route nodes. Michael Pan et al [9] have proposed an efficient approach to repair error links quickly. The approach can apply to the Ad hoc Ondemand Distance Vector (AODV) routing protocol. As an enhancement to AODV, the proposed approach leads to two routing protocols, called AODV-LRQ and AODV-LRT, which are aimed to efficiently repair the link errors. To evaluate the effects of the route repair, they define a factor, called bonus gain, as the ratio between the throughput increments to the routing overhead increment. Aminu Mohammed et al [10] have proposed a new probabilistic counter-based method that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Dhirendra Kumar Sharma et al [11] have enhanced the performance of Split Multipath Routing protocols by using route update mechanism. Their proposal is useful in route recovery process. In MANET for sending the data packets through alternate path takes more time in comparison with stale route that was broken. So, they repair the broken route through route update mechanism process and reduce the delay through new updated path. In their proposal they are considering the high gain antenna terminal that adjust transmission range of each node and follow a new technique for route update mechanism. So, they provide a heuristic approach to reduce the delay metric and increase the performance of MANET.

Vinay Kolar et al [12] have proposed a new directional route discovery approach called Route Compaction. Route compaction relies on enhanced version of omni- directional route discovery to find paths, avoiding the problems with sweeping broadcast. Route compaction then attempts to compact routes by replacing multiple hops with a single directional hop whenever possible. 4. PROPOSED SOLUTION We propose to develop a hybrid routing protocol involving multipath discovery and local error-recovery. In this protocol, each source and destination pair establishes multiple paths in single route discovery and they are cached in their route caches. The cached routes are sorted on the basis of their bandwidth availability. Whenever a link or route break is occurred, a local error-recovery is performed which in turn invokes the alternate route selection. An effective alternate route is selected from the route cache which is most consistent and having greater available bandwidth.Using our proposed hybrid routing technique has the following advantages as possible: Reduces packet drops above 50% Reduces the recovery time 50 60% Reduces overhead above 50% Utilizes bandwidth efficiently. 5. REFERENCES [1] S. Dhanalakshmi and Dr. M.Rajaram A Reliable and Secure Framework for Detection and Isolation of Malicious Nodes in MANET IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.10, October 2008. [2] Bhavyesh Divech , Ajith Abraham, Crina Grosanand Sugata Sanyal Impact of Node Mobility on MANET Routing Protocols Models Journal of Digital Information Management, 2007. [3] Alexander Nouak MANET Security Sixth International Conference on Intelligent Information hiding and multimedia signal processing October 15-17, 2010 in Darmstadt, Germany. [4] Narendra Singh Yadav and R.P.Yadav Performance Comparison and Analysis of Table-Driven and On-Demand Routing

Dr. Mahalingam College of Engineering and Technology, Pollachi.

21

Proceedings of the National Conference on Mobile and Adhoc Networks, 29th & 30th October 2010

Protocols for Mobile Ad-hoc Networks, International Journal of Information Technology 4:2 2008. [5] Stephen Mueller, Rose P. Tsang, and Dipak Ghosal Multipath Routing in Mobile Ad Hoc Networks:Issues and Challenges, In Performance Tools and Applications to Networked Systems (2004). [6] Muhammad Farhan Sjaugi, Mohamed Othman and Mohd. Fadlee A. Rasid A New Distance Based Route Maintenance Strategy for Dynamic Source Routing Protocol, Journal of Computer Science 4 (3): 172-180, 2008. [7] Cigdem Sengul and Robin Kravets Bypass Routing: An On-Demand Local Recovery Protocol for Ad Hoc Networks, Elsevier Science Publishers B. V., Volume 4 May 2006. [8] Byung-Seok Kang and In-Young Ko Effective Route Maintenance and Restoration Schemes in Mobile Ad Hoc Networks, Sensors 2010. [9] Michael Pan, Sheng-Yan Chuang and Sheng-De Wang Local Repair Mechanisms for On-Demand Routing in Mobile Ad hoc Networks, Proceedings of the IEEE 11th Pacific Rim International Symposium on Dependable Computing, 2005. [10] Aminu Mohammed, Mohamed OuldKhaoua, Lewis M. Mackenzie, Colin Perkins, and Jamal Deen Abdulai Probabilistic Counter-Based Route Discovery for Mobile Ad Hoc Networks, IWCMC09, June 2124, 2009, Leipzig, Germany. [11] Dhirendra Kumar Sharma, Sanjay Kumar Biswash and Chiranjeev Kumar Enhancement of Split Multipath Routing Protocol in MANET, International Journal on Computer Science and Engineering Vol. 02, No. 03, 2010. [12] Vinay Kolar, Paul Rogers and Nael B. Abu-Ghazaleh Route Compaction for Directional Route Discovery in MANETs. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005). [13] Hakim Badis, Ignacy Gawedzki and Khaldoun Al Agha, "QoS Routing in Ad

Hoc Networks using QOLSR With no Need of Explicit Reservation", 2005. [14] N. Nikaein, C. Bonnet, and N. Nikaein, ."Hybrid ad hoc routing protocol - HARP",. in Proc. Int. Symp. Telecommunications, 2001

Dr. Mahalingam College of Engineering and Technology, Pollachi.

22