2

ABSTRACT

Mobile ad hoc networks (MANETs) consist of a collection of wireless mobile nodes which dynamically exchange data among themselves without the reliance on a fixed base station or a wired backbone network. MANET nodes are typically distinguished by their limited power, processing, and memory resources as well as high degree of mobility. In such networks, the wireless mobile nodes may dynamically enter the network as well as leave the network. Due to the limited transmission range of wireless network nodes, multiple hops are usually needed for a node to exchange information with any other node in the network. Thus routing is a crucial issue to the design of a MANET.In order to achieve better throughput, load balancing and congestion avoidance, multipath routing has been widely studied and used in wireless networks. In this protocol, a Content Based Concurrent Multipath Routing protocol (CCMR) is proposed. This protocol mainly deals with the distribution of the data packets along the paths in the ratio of the stability of paths. The stability of the paths is proportional to the vector cost provided to the path vector by using the fuzzy concept. The results of our simulation showed that when compared to the existing multipath routing protocol, CCMR exhibited higher performance, notably in terms of throughput and delay.

List of FiguresFigure No.CaptionPage No

Figure 1 Mobile ad hoc Network5

Figure 2Example of ad hoc network8

Figure 3Some Mobile Devices10

Figure 4A typical MANET11

Figure 5Classification of routing protocol13

Figure 6Route Discovery in AODV16

Figure 7RREQ packet header in AODV17

Figure 8Multipath Routing18

List of Tables

Table 1Resource Allocated to Path Vector22

Table 2Simulation Parameters28

Table of Contents

Page No.

Candidates Declaration ..

iii

Certificate ....

iv

Approval Sheet .........................

v

Acknowledgement ....vi

List of Figures ...

1

List of Tables .

2

Table of Contents...3

Chapter 1 Introduction5

1.1Introduction..

1.2Background and motivation..

1.3Aims and objectives.

1.4Project Outline.....................

Chapter 2 Overview of Mobile ad hoc Networks8

2.12.22.32.4Introduction to ad hoc networks .Evolution of ad hoc networksDesign factors of ad hoc networks.Applications of ad hoc networks

Chapter 3 Routing Protocols in MANETs13

3.1Routing protocols classification.....3.1.1 Reactive Protocol3.1.2 Proactive Protocol3.1.3 Hybrid Protocol

3.2Related Work

Chapter 4 Multipath Routing in MANETs4.1 Benefit of Multipath Routing4.1 Multipath Routing Component4.3 Split Multipath Routing4.4 AOMDV4.5 AODVM4.6 Comparison of Multipath and UnipathChapter 5 Related Work225.1 Fuzzy Cost based Multipath RoutingChapter 6 Proposed Protocol (CCMR)2518

6.1Proposed Algorithm.

Chapter 7 Energy Consumption Model and Simulation Environment27

7.1Energy Consumption Model,

7.2 Simulation Environment................................................................................... Chapter 8 Simulation and Results 29 Chapter 9 Conclusion31 References 32

CHAPTER 1: INTRODUCTION

1.1 IntroductionMobile ad hoc networks (MANETs)[4] consist of a collection of wireless mobile nodes which dynamically exchange data among themselves without the reliance on a fixed base station or a wired backbone network. MANETs have potential use in a wide variety of disparate situations. Such situations include moving battlefield communications to disposable sensors which are dropped from high altitudes and dispersed on the ground for hazardous materials detection. Civilian applications include simple scenarios such as people at a conference in a hotel where their laptops comprise a temporary MANET to more complicated scenarios such as highly mobile vehicles on the highway which form an ad hoc network in order to provide vehicular traffic management. MANET nodes are typically distinguished by their limited power, processing and memory resources as well as high degree of mobility. In such networks, the wireless mobile nodes may dynamically enter the network as well as leave the network. Due to the limited transmission range of wireless network nodes, multiple hops are usually needed for a node to exchange information with any other node in the network. Thus routing is a crucial issue to the design of a MANET.

Mobile ad-hoc Network (Figure 1)

Routing protocols in conventional wired networks are usually based upon either distance vector or link state routing algorithms. Both of these algorithms require periodic routing advertisements to be broadcast by each router. In distance vector routing [8], each router broadcasts to all of its neighboring routers its view of the distance to all other nodes; the neighboring routers then compute the shortest path to each node. In link-state routing [3], each router broadcasts to its neighboring nodes its view of the status of each of its adjacent links; the neighboring routers then compute the shortest distance to each node based upon the complete topology of the network.These conventional routing algorithms are clearly not efficient for the type of dynamic changes which may occur in an ad-hoc network. In conventional networks, routers do not generally move around and only rarely leave or join the network. In an environment with mobile nodes, the changing topology will not only trigger frequent re-computation of routes but the overall convergence to stable routes may be infeasible due to the high-level of mobility.Clearly, routing in MANETs must take into consideration their important characteristics such as node mobility. Work on single path (or unipath) routing in MANETs has been proposed. Multipath routing allows the establishment of multiple paths between a single source and single destination node. Multipath routing is typically proposed in order to increase the reliability of data transmission (fault tolerance) or to provide load balancing. Load balancing is of special importance in MANETs because of the limited bandwidth between the nodes.In MANET, there may be numerous routing paths[3, 5, 6] between sources to destination. In order to utilize these alternate paths, there have been many multipath routing protocols proposed for mobile ad hoc networks throughout years. In these protocols, one important thing is to select the most feasible path for routing of packets. In multipath routing, the packets can be transferred in parallel manner between the source and destination. This paper mainly deals with the distribution of the data packets along the paths in the ratio of the stability of paths. The ranking of the paths is done by using the fuzzy concept [1]. Using the fuzzy logic also declines the possibility of having same raked paths.1.2 Background and Motivation:In MANET, there may be numerous routing paths between sources to destination. In order to utilize these alternate paths, there have been many multipath routing protocols proposed for mobile ad hoc networks throughout years. In these protocols, one important thing is to select the most feasible path for routing of packets. In multipath routing, the packets can be transferred in parallel manner between the source and destination. In these protocols, the same node is repeatedly utilized and hence subjected to higher resource exhaustion. This increased overload may results into link breakage between the source and the destination node. This results into decrement in the lifetime of the network. Furthermore, in the unipath approaches like DSDV[7], AODV and DSR[8], there is no utilization of alternate paths until the path does not break.To overcome this problem, multi path routing protocols have been proposed. Instead of using shortest K paths multipath routing algorithms are using low delayed, less congested paths which do not have to be shortest between source and destination. The usage of such multiple paths will employ nodes from different regions of the communication area, and hence enable load balancing and better utilization of the network

1.3 Aims and ObjectivesIn the current existing protocol, there are following issues which can be resolved-1. No utilization of other paths2. No dealing with lifetime of network3. Delay4. No concurrency

The following goals were desired to achieve in the proposed algorithm-1. Energy efficient transmission of data which leads to the greater lifetime of network.2. Concurrent transmission of data in order to decreases the End to End delay.3. Satisfying Bandwidth Requirements

1.4 Project Outline:The remainder of this project is organized as follows: Next section will define the related work regarding the MANET and multipath routing. This section also defines the work done in fuzzy logic based multipath routing. In Section 3, the framework that we are going to use to distribute the packets along with the paths will be described. The proposed algorithm can also be found in Section 3. Section 4 will define the implementation details. Section 5 and 6 will conclude our work.

CHAPTER 2: Overview of Mobile Ad-hoc Networks

In MANETs communication between nodes is done through the wireless medium. Because nodes are mobile and may join or leave the network, MANETs have a dynamic topology. Nodes that are in transmission range of each other are called neighbors. Neighbors can send directly to each other. However, when a node needs to send data to another non-neighboring node, the data is routed through a sequence of multiple hops, with intermediate nodes acting as routers. An example of ad hoc network is depicted in the following Figure-

Figure 1An example of ad hoc network with circles representing nodes. Two nodes that are in transmission range of each other are connected by a line.

There are numerous issues to consider when deploying MANETs. The following are some of the main issues.

1. Unpredictability of environment: Ad hoc networks may be deployed in unknown terrains, hazardous conditions, and even hostile environments where tampering or the actual destruction of a node may be imminent. Depending on the environment, node failures may occur frequently.

2. Unreliability of wireless medium: Communication through the wireless medium is unreliable and subject to errors. Also, due to varying environmental conditions such as high levels of electro-magnetic interference (EMI)or inclement weather, the quality of the wireless link may be unpredictable. Furthermore, in some applications, nodes may be resource-constrained and thus would not be able to support transport protocols necessary to ensure reliable communication on a loss link. Thus, link quality may fluctuate in a MANET.

3. 3. Resource-constrained nodes: Nodes in a MANET are typically battery powered as well as limited in storage and processing capabilities. Moreover, they may be situated in areas where it is not possible to re-charge and thus have limited lifetimes. Because of these limitations, they must have algorithms which are energy-efficient as well as operating with limited processing and memory resources. The available bandwidth of the wireless medium may also be limited because nodes may not be able to sacrifice the energy consumed by operating at full link speed.

4. 4. Dynamic topology: The topology in an ad hoc network may change constantly due to the mobility of nodes. As nodes move in and out of range of each other, some links break while new links between nodes are created.

As a result of these issues, MANETs are prone to numerous types of faults including,

1. Transmission errors: The unreliability of the wireless medium and the unpredictability of the environment may lead to transmitted packets being garbled and thus received in error.

2. Node failures: Nodes may fail at any time due to different types of hazardous conditions in the environment. They may also drop out of the network either voluntarily or when their energy supply is depleted.

3. Link failures: Node failures as well as changing environmental conditions(e.g., increased levels of EMI) may cause links between nodes to break.

4. Route breakages: When the network topology changes due to node/link failures and/or node/link additions to the network, routes become out-of date and thus incorrect. Depending upon the network transport protocol, packets forwarded through stale routes may either eventually be dropped or be delayed; packets may take a circuitous route before eventually arriving at the destination node.

5. Congested nodes or links: Due to the topology of the network and the nature of the routing protocol, certain nodes or links may become over utilized, congested. This will lead to either larger delays or packet loss.

2.2 Evolution of ad hoc Network The whole life-cycle of ad-hoc networks could be categorized into the first, second, and the third generation ad-hoc networks systems. Present ad-hoc networks systems are considered the third generation. The first generation goes back to 1972. At that time, they were called PRNET (Packet Radio Networks). The history of ad-hoc networks can be dated back to the DoD1-dynamically and arbitrarily located, and are required to relay packets for other nodes in order to deliver data across the network.2.3 Design factors of ad hoc network-The MANETs are simply known as infrastructure less network. In MANET, there is no predefined infrastructure. The routing and data transmission is done dynamically in the MANETs. In MANET, node is simply a mobile device which can communicate to its adjacent nodes over the wireless.

Figure 3: Some Mobile Devices The ubiquitous computing devices with Wi Fi or Bluetooth, such as Laptops, PDAs, Cameras, MP3-players works as mobile node and takes part in forming a dynamic network ie. MANET. MANETs are generally infrastructure less. A typical MANET can have following design parameters-Radio communication shared medium Every computer or device (node) is a router as well as end host Nodes are in general autonomous Mobility dynamic topology Limited energy and computing resources

FIG 4: A typical MANET

2.4 Application of ad hoc Networks-historyWith the increase of portable devices as well as progress in wireless communication, ad-hoc networking is gaining importance with the increasing number of widespread applications. Ad-hoc networking can be applied anywhere where there is little or no communication infrastructure or the existing infrastructure is expensive or inconvenient to use. Ad hoc networking allows the devices to maintain connections to the network as well as easily adding and removing devices to and from the network. The set of applications for MANET is diverse, ranging from large-scale, mobile, highly dynamic networks, to small, static networks that are constrained by power sources. Besides the legacy applications that move from traditional infra structured environment into the ad hoc context, a great deal of new services can and will be generated for the new environment. Typical applications in -clude Military Battlefield: Military equipment now routinely contains some sort of computer equipment. Ad- hoc networking would allow the military to take advantage of commonplace network technology to maintain an information network between the soldiers, vehicles, and military information headquarters. The basic techniques of ad hoc network came from this field. Commercial Sector: Ad hoc can be used in emergency/rescue operations for disaster relief efforts, e.g. in fire, flood, or earth-quake. Emergency rescue operations must take place where non-existing or damaged communications infrastructure and rapid deployment of a communication network is needed. Information is relayed from one rescue team member to another over a small hand held. Other commercial scenarios include e.g. ship-to-ship ad hoc mobile communication, law enforcement, etc. Local Level: Ad hoc networks can autonomously link an instant and temporary multimedia network using notebook computers or palmtop computers to spread and share information among participants at e.g. conference or classroom. Another appropriate local level application might be in home networks where devices can communicate directly to exchange information. Similarly in other civilian environments like taxicab, sports stadium, boat and small aircraft, mobile ad hoc communications will have many applications. Personal Area Network (PAN): Short-range MANET can simplify the intercommunication between various mobile devices (such as a PDA, a laptop, and a cellular phone). Tedious wired cables are replaced with wireless connections. Such an ad hoc net-work can also extend the access to the Internet or other networks by mechanisms e.g. Wireless LAN (WLAN), GPRS, and UMTS. The PAN is potentially a promising application field of MANET in the future pervasive computing context. MANET- VoVoN: A MANET enabled version of JXTA peer-to-peer, modular, open platform is used to support user location and audio streaming over the JXTA virtual overlay network. Using MANET-JXTA, a client can search asynchronously for a user and a call setup until a path is available to reach the user. The application uses a private signalling protocol based on the exchange of XML messages over MANET-JXTA communication channels.[12]

CHAPTER 3: Routing Protocol in MANETs

Routing: Routing is the act of moving information from a source to a destination in an inter network. During this process, at least one intermediate node within the internetwork is encountered.It involves two activities:1st, determining optimal routing paths.2nd, transferring the information groups(called packets) through an inter network.Routing protocols in Mobile ad hoc Networks: MANET has significant different characteristics than other wired or wireless networks. Existing networking protocols can not work in this new environment without considerable modification. In three different ways these protocols can be categorized.1.Table-driven protocols (Proactive protocols).2.On-demand routing protocols (Reactive protocols).3. Hybrid routing protocols (mixed protocol).

FIG 5: Classification of Routing Protocol

Routing protocols for MANETs must deal with these issues to be effective. In the remainder of this section, we present an overview of some of the key uni-path routing protocols for MANETs.

3.1 Table driven protocols (Proactive protocols) : These protocols maintain consistent overview of the network. Each node uses routing tables to store the location information of other nodes in the network. This information is used to transfer data among various nodes of the network.These protocols require each node to maintain one or more tables to store routing information, and they respond to changes in network topology by propagating updates throughout the network in order to maintain a consistent network view.Table-driven protocols might not be considered an effective routing solution for mobile ad-hoc network. Nodes in mobile ad-hoc networks operate with low battery power and with limited bandwidth. Presence of high mobility, large routing tables and low scalability result in consumption of bandwidth and battery life of the nodes. Moreover continuous updates could create unnecessary network overhead. Table driven protocols can be further divided (as shown in fig)

3.1.1 Destination sequenced distance vector (DSDV) routing protocol.3.1.2 Wireless Routing Protocol (WRP) routing protocol.3.1.3 Cluster head Gateway Switch Routing (CGSR) routing protocol

3.1.1 Destination Sequenced Distance Vector (DSDV) Routing ProtocolIn DSDV every node in the network maintains a routing table in which all of the possible destinations within the network and the number of hops to each destination are recorded. It is a proactive routing protocol based upon the distributed Bellman Ford algorithm. Each entry is marked with a sequence number assigned by the destination node. The sequence numbers enable the mobile nodes to distinguish stale routes from new ones, thereby avoiding the formation of routing loops. Routing table updates are periodically transmitted throughout the network in order to maintain table consistency [15]. The tables can be updated in two ways either incrementally or through a full dump. An incremental update is done when the node doesnt observe any major changes in the network topology. A full dump is done when network topology changes significantly or when an incremental update requires more than one NPDU (Network Packet Data Unit) [16]. New route broadcasts contain the address of the destination, the number of hops to reach the destination, the sequence number of the information received regarding the destination, as well as a new sequence number unique to the broadcast [17]. The route labeled with the most recent sequence number is always used. In the event that two updates have the same sequence number, the route with the smaller metric is used in order to optimize (shorten) the path. Mobiles also keep track of the settling time of routes, or the weighted average time that routes to a destination will fluctuate before the route with the best metric is received [18].By delaying the broadcast of a routing update by the length of the settling time, mobiles can reduce network traffic and optimize routes by eliminating those broadcasts that would occur if a better route was discovered in the very near future.

Advantages of DSDV DSDV protocol guarantees loop free paths. Count to innity problem is reduced in DSDV. We can avoid extra trac with incremental updates instead of full dump updates. Path Selection: DSDV maintains only the best path instead of maintaining multiple paths to every destination. With this, the amount of space in routing table is reduced [19].

Limitations of DSDV

Wastage of bandwidth due to unnecessary advertising of routing information even if there is no change in the network topology [20]. DSDV doesnt support Multi path Routing. It is dicult to determine a time delay for the advertisement of routes [21]. It is dicult to maintain the routing tables advertisement for larger network. Each and every host in the network should maintain a routing table for advertising. But for larger network this would lead to overhead, which consumes more bandwidth.

3.2 On-demand routing protocols (Reactive protocol) In contrast to table driven routing protocols, On demand protocols create routes only when desired by source nodes .With on-demand protocols, if a source node requires a route to the destination for which it does not have route information, it initiates a route discovery process which goes from one node to the other until it reaches to the destination or an intermediate node has a route to the destination.It is the responsibility of the route request receiver node to reply back to the source node about the possible route to the destination. The source node uses this route for data transmission to the destination node. This process is completed once a route is found or all possible route permutations are examined. Once a route is discovered and established, it is maintained by route maintenance procedure until either destination becomes inaccessible along every path from source or route is no longer desired.

On demand protocol can be further divided (as shown in figure):

3.2.1 Ad-hoc On-demand Distance Vector routing (AODV)3.2.2 Dynamic Source Routing (DSR)3.2.3 Temporary Ordered Routing Algorithm (TORA).

3.2.1 Ad hoc on-demand Distance Vector (AODV) Routing ProtocolIt is an improved version of DSDV algorithm previously described; it inherits the good features of DSDV. It minimizes the number of required broadcasts by creating routes on a demand basis, while DSDV algorithm maintains a complete list of routes. The authors of AODV classify it as a pure on-demand route acquisition system, since nodes that are not on a selected path do not maintain routing acquisition or participate in routing table exchanges.The AODV routing protocol uses a reactive approach to finding routes and a proactive approach for identifying the most recent path. More specifically, it finds routes using the route discovery process and uses destination sequence numbers to compute fresh routes. The two phases are discussed in more detail.

Rout Discovery- Now let us see how a rout is discovered with the help of AODV protocol. Consider the ad hoc network given below in which a process at node A wants to send a packet to node I.

FIG 6: Rout Discovery in AODV

(a)Range of A's broadcast.(b)After B and D have received A's broadcast.(c)After C, F, and G have received A's broadcast.(d)After E, H, and I have received A's broadcast.

Shaded nodes are new recipients. Arrows show possible reverse routes.

To locate I, A constructs a special ROUT REQUEST packet and broadcasts it. The format of the ROUT REQUEST is shown below.FIg 7: RREQ Packet Header in AODV

When a route request arrive (B and D):

Source address and request ID pair is looked up in a table to check duplicity. If duplicate, then discarded otherwise it is entered into table for future operation. If route is known then ROUTE REPLY, means that the receiver looks up the destination in its route table if a fresh route to the destination is known, a ROUT REPLY packet is sent back to the source. else next step As the receiver does not know a fresh route to the destination, it increments hop count and rebroadcast the ROUTE REQUEST packet. It also extracts data from the packet and stores it as a new entry in its reverse rout table. This information is used to construct the reverse rout table so that the reply can get back to the source later.Now we will discuss the format of ROUTE REPLY packet.

FIg 7: RREQ Packet Header in AODV

Node I will now response back to node A.

The source address, destination address and Hop count are copied from incoming request, but destination sequence number is taken from its counter in memory. The Hop count field count is set to 0. The Life time field controls how long the route is valid. This ROUTE REPLY packet is sent back and Hop count is incremented at each node so the node can see how far from the destination it is. It follows the reverse path to node G to node D and finally at node A [18].

3.3 Hybrid Routing Protocols (Proactive + Reactive):

Hybrid routing protocols inherit the characteristics of both on-demand and table-driven routing protocols. Such protocols are designed to minimize the control overhead of both proactive and reactive routing protocols. Consequentially, the delay and overhead of route discovery is avoided since locally (for example, within a zone) the routes are available at all the times. It avoids periodic updates for nodes which are at a far distance by using a reactive approach thereby reducing the control overhead in large networks.

CHAPTER 4: Multipath Routing in MANETs

Standard routing protocols in ad hoc wireless networks, such as AODV and DSR, are mainly intended to discover a single route between a source and destination node. Multipath routing consists of finding multiple routes between a source and destination node. These multiple paths between source and destination node pairs can be used to compensate for the dynamic and unpredictable nature of ad hoc networks.

4.1 Benefits of Multipath RoutingAs mentioned before, multiple paths can provide load balancing, fault-tolerance, and higher aggregate bandwidth. Load balancing can be achieved by spreading the traffic along multiple routes. This can alleviate congestion and bottlenecks.From a fault tolerance perspective, multipath routing can provide route resilience. To demonstrate this, where node S has established three paths to node D. If node S sends the same packet along all three paths, as long as at least one of the paths does not fail, node D will receive the packet. While routing redundant packets is not the only way to utilize multiple paths, it demonstrates how multipath routing can provide fault tolerance in the presence of route failures.Since bandwidth may be limited in a wireless network, routing along a single path may not provide enough bandwidth for a connection. However, if multiple paths are used

YY

S X D S X

Z ZD

Fig. 8. Source node S routes the same packet to destination node D along the routes SXD, SYD, and SZD. When node D moves, routes SXD and SYD break, but route SZD is still able to deliver the packet to node D.

simultaneously to route data, the aggregate bandwidth of the paths may satisfy the bandwidth requirement of the application. Also, since there is more bandwidth available, a smaller end-to-end delay may be achieved .Due to issues at the link layer, using multiple paths in ad hoc networks to achieve higher bandwidth may not be as straightforward as in wired networks.Because nodes in the network communicate through the wireless medium, radio interference must be taken into account. Transmissions from a node along one path may interfere with transmissions from a node along another path, thereby limiting the achievable throughput. Howev11er, results show that using multi path routing in ad hoc networks of high density results in better throughput than using unipath routing [6].

4.2 Multipath Routing Components

Multipath routing consists of three components: route discovery, route maintenance ,and traffic allocation. We discuss these components in the following subsections.

4.2.1 Route Discovery and Maintenance. Route discovery and route maintenance consists of finding multiple routes between a source and destination node. Multipath routing protocols can attempt to find node disjoint, link disjoint, or non-disjoint routes. Node disjoint routes, also known as totally disjoint routes, have no nodes or links in common. Link disjoint routes have no links in common ,but may have nodes in common. Non-disjoint routes can have nodes and links in common. Disjoint routes offer certain advantages over non-disjoint routes. For instance ,non-disjoint routes may have lower aggregate resources than disjoint routes ,because non-disjoint routes share links or nodes. In principle, node disjoint routes offer the most aggregate resources, because neither links nor nodes are shared between the paths. Disjoint routes also provide higher fault-tolerance. When using non-disjoint routes, a single link or node failure can cause multiple routes to fail. In node or link disjoint routes, a link failure will only cause a single route to fail. However, with link disjoint routes, a node failure can cause multiple routes that share that node to fail. Thus, node disjoint routes offer the highest degree of fault-tolerance.The main advantage of non-disjoint routes is that they can be more easily discovered. Because there are no restrictions that require the routes to be node or link disjoint, more non-disjoint routes exist in a given network than node or link disjoint routes. Because node-disjointedness is a stricter requirement than link disjointedness, node-disjoint routes are the least abundant and are the hardest to find. It has been shown that in moderately dense networks, there may only exist a small number of node disjoint routes between any two arbitrary nodes, especially as the distance between the nodes increases. This is because there may be sparse areas between the two nodes that act as bottlenecks. Given the trade-offs between using node disjoint versus non-disjoint routes, link disjoint routes offer a good compromise between the two. In the following subsection, was view some of the proposed multipath protocols for finding node disjoint, link disjoint, and non-disjoint paths.Intelligent path selection can be used to enhance the performance of multipath routing. For instance, a certain subset of paths may be selected for use based on a variety of criteria such as characteristics of the paths and interactions with the link layer. From a fault tolerance perspective, more reliable paths should be selected to reduce the chance of routes failures. Path selection also plays an important role for QoS routing. In QoS routing, only a subset of paths that together satisfies the QoS requirement is selected.After a source begins sending data along multiple routes, some or all of the routes may break due to node mobility and/or link and node failures. As in unipath routing, route maintenance must be performed in the presence of route failures. As discussed previously for unipath routing, route discovery can be triggered upon failure of the route. In the case of multipath routing, route discovery can be triggered each time one of the routes fails or only after all the routes fail. Waiting for all the routes to fail before performing a route discovery would result in a delay before new routes are available. This may degrade the QoS of the application. However, initiating route discovery every time one of the routes fails may incur high overheads. Performing route discovery when N routes fail, where N is less than the number of paths available, may be a compromise between the two options.

4.3 Split Multipath Routing. Split Multipath Routing (SMR) proposed in [14] is an on-demand multipath source routing protocol. SMR is similar to DSR, and is used to construct maximally disjoint paths. Unlike DSR, intermediate nodes do not keep a route cache, and therefore, do not reply to RREQs. This is to allow the destination to receive all the routes so that it can select the maximally disjoint paths. Maximally disjoint paths have as few links or nodes in common as possible. Duplicate RREQs are not necessarily discarded. Instead, intermediate nodes forward RREQs that are received through a different incoming link, and whose hop count is not larger than the previously received RREQs. The proposed route selection algorithm only selects two routes. However, the algorithm can be extended to select more than two routes. In the algorithm, the destination sends an RREP for the first RREQ it receives, which represents the shortest delay path. The destination then waits to receive more RREQs. From the received RREQs, the path that is maximally disjoint from the shortest delay path is selected. If more than one maximally disjoint path exists, the shortest hop path is selected. If more than one shortest hop path exists, the path whose RREQ was received first is selected. The destination then sends an RREP for the selected RREQ.

4.4 AOMDV (AD HOC ON DEMAND MULTIPATH DISTANCE VECTOR ROUTING)- AOMDV [11] is an extension to the AODV protocol for computing multiple loop-free and link-disjoint paths. To keep track of multiple routes, the routing entries for each destination contain a list of the next-hops along with the corresponding hop counts. All the next hops have the same sequence number. For each destination, a node maintains the advertised hop count, which is defined as the maximum hop count for all the paths. This is the hop count used for sending route advertisements of the destination. Each duplicate route advertisement received by a node defines an alternate path to the destination. To ensure loop freedom, a node only accepts an alternate path to the destination if it has a lower hop count than the advertised hop count for that destination. Because the maximum hop count is used, the advertised hop count therefore does not change for the same sequence number. When a route advertisement is received for a destination with a greater sequence number, the next-hop list and advertised hop count are reinitialized.AOMDV can be used to find node-disjoint or link-disjoint routes. To find node-disjoint routes, each node does not immediately reject duplicate RREQs. Each RREQ arriving via a different neighbor of the source defines a node-disjoint path. This is because nodes cannot broadcast duplicate RREQs, so any two RREQs arriving at an intermediate node via a different neighbor of the source could not have traversed the same node. In an attempt to get multiple link disjoint routes, the destination replies to duplicate RREQs regardless of their first hop. To ensure link-disjointness in the first hop of the RREP, the destination only replies to RREQs arriving via unique neighbors. After the first hop, the RREPs follow the reverse paths, which are node-disjoint and thus link-disjoint. The trajectories of each RREP may intersect at an intermediate node, but each takes a different reverse path to the source to ensure link-disjointness.

4.5 AODVM (AD HOC ON DEMAND DISTANCE VECTOR MULTIPATH ROUTING) AODVM [10] is an extension to AODV for finding multiple node disjoint paths. Intermediate nodes are not allowed to send a route reply directly to the source. Also, duplicate RREQ packets are not discarded by intermediate nodes. Instead, all received RREQ packets are recorded in an RREQ table at the intermediate nodes. The destination sends an RREP for all the received RREQ packets. An intermediate node forwards a received RREP packet to the neighboring the RREQ table that is along the shortest path to the source. To ensure that nodes do not participate in more than one route, whenever a node overhears one of its neighbors broadcasting an RREP packet, it deletes that neighbor from its RREQ table. Because a node cannot participate in more than one route, the discovered routes must be node-disjoint.

4.6 Comparison of Unipath and Multipath Routing- The main advantage of DSR over AODV is its simplicity. In DSR, while nodes do maintain route caches, they do not need to maintain routing tables with forwarding information, as in AODV. However, with DSR, more overhead is incurred in routing data packets, since the entire route must be specified in the packet header. The multipath extensions to DSR and AODV inherit these advantages and disadvantages from their parent protocols. Therefore, the main advantage of SMR, and any multipath extension to DSR, is simplicity.Both AODV and DSR allow for intermediate nodes to respond to RREQs, which can reduce the time for route discoveries. However, both SMR and AODVM do not allow intermediate nodes to reply to route discoveries, in order to ensure that the destination can select disjoint paths. The primary advantage of AOMDV is that it allows intermediate nodes to reply to RREQs, while still selecting disjoint paths. All three multipath protocols do not reject duplicate RREQs at intermediate nodes. This allows for the discovery of more paths. However, it also results in more messages overhead during route discovery due to increased flooding. Additionally, in the multipath protocols the destination replies to multiple RREQs, which results in more overhead. However, in SMR and AOMDV, the destination only replies to a subset of the received RREQs.The primary disadvantages of multipath routing protocols compared to unipath protocols are complexity and overhead. In the case of multipath extensions to AODV, maintaining multiple routes to a destination results in larger routing tables at intermediate nodes.

CHAPTER 5: Related Work5.1: FUZZY COST BASED MULTIPATH ROUTING FOR MOBILE AD-HOC NETWORKS:-In [1], the various paths between the source and the destination are ranked by using fuzzy logic. This approach gives an idea of survival factor of the paths. One more advantage of using fuzzy logic is the uniqueness of the ranks[10] of different paths. In [1], protocol the traffic is distributed amongst the best selected paths from the existing multipath routing the selection is based on consideration of five resource constraints bandwidth, computing efficiency, power consumption, traffic load, and the number of hops.

The Resources allocated to five paths and their vector costs[1]VectorVector Resources

BandwidthComputation EfficiencyPower ConsumptionTraffic LoadNo. of Inter nodesTotal Vector Cost

16040050143.018

240350400.2532.518

330200550.512.547

420450700.7522.8

57010060051.528

In [1], the cost of each path is evaluated by using the fuzzy logic. Later, the paths are ranked by using the cost as their survival factor. The data packets are forwarded along the paths in the ratio of their cost.A) Concept of Ranks- Ranking refers to the process of ordering a sample with respective to a system of performance metric. To minimize the complexity in the process, the observation with the least value of the objective function receives the highest rank while the observation with the maximum values receives the lower rank ( i.e. rank 1).Rank process will be failed in the situation of same objective function values(of resources). Hence, this protocol uses fuzzy cost.

B) Fuzzy concept in MANETs-The membership functions were introduced by Zadeh in the first paper on fuzzy sets (1965). A fuzzy set is a generalization of the indicator function in classical sets. Fuzzy logic represents the degree of truth as an extension of valuation. Degrees of truth are often confused with probabilities through they are conceptually distinct. Fuzzy truth represents membership in vaguely defined sets, not even the likelihood of some event or condition. For any set X, a membership function on X is any function from X to the real unit interval [0, 1]. Membership functions on X represent fuzzy subset of X. The membership function set is usually denoted by A. For an element x of X, The value A(x) is called the member ship degree of x in the fuzzy set. A(x)quantifies the grade of membership of the element x to the fuzzy set. A(x) =0 means that x is not a member of fuzzy set. The value of A(x)=1 means that x is fully member of fuzzy set .The value of A (x) between 0 and 1charctrize fuzzy members , which belong to set partially.

C) Fuzzyfication-It is a process of converting characteristics of network (node or link) in to fuzzy measure. Fuzzy cost will be evaluated by applying fuzzy measure function to the resources. It maps the resource values in to 0 to 1 interval based on favorable or not favorable resource for routing. Mi is resource vector corresponding cost vector is Ci will be calculated by applying fuzzy measure . The above process also calling as fuzzyfication in the literature of fuzzy.

D) Fuzzy cost EvaluationLet Mi is resource vector (1i ,2i ,3i ,.ki) here we consider k number of resources some of them are favorable for routing and some are not favorable for routing for example available band width is favorable for routing and traffic is not favorable for routing. Several metrics have been chosen to meet these objectives and to produce a single cost metric (C) for selecting routes. The various routing metrics used are: bandwidth, computing efficiency, power consumption, traffic load, and the number of hops

C= f (BD, N, TL, PC)

E) Fuzzy ControllerIn the protocol fuzzy controller will take the five inputs base on the following equations controller will give the fuzzy cost. The equations which are used to find cost were satisfying linearity property.The core part of the algorithm design is fuzzy controller. It is designed based onlinear equations. The linear equations are classified in to two categories one is favorable and another is non favorable equation. The equations are used based on the input values.Let pi is favorable then

Cpi = (vi(Mi(p) ) )= vi(Mi(p)) / max {vi(Mi(p)) } ni=1-----( 1 )

and qi is not favorable then

Cpi = (vi(Mi(p)) = 1 - vi(Mi(p)) / max {vi(Mi(p)) } ni=1---(2 )

F) Fuzzy cost based Multi path Routing Algorithm

Input: A set of resource vectors {M1, M2,M3,.,Mn} indicating set of path vectors{V1,V2, V3, ,Vn}Output: The reorder set of resource vectors with {Mc1, Mc2, Mc3, ..,Mcmax } with theassigned fitness value of each Mi based which indicates { Vc1,Vc2,Vc3,. ,Vcmax}Method:for each i from 1 to nfor each p from 1 to maximum resources (k)if p is favorable{Cip = Vi(Mi(p)) / max { vi(p)} ni=1}else{Cip = 1 - Vi(Mi(p)) / max { vi(p)} ni=1}for each i from 1 to n{for each p from 1 to kcost = Cip + costcost[i] =cost ;}The above algorithm evaluates and assigns fuzzy cost to each vector. The threshold value of fuzzy cost will be predefined the paths with fuzzy cost more than threshold will be consider for sending data form source to destination.

CHAPTER 6: PROPOSED PROTOCOL: CCRM

In order to achieve better throughput, load balancing and congestion avoidance multipath routing has been widely studied and used in wired networks. In this paper, a Content Based Concurrent Multipath Routing protocol is proposed. This paper mainly deals with the distribution of the data packets along the paths in the ratio of the stability of paths. The stability of the paths is proportional to the vector cost provided to the path vector by using the fuzzy concept [1]. The results of our simulation showed that when compared to the existing fuzzy logic based multipath routing protocol, CCMR exhibited higher performance, notably in terms of throughput and delay.In the unipath approaches like DSDV, AODV and DSR, there is no utilization of alternate paths until the path does not break. To overcome this problem, multi path routing protocols have been proposed. Instead of using shortest K paths multipath routing algorithms are using low delayed, less congested paths which do not have to be shortest between source and destination. The usage of such multiple paths will employ nodes from different regions of the communication area, and hence enable load balancing and better utilization of the network.In [1], the various paths between the source and the destination are ranked by using fuzzy logic. This approach gives an idea of survival factor of the paths. One more advantage of using fuzzy logic is the uniqueness of the ranks of different paths. In protocol [1], the traffic is distributed amongst the best selected paths from the existing multipath routing the selection is based on consideration of five resource constraints bandwidth, computing efficiency, power consumption, traffic load, and the number of hops.In the proposed protocol, the data packets to be transferred from source node to destination node are distributed among the various paths in the ratio of the survival factor of respected paths. The survival factor is helpful in deciding the lifetime of the paths.Survival Factor:Survival factor gives an idea of lifetime of the network. The cost of the vector evaluated in [1] can be understand as the survival factor of the path. Higher the survival factor, higher will be the lifetime and the transmission rate of the path. On the basis of this survival factor, the ranking of the path is done. Packet Distribution:Let, there be a set of path vector from the source Vs to Vd defined as- = {V1, V2, V3, V4}This set is ranked by using the fuzzy logic []. The ordered pair of and the cost C is defined as- (Vi,Ci) = {(V1, C1), (V2, C2), (V3, C3),.}The evaluation of the distribution factor, can be done by using the following formula-i = Ci/f(Ci)Where, f (C1, C2, C3) = CiThe number of packets to be transferred from the path vector Vi can be calculated by following formula- Ni = Z* iWhere, Z is number of total packets to be transmitted.6.1 Proposed Algorithm

Algorithm: The below method is encorporated to evaluate the number of the packets to be transferred from each path-

Input: A set of path vectors = {V1, V2, V3, V4} and their cost values (Vi,Ci) = {(V1, C1), (V2, C2), (V3, C3),.}Output: Number of packets Ni to be transferred from each path in the setfor each i from 1 to n{total_cost = total_cost + cost_value[i];distribution_factor[i] = cost_value/total_cost;No_of_packets[i] = size * distribution_factor[i];}

Packet routing and path maintenance: In this approach, the ranking is done before sending the packets. Since the numbers of packets to be transferred from each path vector are proportional to the survival factor of the path vector, there is no possibility of higher resource exhaustion. If however there is any path break, the remaining number of packets can be transferred from the other paths, thus reducing the RREQ packets. After each successful transmission of the content, the ranking is done and new paths are established.

CHAPTER 7: ENERGY CONSUMPTION MODEL AND SIMULATION ENVIRONMENT

7.1 Energy Consumption Model: The bandwidth and computer efficiency are computed using the definitions from previous studies [13]. The bandwidth calculation function is defined as:BDF(I) = BD T(I) ( BD(I)U + BD(x) M )According to our band width calculation function, a mobile device can keep at least BDF amount of bandwidth. Only the remaining free bandwidth can be used to serve another routing path with a required band width BM, making the node join the other path as an intermediate node. In other words, the bandwidth, BF, is reserved for the mobile device and the bandwidth embedded in a device will not be all occupied during the discovery of routing path. The computing efficiency function is computed as follows-EI = 1/ n x=1n Tl (x) = 1/n x=1n SM (x)/ ClAssuming that the distance between the transmitter node and the receiver node is d, the strength of the signal received can be determined using the following equation.Pr(d) = (PtGtGr2 ) (4)2 d2 LWhere Pr(d) is the received power ,Pt is the transmitting power, and Gt transmitter antenna gain ,Gr is receiver antenna gain.

7.2 Simulation Environment-In the proposed protocol, a content based concurrent multipath routing protocol is proposed. To simulate the protocol, a java based environment is used on windows platform. Java is a cross platform programming language. The logic of the protocol is implemented completely in java language. The input is taken from the file and output is stored in the file too. Our simulation environment consist 5 vector paths and their respected resource values. The following table shows the parameter used in the implementation of the simulation environment-

TABLE 2: SIMULATION PARAMETER

Parameters

Values

Simulator

Java Language

Simulation Area

500*500

Mobility Model

Random Way Point

Traffic Pattern

Constant Bit Rate(CBR)

Simulation Time

500ms

Number of Node

20

In the proposed algorithm, a content based routing protocol is proposed. We implemented the protocol in JAVA programming language. We compared our protocol with the existing fuzzy cost based multipath routing protocol [].

CHAPTER 8: SIMULATION AND RESULTS

In the proposed algorithm, a content based routing protocol is proposed. We implemented the protocol in JAVA programming language. We compared our protocol with the existing fuzzy cost based multipath routing protocol [1]. In proposed protocol, the delay of the network is significantly lower than the existing fuzzy cost based multipath routing protocol. This is due to the concurrent multipath routing of the packets. In CCMR, the total delay depends on the delay in the path with the maximum hop counts or the path with the higher number of the packets to be transferred, whichever is higher. When comparing the output of the proposed protocol with the existing fuzzy cost based protocol, there is significant decrease in the delay of the content to be transmitted.

GRAPH 1: Delay VS Size

When comparing the CCMR with the existing fuzzy logic based multipath routing protocol, the proposed algorithm out spade the existing one. Hypothetically, a routing path with more resources should naturally support a higher throughput. Hence, more number of packets is transmitted using the path with higher ranking. Since the packets to be transmitted are distributed along the paths in the ratio of their survival factor, there is no possibility of higher resource exhaustion.

GRAPH 2: Throughput VS Size

In the proposed protocol, as the number of nodes is increasing, the throughput of the network is significantly increasing. As shown in the graph, at point 4, the throughput of the both protocol is somewhat same. This is due to the number of established route is only one.GRAPH3: Throughput VS Number of Nodes

CHAPTER 9: CONCLUSION

In this study, a content based concurrent multi-path routing protocol was proposed. Compare to prior approaches, the algorithm uses the distribution of the packets along the path vectors in the ratio of their stability. The optimal concurrent routing of the packets is more helpful and meaningful when there is a problem of redundancy of traffic load.Also, the fuzziness insures the uniqueness of the paths. It is our hope that the proposed algorithm help shed lights on how a more effectively and efficiently multi-path routing algorithm can be utilized to meet the challenging needs in a mobile ad hoc network.

REFERENCES

[1]A Naga Raju, Dr S Rmachandram FUZZY COST BASED MULTIPATH ROUTING FOR MOBILE AD-HOC NETWORKS[2]Stephen Mueller, Rose P. Tsang, and DipakGhosal Multi path Routing Ad Hoc Networks: Issues and challenges .This research was founded in part by a grant from Sandia National Laboratories, CA,USA[3]Charles Perkins E ,PravinBhagwat Highly Dynamic Destination-Sequenced Distance- Vector Routing (DSDV) for Mobile[4]Computers. In the proceedings of the Conference on Communication architecture, protocols and applications page 234-244 ACM Press 1994.[5]Royer E M and Toh C K Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks, IEEE personal Communications.pp 46-55, April 1999.[6]ilkerBasaran, Mart Molle Multipath Routing Protocols in Mobile Ad Hoc Networks: A Comparative Survey Department of Computer Science and Engineering University of California, Riverside[7][DSR] D. Johnson, D. Maltz, Y Hu and J Jetcheva. The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks. IETF MANET Internet Draft, Feb 2002.[8][AODV] Elizabeth M. Royer and Charles E. Perkins. Ad-hoc On-Demand Distance Vector Routing. In 2nd IEEE Workshop on Mobile Computing Systems and Applications, Feb 1999.[9][AODV-BR] S.-J. Lee and M. Gerla, .AODV-BR: Backup Routing in Ad hoc Networks, In Proceedings of IEEE WCNC 2000, Chicago, IL, Sep. 2000.[10][AODVM] Ye, Z., Krishnamurthy S.V., and Tripathi, S.K., A Framework for Reliable Routing in Mobile Ad hoc Networks, IEEE INFOCOM 2003.[11][AOMDV] M. K. Marina and S. R. Das. On-demand multipath distance vector routing in ad hoc networks. Proceedings IEEE ICNP, pages 1423, 2001[12] MANET : History,Challenges And Applications Ankur O. Bang, Prabhakar L. Ramteke Volume 2, Issue 9, September 2013[13] S.J. Lee and M.Gerla, Split Multi-Path Routing with Maximally Disjoint Paths in Ad-hoc networks, Proc, conf, Communications ICC 2001, PP 3201-3205, 2001. [14] link.springer.com/content/pdf/10.1007%2F978-3-642-24043-0_15.pdf[15] A Review of Current Routing Attacks in Mobile Ad Hoc Networks by Rashid Hafeez Khokhar[16] Guoyou He. Destination-sequenced distance vector (DSDV) protocol. Technical[17] computer networks fourth edition by Andrew S. Tanenbaum[18] C. E. Perkins and P. Bhagwat, "Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers