Performance of Route Caching Strategies in Dynamic Source Routing
|
|
- Ferdinand Curtis
- 5 years ago
- Views:
Transcription
1 Performance of Route Caching Strategies in Dynamic Source Routing Mahesh K. Marina Samir R. Das Department of Electrical & Computer Engineering and Computer Science University of Cincinnati Cincinnati, OH Abstract On-demand routing protocols for mobile ad hoc networks utilize route caching in different forms in order to reduce the routing overheads as well as to improve the route discovery latency. For route caches to be effective, they need to adapt to frequent topology changes. Using an ondemand protocol called Dynamic Source Routing (DSR), we study the problem of keeping the caches up-to-date in dynamic ad hoc networks. Previous studies have shown that cache staleness in DSR can significantly degrade performance. We present and evaluate three techniques to improve cache correctness in DSR namely wider error notification, route expiry mechanism with adaptive timeout selection and the use of negative caches. Simulation results show that the combination of the proposed techniques not only result in substantial improvement of both application and cache performance but also reduce the overheads. 1 Introduction A mobile ad hoc network is a mobile, multi-hop wireless network with no stationary infrastructure. Dynamic topologies due to mobility and limited bandwidth and battery power make the routing problem in ad hoc networks more challenging than traditional wired networks. A key to designing efficient routing protocols for such networks lies in keeping the routing overhead minimal. A new class of on-demand routing protocols (e.g., DSR[10], AODV[13], TORA[12]) attempt to reduce routing overhead by only maintaining routes between nodes taking part in data communication. In these protocols, the source discovers routes on-demand by initiating a route discovery process. This process typically involves networkwide flooding of a route request and waiting for a route reply. Caching provides a mechanism for generating a route reply from an intermediate node en route to the destination. An intermediate node generating a reply also quenches the route request flood at that node and helps reduce the routing overhead to a large extent. Replies from caches also bring down the route discovery latency. This is similar to processor caches where caches reduce the access latency as well as bandwidth demand on the memory bus. The route caches are distributed across different nodes over the entire network. Leveraging caches in the mobile ad hoc networks brings up the challenge of keeping the distributed caches up-to-date even with frequent route changes. Utilizing cached information without robust mechanisms to keep it up-to-date can actually degrade performance and thus making caches counter-productive. Our goal in this paper is to develop and analyze effective caching strategies for the best overall performance. The majority of work related to route caches in mobile ad hoc networks focussed on Dynamic Source Routing (DSR)[10, 1], an on-demand protocol that uses source routing and makes aggressive use of route caches. However, the current specification of DSR lacks a mechanism to determine the relative freshness among routes in the route caches, or even to purge all stale routes from route caches effectively. Some performance studies[11, 6, 3] have observed that caches in DSR can report invalid routes frequently which affects performance negatively. In this paper, we reason further on the effects of caching on the performance of DSR. We present and evaluate three techniques to keep caches up-to-date in DSR. The remainder of the paper is organized as follows. Following section gives an overview of DSR. In section 3, we first point out some drawbacks of the existing caching model in DSR and then we present techniques to overcome those. We perform an evaluation of the proposed techniques in section 4 and follow it with related work and conclusions. 2 Dynamic Source Routing (DSR) Protocol The key feature of Dynamic Source Routing [10, 1] is the use of source routing, i.e., the sender knows the complete hop-by-hop route to the destination. These routes are stored in a route cache. The data packets carry the source route in the packet header.
2 When a node in the ad hoc network attempts to send a data packet to a destination for which it does not already know the route, it uses a route discovery process to dynamically determine such a route. Route discovery works by flooding the network with route request (also called query) packets. Each node receiving the request for the first time, rebroadcasts it, unless it is the destination or it has a route to the destination in its route cache. Such a node replies to the request with a route reply packet that is routed back to the original source. Route request and reply packets are also source routed. The request builds up the path traversed so far. The reply routes itself back to the source by traversing this path backwards. The route carried back by the reply packet is cached at the source for future use. If any link on a source route is broken (detected by a link-layer feedback resulting from the failure of an attempted data transmission over a link), a route error packet is generated. Route error is unicast back to the source using the part of the route traversed so far, erasing all entries in the route caches along the way that contain the broken link. A new route discovery must be initiated by the source, if this route is still needed and no alternate route is available in the cache. Several optimizations to this basic protocol have been proposed and have been evaluated to be very effective by the authors of the protocol [11]. They are as follows. (i) Salvaging: An intermediate node can use an alternate route from its own cache, when a data packet meets a broken link on its source route. (ii) Gratuitous route repair: A source node receiving an error packet, piggybacks the error in the following route request. This helps cleaning up the caches of other nodes in the network that may have the broken link in one of the cached source routes. (iii) Promiscuous listening: When a node overhears a packet not addressed to itself, it checks if the packet could be routed via itself to gain a shorter route. If so, the node sends a gratuitous reply to the source of the route with this new, better route. Aside from this, promiscuous listening helps a node to learn different routes without directly participating in the routing process. (iv) Non-propagating route requests: A node can perform a non-propagating (one-hop) route discovery before resorting to a network-wide flood. This optimization can reduce the routing overhead in cases where the neighbor caches have a route to the intended destination or when the destination is a neighbor. 3 Route Caching in DSR DSR aggressively uses route caching. By virtue of source routing, it is possible to cache every overheard route without causing loops. Any forwarding node caches any source route in a packet it forwards for possible future use. Also, the destination replies to all requests. Thus the source learns many alternate routes to the destination that are cached. Alternate routes are useful in case the primary (shortest) route breaks. In addition, any intermediate node on a route learns routes to the source and destination as well as other intermediate nodes on that route. Thus, a large amount of routing information is gathered and cached with just a single query-reply cycle. These cached routes may be used in replying to subsequent route queries. Replies from caches provide dual performance advantages. First, they reduce route discovery latency. Second, without replies from caches the route query flood will reach all nodes in the network (request storm). Cached replies quench the query flood early, thus saving on routing overheads. However, without an effective mechanism to remove stale cache entries, caches may contain routes that are invalid. Then, route replies may carry stale routes. Attempted data transmissions using stale routes incur overheads, generate additional error packets and can potentially pollute other caches when a packet with a stale route is forwarded or snooped on. Previous studies (e.g., [11, 6, 3]) have identified the stale route problem and its harmful effects. In the following, we identify three main trouble spots with the DSR protocol that are the root cause of the stale cache problem. Incomplete error notification: When a link breaks, route errors are not propagated to all caches that has an entry with the broken link. Instead, the route error is unicast only to the source whose data packet is responsible for identifying the link breakage via a link layer feedback. Thus only a limited number of caches are cleaned. The failure information is, however, propagated by piggybacking it onto the subsequent route requests from the source. But as the route requests may not be propagated network-wide (because of replies from caches), many caches may remain unclean. No expiry: There is no mechanism to expire stale routes. If not cleaned explicitly by the error mechanism, stale cache entries will stay forever in the cache. Quick pollution: There is no way to determine the freshness of any route information. For example, even after a stale cache entry is erased by a route error, a subsequent in-flight data packet carrying the same stale route can put that entry right back in. This possibility increases at high data rates, as there will be a large number of in-flight data packets upstream carrying the stale route to un-erase the route. This problem is compounded by liberal use of snooping. Stale routes are picked up by any other node overhearing any transmission. Thus, cache pollution can propagate fairly quickly.
3 We have developed three mechanisms to address these problems. Wider Error Notification - This technique is based on the idea that bad news should be propagated fast and wide. In order to increase the speed and the extent of error propagation, route errors are now transmitted as broadcast packets at the MAC (medium access control) layer. Initially, the node that determines the link breakage (via a link layer feedback, e.g.) broadcasts the route error packet containing the broken link information. Upon receiving a route error, a node updates its route cache so that all source routes containing the broken link are truncated at the point of failure. A node receiving a route error propagates (rebroadcasts) it further only if there exists a cached route containing the broken link and that route was used before in the packets forwarded by the node. Note that using this scheme route errors reach all the sources in a tree fashion starting from the point of failure. In effect, route error information is efficiently disseminated to all the nodes that forwarded packets along the broken route and to the neighbors of such nodes that may have acquired the (broken) route through snooping. Timer-based Route Expiry - Recall that link breakage is detected only by a link layer feedback, when an attempted data transmission fails. Thus loss of a route will go undetected if there is no attempt to use this route. A more proactive timer-based approach will be able to clean up such routes. A timer-based approach is based on the hypothesis that routes are only valid for a specific amount of time Ì (timeout period) from their last use. Each node in a cached route now has an associated timestamp of last use. This timestamp is updated each time the cached route or part thereof is seen in a unicast packet being forwarded by the node. Portions of cached routes unused in the past Ì interval are pruned. Benefit of this approach depends critically on the proper selection of the timeout period Ì. A very small value for the timeout may cause many unnecessary route invalidations, while a very large value may defeat the purpose of this technique. Although well-chosen static values can be obtained for a given network, a single timeout for all the nodes may not be appropriate in all scenarios and for all network sizes. Therefore, a dynamic mechanism is desirable that allows each node to choose timeout values independently based on its observed route stability. We propose a heuristic for adaptive selection of timeouts locally at each node based on the average route lifetime and the time between link breaks seen by the node. When a cached route breaks due to link breakage (known via link layer feedback) or upon receipt of a route error, the lifetime of the broken route is computed as the time elapsed since it was last entered in the cache. Average route lifetime is obtained using the lifetimes of all broken routes in the past. Time of latest link breakage seen by a node is also maintained. Using this information, the timeout period Ì is calculated as follows. Ì Ñ Ü «* average route lifetime, time since last link breakage µ When route breaks occur uniformly in time, average route lifetime itself provides a good estimate of Ì. However when many route breaks occur in short bursts with a large separation in time, the average route lifetime does not accurately predict Ì during the periods of no route breaks. Hence, the second term in the above equation is used to correct the Ì estimates during time intervals when there are no route breaks. The value of Ì is computed periodically and is used to expire stale entries from the cache. In our experiments, Ì is computed every half a second and route cache is then checked for stale entries. We use an «of and the minimum Ì is limited to ½ second. - To improve error handling in DSR, caching of negative information has already been suggested [1]. We make use of this idea in the following way. Every node caches the broken links seen recently via the link layer feedback or route error packets. Within a ÆØ interval of creating this entry if a node is to forward a packet with a source route containing the broken link, (i) the packet is dropped and (ii) a route error packet is generated. In addition, the negative cache is always checked for broken links before adding a new entry in the route cache. Essentially, route cache and negative cache are mutually exclusive with respect to the links present in them. This prevents the cache pollution problem. In our experiments, we used a negative cache size of entries with FIFO replacement policy and entries are expired after ÆØ = 10 seconds. 4 Performance Evaluation We use a detailed simulation study to evaluate the effectiveness of the caching techniques described in the last section. Their performances are compared with the base DSR protocol. In the following, we first describe the simulation environment and the performance metrics used, and then present and analyze the simulation results.
4 4.1 Simulation Environment We use a detailed simulation model based on ns-2 [5]. In a recent work, the Monarch research group in CMU developed support for simulating multi-hop wireless networks complete with physical, data link and MAC layer models [2] on ns-2. The distributed coordination function (DCF) of IEEE [4] for wireless LANs is used as the MAC layer. The radio model uses characteristics similar to a commercial radio interface, Lucent s WaveLAN [14]. Wave- LAN is a shared-media radio with a nominal bit-rate of 2 Mb/sec and a nominal radio range of 250 meters. A detailed description of simulation environment and the models is available in [2, 5] and will not be presented here. Note that the same simulation environment has been used before in several recent performance studies on ad hoc networks [2, 6, 11, 9, 3]. In the following, we mention some of the features of the simulation environment to provide a context for the performance study. The protocol models are layered in the simulator as in a traditional protocol stack. The routing protocol model sees all data packets transmitted or forwarded, and responds by invoking routing activities as specified by the DSR protocol. The routing layer detects link breakage using feedback from the IEEE MAC layer. A signal is sent to the routing layer when the MAC layer fails to deliver a unicast packet to the next hop. This is indicated, for example, by failure to receive CTS after a specific number of RTS retransmissions, or absence of an ACK following data transmission. The routing protocol model maintains a send buffer of 64 packets. It buffers all data packets waiting for a route, i.e., packets for which route discovery has started, but no reply has arrived yet. Buffering is done only at the source of the traffic session. To prevent buffering of packets too long, packets are dropped if they wait in the send buffer for more than 30 seconds. Mobility and traffic models are similar to previous reported results using this simulator [2, 9, 3]. The mobility model uses the random waypoint model [2] in a rectangular field. Here, each node starts its journey from a random location to a random destination with a randomly chosen speed (uniformly distributed between 0 20 m/sec). Once the destination is reached, another random destination is targeted after a pause. To change mobility, we vary the pause time, which affects the relative speeds of the mobiles. A 100 node network in a field with dimensions 2200m 600m is used. Traffic sources are CBR (continuous bit-rate). The source-destination pairs are spread randomly over the network. Only 512 byte data packets are used. The number of source-destination pairs is fixed to 25 and the packet sending rate in each pair are varied to change the offered load in the network. All traffic sessions are established at random times near the beginning of the simulation run and they stay active until the end. Simulations are run for 500 simulated seconds. Each data point represents an average of five runs with identical traffic models, but different randomly generated mobility scenarios. Identical mobility and traffic scenarios are used across all protocol variations. 4.2 Performance Metrics We evaluate three key performance metrics: (i) Packet delivery fraction ratio of the data packets delivered to the destination to those generated by the CBR sources; or a related metric received throughput in Kb/sec received at the destination. (ii) Average end-to-end delay of data packets this includes all possible delays caused by buffering during route discovery, queuing delay at the interface, retransmission delays at the MAC, propagation and transfer times; (iii) Normalized overhead the total number of overhead packets including the routing and MAC control packets (e.g., RTS, CTS, ACK) transmitted for each delivered data packet. Each hop-wise transmission of these packets is counted as one transmission. All overhead packets are considered since routing packets alone do not completely account for the overheads incurred by using stale routes. We do not consider route discovery latency since it does not provide useful insight regarding the effectiveness of a caching strategy. For example, a source might receive an invalid route faster from a closer node than a valid route from another node farther away. Thus, a smaller route discovery latency does not necessarily imply that a particular caching strategy is effective. The above metrics evaluate the performance of the routing protocol. However, since we are interested in cache performance, we also use the following two cache-related metrics to evaluate the correctness of route caches: (i) Percentage of good replies percentage of route replies received at the sources that contain a broken link. This metric captures the quality of the cached route replies and has been used in earlier studies[11, 7]; (ii) Percentage of invalid cached routes percentage of the total number of cache hits that result in invalid or stale routes. Smaller value for this metric is desired as the usage of invalid routes incur additional overheads and also cause cache pollution. These two metrics evaluate the effectiveness of a caching strategy to purge stale entries from route caches. Note that a lower percentage of invalid cached routes as well as a higher percentage of good replies are required for the best overall cache performance. 4.3 Simulation Results We present three sets of simulation results. In the first set, we evaluate the effect of various timeout periods on the
5 Packet delivery fraction Avg. delay (sec) Normalized overhead No Timeout 0.7 Static Timeout Adaptive Timeout Timeout period (sec) (a) Packet delivery fraction No Timeout Static Timeout Adaptive Timeout Timeout period (sec) (b) Average delay No Timeout Static Timeout Adaptive Timeout Timeout period (sec) (c) Normalized overhead Figure 1. Performance metrics for different timeout periods. performance and the next two sets of results study the effect of mobility and load on different caching strategies. Fig. 1 shows the packet delivery fraction, average delay and normalized overheads for various static timeout values ranging from 1 to 50 seconds. These results correspond to a pause time of 0 seconds (constant mobility) and a fixed packet rate of 3 packets/sec. The performance of the base DSR (no timeout) and the adaptive timeout mechanism are also shown. As expected, the performance with very small timeout of 1 second is significantly worse, worse than without any timeout! Performance of all the three metrics improves with increase in timeout period till 10 seconds (which is the optimal timeout period for this network) and drops later with further increase in timeout periods. performs worse in all cases except when timeout is too small. Performance of the adaptive timeout selection is similar to that with a well chosen static timeout period and its effectiveness is thus validated. In the rest of the performance comparisons, we show results only for the adaptive timeout selection when considering the timer-based route expiry technique. We now study the performance of the three caching techniques (see section 3) as a function of mobility. Pause time is varied between 0 seconds and 500 seconds. Note that pause time of 0 seconds indicates constant mobility while a pause time of 500 seconds means no mobility. Packet rate is fixed at 3 packets/sec as before. We look at the performance of DSR with wider errors, adaptive route expiry and negative caches independently in comparison with the base DSR. We also consider the variant of DSR with all three techniques combined (referred to as in the plots). Fig. 2 shows the delivery fraction, delay and overheads with varying pause times. DSR performs worse in all metrics in comparison with the other variants except at high pause times while delivers superior performance overall. At constant mobility, in particular, gives an improvement of about 16% and 22% in packet delivery and overheads respectively and about 40% reduction in the average delay. These performance improvements show that the combination of the three techniques are able to effectively remove stale cache entries. Still at most 85% of the packets are delivered at lower pause times. This fact is justified to a large extent given the very high rate of link breaks at low pause times and the fact that majority of the packet losses are due to the packets dropped at the intermediate nodes for lack of a route. Recall that in the DSR model we used, only traffic sources buffer packets and a packet is dropped at the intermediate node if the source route in the packet breaks and there is no alternate route in the local cache to salvage from. Among the three caching techniques, when taken independently, adaptive route expiry shows the most improvement in performance while negative caches gives the least
6 Packet delivery fraction Avg. delay (sec) Pause time (sec) (a) Packet delivery fraction Pause time (sec) (b) Average delay Protocol Good Invalid Replies (%) Routes (%) Adaptive Route Expiry Figure 3. Cache-related metrics for different caching techniques. benefit and wider errors performance lies in between. The performance of negative caches is as expected since they try to prevent cache pollution which is prevalent only at high data rates. About the relative performance of wider errors and adaptive route expiry, the former removes only entries containing broken links discovered via link layer feedback while the latter through its proactive mechanism can also remove unused stale route entries. Table 3 shows the behavior of different techniques in terms of cache-related metrics corresponding to the results for the pause time of 0 seconds shown in Fig. 2. Cache performance of different protocol variations show similar relative behavior as before. Effect of load on various caching strategies at constant mobility is shown in Fig 4. As before, outperforms the base DSR and the performance of the individual techniques lie in between these two extremes. Normalized overhead Pause time (sec) (c) Normalized overhead Figure 2. Performance metrics with varying pause times (mobility). 5 Related Work A few performance studies have looked at the effects of route caches on DSR s performance. Maltz et al[11] evaluated the benefit of replies from caches on the route discovery latency and routing overhead. In their simulation scenarios, they found the cache hit rates to be around 55%. They argued that this low hit rate was consistent with the on-demand philosophy of maintaining only routes which are needed. They also observed that the percentage of good replies to be around 59% in a 50 node network. Since the packet delivery ratios in their scenarios were above 90%, they claimed that despite having low percentage of good cache replies, the route maintenance in DSR was able to cope up and deliver good performance. However, later performance studies have indicated that this is not always the case. Performance impact of stale routes is largely dependent on the type of traffic (e.g., TCP), load in the network, network size etc. For instance, it was shown in [6, 7] that stale routes in DSR can significantly degrade TCP performance. For a single TCP connection they
7 Throughput (Kbits/sec) Avg. delay (sec) Normalized overhead Offered load (Kbits/sec) (a) Throughput Offered load (Kbits/sec) (b) Average delay Offered load (Kbits/sec) (c) Normalized overhead Figure 4. Performance metrics with increasing offered load. even found the TCP throughput to be much better without replies from caches. Mechanisms similar to those studied in this paper like suitable timeouts, negative caches etc were suggested to overcome stale route problem in DSR[6]. Similar observations were made in [3], where the authors noted that the lack of mechanisms to determine the freshness of routes and the absence of cache expiry mechanisms were important factors for the poor performance of DSR in large networks and in high load situations. More recently, the effects of cache structure, cache capacity, cache timeouts and mobility patterns on the performance of DSR were studied in [8]. Main difference between our work and [8] is that we focus on the performance impact of cache correctness in DSR while they put more emphasis on the cache organization. The performance of DSR using a range of timeout values were studied and an observation similar to ours was made i.e., well-tuned static timers perform as well as those with adaptive timers. The route expiry mechanism they investigated differs from our technique in the underlying cache structure. They used an expiry mechanism based on link caches, while our scheme uses a path cache 1 used in [2]. 6 Conclusions Most of the on-demand protocols for mobile ad hoc networks employ some form of route caching to reduce route discovery latency as well as the routing overhead. In dynamic ad hoc networks, route changes can occur frequently due to node mobility. Unless route caches adapt well to the frequent route changes, they may affect performance adversely. We used Dynamic Source Routing Protocol (DSR) to study the effect of cache correctness on the performance of routing protocol. This work was motivated by prior studies that observed performance degradation of DSR due to stale caches. DSR is a good candidate protocol to study caching strategies as it uses route caching aggressively. However, we expect any other protocol that uses caching moderately also to benefit from our study. An example is AODV[13] that uses caching indirectly when intermediate nodes generate route replies. We evaluated three techniques to improve caching performance in DSR namely wider error notification, route expiry mechanism with adaptive timeout selection and negative caches. The techniques primarily focus on effective removal of stale cache entries and preventing cache pollution. Our simulation results show that the combination of these techniques improve the packet delivery by about 15% at high mobility relative to the base DSR and consistently outperform the base DSR in terms of average delay and 1 Link caches store a set of individual links, organized as a graph data structure. In contrast, path caches store a set of complete paths (sequence of links), each starting at the caching node.
8 overheads. A significant improvement (around 70%) in the quality of cache replies is also achieved by these techniques. Our future work will concentrate on modifying the caching model in DSR so that the relative freshness of cached routes can be determined. We will also explore the possibility of incorporating techniques proposed in this paper to other ondemand routing protocols. Acknowledgements [12] V. D. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In Proceedings of IEEE INFOCOM 97 Conf., April [13] C. E. Perkins and E. M. Royer. Ad hoc on-demand distance vector routing. In Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages , Feb [14] B. Tuch. Development of WaveLAN, an ISM band wireless LAN. AT&T Technical Journal, 72(4):27 33, July/Aug This work is partially supported by NSF CAREER grant ACI , NSF Networking research grant ANI , and Ohio Board of Regents computing research enhancement funds in University of Cincinnati. We would also like to thank the reviewers for their comments. References [1] J. Broch, D. Johnson, and D. Maltz. The dynamic source routing protocol for mobile ad hoc networks. Oct IETF Internet Draft (work in progress). [2] J. Broch, D. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of IEEE/ACM MO- BICOM 98, pages 85 97, October [3] S. R. Das, C. E. Perkins, and E. M. Royer. Performance comparison of two on-demand routing protocols for ad hoc networks. In Proceedings of the IEEE INFOCOM 2000 Conference, March [4] I. S. Department. Wireless LAN medium access control (MAC) and physical layer (PHY) specifications, IEEE standard , [5] K. Fall and K. V. (Eds.). ns notes and documentation, available from [6] G. Holland and N. H. Vaidya. Analysis of TCP performance over mobile ad hoc networks. In Proceedings of IEEE/ACM MOBICOM 99, pages , Seattle, August [7] G. Holland and N. H. Vaidya. Impact of routing and link layers on TCP performance in mobile ad hoc networks. In Proceedings of the IEEE WCNC 1999, September [8] Y.-C. Hu and D. Johnson. Caching strategies in on-demand routing protocols for wireless ad hoc networks. In Proceedings of IEEE/ACM MOBICOM 00, pages , August [9] P. Johansson, T. Larsson, N. Hedman, and B. Mielczarek. Routing protocols for mobile ad-hoc networks - a comparative performance analysis. In Proceedings of IEEE/ACM MOBICOM 99, pages , August [10] D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks. In T. Imielinski and H. Korth, editors, Mobile computing, chapter 5. Kluwer Academic, [11] D. Maltz, J. Broch, J. Jetcheva, and D. Johnson. The effects of on-demand behavior in routing protocols for multi-hop wireless ad hoc networks. IEEE Journal on Selected Areas in Communication, 17(8), August 1999.
AODV-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 Comparison of Two On-demand Routing Protocols for Ad Hoc Networks Λ
Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks Λ Samir R. Das Dept. of ECECS University of Cincinnati Cincinnati, OH 4522 Elizabeth M. Royer Dept. of ECE University of California,
More informationIN a mobile ad hoc network, nodes move arbitrarily.
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 5, NO. 6, JUNE 2006 609 Distributed Cache Updating for the Dynamic Source Routing Protocol Xin Yu Abstract On-demand routing protocols use route caches to make
More informationPerformance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point Mobility Model
American Journal of Applied Sciences 5 (6): 659-664, 2008 ISSN 1546-9239 2008 Science Publications Performance Comparison of Two On-demand Routing Protocols for Ad-hoc Networks based on Random Way Point
More informationDYNAMIC ROUTES THROUGH VIRTUAL PATHS ROUTING FOR AD HOC NETWORKS
DYNAMIC ROUTES THROUGH VIRTUAL PATHS ROUTING FOR AD HOC NETWORKS Abdulrahman H. Altalhi Computer Science Department University of New Orleans New Orleans, LA, 70148 USA Golden G. Richard, III Abstract
More informationA Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
A Graph-based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks Gunyoung Koh, Duyoung Oh 1 and Heekyoung Woo 2 1 School of Electrical Engineering and Computer Science Seoul National University,
More informationPerformance Analysis of Three Routing Protocols for Varying MANET Size
Proceedings of the International MultiConference of Engineers and Computer Scientists 8 Vol II IMECS 8, 9- March, 8, Hong Kong Performance Analysis of Three Routing Protocols for Varying MANET Size N Vetrivelan,
More informationPerformance Comparison of Ad Hoc Routing Protocols over IEEE DCF and TDMA MAC Layer Protocols
Performance Comparison of Ad Hoc Routing Protocols over IEEE 82.11 DCF and TDMA MAC Layer Protocols Govind. P. Gupta Computer Science Department R.K.G.I.T, Ghaziabad (India) er_gpgupta@yahoo.com A. K.
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 informationGateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario
Gateway Discovery Approaches Implementation and Performance Analysis in the Integrated Mobile Ad Hoc Network (MANET)-Internet Scenario K.Gautham 1, Nagajothi A 2 Student, Computer Science and Engineering,
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 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 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 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 informationEfficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks
Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent Wong and Victor Leung Department of Electrical and Computer Engineering The University of British Columbia 56
More informationAnalysis of TCP and UDP Traffic in MANETs. Thomas D. Dyer Rajendra V. Boppana CS Department UT San Antonio
Analysis of TCP and UDP Traffic in MANETs Thomas D. Dyer Rajendra V. Boppana CS Department UT San Antonio MANET Routing Protocols Proactive protocols Maintain routes to all nodes Distance vector, link
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 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 informationSimulation Based Performance Analysis of Routing Protocols Using Random Waypoint Mobility Model in Mobile Ad Hoc Network
Global Journal of Computer Science and Technology Volume 11 Issue 1 Version 1.0 February 2011 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online
More informationA Reliable Route Selection Algorithm Using Global Positioning Systems in Mobile Ad-hoc Networks
A Reliable Route Selection Algorithm Using Global Positioning Systems in Mobile Ad-hoc Networks Won-Ik Kim Radio Performance Analysis Section Electronics & Telecommunications Research Institute 161 Kajong-dong,
More informationMinimizing the Routing Delay in Ad Hoc Networks through Route-Cache TTL Optimization
Minimizing the Routing Delay in Ad Hoc Networks through Route-Cache TTL Optimization Ben Liang and Zygmunt J. Haas School of Electrical and Computer Engineering, Cornell University, Ithaca, NY 14853, USA
More informationA Distributed Adaptive Cache Update Algorithm for the Dynamic Source Routing Protocol
A Distributed Adaptive Cache Update Algorithm for the Dynamic Source Routing Protocol Xin Yu and Zvi M. Kedem Department of Computer Science Courant Institute of Mathematical Sciences New York University,
More informationIN a wireless ad hoc network, individual mobile nodes
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 17, NO. 8, AUGUST 1999 1439 The Effects of On-Demand Behavior in Routing Protocols for Multihop Wireless Ad Hoc Networks David A. Maltz, Josh Broch,
More informationImproving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness Xin Yu Department of Computer Science Courant Institute of Mathematical Sciences New York University,
More informationIMPACT OF MOBILITY SPEED ON PROACTIVE AND REACTIVE ROUTING PROTOCOLS IN MOBILE ADHOC NETWORKS
IMPACT OF MOBILITY SPEED ON PROACTIVE AND REACTIVE ROUTING PROTOCOLS IN MOBILE ADHOC NETWORKS E. Gnanamanoharan and R. Bensraj Department of Electrical Engineering, Annamalai University, Tamil Nadu, India
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 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 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 informationRouting 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 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 informationDynamic Load-Aware Routing in Ad hoc Networks
Dynamic Load-Aware Routing in Ad hoc Networks Sung-Ju Lee Internet & Mobile Systems Labs Hewlett-Packard Laboratories Palo Alto, CA 9434-6 sjlee@hpl.hp.com Mario Gerla Computer Science Department University
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 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 informationEfficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks
Efficient On-Demand Routing for Mobile Ad-Hoc Wireless Access Networks Joo-Han Song, Vincent W. S. Wong and Victor C. M. Leung Department of Electrical and Computer Engineering The University of British
More informationDynamic Source Routing in ad hoc wireless networks
Dynamic Source Routing in ad hoc wireless networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University In Mobile Computing, vol. 353, chapter 5, T. Imielinski and H.
More informationPoonam kori et al. / International Journal on Computer Science and Engineering (IJCSE)
An Effect of Route Caching Scheme in DSR for Vehicular Adhoc Networks Poonam kori, Dr. Sanjeev Sharma School Of Information Technology, RGPV BHOPAL, INDIA E-mail: Poonam.kori@gmail.com Abstract - Routing
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 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 Study of Bellman-Ford, DSR and WRP Routing Protocols with Respect to Performance Parameters for Different Number of Nodes
A Study of Bellman-Ford, DSR and WRP Routing Protocols with Respect to Performance Parameters for Different Number of Nodes Ruchi Khandelwal 1 & Akhilesh Kosta 2 Department of Computer Science and Engineering
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 informationPerformance Comparison of MANETs Routing Protocols for Dense and Sparse Topology
2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Performance Comparison of MANETs Routing Protocols for Dense and Sparse
More informationPerformance Evaluation of Route Failure Detection in Mobile Ad Hoc Networks
Performance Evaluation of Route Failure Detection in Mobile Ad Hoc Networks Dimitri Marandin 4. Würzburger Workshop "IP Netzmanagement, IP Netzplanung und Optimierung" 27.-28. July 2004 www.ifn.et.tu-dresden.de/tk/
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 informationEfficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks
Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,
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 informationDSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks
DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks David B. Johnson David A. Maltz Josh Broch Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213-3891
More informationVolume 3, Issue 6, June 2015 International Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 6, June 2015 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com Analysis
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 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 information[Kamboj* et al., 5(9): September, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY NOVEL REVIEW OF MANET ROUTING PROTOCOLS Nippun Kamboj*, Dr. Munishwar Rai Department of Computer Applications Maharishi Markandeshwar
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 informationPerformance Enhancement of Reactive on Demand Routing Protocol in Wireless Ad Hoc Network
Performance Enhancement of Reactive on Demand Routing Protocol in Wireless Ad Hoc Network V. P. Patil, K.T.Patil, A. R. Kharade & D. D.Gote Smt. Indira Gandhi College of Engineering, New Mumbai, India
More informationBRICS: A Building-block approach for analyzing RoutIng protocols in ad hoc networks - a Case Study of reactive routing protocols
BRICS: A Building-block approach for analyzing RoutIng protocols in ad hoc networks - a Case Study of reactive routing protocols Fan Bai, Narayanan Sadagopan, Ahmed Helmy Department of Electrical Engineering,
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 informationPERFORMANCE BASED EVALUATION OF DSDV, AODV AND DSR ROUTING PROTOCOLS IN MANET
Volume 1, Issue 4, 215 PERFORMANCE BASED EVALUATION OF, AND ROUTING PROTOCOLS IN MANET Ms Anuradha M.Tech, Suresh Gyan Vihar University Ms Savita Shivani Suresh Gyan Vihar University Abstract:A Mobile
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 informationPERFORMANCE BASED EVALUATION OF DSDV, AODV AND DSR ROUTING PROTOCOLS IN MANET
Suresh Gyan Vihar University, Jaipur Volume 2, Issue 2, 216 PERFORMANCE BASED EVALUATION OF, AODV AND ROUTING PROTOCOLS IN MANET Ms Anuradha M.Tech, Suresh Gyan Vihar University Ms Savita Shivani Suresh
More informationResearch Paper GNANAMANOHARAN ET AL., INTERNATIONAL JOURNAL OF ADVANCED ENGINEERING TECHNOLOGY E-ISSN
Research Paper PERFORMANCE ANALYSIS OF PROBABILISTIC BROADCAST ON DEMAND ROUTE DISCOVERY PROTOCOL FOR MOBILE AD HOC NETWORKS BASED ON NODE MOBILITY E.Gnanamanoharan 1, R.Bensraj 2 Address for Correspondence
More informationSecurity Scheme for Malicious Node Detection in Mobile Ad Hoc Networks
Security Scheme for Malicious Node Detection in Mobile Ad Hoc Networks Punit Rathod 1, Nirali Mody 1, Dhaval Gada 1, Rajat Gogri 1, Zalak Dedhia 1, Sugata Sanyal 2 and Ajith Abraham 3 1 Mumbai University,
More informationA NEW ENERGY LEVEL EFFICIENCY ISSUES IN MANET
A NEW ENERGY LEVEL EFFICIENCY ISSUES IN MANET K. ARULANANDAM 1 and Dr. B. PARTHASARATHY 2 1 Research scholar, Vinayaka Mission University, Salem, Tamilnadu 2 Dean, Mailam Engineering College, Tindivanam.
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 Josh Broch David A. Maltz David B. Johnson Yih-Chun Hu Jorjeta Jetcheva Computer Science Department Carnegie Mellon University
More informationVolume 2 No. 1 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.
The Beaconless Node Velocity-based Stable Path Routing Protocol for Unicasting and Multicasting in Mobile Ad hoc Networks Natarajan Meghanathan Jackson State University, Jackson, MS 39217, USA natarajan.meghanathan@jsums.edu
More informationBraving the broadcast storm: infrastructural support for ad hoc routing
Computer Networks 41 (2003) 687 706 www.elsevier.com/locate/comnet Braving the broadcast storm: infrastructural support for ad hoc routing Raghupathy Sivakumar a, *, Prasun Sinha b, Vaduvur Bharghavan
More informationG.Narasa Reddy, 2 A.Avanthi, 3 R.Prasanth Reddy 1
ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: Enhancing DSR Protocol Performance in Mobile Ad Hoc Networks
More informationPerformance Evaluation and Comparison of On-Demand Routing Protocols for Ad Hoc Networks: DSR, AODV, AOMDV, TORA
2666 Performance Evaluation and Comparison of On-Demand Routing Protocols for Ad Hoc Networks: DSR, AODV, AOMDV, TORA S.Nagalakshmi Research Scholar, Dept Of Information Science and Engineering,Dr AIT,
More informationImpact of Node Velocity and Density on Probabilistic Flooding and its Effectiveness in MANET
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. 12, December 2014,
More informationANewRoutingProtocolinAdHocNetworks with Unidirectional Links
ANewRoutingProtocolinAdHocNetworks with Unidirectional Links Deepesh Man Shrestha and Young-Bae Ko Graduate School of Information & Communication, Ajou University, South Korea {deepesh, youngko}@ajou.ac.kr
More informationOutline. CS5984 Mobile Computing. Taxonomy of Routing Protocols AODV 1/2. Dr. Ayman Abdel-Hamid. Routing Protocols in MANETs Part I
CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Part I Outline Routing Protocols for Ad hoc Networks Example of a reactive routing protocol AODV: Ad hoc On-demand
More informationOverhead Analysis of Query Localization Optimization and Routing
Overhead Analysis of Query Localization Optimization and Routing Wenzheng Xu School of Inform. Sci. and Tech. Sun Yat-Sen University Guangzhou, China phmble@gmail.com Yongmin Zhang School of Inform. Sci.
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 informationThe Performance Impact of Traffic Patterns on Routing Protocols in Mobile Ad Hoc Networks
The Performance Impact of Traffic Patterns on Routing Protocols in Mobile Ad Hoc Networks Himabindu Pucha School of Electrical and Computer Engineering Purdue University West Lafayette, IN 4797 hpucha@purdue.edu
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 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 informationA Performance Comparison of Multicast Routing Protocols In Ad hoc Networks
A Performance Comparison of Multicast Routing Protocols In Ad hoc Networks Hasnaa MOUSTAFA and Houda LABIOD ENST - INFRES Department - 46 Rue Barrault 75634 Paris cedex 3 Paris - France Tel: +33 ().45.8.74.36
More informationStudy of Route Reconstruction Mechanism in DSDV Based Routing Protocols
Study of Route Reconstruction Mechanism in DSDV Based Routing Protocols Sharma Shelja, Kumar Suresh and Rathy R. K. Department of CSE, FET, MRIU, Faridabad, India Email: sharma.shelja@gmail.com, enthusk@yahoo.com,
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 informationAdaptive local searching and caching strategies for on-demand routing protocols in ad hoc networks
Adaptive local searching and caching strategies for on-demand routing protocols in ad hoc networks Zhao Cheng, Wendi B. Heinzelman Department of Electrical and Computer Engineering University of Rochester
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 informationAn Extensive Simulation Analysis of AODV Protocol with IEEE MAC for Chain Topology in MANET
An Extensive Simulation Analysis of AODV Protocol with IEEE 802.11 MAC for Chain Topology in MANET V.K.Taksande 1, Dr.K.D.Kulat 2 1 Department of Electronics & Communication, Nagpur University Priyadarshini
More informationA Comparison of TCP Performance over Three Routing Protocols for Mobile Ad Hoc Networks Λ
A Comparison of TCP Performance over Three Routing Protocols for Mobile Ad Hoc Networks Λ Thomas D. Dyer Computer Science Division The Univ. of Texas at San Antonio San Antonio, TX 8249 tdyer@cs.utsa.edu
More informationMulticasting in Ad-Hoc Networks: Comparing MAODV and ODMRP
Multicasting in Ad-Hoc Networks: Comparing MAODV and ODMRP Thomas Kunz and Ed Cheng Carleton University tkunz@sce.carleton.ca Abstract. Multicasting can efficiently support a variety of applications that
More informationDead Reckoning in Mobile Ad Hoc Networks
Dead Reckoning in Mobile Ad Hoc Networks Aarti Agarwal Department of ECECS University of Cincinnati Cincinnati, OH 45221 Samir R. Das Computer Science Department SUNY at Stony Brook Stony Brook, NY 11794
More informationNode Density based Performance Analysis of Two Reactive Routing Protocols in Mobile Ad-hoc Networks
Node Density based Performance Analysis of Two Reactive Routing Protocols in Mobile Ad-hoc Networks Gurleen Kaur Walia 1, Charanjit Singh 2 1,2 UCoE Department, Punjabi University, Patiala, Punjab, India
More informationDynamic Source Routing in Ad Hoc Wireless Networks
Dynamic Source Routing in Ad Hoc Wireless Networks David B. Johnson David A. Maltz Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213-3891 dbj@cs.cmu.edu Abstract
More informationAppointed BrOadcast (ABO): Reducing Routing Overhead in. IEEE Mobile Ad Hoc Networks
Appointed BrOadcast (ABO): Reducing Routing Overhead in IEEE 802.11 Mobile Ad Hoc Networks Chun-Yen Hsu and Shun-Te Wang Computer Network Lab., Department of Electronic Engineering National Taiwan University
More informationThe Effects of Route Information Initialization on Two On-demand Routing Algorithms for wireless Ad Hoc Networks *
The Effects of Route Information Initialization on Two On-demand Routing Algorithms for wireless Ad Hoc Networks * Chunyue Liu Dept. of Computer Science, Graduate Center of City University of New York
More informationPerformance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks
Performance of Routing Protocols in Very Large-Scale Mobile Wireless Ad Hoc Networks Xin Zhang, George F. Riley Department of ECE Georgia Institute of Technology Atlanta, GA 3332-25 xinzhang, riley@ece.gatech.edu
More informationSecurity Scheme for Distributed DoS in Mobile Ad Hoc Networks
Security Scheme for Distributed DoS in Mobile Ad Hoc Networks Sugata Sanyal 1, Ajith Abraham 2, Dhaval Gada 3, Rajat Gogri 3, Punit Rathod 3, Zalak Dedhia 3 and Nirali Mody 3 1 School of Technology and
More informationAbstract 1.1. OVERVIEW
Operation of Dynamic Source Routing in Wireless Mobile Ad Hoc Networks Kestina Rai 1, Rubinder Kaur 2, Kanchan Aggarwal CSE/IT Department, PTU Chandigarh Engineering College, Landran(Punjab) cupids2@rediffmail.com,rubykhokhar@gmail.com
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 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 informationCache Timeout Strategies for on-demand Routing in MANETs
1 Cache Timeout Strategies for on-demand Routing in MANETs Sanlin Xu Kim Blackmore Haley Jones Department of Engineering, Australian National University, ACT 0200 {Sanlin.Xu, Kim.Blackmore, Haley.Jones}@anu.edu.au
More informationThroughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network
Throughput Analysis of Many to One Multihop Wireless Mesh Ad hoc Network Dr.S.Senthil Kumar,Assistant Professor, Dept of Electrical and Electronics Engineering, Government College of Engineering, Salem,India
More informationImplicit Source Routes for On-Demand Ad Hoc Network Routing
Implicit Source Routes for On-Demand Ad Hoc Network Routing Yih-Chun Hu yihchun@cs.cmu.edu Department of Computer Science Rice University Houston, TX 77005-1892 USA David B. Johnson dbj@cs.rice.edu http://www.monarch.cs.rice.edu/
More informationEnhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1
Enhancing the Performance of Mobile Ad Hoc Networks with the Aid of Internet Gateways 1 Shiv Mehra and Chansu Yu Department of Electrical and Computer Engineering Cleveland State University E-mail: {s.mehra,c.yu91}@csuohio.edu
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 informationPerformance Evaluation of AODV, DSR, DYMO & ZRP in Cost 231 Walfisch-Ikegami Path Loss Propagation Model
Page 2 Oeconomics of Knowledge, Volume 3, Issue 3, 3Q, Summer 2011 Performance Evaluation of AODV, DSR, DYMO & ZRP in Cost 231 Walfisch-Ikegami Path Loss Propagation Model Rachit JAIN Department of Electronics
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 informationExploring the Behavior of Mobile Ad Hoc Network Routing Protocols with Reference to Speed and Terrain Range
Exploring the Behavior of Mobile Ad Hoc Network Routing Protocols with Reference to Speed and Terrain Range Asha Ambhaikar and Lokesh Kumar Sharma Abstract a mobile ad hoc network is a collection of autonomous
More information