Computation of Multiple Node Disjoint Paths
|
|
- Lewis Pierce
- 5 years ago
- Views:
Transcription
1 Chapter 5 Computation of Multiple Node Disjoint Paths 5.1 Introduction In recent years, on demand routing protocols have attained more attention in mobile Ad Hoc networks as compared to other routing schemes due to their ability and efficiency. There exist many on demand routing protocols for Mobile Ad Hoc Networks. Most of the protocols, however, use a single route and do not utilize multiple alternative paths. Multipath routing allows the establishment of multiple paths between a single source and single destination node and when a path breaks an alternate path is used instead of initiating a new route discovery. Hence multipath routing represents a promising routing method for wireless mobile Ad Hoc networks. There exist some multipath Ad Hoc on-demand routing protocols such as AOMDV [120]. Compared to AODV, the AOMDV protocol performs better in terms of QoS metrics such as end-to-end Delay and Packet delivery ratio [121]. The route discovery of the original single path AODV protocol can be altered by using the path accumulation feature [122] of DSR to compute more than one path during route discovery. Among the multiple paths obtained at the destination, only node disjoint paths can be selected using the path matrix method [123]. The modified multipath AODV is compared with the original AODV. Multipath routing improves the QoS metrics like reliability, route Some part of this chapter published in the International Journal of Applied Information Systems, Vol.3, No.5, 2012, ISSN:
2 discovery frequency and end-to-end delay. The goal of the research work is to improve the performance of the existing Multipath Ad Hoc On-demand Routing Protocol by providing modifications to Route discovery mechanism so that the algorithm is multi-objective on demand QoS routing algorithm for Mobile Ad Hoc Network which will be highly adaptive, energy efficient, scalable, reliable and mainly reduces end-to-end delay in high mobility cases Unipath Routing in MANETs The unipath routing protocols [124] discover a single route between a pair of source and destination. A new route discovery is required in response to every broken route which leads to high overhead and latency. The most commonly used unipath routing protocols are Ad Hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Destination Sequenced Distance Vector (DSDV) [125]. Among these AODV and DSR are on-demand protocols whereas DSDV is a table driven routing protocol. In on-demand protocols [126][127], nodes compute routes only when they are needed. Therefore, on-demand protocols are more scalable to large dynamic networks. When a node needs a route to another node, it initiates a route discovery process to find a route. On demand protocols consist of two main phases: (i) Route discovery It is the process of finding a route between two nodes. If a source has no entry for a destination in its routing cache, it starts a route discovery process. The sample route discovery process using unipath routing protocol in MANET is shown in Figure 5.1. In order to send data from node S to node D, source node S first identifies the route to destination node D through the intermediate node B. Once the route is identified, then node S sends data along the path. 68
3 A A A S D S D S D B B B C C C Figure 5.1: An example of Route discovery process in MANET (ii) Route maintenance It is the process of repairing a broken route or finding a new route in the presence of a route failure. If a node tries to forward a message, but detects that there is a link break, i.e., the next node is no more reachable, it starts a route maintenance process. Figure 5.2 shows the sample route maintenance process in MANET. The node S sends data to node D along the established route through the node B. When the node D moves out of range of node B, then the route breaks. So a new path is identified from node S to node D through the intermediate node C. Now the data is transmitted from node S to D along the new path through node C. A A A S D S S B B B C C D C D Figure 5.2: An example of Route maintenance process in MANET 69
4 5.1.2 Multipath Routing in MANETs Multipath routing consists of finding multiple routes between a source and a 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. Multipath routing consists of three components: route discovery, traffic allocation and route maintenance. These three components are discussed below: (i) Route Discovery- Route discovery and route maintenance consist of finding multiple routes between a source and a 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. The Figure 5.3 shows two types of disjoint QoS paths from source node S to the destination node D. A A S D S D B C B C Path1 Path1 Path3 a) Node disjoint paths SAD, SBD b) Link disjoint paths SBD and SCD and SABCD Figure 5.3: Disjoint paths between Source S and Destination D 70
5 Figure 5.3 (a) shows the node disjoint paths and Figure 5.3 (b) shows the link disjoint paths. Among these, node-disjoint path is better, because it is the strongest measure of path independence. In this case if any node fails in between, then any of the remaining paths can be used for transmission through route maintenance without any problem. (ii) (iii) Traffic Allocation - Once the source node has selected a set of paths to the destination, it can begin sending data to the destination along the paths. The traffic allocation strategy used deals with how the data is distributed amongst the paths. The choice of allocation granularity is important in traffic allocation. The allocation granularity specifies the smallest unit of information allocated to each path. For instance, a perconnection granularity would allocate all traffic for one connection to a single path. A per-packet granularity would distribute the packets from multiple connections amongst the paths. A per-packet granularity results in the best performance [128]. This is because it allows for finer control over the network resources. It is difficult to evenly distribute traffic amongst the paths in the per-connection case, because all the connections experience different traffic rates. Path Maintenance - Over time, paths may fail due to link/node failures or, in Ad Hoc networks, due to node mobility. Path maintenance is the process of regenerating paths after the initial path discovery. It can be initiated after each path failure, or when all the paths have failed. Some multipath protocols use dynamic maintenance algorithms to constantly monitor and maintain the quality or combined QoS metric of available paths Benefits of multipath routing (i) Fault tolerance Multipath routing protocols can provide fault tolerance by having redundant information routed to the destination via alternative paths. This reduces the probability that communication is 71
6 disrupted in case of link failure. More sophisticated algorithms employ source coding [129] to reduce the traffic overhead caused by too much redundancy, while maintaining the same degree of reliability. This increase in route resiliency largely depends on metrics such as the diversity, or disjointedness, of the available paths. Disjoint routes are discussed in the section 5.3. (ii) Load balancing When a link becomes over utilized and causes congestion, multipath routing protocols can choose to divert traffic through alternative paths to ease the burden of the congested link. (iv) Bandwidth aggregation By splitting data to the same destination into multiple streams, each routed through a different path, the effective bandwidth can be aggregated. This strategy is particularly beneficial when a node has multiple low bandwidth links but requires a bandwidth greater than an individual link can provide. End-to-end delay may also be reduced as a direct result of larger bandwidth. (v) Reduced delay For wireless networks employing single path on demand routing protocols, a route failure means that a new path discovery process needs to be initiated to find a new route. This results in a route discovery delay. The delay is minimized in multipath routing because backup routes are identified during route discovery Ad Hoc On-Demand Multipath Distance Vector Routing (AOMDV) The main idea in AOMDV is to compute multiple paths during route discovery. It is designed primarily for highly dynamic Ad Hoc networks where link failures and route breaks occur frequently. When single path on-demand routing protocol such as AODV is used in such networks, a new route discovery is needed in response to every route break. Each route discovery is associated with high overhead and latency. This inefficiency can be avoided by having multiple redundant paths available. Now, a new route discovery is needed only when all paths to the destination break. To 72
7 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 alternative path to the destination. To ensure loop freedom, a node accepts an alternative path to the destination, only if it has a lower hop count than the advertised hop count for that destination. AOMDV can be used to find node-disjoint or link-disjoint routes [120]. 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-disjointedness 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-disjointedness. The performance study of AOMDV relative to AODV under a wide range of mobility and traffic scenarios reveals that AOMDV offers a significant reduction in delay. It also provides reduction in the routing load and the end-to-end delay Experimental Results The performances of two on-demand routing protocols, viz., AODV and AOMDV are compared using NS-2 simulation. The two models used for the simulation are the Traffic generation model (TGM) and the Mobility generation model (MGM). 73
8 Delay (in ms) PDR (in %) The performance of AODV and AOMDV has been analyzed by fixing simulation parameters as given in Table 4.1: node speed to 10m/s, pause time to 40 seconds, single CBR flow per node and by varying the node density from 10 to 100 nodes. The mobile nodes are placed randomly within a 1000mX1000m area. Radio propagation range for each node is 250m PDR vs. number of nodes: Table 5.1 and Figure 5.4 show the PDR for each protocol versus number of nodes at low mobility. Table 5.1: PDR versus no. of nodes for different protocols PDR in % No. of nodes AODV AOMDV PDR vs. number of nodes 0 No. of nodes AODV AOMDV Figure 5.4: PDR versus No. of nodes Delay vs. number of nodes: Table 5.2 and Figure 5.5 show the end-to-end delay for each protocol versus number of nodes at low mobility. Table 5.2: Delay versus no. of nodes for different protocols Delay in milliseconds No. of nodes AODV AOMDV Delay vs. number of nodes No. of nodes AODV AOMDV Figure 5.5: Delay versus No. of nodes 74
9 Control overhead: Total number of control packets such as route requests (RREQs), route replies (RREPs) and route error (RRER). AOMDV allows for more RREQ and RREP packets in the network in order to build multiple paths to each destination for each node. The number of control packet sent for movement of 20 m/s and 30 traffic sources with zero pause time is shown in Table 5.3. Table 5.3: Control overhead of AODV and AOMDV Protocol Total no. of Control packets AODV 1,35,202 AOMDV 95, Analysis of Simulation Results The performance of AODV and AOMDV routing protocols is compared and analyzed using NS-2.34 simulator. The QoS metrics Average delay and Packet delivery ratio is measured by varying the number of nodes from 10 to 100. a) PDR comparison: It is observed that the PDR of AOMDV is better in increasing the number of nodes as compared to AODV at low mobility. For example, at 80 nodes, the PDR of AODV and AOMDV is 90% and 96.5% respectively. But, at high mobility the PDR of AOMDV reduces to 75%. b) Delay comparison: It is observed that the delay of AOMDV is better than AODV at low mobility. For example, at 80 nodes, the delay of AODV is 162ms. Whereas for AOMDV, delay is 145ms. But at high mobility conditions, the delay of AOMDV may reach up to 250ms. Thus, from the experimental analysis, it is observed that the AOMDV routing protocol is better in performance as compared to AODV. But the performance degrades, as the mobility and traffic is increased. This is due to, more routing overhead caused in the MANET. 75
10 c) Control overhead: AODV allows only for a single RREP packet, for the first RREQ the destination node received to be sent back via the reverse route it arrived in. By considering 3 types of control messages(rrep, RREQ and RERR) the overall control overhead of AOMDV is less than AODV is given in the Table Establishing Path Accumulation features in AODV DSR and AODV are the two well-known on-demand routing protocols for MANETs. A major disadvantage of these two protocols is, the problem associated with routing of packets through flooding, resulting in congestion and unnecessary traffic in the network. There exists minimal flow control in the network. Thus, DSR and AODV are combined into one hierarchical routing protocol [130]. AODV can be modified to enable path accumulation as in the case of DSR, during the route discovery cycle. Each node also updates its routing table with all the information contained in the control messages. Each RREQ and RREP contains a source route for the nodes along the path, so that each node can have a routing table entry to the rest of the nodes. The main benefit of obtaining the additional routing entries is to reduce the route discovery overhead by eliminating some of the RREQs that would be required to discover these nodes. Since RREQs are the major source of control overhead due to flooding the whole network, any reduction in RREQs is expected to improve the performance significantly. The tradeoff is that the RREQ and RREP packet header will become larger to accommodate the source route. Figure 5.6 clarifies the difference between route discovery without path accumulation and route discovery with path accumulation [131]. 76
11 A A A A RREQ A B C D E E E E E RREP Figure 5.6 (a): Route Discovery Mechanism without Path Accumulation A A B A B C A B C D RREQ A B C D E B C D E C D E D E E RREP Figure 5.6 (b): Route Discovery Mechanism with Path Accumulation Figure 5.6: Route Discovery Mechanism in AODV 5.3 Proposed method of Multiple Node Disjoint Paths for a MANET Consider the sample network and possible paths from source A to destination D given in Figure 5.7. For this graph we can construct the path matrix as shown in Figure 5.8. In the path matrix, number of paths is placed in rows, and number of vertices is placed in columns. For every path we identify the vertices. If the vertex is there in the path, then we assign the value 1 for the corresponding vertex otherwise we assign the value 0. B C A Source Node D Destination Node A G D E F Figure 5.7: Sample graph and possible paths 77
12 The possible paths are: (i) P1 = ABCD (ii) P2 = ACD (iii) P3= AGD (iv) P4 = AFD (v) P5 = AEFD (vi) P6 = ACFD (vii) P7 = ABCFD A B C D E F G Weight P P P P P P P Figure 5.8: Path matrix In the above path matrix, paths P2, P3 and P4 contain the lowest weight 3. Among these 3 paths all the paths are treated as node disjoint paths. Suppose by default, among them first path is selected, i.e., P2. Then rest of the node disjoint paths are computed using the Hamming distance matrix [122]. Hamming distance is the difference in bit pattern of each path with the other paths. The hamming distance matrix for the above graph is represented in Figure
13 P1 P2 P3 P4 P5 P6 P7 P P P P P P P Figure 5.9: Hamming Distance Matrix In the Hamming distance matrix, the corresponding P2(row2) the maximum value is under P5, i.e., 3(circled in the Figure 5.9). So P5 is selected as the second path. Now, in order to find the third path, we have to find the maximum of the sum of P2 and P5 as shown in Figure P P Sum Figure 5.10: Determining the third disjoint path Now the maximum sum is 5. It is under column1. So the third path selected is P1. In order to find the next node disjoint path the maximum sum of P2, P5 and P1 are used as shown in Figure
14 P P P Sum Figure 5.11: Determining the fourth disjoint path It is observed that the maximum sum is 8. It is under column3 (circled in the Figure 5.11). So the fourth path selected is P3. Similarly the rest of the node disjoint paths can be computed using the same procedure. The algorithm first selects the node disjoint paths according to the Path matrix initially. For the given MANET, using the path matrix, there are 3 paths (P2, P3 and P4) having the same weight value (lowest weight). So, actually P2, P3 and P4 will be the first set of node disjoint paths. Upon selecting these three paths only, second set of node disjoint paths are selected, based on the hamming distance. Total number of node disjoint paths computed is based on the Timestamp. During the data transmission, initially whichever path is available first (primary path) is taken. When primary path breaks, it takes up the next alternative path from the routing table. 5.4 Algorithm for computing Multiple Node Disjoint Paths by making use of Path accumulation feature in AODV protocol (MQARP) Suppose n is the number of mobile nodes and N is the set of mobile nodes, N={N1,N2,..,Nn}. Assume that node Ni seeks to find a path to node Nj and Nt receives the RREQ packet, where Ni, Nj, Ntϵ N and 1<i, j, t<n and i j. 80
15 1. Broadcast the RREQ message from Ni to the intermediate node Nt if they are reachable. 2. [Using path accumulation feature of DSR in AODV] Accumulate each intermediate node address in the RREQ message and forward the RREQ message until destination Nj is reached. 3. Repeat steps 1 and 2 until all RREQ messages are received at the destination Nj or a time stamp is reached. 4. [Computing Path matrix by placing paths as rows and nodes as columns] For each path or row Begin If a node is present in the path put the value 1. Else place a zero in the corresponding column. Select the next path or next row. End 5. From the Node disjoint path matrix, for every path find the weight, by finding the row sum. 6. Now select the minimum weight from the path matrix. Include this path as a first path in the list of Node disjoint paths. 7. [Compute the rest of Node disjoint paths by making the Hamming distance matrix where row and column indicates the paths] For each path or row Begin Initialize the counter to zero. Take the bit pattern from the Path matrix for this path and Compare this bit pattern with the rest of the path s bit pattern and with the same path. If there is no change in corresponding bit position, then skip that bit Else add 1 to the counter. Store the counter value in the corresponding column of the Hamming distance matrix for that path. Select next path or row. 81
16 End 8. Using the hamming distance matrix compute the rest of the node disjoint paths by taking the maximum column value under the first node disjoint path or row. The path having the maximum value is taken as the second node disjoint path. 9. Add the corresponding bit positions in the bit patterns of the computed node disjoint paths or compute the column sum of the corresponding entries. 10. In the column sum, if all the values are same then select any one of the values and take the corresponding column s path as the third node disjoint path else go to Step Find the maximum value of the column sum, and take the corresponding column s path as the third path. 12. Repeat steps 9 to 11 to compute rest of the node disjoint paths, until the maximum limit or Time stamp reached. 13. At the node Nj forward the computed node disjoint paths to the source node Ni. 14. Stop 5.5 Experimental Results The performance of AOMDV and MQARP has been analysed by fixing node speed to 25m/s, single CBR flow per node, pause time to 10 seconds and by varying the node density from 10 to 100 nodes. The mobile nodes are placed randomly within a 1000mX1000m area. Radio propagation range for each node is 250m PDR vs. number of nodes: Table 5.4 and Figure 5.12 show PDR for each protocol versus number of nodes. 82
17 Delay (in ms) PDR (in %) Table 5.4: PDR versus no. of nodes for different protocols at high mobility No. of nodes PDR in % AOMDV MQARP PDR vs. number of nodes AOMDV 40 MQARP 20 0 No. of nodes Figure 5.12: PDR versus No. of nodes Delay vs. number of nodes: Table 5.5 and Figure 5.13 show the end-to-end delay for each protocol versus number of nodes. Table 5.5: Delay versus no. of nodes for different protocols at high mobility Delay in ms No. of AOMDV MQARP nodes Delay vs. number of nodes No. of nodes AOMDV MQARP Figure 5.13: Delay versus no. of nodes Control overhead: Table 5.6 shows overall control overhead of AOMDV and MQARP protocols at high mobility situations. 83
18 Table 5.6: Control overhead of AOMDV and MQARP Protocol Total no. of control packets MQARP 84,075 AOMDV 95, Analysis of Simulation Results The performance of AOMDV and MQARP routing protocols is compared and analyzed using NS-2.34 simulator. The QoS metrics Average delay and Packet delivery ratio are measured by varying the number of nodes from 10 to100. a) PDR comparison: It is observed that the PDR of MQARP is better in increasing the number of nodes as compared to AOMDV at high mobility. For example, at 80 nodes, the PDR of AOMDV and MQARP is 75% and 85%, respectively. b) Delay comparison: It is observed that the delay of MQARP is better than AOMDV at high mobility. For example, at 80 nodes, the delay of AOMDV is 180ms. Whereas for MQARP, delay is 155ms. The reason behind this is, MQARP identifies node disjoint paths, due to link break or node failures another route will be readily available in the routing table for data transmission. The route discovery latency of MQARP is lesser than that of AOMDV and the AOMDV which is available now is taking care of only link disjoint paths. The link disjoint paths provide fault tolerance, but cannot be used for resource sharing. The node disjoint path is the strongest measure of path independence. c) Control overhead comparison: As far as control overhead is concerned, AOMDV and MQARP are almost same for RREQ messages. But the control overhead in terms of RREP is less for MQARP than AOMDV. 84
19 The total number of paths computed for data transmission, depends upon the network topology and the reachability of nodes. For traffic sharing node disjoint paths are necessary. Since the multiple paths computed by AOMDV protocol is not node disjoint, it cannot be used for simultaneous data transmission. In the experiments, the paths computed are node disjoint. i.e., among the multiple computed paths, there is no common node except source and the destination. It s not always feasible to have multiple node-disjoint paths. For example, consider a sample MANET shown in Figure B C S A E G H D F Figure 5.14: Sample MANET According to the algorithm only one node-disjoint path is considered. There exist three paths between S and D. They are: S->A->E->G->H->D, S->A->B->C->G->H->D and S->A->F->G->H->D. According to the path matrix method, two paths contain same weights. Assuming that, for example S->A->E->G->H->D path is obtained first at the destination, then this path is taken as the node disjoint path even though there exist one more path between S and D. At the destination, if the weights of the paths are same, then they are checked for node disjointedness. 5.6 Summary In the single path routing protocol as the number of nodes are increased, performance degrades in terms of QoS metrics. Multipath routing allows the establishment of multiple paths between a single source and single destination node and when a path breaks an alternate path is used 85
20 instead of initiating a new route discovery. Hence multipath routing represents a promising routing method for wireless mobile Ad Hoc networks. Multipath routing achieves load balancing and is more resilient to route failures. Compared to unipath AODV, the performance of AOMDV is better in terms of QoS metrics. The AOMDV works for both link disjoint and node disjoint paths. In the case of original AODV, since at a time only one path is identified, due to link break or node failure the current path becomes invalid, so immediate route discovery has to take place. In the case of original AOMDV, the path/paths that are existing in the routing table are not node disjoint. i.e., whenever there is link break or node failure in the network, the current path becomes invalid. In this work the AODV protocol is modified to get multiple node disjoint paths during route discovery using the path accumulation feature. In MQARP, when the primary path breaks, it takes up the next alternative path from the routing table. This message is given to the source node in terms of error messages. The purpose of the proposed work is not only to compute the maximum number of node disjoint path, but also the paths computed must be delay aware, link reliable and energy efficient. The experimental results show that the performance of the proposed MQARP better in all aspects as compared to the original AODV and AOMDV. This is due to the infrequent route discovery process. The performance needs to be improved further for high mobility and high traffic situations. So the MQARP is taken as the base protocol to improve further the QoS metrics. 86
Routing Protocols in MANETs
Chapter 4 Routing Protocols in MANETs 4.1 Introduction The main aim of any Ad Hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an
More informationContent. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.
Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management
More informationPerformance Analysis and Enhancement of Routing Protocol in Manet
Vol.2, Issue.2, Mar-Apr 2012 pp-323-328 ISSN: 2249-6645 Performance Analysis and Enhancement of Routing Protocol in Manet Jaya Jacob*, V.Seethalakshmi** *II MECS, Sri Shakthi Institute of Engineering and
More informationPerformance Evaluation of Various Routing Protocols in MANET
208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri
More information6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA)
103 6. Node Disjoint Split Multipath Protocol for Unified Multicasting through Announcements (NDSM-PUMA) 6.1 Introduction It has been demonstrated in chapter 3 that the performance evaluation of the PUMA
More informationSimulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol
Simulation & Performance Analysis of Mobile Ad-Hoc Network Routing Protocol V.S.Chaudhari 1, Prof.P.N.Matte 2, Prof. V.P.Bhope 3 Department of E&TC, Raisoni College of Engineering, Ahmednagar Abstract:-
More informationAn Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks
An Efficient Routing Approach and Improvement Of AODV Protocol In Mobile Ad-Hoc Networks Tejomayee Nath #1 & Suneeta Mohanty *2 # School of Computer Engineering, KIIT University Bhubaneswar,, India Abstract
More informationMultipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network
1 Multipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network Nilima Walde, Assistant Professor, Department of Information Technology, Army Institute of Technology, Pune, India Dhananjay
More information2. LITERATURE REVIEW. Performance Evaluation of Ad Hoc Networking Protocol with QoS (Quality of Service)
2. LITERATURE REVIEW I have surveyed many of the papers for the current work carried out by most of the researchers. The abstract, methodology, parameters focused for performance evaluation of Ad-hoc routing
More informationPerformance Evaluation and Comparison of AODV and AOMDV
Performance Evaluation and Comparison of AODV and AOMDV S. R. Biradar 1, Koushik Majumder 2, Subir Kumar Sarkar 3, Puttamadappa C 4 1 Sikkim Manipal Institute of Technology, Majitar -737 132 2 WBUT, Kolkata
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationSUMMERY, CONCLUSIONS AND FUTURE WORK
Chapter - 6 SUMMERY, CONCLUSIONS AND FUTURE WORK The entire Research Work on On-Demand Routing in Multi-Hop Wireless Mobile Ad hoc Networks has been presented in simplified and easy-to-read form in six
More informationAODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
More informationPerformance analysis of aodv, dsdv and aomdv using wimax in NS-2
Performance analysis of aodv, dsdv and aomdv using wimax in NS-2 Madhusrhee B Department Computer Science, L.J Institute of Technology, Ahmedabad, India Abstract WiMAX (IEEE 802.16) technology empowers
More informationQoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET
2011 International Conference on Information and Network Technology IPCSIT vol.4 (2011) (2011) IACSIT Press, Singapore QoS Routing By Ad-Hoc on Demand Vector Routing Protocol for MANET Ashwini V. Biradar
More informationMobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1
Mobile Ad-hoc and Sensor Networks Lesson 04 Mobile Ad-hoc Network (MANET) Routing Algorithms Part 1 Oxford University Press 2007. All rights reserved. 1 Ad-hoc networks deployment For routing, target detection,
More informationUnicast Routing in Mobile Ad Hoc Networks. Dr. Ashikur Rahman CSE 6811: Wireless Ad hoc Networks
Unicast Routing in Mobile Ad Hoc Networks 1 Routing problem 2 Responsibility of a routing protocol Determining an optimal way to find optimal routes Determining a feasible path to a destination based on
More informationSUMMARY OF ROUTING PROTOCOL MOBILE AD HOC NETWORKS. YI Jiazi. Polytechnic School of University of Nantes. Feb.
SUMMARY OF ROUTING PROTOCOL IN MOBILE AD HOC NETWORKS YI Jiazi Polytechnic School of University of Nantes yi.jiazi@gmail.com Feb. 2007 CONTENTS ABSTRACT...2 1. INTRODUCTION...2 2. UNI-PATH ROUTING PROTOCOL...2
More informationPerformance Evaluation of MANET through NS2 Simulation
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 1 (2014), pp. 25-30 International Research Publication House http://www.irphouse.com Performance Evaluation
More informationPerformance Comparison of AODV and AOMDV Routing Protocols in Mobile Ad Hoc Networks
International Research Journal of Applied and Basic Sciences 2013 Available online at www.irjabs.com ISSN 2251-838X / Vol, 4 (11): 3277-3285 Science Explorer Publications Performance Comparison of AODV
More informationArvind Krishnamurthy Fall 2003
Ad-hoc Routing Arvind Krishnamurthy Fall 2003 Ad Hoc Routing Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems
More information1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
1 Multipath Node-Disjoint Routing with Backup List Based on the AODV Protocol Vahid Zangeneh i and Shahriar Mohammadi ii * ABSTRACT In recent years, routing has been the most focused area in ad hoc networks
More informationPerformance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols
www.ijcsi.org 551 Performance Evaluation of Two Reactive and Proactive Mobile Ad Hoc Routing Protocols Kashif Ibrahim Qazi Javed Ahmed Abdul Qudoos Mirza Aamir Mehmood Department of Computer Science, Balochistan
More informationAnil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput.
Volume 6, Issue 7, July 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Analysis
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationLECTURE 9. Ad hoc Networks and Routing
1 LECTURE 9 Ad hoc Networks and Routing Ad hoc Networks 2 Ad Hoc Networks consist of peer to peer communicating nodes (possibly mobile) no infrastructure. Topology of the network changes dynamically links
More informationAnalysis of Routing Protocols in MANETs
Analysis of Routing Protocols in MANETs Musica Supriya, Rashmi, Nishchitha, Ashwini C Shetty, Sharath Kumar Student, Dept. of CSE, SMVITM Bantakal, Karnataka, India Student, Dept. of CSE, SMVITM Bantakal,
More informationSimulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Abstract Keywords:
Volume-9 Number-1 Jan -June 2017 pp. 16-21 available online at www.csjournalss.com Simulation and Comparative Analysis of AODV, DSR, DSDV and OLSR Routing Protocol in MANET Sachin Lalar, Arun Kumar Yadav
More informationPerformance Evaluation of AODV and DSDV Routing Protocol in wireless sensor network Environment
2012 International Conference on Computer Networks and Communication Systems (CNCS 2012) IPCSIT vol.35(2012) (2012) IACSIT Press, Singapore Performance Evaluation of AODV and DSDV Routing Protocol in wireless
More informationReview on Packet Forwarding using AOMDV and LEACH Algorithm for Wireless Networks
RESEARCH ARTICLE OPEN ACCESS Review on Packet Forwarding using AOMDV and LEACH Algorithm for Wireless Networks Mrs. P. V. Meghare 1, Prof. P. A. Deshmukh 2 1 Department of Computer Science, Nagpur University,
More informationMODIFICATION AND COMPARISON OF DSDV AND DSR PROTOCOLS
MODIFICATION AND COMPARISON OF DSDV AND DSR PROTOCOLS Department of computer science Thadomal Shahani engineering college Mumbai-400051, ABSTRACT: In this era of mobile devices, mobile ad-hoc network (MANET)
More informationA COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET
ISSN: 2278 1323 All Rights Reserved 2016 IJARCET 296 A COMPARISON OF REACTIVE ROUTING PROTOCOLS DSR, AODV AND TORA IN MANET Dr. R. Shanmugavadivu 1, B. Chitra 2 1 Assistant Professor, Department of Computer
More informationPERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STRATEGIES AND MINIMUM HOP SINGLE PATH ROUTING FOR MOBILE AD HOC NETWORKS
PERFORMANCE COMPARISON OF LINK, NODE AND ZONE DISJOINT MULTI-PATH ROUTING STRATEGIES AND MINIMUM HOP SINGLE PATH ROUTING FOR MOBILE AD HOC NETWORKS Natarajan Meghanathan Jackson State University, 1400
More informationROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS
ROUTE STABILITY MODEL FOR DSR IN WIRELESS ADHOC NETWORKS Ganga S 1, Binu Chandran R 2 1, 2 Mohandas College Of Engineering And Technology Abstract: Wireless Ad-Hoc Network is a collection of wireless mobile
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions
More informationSimulation and Performance Analysis of Throughput and Delay on Varying Time and Number of Nodes in MANET
International Journal of Recent Research and Review, Vol. VII, Issue 2, June 2014 ISSN 2277 8322 Simulation and Performance Analysis of and on Varying and Number of Nodes in MANET Arun Jain 1, Ramesh Bharti
More informationA Survey - Energy Efficient Routing Protocols in MANET
, pp. 163-168 http://dx.doi.org/10.14257/ijfgcn.2016.9.5.16 A Survey - Energy Efficient Routing Protocols in MANET Jyoti Upadhyaya and Nitin Manjhi Department of Computer Science, RGPV University Shriram
More informationRouting protocols in WSN
Routing protocols in WSN 1.1 WSN Routing Scheme Data collected by sensor nodes in a WSN is typically propagated toward a base station (gateway) that links the WSN with other networks where the data can
More informationExperiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol
Experiment and Evaluation of a Mobile Ad Hoc Network with AODV Routing Protocol Kalyan Kalepu, Shiv Mehra and Chansu Yu, Department of Electrical and Computer Engineering Cleveland State University 2121
More informationA Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta Jetcheva Presentation by: Michael Molignano Jacob
More informationRouting in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14
Routing in Ad Hoc Wireless Networks PROF. MICHAEL TSAI / DR. KATE LIN 2014/05/14 Routing Algorithms Link- State algorithm Each node maintains a view of the whole network topology Find the shortest path
More informationPerformance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model
Performance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model Geetha.S, Dr.G.Geetharamani Asst.Prof, Department of MCA, BIT Campus Tiruchirappalli, Anna University,
More informationFigure 1: Ad-Hoc routing protocols.
Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks Sukhchandan Lally and Ljiljana Trajković Simon Fraser University Vancouver, British Columbia Canada E-mail: {lally, ljilja}@sfu.ca
More informationEffect of Variable Bit Rate Traffic Models on the Energy Consumption in MANET Routing Protocols
Volume 1, Issue 3, October 2013 ISSN: 2320-9984 (Online) International Journal of Modern Engineering & Management Research Website: www.ijmemr.org Effect of Variable Bit Rate Traffic Models on the Energy
More informationPerformance Evaluation of AODV and DSR routing protocols in MANET
Performance Evaluation of AODV and DSR routing protocols in MANET Naresh Dobhal Diwakar Mourya ABSTRACT MANETs are wireless temporary adhoc networks that are being setup with no prior infrastructure and
More informationBehaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model
Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Deepak Agrawal, Brajesh Patel Department of CSE Shri Ram Institute of Technology Jabalpur,
More informationAn Extended AODV Protocol for Multipath Routing in MANETs
IACSIT International Journal of Engineering and Technology, Vol.2, No.4, August 21 An Extended Protocol for Multipath Routing in MANETs N.Jaisankar 1 and R.Saravanan 2 Abstract Mobile ad hoc networks (MANETs)
More informationA Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network
ShriRam College of Engineering & Management 1 A Review of Reactive, Proactive & Hybrid Routing Protocols for Mobile Ad Hoc Network M.Ramaiya Rohit Gupta Rachit Jain Head,Dept. Computer Science Dept. Computer
More informationQoS Based Evaluation of Multipath Routing Protocols in Manets
Advances in Networks 2017; 5(2): 47-53 http://www.sciencepublishinggroup.com/j/net doi: 10.11648/j.net.20170502.13 ISSN: 2326-9766 (Print); ISSN: 2326-9782 (Online) QoS Based Evaluation of Multipath Routing
More informationUCS-805 MOBILE COMPUTING Jan-May,2011 TOPIC 8. ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala.
Mobile Ad Hoc Networks: Routing TOPIC 8 UCS-805 MOBILE COMPUTING Jan-May,2011 ALAK ROY. Assistant Professor Dept. of CSE NIT Agartala Email-alakroy.nerist@gmail.com Mobile Ad Hoc Networks (MANET) Introduction
More information2013, IJARCSSE All Rights Reserved Page 85
Volume 3, Issue 12, December 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Overview of
More informationA Survey on Wireless Routing Protocols (AODV, DSR, DSDV)
RESEARCH ARTICLE International Journal of Computer Techniques - Volume 2 Issue 1, 2015 OPEN ACCESS A Survey on Wireless Routing Protocols (AODV, DSR, DSDV) Sejal D Mello 1, Priyanka B. Patil 2, Tarannum
More informationPERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS
PERFORMANCE ANALYSIS OF AODV ROUTING PROTOCOL IN MANETS AMANDEEP University College of Engineering, Punjabi University Patiala, Punjab, India amandeep8848@gmail.com GURMEET KAUR University College of Engineering,
More informationCS551 Ad-hoc Routing
CS551 Ad-hoc Routing Bill Cheng http://merlot.usc.edu/cs551-f12 1 Mobile Routing Alternatives Why not just assume a base station? good for many cases, but not some (military, disaster recovery, sensor
More informationPower aware Multi-path Routing Protocol for MANETS
Power aware Multi-path Routing Protocol for MANETS Shruthi P Murali 1,Joby John 2 1 (ECE Dept, SNGCE, India) 2 (ECE Dept, SNGCE, India) Abstract: Mobile Adhoc Network consists of a large number of mobile
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK COMPARISON OF MANET REACTIVE ROUTING PROTOCOLS USING OPNET SIMULATOR SANGEETA MONGA
More informationAnalysis of Black-Hole Attack in MANET using AODV Routing Protocol
Analysis of Black-Hole Attack in MANET using Routing Protocol Ms Neha Choudhary Electronics and Communication Truba College of Engineering, Indore India Dr Sudhir Agrawal Electronics and Communication
More informationKeywords: AODV, MANET, WRP
Performance Analysis of AODV and WRP in MANET Sachchida Nand Singh*, Surendra Verma**, Ravindra Kumar Gupta*** *(Pursuing M.Tech in Software Engineering, SSSIST Sehore(M.P), India, Email: sesachchida@gmail.com)
More informationPerformance of Ad-Hoc Network Routing Protocols in Different Network Sizes
Performance of Ad-Hoc Network Routing Protocols in Different Network Sizes Sudheer Kumar 1, Akhilesh Yadav 2 Department of Computer Science and Engineering Kanpur Institute of Technology, Kanpur sudheerkr21@gmail.co
More informationA COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE AND IEEE
Journal of Engineering Science and Technology Vol. 4, No. 2 (2009) 132-141 School of Engineering, Taylor s University College A COMPARISON OF IMPROVED AODV ROUTING PROTOCOL BASED ON IEEE 802.11 AND IEEE
More informationA Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver
1 A Routing Protocol for Utilizing Multiple Channels in Multi-Hop Wireless Networks with a Single Transceiver Jungmin So Dept. of Computer Science, and Coordinated Science Laboratory University of Illinois
More informationPerformance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols
Performance Comparison of AODV, DSR, DSDV and OLSR MANET Routing Protocols Akshay Shankar, Lavanya Chelle Information Science Engineering RNS Institute of Technology Bangalore, India Abstract- A Mobile
More informationA Neighbor Coverage Based Probabilistic Rebroadcast Reducing Routing Overhead in MANETs
A Neighbor Coverage Based Probabilistic Rebroadcast Reducing Routing Overhead in MANETs Ankita G. Rathi #1, Mrs. J. H. Patil #2, Mr. S. A. Hashmi #3 # Computer Science-Information Technology Department,
More informationWireless Networking & Mobile Computing
Wireless Networking & Mobile Computing CS 752/852 - Spring 2012 Network Layer: Ad Hoc Routing Tamer Nadeem Dept. of Computer Science The OSI Communication Model Page 2 Spring 2012 CS 752/852 - Wireless
More informationCOMPREHENSIVE COMPARISON STUDY FOR ROUTING PROTOCOLS IN MOBILE AD-HOC NETWORK USING NS2
COMPREHENSIVE COMPARISON STUDY FOR ROUTING PROTOCOLS IN MOBILE AD-HOC NETWORK USING NS2 Yasir I. Mohammed and Raed A. Alsaqour School of Computer Science, Faculty of Information Science and Technology,
More informationMANET is considered a collection of wireless mobile nodes that are capable of communicating with each other. Research Article 2014
Throughput Analysis of Proactive and Reactive MANET Routing Protocols Kiranveer Kaur 1 Surinderjit Kaur 2 Vikramjit Singh 3 Department of Computer Science, University College of Engineering, Department
More informationLecture 13: Routing in multihop wireless networks. Mythili Vutukuru CS 653 Spring 2014 March 3, Monday
Lecture 13: Routing in multihop wireless networks Mythili Vutukuru CS 653 Spring 2014 March 3, Monday Routing in multihop networks Figure out a path from source to destination. Basic techniques of routing
More informationEvaluation of Routing Protocols for Mobile Ad hoc Networks
International Journal of Soft Computing and Engineering (IJSCE) Evaluation of Routing Protocols for Mobile Ad hoc Networks Abstract Mobile Ad hoc network is a self-configuring infrastructure less network
More informationConsiderable Detection of Black Hole Attack and Analyzing its Performance on AODV Routing Protocol in MANET (Mobile Ad Hoc Network)
Editorial imedpub Journals http://www.imedpub.com/ American Journal of Computer Science and Information Technology DOI: 10.21767/2349-3917.100025 Considerable Detection of Black Hole Attack and Analyzing
More informationOptimizing Performance of Routing against Black Hole Attack in MANET using AODV Protocol Prerana A. Chaudhari 1 Vanaraj B.
IJSRD - International Journal for Scientific Research & Development Vol. 3, Issue 04, 2015 ISSN (online): 2321-0613 Optimizing Performance of Routing against Black Hole Attack in MANET using AODV Protocol
More informationA REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS
A REVERSE AND ENHANCED AODV ROUTING PROTOCOL FOR MANETS M. Sanabani 1, R. Alsaqour 2 and S. Kurkushi 1 1 Faculty of Computer Science and Information Systems, Thamar University, Thamar, Republic of Yemen
More informationRouting Protocols in MANET: Comparative Study
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.119
More informationPerformance Analysis of Wireless Mobile ad Hoc Network with Varying Transmission Power
, pp.1-6 http://dx.doi.org/10.14257/ijsacs.2015.3.1.01 Performance Analysis of Wireless Mobile ad Hoc Network with Varying Transmission Power Surabhi Shrivastava, Laxmi Shrivastava and Sarita Singh Bhadauria
More informationA Scheme of Multi-path Adaptive Load Balancing in MANETs
4th International Conference on Machinery, Materials and Computing Technology (ICMMCT 2016) A Scheme of Multi-path Adaptive Load Balancing in MANETs Yang Tao1,a, Guochi Lin2,b * 1,2 School of Communication
More informationMobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV
Journal of Computer Science 8 (1): 13-17, 2012 ISSN 1549-3636 2011 Science Publications Mobility and Density Aware AODV Protocol Extension for Mobile Adhoc Networks-MADA-AODV 1 S. Deepa and 2 G.M. Kadhar
More informationPerformance evaluation of AODV, DSR and DSDV in mobile ad-hoc network using NS-2
Performance evaluation of AODV, DSR and DSDV in mobile ad-hoc network using NS-2 Fan-Shuo KONG, Bei-Bei CUI School of Software Engineering, Beijing University of Technology, Beijing, China e-mail: kongfanshuo0224@163.com,
More information6367(Print), ISSN (Online) Volume 4, Issue 2, March April (2013), IAEME & TECHNOLOGY (IJCET)
INTERNATIONAL International Journal of Computer JOURNAL Engineering OF COMPUTER and Technology ENGINEERING (IJCET), ISSN 0976- & TECHNOLOGY (IJCET) ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 4,
More informationAd-Hoc Data Processing and Its Relation with Cloud Computing Process Using Functional Approach
Ad-Hoc Data Processing and Its Relation with Cloud Computing Process Using Functional Approach 1 M Dhasaratham, 2 Dr. R P Singh 1 Research Scholar, 2 Research Guide 1 SSSUTMS, Sehore,India, 2 SSSUTMS,
More informationOverhead Reduction and Performance Enhancement of AODV and DSR Routing Protocols
Overhead Reduction and Performance Enhancement of AODV and DSR Routing Protocols Prabhat Kumar Khemariya Department of Electronics & Communication Engineering Sagar Institute of Research, Technology and
More informationPERFORMANCE EVALUATION OF DSR USING A NOVEL APPROACH
PERFORMANCE EVALUATION OF DSR USING A NOVEL APPROACH 1. Prof.S.P. Setti 2. Narasimha Raju K 3. Naresh Kumar K CS&SE Dept., CS&SE Dept., CS&SE Dept., AU College of Engineering, AU College of Engineering,
More informationScalability Performance of AODV, TORA and OLSR with Reference to Variable Network Size
Lovekesh Kumar / International Journal of Engineering Research and Applications (IJERA) ISSN: Scalability Performance of AODV, TORA and OLSR with Reference to Variable Network Size Lovekesh Kumar* *(Department
More informationEmergence of Ad-hoc On-demand Distance Vector Protocol (AODV) as an Efficient On-demand Routing Protocol (EORP) Using Bayesian Approach
ISSN : 2050-3021 Emergence of Ad-hoc On-demand Distance Vector Protocol (AODV) as an Efficient On-demand Routing Protocol (EORP) Using Bayesian Approach Dr. Anubhuti Khare 1, Manish Saxena 2, Raghav Shrivastava*
More informationThe Performance of MANET Routing Protocols for Scalable Video Communication
Communications and Network, 23, 5, 9-25 http://dx.doi.org/.4236/cn.23.522 Published Online May 23 (http://www.scirp.org/journal/cn) The Performance of MANET Routing Protocols for Scalable Video Communication
More informationPerformance Analysis of DSR Routing Protocol With and Without the Presence of Various Attacks in MANET
Performance Analysis of DSR Routing Protocol With and Without the Presence of Various Attacks in MANET Aaditya Jain M.Tech Scholar, Department of Computer Science & Engg., R. N. Modi Engineering College,
More informationPerformance evaluation of reactive and proactive routing protocol in IEEE ad hoc network
Author manuscript, published in "ITCom 6 - next generation and sensor networks, Boston : United States (26)" DOI :.7/2.68625 Performance evaluation of reactive and proactive routing protocol in IEEE 82.
More informationENERGY EFFICIENT MULTIPATH ROUTING FOR MOBILE AD HOC NETWORKS
ENERGY EFFICIENT MULTIPATH ROUTING FOR MOBILE AD HOC NETWORKS May Cho Aye and Aye Moe Aung Faculty of Information and Communication Technology, University of Technology (Yatanarpon Cyber City), Pyin Oo
More informationA Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET
A Comparative Analysis of Energy Preservation Performance Metric for ERAODV, RAODV, AODV and DSDV Routing Protocols in MANET Bhabani Sankar Gouda Department of Computer Science & Engineering National Institute
More informationIntroduction to Mobile Ad hoc Networks (MANETs)
Introduction to Mobile Ad hoc Networks (MANETs) 1 Overview of Ad hoc Network Communication between various devices makes it possible to provide unique and innovative services. Although this inter-device
More informationEnhanced AODV for Providing QoS of Multimedia Application in MANET
Enhanced AODV for Providing QoS of Multimedia Application in MANET Wintwar Oo, and Eiei Khin Abstract MANET is a kind of wireless network which has dynamic topology and no fixed organization. As more and
More informationA Hybrid Routing Protocol for Ad-hoc Wireless Network Based on Proactive and Reactive Routing Schemes
A Hybrid Routing Protocol for Ad-hoc Wireless Network Based on Proactive and Reactive Routing Schemes Chetana K. Kamate, Dr. Santosh L. Deshpande Department P.G. Studies in Computer Network and Engineering,
More informationRecent Researches in Communications, Information Science and Education
AODV Based Multi-path Local Repairing Scheme for Mobile Ad Hoc Networks Eman Shaaban, PhD Computer Systems Dept. Faculty of computer and information science Ain-Shams university, Cairo, Egypt Eman.shaaban@cis.asu.edu.eg
More informationMobile Ad-Hoc Networks & Routing Algorithms
Mobile Ad-Hoc Networks & Routing Algorithms EMMANOUIL G. SPANAKIS, PhD. spanakis@csd.uoc.gr COLLABORATING RESEARCHER, COMPUTATIONAL BIOMEDICINE LABORATORY, FORTH-ICS VISITING LECTURER, COMPUTER SCIENCE
More informationPacket Estimation with CBDS Approach to secure MANET
Packet Estimation with CBDS Approach to secure MANET Mr. Virendra P. Patil 1 and Mr. Rajendra V. Patil 2 1 PG Student, SSVPS COE, Dhule, Maharashtra, India 2 Assistance Professor, SSVPS COE, Dhule, Maharashtra,
More informationA Review paper on Routing Protocol Comparison
A Review paper on Routing Protocol Comparison Ms. Aastha kohli 1, Mr. Sukhbir 2 1 M.Tech(CSE) (N.C College of Engineering, Israna Panipat) 2 HOD Computer Science Dept.( N.C College of Engineering, Israna
More informationInternational Journal of Advance Engineering and Research Development. Improved OLSR Protocol for VANET
Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 4, Issue 11, November -2017 Improved OLSR Protocol for VANET Ravi Shrimali
More informationStudy and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs
Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate
More informationA Highly Effective and Efficient Route Discovery & Maintenance in DSR
A Highly Effective and Efficient Route Discovery & Maintenance in DSR Shiva Prakash 1, Rajeev Kumar 2, Brijesh Nayak 3, Manindar Kumar Yadav 4 Department of Computer Science and Engineering, Madan Mohan
More informationMANET TECHNOLOGY. Keywords: MANET, Wireless Nodes, Ad-Hoc Network, Mobile Nodes, Routes Protocols.
MANET TECHNOLOGY Dharna 1, Varsha Saroha 2, R. B. Dubey 3 1,2,3 Department of Electronics and Communication Engineering, Hindu College of Engineering, Sonepat, Haryana,(India) ABSTRACT Wireless technology
More informationEnergy Efficient EE-DSR Protocol for MANET
Energy Efficient EE- Protocol for MANET 1 Mr. Prakash Patel, 2 Ms. Tarulata Chauhan 1 Department of Computer engineering, 1 LJ Institute of Technology, Ahmedabad, India 1 prakashpmp1990@gmail.com, 2 taruchauhan114@gmail.com
More informationRouting Protocols in Mobile Ad-Hoc Network
International Journal of Computer Science & Management Studies, Vol. 12, Issue 02, April 2012 Protocols in Mobile Ad-Hoc Network Sachin Minocha M. Tech Student, Vaish College of Engineering, Rohtak, Haryana
More information