International Journal of Engineering & Technology, 3 (2) (2014) 237-244 ©Science Publishing Corporation www.sciencepubco.com/index.php/IJET doi: 10.14419/ijet.v3i2.2318 Research Paper An efficient quantum based routing protocol with local link failure recovery algorithm for manet P. R. Jasmine Jeni 1 *, A. Vimala Juliet 1 , A. Messiah Bose 2 1 SRM university,Chennai,Tamilnadu,India 2 Chemtrols Industries Pvt Limited,Chennai,Tamilnadu,India *Corresponding author E-mail: jasminejeni.pr@gmail.com Copyright © 2014 P.R.Jasmine Jeni et. al. This is an open access article distributed under the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract The mobility factor of the nodes in a mobile Ad Hoc networks (MANET) changes the network topology leading to changes in size of the network. As the topology changes, link failure between the nodes takes place due to several reasons like channel interference and dynamic obstacles that give rise to severe performance degradation. Scalability and link failure recovery are the main criteria that will determine the performance of the network in terms of quality of service (QoS). While having different type of nodes, both mobile and immobile, that have several performance severity related to data transfer which is similar to the one in industrial parameter reporting and data logging, there exists a need to overcome performance related issues such as relatively faster and secured data transfer within the set of nodes. We developed the Quantum based Routing protocol (QRP) associated with Local Link Failure Recovery Algorithm (LLFR). The QRP is a routing protocol that uses DSR and AODV as an underlying protocol to improve the QoS in scalable wireless network. The QRP and LLFR establish link failure recovery spontaneously at the point of link breakage. The performance parameters like; packet delivery ratio, throughput, average end to end delay and routing overhead of the routing protocol QRP with LLFR is analyzed using NS2 simulator. Keywords: Ad Hoc Network, Link Failure, Routing Protocols, Scalability, Quality of Service. 1. Introduction The mobile network using both mobile and immobile nodes that are free to move has a fixed geographic topology but changes its link between its neighbors in due course of time over time. The establishment of communication is extremely challenging due to the dynamic nature of nodes that necessitates the need for having efficient data transmission. Since the routing process is associated within the mobile nodes, the routine exercises pertaining to the network such as exploring the network topology and transmitting the data are performed by the node itself. The mobile network with self-determining nodes communicate via confined wireless bonds in a widespread geographical area, requires specified protocol to perform a defined routing function. The routing protocols in MANET [1] are categorized into three types, namely pro-active, reactive and hybrid routing protocols. In proactive routing protocols, every node in the network maintains the routing table that is updated regularly. The nodes exchange the topology information to keep the routing table with latest notifications leading to high overhead, as they are flooded with information pertaining to unknown links. In QRP, we use DSR and AODV- the reactive protocols, as we proceed in this paper. Ad hoc On-Demand Distance Vector, (AODV) [2] is a reactive routing protocol used in wireless networks that discovers a route to destination on demand. AODV requires each node to maintain a routing table containing the discovered path information. AODV is capable of creating fresh routes whenever a route error occurs. The advantages of AODV is that, it uses sequence numbers to determine the freshness of the route thereby preventing loop formation and doesn’t create overhead unnecessarily during communication. Dynamic Source Routing, (DSR) [3] is designed for infrastructure less network and provides loop free routing. It is a reactive routing protocol that uses a source routing approach in which the route cache stores the routing information for its later use. In DSR, each node acts as a source and is responsible for neighboring node for receiving the transmitted