Now Wireless Ad hoc network can be deployed without infrastructure, and this comprise of self-organizing devices. MANET (Mobile Ad hoc Networks) can be denoted as the autonomous system of the mobile node joined via wireless link without using the any existing network infrastructure. Every node acts as a host as well as the router and forwards every other packet to visible the communication during nodes not instruct connected by the wireless links. The central challenge in the design of ad hoc networks is development of the dynamic routing protocols that can efficient search route during communicating node. The routing protocol must be able to keep up with high degree of nodes mobility that often change the network topology unpredictably and drastically (Chen & Heinzelman, 2007). The integration of the link-quality variation with broadcasting nature of the Wireless channel has disclose the direction in analysis of the wireless networking namely co-operative communications (Frias, et. al., 2007). While working with the wireless networks, the network layer received the most of the researcher’s attention. Due to this there are many routing protocols proposed by various authors for MANET with their different aims and objectives by targeting the specific application needs. At the network layer there are two major operations performed by network layer such as data forwarding and routing (Das, et. al., 2007). This two are completely different methods. The concept of data forwarding is nothing but process of regulating how the packets taken from one link and added into another link. Whereas the routing determines the route on which the data packet are routed from the source of mobile nodes to sink a mobile node. Here latter technique is imperative providing the former technique with control input. Although the bigger amount of effort have been add in routing ad hoc network, in contrast, data forwarding follow the pretty more same paradigm as in IP(Internet Protocol) forwarding in the Internet (Feng, et. al., 2008).

2

IP forwarding is fundamentally multi-hip-hop wired networks where the packet transmission only reservation the single cable can be gained by nodes was designed for a modern Ethernet case. IP packets are transmitted one end of Ethernet cable and other. when a packet is transmitted on a physical channel however, Wireless network, this channel by all other nodes within the transmission range is checked for the most part of the research to get a packet node history as completely negative thoughts was not intended for overhearing, i.e., intervention (Xie, et. al., 2008). Thus, goal of analysis in wireless networking was to make the wireless link as good as wired ones. Suddenly, this ignores the original nature of broadcasting of wireless intercommunication link. For the mobile ad hoc network to truly succeed beyond lab and test beds, we must manage its broadcasting nature instead than fighting it. Co-operative communication is an effective approach to obtaining the goal. Research on co-operative communication physical layer community began to attract interest, but more recently its importance and utility also felt on top of the network protocol stack layers. It’s a plan that top shelf net network layer wireless networking Devices can be constructed that intermediate nodes in the network data packets. Paths to the destination must follow to determine a list of a lightweight proactive use source routing protocols when the data packets is broadcast by an upstream node and move to the drift along route node has to gained by Here, it your route there and thus will come as soon as the potential on destination node. This is gained through the co-operative data interconnection at link and network layer. On another hand, wireless networking, there are two important architectures: infrastructure (single-hop) network and mobile ad hoc (multi-hop) network (MANETs), Infrastructure network involved the cellular network and wireless local area network. Users are connected via the base station/access point and backbone network. Although user can handover during base station or access point and roam among distinct network, their mobility is bounded within the coverage area of base station or access point. Ad hoc network exclude the use of wired infrastructure. Mobile node can be form of arbitrary network "on the fly" to interchange the information without demand of pre-existing network infrastructure. Ad hoc network can node efficiently without pre-determined topology or centralized control which is the important goal of the ad hoc routing protocol. Every node in network function as both a host and a router and change of network topology are divided between the nodes. Design of capability and reliable routing protocol in such a network is a challenging problem (Uddin, et. al., 2017. Reddy & Satyanarayana, 2016. Kumar, et. al., 2016. Singh, et. al., 2015). To resolve such complexity in this thesis, we proposed naive improved disjoint multipath routing is method that exploits the underlying physical network resource by managing the multiple source destination paths efficiently. It is used for the number of purposes, involving bandwidth aggregation, reducing the end-to-end delay, enhancing the fault-tolerance, enhancing reliability, load balancing and so on as compared to the previous multi-route routing protocols.

Sangdae Kim et.al. (2017), In this author demonstrate (LCMRP) Low Cost Multipath Routing Protocol (LCMRP) by Adapting Opportunistic Routing which can minimized the consistent energy consumption and less affected by network scale. The proposed protocol exploits the opportunistic routing that improves the single-hop reliability in order to improve the reliability in each path. This approach minimized the number of routes, which constructed for ensuring the enough reliability. Mueen Uddin et.al. (2017), In this creator focus on the specific issue of vitality utilization in the MANET by applying Fitness Function Method (FFM) to advances the vitality utilization in portable specially appointed systems on need of Multi Route Distance Vector (AOMDV) directing convention. Proposed convention was named as the Ad Hoc arrange on Demand of Multipath Distance Vector (DMD) with Fitness of the Function (FF-AOMDV). The wellness work was utilizing the pursuit ideal course from the source to goal and limited vitality utilization in multi-way directing distinctive in throughput. A. Pratapa Reddy et.al. (2016), Author proposed the routing techniques known as Efficient and Stable Multi Route Routing MANET network with the Congestion Aware. This approach was extends the work to author of the existing work and where the bandwidth and delay are assumed during the routing. They estimated the residual energy of the stability node wireless network. While estimating the residual energy and also assumed the receiving energy and transferring energy of the link. Then node of the stability LET was estimated, this LET

Rajeev Kumar et.al (2016), designed the novel algorithm called, Exponential Ant Colony Optimization (EACO) to and locates the issue in WSN after searching the cluster heads using Fractional Artificial Bee Colony (FABC) algorithm. In first step, cluster head and find out using FABC algorithm with fitness method considering distance, energy and delay. Ruby Singh et.al (2015), in this author proposed the naive protocol REBM. Comparison REBM Energy aware routing (EAR) protocol represented the authors and it was found the overall performance of the R-E-B-M better than E-A-R protocol. D.A. Tran et al. (2006) maintain that routing should not only be aware, but also adaptive to, the network congestion. Hence, they proposed the routing protocol (CRP) with such properties. They produced ns-2 simulation outcome which confirm that CRP enhance the packet loss rate and end-to-end delay while enjoying the significantly smaller protocol overhead and higher energy efficiency as compared to the AODV and DSR Rui Teng et al. (2006) Assumed organized routing operation during any two nodes in the ad hoc network that linked to wired network by an access point. To build the paths with low routing overhead efficiently, they developed the new routing facilitate of region-based routing (RBR), which managed hop count during the mobile nodes and access point to localize the route discovery within the limited topological area. Limiting region of route locate results in fewer routing messages and therefore minimize the routing overhead. Lei Chen et al. (2007) extensively and exclusively analyzed the problem include with QoS-aware routing and refer an overview and comparison of existing QoS-aware routing protocols. In addition, open problems that must be addressed to fully support QoS-aware routing were discussed. Victor Carrascal Friaset al. (2007) proposed MM-DSR (Multipath Multimedia Dynamic Source Routing) is the multipath routing protocol DSR-based combined with the cross-layer algorithm. This supplied QoS for multiple sources of video over IEEE 802.11b Ad Hoc network. The weaknesses of system with plain DSR and IEEE 802.11b have been analyzed and work has been done in order to enhance throughput and final user quality. S. M. Das et al. (2007) propose and evaluate two the unicast routing protocol tailored for use in the ad hoc network formed by the mobile multi-robot team: Mobile robot distance vector (MRDV) and mobile robot source Kai-Ten Feng et al. (2008) proposed two algorithms velocity-aided routing (VAR) algorithm decides its packet forwarding facility based on relative velocity during the intended forwarding node and destination node. The routing performance can additional be enhanced by proposed predictive mobility and location-aware routing (PMLAR) algorithm, which in-corporate the predictive moving behaviors of the mobile nodes in protocol design. The area for packet forwarding is determined by the predicting future trajectory of destination node. Xie Xiaochuan et al. (2008) proposed Link reliability based on the hybrid routing (LRHR) which was the naive hybrid routing protocol for the tactical MANET. Contrary to traditional single routing strategy, multiple routes are established during the pair of source-destination node. In hybrid routing strategy, the rate of topological vary supplied a natural mechanism for switching dynamically during table-driven and on-demand routing. The network topology can vary quickly and unpredictably mobile ad hoc network. Because wireless link capacities are the usually limited, congestion is potential in the MANETs. Hence, balancing load in MANET is vital since node with high load will deplete their batteries rapidly, thereby enhancing the probability of disconnecting or partitioning the network. Chai Keong Toh et al. (2009) discussed the several load metrics and condense the principles behind various existing load balanced and ad hoc routing protocols. Lastly, a qualitative comparison of several load metrics and load balanced routing protocols is re-presented. H.Zafar et al. (2009) proposed the multipath routing facilitate, referred as shortest multipath source (SMS) routing based on the dynamic source routing (DSR) The mechanism has two naive aspects as compared with the other on-demand multipath routing facilitate it achieves the shorter multiple partial-disjoint route and allow the more quickly recovery from path break. The performance distinguished is investigated using the NS-2 under situations of changing the mobility, offered load and network size. Sunho Lim et al. (2009) proposed the new communication mechanism, called Random Cast, via which is the sender can identify desired level of the overhearing, making a prudent balance during energy and routing performance. In addition, it minimized the redundant rebroadcasts for the broadcast packet and thus, saves more energy.

4

issue. Given an all-to-all multicast session consisting of the group of terminal nodes in a the wireless ad hoc network, where transmission power of every node is either fixed or adjustable, consider that the every terminal node has an message to share with every other, problem is to build the shared multicast tree spanning all terminal nodes such the total energy consumption of the realizing to the all-to-all multicast session by tree is minimized. Multipath routing application Voice over IP and video delivery these applications demand the continuous data transmission in network so it demands quickly failure locate mechanisms. Already some of the proactive rapidly failure recovery mechanisms are available. They are used to enhance the network performance during the failure transients. Yong Oh Lee et al. (2010) proposed method proposed by is to make some changes in routing table entries, extra addresses etc. These changes can be constructing the disjoint paths while retaining the recovery route lengths close-up to important routes. This approach also illustrates the possibility to extend proactive recovery mechanisms to supplied support for nearly disjoint routes. S.Kalwar (2010) claimed that protocol is a group of protocol for communication. Reactive protocols are the types of communication protocol. The important purpose of the reactive protocols is react based only "on the demand." It is just like saying that, "When you need me, tell me." MANETs run risk of attack by malicious nodes. X.Li et al. (2010) incorporated model of trust to MANETs and build the straight forward trust model to gauge the neighbors 'behaviors' forwarding packet like the trust based reactive multipath routing protocol and ad hoc on-demand trusted path distance vector (AOTDV) for minimizing the risk from malicious nodes,. This protocol was able of searching the multiple loop free paths in one path discovery task. These path were evaluated by hop measures and trust values. This two dimensional evaluation provides a flexible and feasible approach to the select shortest route from candidates that reached the needs of data packets for dependability or trust. Various experiments were conducted to compare these rules and results show that AOTDV enhance the packet delivery ratio and also safe from the attacks.

In the MANET Analysis and security is important objective is to present the efficient multi-route and multi-hop routing protocol for MANET. This section presents the design of proposed routing protocol Node Disjoint Multipath 1. Searching all the present disjoint routes from the source to descend through a routing protocol. 2. Consider the hop count all nodes from the destination node. 3. Calculate novel Source Initiated Bulged Transmission Rate by distributing current TR by neighboring node of source and then assign the naive TR to every route. 5. If received packet is I. from higher Hop count node and II. from the path of which the current node is member Then accept and forward the packet. 6. Else drop the packet. 7. Repeat step 5 and 6 till packet reaches the destination. Algorithm 1 represents above phases in path discovery and route selection task of the proposed routing protocol. Algorithm 1: Multipath Node Disjoint Route Selection Input: N: be the set of nodes in the network. Ni: be the neighbor set of node i, where, Ni = {N-S}. S: Source node. J: The group of node from which nodes I is receive the route request packets. D: Destination nodes Thus, R= Ni –J, Set of node which node I is transmitted the path request packet. Step 1: Source node S: (Initiate the task of the node discovery) • Generate RREQ packet with field value group as,

SA=S,

DA= D,

LSD=0, B= 0,

Hops=H and

PATH={S},

Velocity values, Directions and Positions co-ordinate • Send RREQ packets to all the neighbor nodes j with, Bj >= B Step 2: If RREQ packet is receiving from the node D, then node D. • Receive the all path and arriving to Wait Period, W. • Choose the nodes to disjoint route during them. • RREP packet generate for uni-casting to source, the Bandwidth field of RREP packets is updated with cumulative bandwidth the path and the PATH list is appended with D. • D uni-cast nodes all disjoint the path back to source node S. Step 3: The middle node i, on receiving RREQ packet: O If i is present in PATH list then it check, else drop packet and exit. Else, append i, to PATH list and wait for the period W. and receives the all RREQs with ID =I and updates the NIT. O From NIT, choose node j ε J, with highest LSD values. And put the value of Bj to B. In the case LSDjj=LSDk, k ε J, choose one with lesser hop value. O Transmit RREQ to node r ε R, with LSDr >= LSD thr and Br>= B. Also update velocity of direction and position co-ordinate in RREQ with its own value. Step 4: Measures the all disjoint paths from S to D, let’s suppose there is Dp number of multiple routes selected. Step 5: Measures the hop count for every route selection from Dp New_TR = TR/size (Dp) Step 7: Data Transmission • If packets the is received O Hop count node from higher and O from path of the recent node is member Accept packet and forward the packet. Else Drop the packet • Repeat the task until packet reaches destination D Step 8: Stop Algorithm 2: Mobility Aware Algorithm Step 1: When the node is i receive overhear the packet P, IF the node i is final destination address, consumes the packet. GOTO END; Step 2: (Assume P belongs to flow.) Compare to all the valid entries in hop comparison array; Step 3: IF there is no match with entries, store the in hop comparison array; Step 4: IF packet is destined to i is next-hop node, task packet for the forwarding further. Step 5: (Assume that it matched the with an entry ) IF (HCk − HCj > 2), a short-cut is search, node I, does following: Step 5.1: Transfer the message to NAj to update routing table such that next hop address for the destination node DAk is modified to address of the node i; Step 5.2: Modify its routing table by making next hop address for the destination DA k as NA k; Step 5.3: Modify the hop comparison array, delete entry corresponding to ; Step 6: Return the delay efficient path. Step 7: Stop.

6

measured with varying the mobile nodes from 10 to 100. There are four key performance metrics measured which can widely use for QoS performance analysis in MANET routing.

All For MANET, directing methods play the critical position in grouping to gain the Q-o-S arrangements. Conventional MANET is the steering conventions are experiencing all the more directing overhead and lessened the bundle conveyance proportion because of the single way intercommunications in MANET. We examined the quantity of existing only course and multipath procedures by accepting the unmistakable system condition and parameters, for example, portability speed, vitality utilization, stack and so forth. However, there is need proficient multipath directing technique which accomplishes more enhanced Q-o-S execution by considering the changing portability speed of versatile hubs. To address these examination issues, this exploration proposed new calculation for MANET multipath directing convention with the objective of versatility and proficiency. This new approach depends on as of late introduced existing disjoint based multipath directing convention DAOMDV. This new convention is called as MDAOMDV. The recreation is planned with two unique targets, for example, 1) QoS Assessment: we outlined new calculation for accomplishing and improved QoS execution when contrasted with the current AODV, AOMDV and DAOMDV directing conventions. The outcomes are analyzed by expecting three imperative execution measurements of any steering convention as throughput, end to end postpone and parcel conveyance proportion. In all cases, proposed steering conventions indicating expanded the execution when contrasted with existing strategies. 2) Versatility Assessment, in which we planned unique systems to assert the adaptability of

when contrasted with existing multipath steering technique.

A. Pratapa Reddy, Dr. N. Satyanarayana (2016). "Energy Efficient Stable Multi path Routing in MANET", International conference on Signal Processing, Communication, Power and Embedded System (SCOPES)-2016 Carrascal Frias, Victor; Diaz Delgado, G.; Zavala Ayala, Aida; Aguilar Igartua, Monica (2007). “MM-DSR: Multipath QoS routing for multiple multimedia sources over Ad Hoc mobile networks “, IEEE Latin America Transactions, Volume: 5 , Issue: 6, pp. 448–456. Chai Keong Toh ; Anh-Ngoc Le ; You-Ze Cho (2009). “Load balanced routing protocols for ad hoc mobile wireless networks”, IEEE Communications Magazine, Volume: 47, Issue: 8, Page(s): pp. 78–84. Das, S.M.; Hu, Y.C. ; Lee, C.S.G. ; Yung-Hsiang Lu (2007). “Mobility-aware ad hoc routing protocols for networking mobile robot teams,” Journal of Communications and Networks, Volume: 9, Issue: 3, pp. 296–311. Kai-Ten Feng ; Chung-Hsien Hsu ; Tse-En Lu (2008). “Velocity-Assisted Predictive Mobility and Location-Aware Routing Protocols for Mobile Ad Hoc Networks”, IEEE Transactions on Vehicular Technology, Volume: 57, Issue: 1, pp. 448–464. Kalwar, S. (2010). “Introduction to reactive protocol”, IEEE Potentials, Volume: 29 , Issue: 2, pp. 34–35. Lei Chen; Heinzelman, W. B. (2007). “A Survey of Routing Protocols that Support QoS in Mobile Ad Hoc Networks”, IEEE Network, Volume: 21, Issue: 6, Page(s): pp. 30–38. Li X., Z. Jia, P. Zhang, R. Zhang and H. Wang (2010). “Trust-based on-demand multipath routing in mobile ad hoc networks,” IET Information Security, Vol. 4, Issue: 4, pp. 212 – 232. Mueen Uddin, Aqeel Taha, Raed Alsaqour, Tanzila Saba (2017). "Energy Efficient Multipath Routing Protocol for Mobile ad-hoc Network Using the Fitness Function", IEEE Access, 2017 Data Transmission in Wireless Sensor Networks", IET Communications, 2016 Ruby Singh, Shashi Kant Gupta, Pallavi Khatri (2015). "Residual Energy Based Multipath Routing Protocol (REBM) in Wireless Sensor Network", International Conference on Computing, Communication and Automation (ICCCA 2015) Rui Teng (2006). “RBR: a region-based routing protocol for mobile nodes in hybrid ad hoc networks”, IEEE Communications Magazine, Volume: 44 , Issue: 11, pp. 124–132. Sangdae Kim, Hyunchong Cho, Taehun Yang, Cheonyong Kim and Sang-Ha Kim (2017). "Low-Cost Multipath Routing Protocol by Adapting Opportunistic Routing in Wireless Sensor Networks", IEEE Wireless Communications and Networking Conference (WCNC) Sunho Lim ; Chansu Yu ; Das, C.R. (2009). “Random Cast: An Energy-Efficient Communication Scheme for Mobile Ad Hoc Networks”, IEEE Transactions on Mobile Computing, Volume: 8 , Issue: 8, pp. 1039–1051. Tran, D.A.; Harish Raghavendra (2006). “Congestion Adaptive Routing in Mobile Ad Hoc Networks”, IEEE Transactions on Parallel and Distributed Systems, Volume: 17, Issue: 11, pp. 1294 – 1305. Weifa Liang ; Brent, R. ; Yinlong Xu ; Qingshan Wang (2009). “Minimum-energy all-to-all multicasting in wireless ad hoc networks”, IEEE Transactions on Wireless Communications, Volume: 8 , Issue: 11, pp. 5490–5499. Xiaochuan, Xie ; Gang, Wei ; Keping, Wu ; Gang, Wang ; Shilou, Jia (2008). “Link reliability based hybrid routing for tactical mobile ad hoc network”, Journal of Systems Engineering and Electronics, Volume: 19, Issue: 2, pp. 259–267. Yong Oh Lee and A. L. Narasimha Reddy (2010). “Disjoint Multi-Path Routing and Failure Recovery,” IEEE International Conference on Communications (ICC), pp. 1 – 6, 23-27 May 2010 Zafar, H. ; Harle, D. ; Andonovic, I. ; Khawaja, Y. (2009). “Performance evaluation of shortest

8

Research Scholar (Department of Computer Science and Engineering) Kalinga University, Naya Raipur, Chhattisgarh, India E-Mail – abhijeethaval9@gmail.com