Volume 1, No.

10, December 2012 ISSN 2278-1080 The International Journal of Computer Science & Applications (TIJCSA) RESEARCH PAPER Available Online at http://www.journalofcomputerscience.com/

A Survey on Alternate Route Finding in MANET using Backtracking Algorithm: Recovery Issues
Rajesh.T 1 , Rajesh.Y 2, Kishore Babu.T 3 , Vidya Sagar.V 4
1

Assistant.Professor, CSE Department, Andhra Loyola institute of Engineering and Technology, Vijayawada, Andhra Pradesh, India.rajesh.cse6@gmail.com Assistant.Professor, CSE Department, Andhra Loyola institute of Engineering and Technology, Vijayawada, Andhra Pradesh, India..rajeshrajiv1324@gmail.com Assistant Professor, IT Department, Andhra Loyola institute of Engineering and Technology, Vijayawada, Andhra Pradesh, India. .babu07.tk@gmail.com Assistant Professor, IT Department, Andhra Loyola institute of Engineering and Technology, Vijayawada, Andhra Pradesh, India. vidyasagar0058@gmail.com

ABSTRACT: - In Mobile Ad hoc Network the data packet may fail to be delivered to destination for various reasons including nodes movement, high traffic and bad channel, link breakage condition. Because re-route recovery of traditional routing protocols has high latency, several ideas have been proposed to solve these problems. To overcome this problem backtracking algorithm scheme was introduced. In this paper, we present a method by using backtracking algorithm which can be used to find alternative path to reach destination, thereby it reduces the path cost by selecting the optimal alternate node. It uses the process of repeatedly exploring various paths until you encounter the solution. Here current node estimates the shortest path to reach destination while choosing alternative path. When the data has been lost, current node immediately sends request back to the source and retransmission is done.

Keywords: MANET, Recovery, Retransmission, Backtracking.

1. INTRODUCTION
The rapidly expanding technology of cellular communication, wireless LANs, and satellite services will make information accessible anywhere and at any time. Regardless of size, most mobile computers will be equipped with a wireless connection to the fixed part of the network, and, perhaps, to other mobile computers. The resulting computing environment, which is often referred to as mobile or nomadic computing, no longer requires users to maintain a fixed and universally known position in the network and enables almost unrestricted mobility. Mobility and portability will create an entire new class of applications and, possibly, new massive markets combining personal computing and consumer electronics. Ad hoc networks, as the name suggests, have no supporting infrastructure. Ad hoc networks are comprised of a dynamic set of cooperating peers, which share their wireless capabilities with other similar devices to enable communication with devices not in direct radio-range of each other, effectively

2012, http://www.journalofcomputerscience.com - TIJCSA All Rights Reserved

25

Rajesh.T 1 , Rajesh.Y 2, Kishore Babu.T 3 , Vidya Sagar.V 4, The International Journal of Computer Science & Applications (TIJCSA) ISSN 2278-1080, Vol. 1 No. 10 December 2012
relaying messages on behalf of others. A mobile unit within these networks connects to and communicates with, the nearest base station that is within its communication radius. As the mobile unit travels out of range of one base station into the range of another, a "handoff" occurs from the old base station to the new, allowing the mobile to be able to continue communication seamlessly throughout the network. Typical applications of this type of network include office wireless local area networks (WLANs). The second type of mobile wireless network is the mobile ad-hoc network or MANET. Unlike infrastructure network, this type of network needs no base station. Mobile nodes communicate to each other by either directly or through intermediate nodes. Ad-hoc network becomes popular since it can be applied in many situations, such as emergency search-and-rescue operations, classroom, meetings or conference and many more. To facilitate communication within the network, routing protocols used to discover routes between nodes. Building a MANET routing protocol is not an easy job, since efficiency and correctness becomes the main concern.

2 ADVANTAGES OF AD-HOC NETWORK

Fully self-organized MANETs can be informally visualized as a group of strangers, people who have never met before, coming together for a common purpose. These people have no prior relationships and share no common keying material on their nodes. Users therefore have to establish security associations between themselves, after network formation. 1. 2. 3. Mobile ad-hoc network provide wireless devices that can move freely in the network and cooperate to send packets on one another. MANET provides the security on key Management in which the key management for group communication is to solve the most critical security technology of MANET security. Wireless network has been widely used in many sectors. The popularity gained is due to many reasons, such as ease of installation, flexibility, mobility, reduced cost-of-ownership, and scalability. Wireless network have some security threats, in which anyone who use it or intend to use it should be aware.

3. METHODOLOGY
3.1) GENERAL METHOD OF ROUTING

Here Source is N1 and destination is N4. Generally algorithms prefer shortest path to reach destination. If there is no path existing to reach destination , then we prefer alternative path. In this diagram N1 having 2 possible paths. i.e.: N2 & N3. , It prefer N3 node because cost of N3 is smaller than N2.we found no path existing to reach destination, Then we come back to the previous node N1 and again choose another alternative node.

2012, http://www.journalofcomputerscience.com - TIJCSA All Rights Reserved

26

Rajesh.T 1 , Rajesh.Y 2, Kishore Babu.T 3 , Vidya Sagar.V 4, The International Journal of Computer Science & Applications (TIJCSA) ISSN 2278-1080, Vol. 1 No. 10 December 2012
3.2) BACKTRACKING METHOD OF ROUTING
N1

4 11 2
1
N2 N3

21

5
N4

11 4 8 11 11 11 11 11 N7 1 21 111 111 N9

11 4 4 11 11 N5

511 6

11 11 N6 1 4
N8

Here Source is N1 and destination is N4. As I above stated, current node calculates the shortest alternate path to reach destination. In this diagram N1 having 2 possible paths. i.e.: N2 & N3. Though cost of N3 is smaller than N2, we prefer N2 node because N2 is the efficient way to reach destination in an efficient manner. 3.3) DESCRIPTION OF BACKTRACKING ALGORITHM The backtracking algorithm for mobile ad hoc network is designed into three modules viz., Route discovery module, Alternate route selection module and Route recovery module 3.3.1) ROUTE DISCOVERY MODULE Route discovery is responsible for generating route between source and destination. Working of this module is as follows: At source node create Request packet data and sends to its adjacent nodes which is towards destination in the increasing order. At any node, when it receives Request packet, it does the following If(curr_node = = dest_node) { construct the acknowledge packet and send acknowledge packet back to previous node from which it has received Request packet and update the table according to the node count } else { add the curr_node address & forward the Request packet to the neighbor nodes towards destination . }

2012, http://www.journalofcomputerscience.com - TIJCSA All Rights Reserved

27

Rajesh.T 1 , Rajesh.Y 2, Kishore Babu.T 3 , Vidya Sagar.V 4, The International Journal of Computer Science & Applications (TIJCSA) ISSN 2278-1080, Vol. 1 No. 10 December 2012

3.3.2) ALTERNATE ROUTE SELECTION MODULE: Main agenda of this paper is choosing alternative path when there is huge traffic towards the path which we are going to travel. If(curr_node==dest_node) { construct the acknowledge packet and send acknowledge packet back to previous node from which it has received Request packet and update the table according to the node count. } Else if ( bandwidth is less than packet data) { Choose alternative path from current level of a tree towards destination .Once destination has been reached send acknowledge packet back to previous node from which it has received Request packet and update the table according to the node count. } Else { Come back to the previous level of a tree i.e. backtracking. And choose best alternative path towards destination. send acknowledge packet back to previous node from which it has received Request packet and update the table according to the node count. }

3.3.3) RECOVERY ROUTE MODULE: This module concentrates on data loss over the nodes which was send by source. If (curr_node = = NULL) { Send error signal back to previous nodes until it reaches source. Then source resends packet data to the appropriate nodes. } 4) CONCLUSION: In this paper we have proposed a backtracking algorithm which can be used to find alternative path to reach destination, thereby it reduces the path cost by selecting the optimal alternate node. It uses the process of repeatedly exploring various paths until you encounter the solution. 5) REFERENCES: [1]. Zhenqiang Ye., Srikanth V. Krishnamurthy., and Satish K. Tripathi., A Framework for Reliable Routing in Mobile AdHoc Networks, IEEE InfoCom, 2003. [2]. Sirisha Medidi., and Jiong Wang., Location based Route Self-Recovery for Mobile Ad-Hoc Networks, 2007. [3]. Junghwi Jeon., Kiseok Lee., and Cheeha Kim., Fast Route Recovery Scheme for Mobile Ad Hoc Networks, IEEE International Conference on Information Networking, 2011. [4]. Hadi Sargolzaey., Borhanuddin Mohd Ali., and Sabira Khatun., A Cross Layer Metric for Discovering Reliable Routes in Mobile Ad Hoc Networks, Springer, Wireless Pervasive Communication, 2007. [5] Tomonori Kagi., and Osamu Takahashi., Efficient Reliable Data Transmission Using Network Coding in MANET Multipath Routing Environment, Springer , KES, 2008

2012, http://www.journalofcomputerscience.com - TIJCSA All Rights Reserved

28

Rajesh.T 1 , Rajesh.Y 2, Kishore Babu.T 3 , Vidya Sagar.V 4, The International Journal of Computer Science & Applications (TIJCSA) ISSN 2278-1080, Vol. 1 No. 10 December 2012
[6]. Chunxue Wu., Fengna Zhang., and Hongming Yang., A Novel QoS Multipath Path Routing in MANET, International Journal of Digital Content Technology and its Applications, 2010 [7]. Khalid Zahedi., and Abdul Samad Ismail.,Route Maintenance Approach for Link Breakage Predicttion in Mobile Ad Hoc Networks, International Journal of Advanced Computer Science and Applications ((IJACSA), 2011.

BIOGRAPHIES: T.Rajesh received the B.Tech. Degree in Computer science engineering from PVP Siddhartha Institute of Engineering & Technology in 2006 and M.Tech (SE) from G.I.E.T College, Rajahmundry in 2008.Currently he is working as an Assistant Professor In Andhra Loyola Institute Of Engineering And Technology, Vijayawada. His Area of interest are mobile adhoc networks and security issues in the data bases. Y.Rajesh received the B.Tech. Degree in Computer science engineering from PVP Siddhartha Institute of Engineering & Technology in 2009 and M.Tech CSE from K. L. University in 2011.Currently he is working as an Assistant Professor in Andhra Loyola Institute Of Engineering And Technology,Vijayawada.His Area of interest are data mining, security and artificial Intelligence.

T.Kishore babu received the B.Tech. Degree in Computer science engineering from Narasaraopeta Engineering college in 2008. and M.Tech (IT) from SRM University, Chennai in 2011.Currently he is working as an Assistant Professor in Andhra Loyola Institute Of Engineering and Technology, Vijayawada. His Area of interest are data mining and networking

V.Vidya Sagar received the B.Tech. Degree in Computer science engineering from KLCE, Vijayawada in 2007 and M.Tech (IT) from Avanthi Institute of Engineering and Technology, Visakhapatnam in 2011.Currently he is working as an Assistant Professor in Andhra Loyola Institute of Engineering and Technology, Vijayawada. His Area of interest are data mining and wireless networks .

2012, http://www.journalofcomputerscience.com - TIJCSA All Rights Reserved

29