Lee S. J., M. Gerla, and C. K. Toh, "A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks," IEEE Network, pp.48-54, July 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....as reactive [2] 4] 11] 10] 12] 13] Within the same category, the detailed mechanisms of the protocols vary. Extensive research has been done to compare and explain the differences of various routing protocols at the whole protocol level through simulation or intuitive analysis [14] [15] [16] 17] This helped us to rank protocols according to their performance and distinguish the pros and cons of each protocol. But the impact of the fine grained functionality on the whole protocol remains unknown. We propose a methodology to systematically compare and explain the commonalities ....

....work has been done to compare the performance of MANET routing protocols and explain the difference based on the building block behavior. However, we draw inspiration from some related work in this area. Extensive work has been done to compare the performance of several routing protocols by [14] [15], 16] and [17] Their focus has been comparison of routing protocol mechanisms and the explanation of the difference between various protocols at the whole protocol level. In [18] several design choices of DSR were carefully analyzed through simulations and some important observations were ....

S-J. Lee, M. Gerla, and C-K. Toh.A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network,vol. 13, no. 4, Jul/Aug 1999, pp. 48-54.

....statistics including the PDFs of link and path duration across several mobility models. 2.3 Reactive Protocols: In this paper, we focus on evaluating the reactive MANET routing protocols like DSR and AODV. There have been several studies to compare both proactive and reactive routing protocols. [11], 13] 2] 12] and [4] give a very good exposition of this subject. Here, we discuss the work that focus completely on reactive protocols. Johnson, Maltz, Broch, et al. proposed DSR in [2] while AODV was proposed by Perkins in [5] Maltz, Broch, Jetcheva and Johnson gave a very comprehensive ....

S.-J. Lee, M. Gerla, and C.-K. Toh.A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network,vol. 13, no. 4, Jul/Aug 1999, pp. 48-54.

....statistics including the PDFs of link and path duration across several mobility models. C. Reactive Protocols: In this paper, we focus on evaluating the reactive MANET routing protocols like DSR and AODV. There have been several studies to compare both proactive and reactive routing protocols. [11], 13] 2] 12] and [4] give a very good exposition of this subject. Here, we discuss the work that focus completely on reactive protocols. Johnson, Maltz, Broch, et al. proposed DSR in [2] while AODV was proposed by Perkins in [5] Maltz, Broch, Jetcheva and Johnson gave a very comprehensive ....

S.-J. Lee, M. Gerla, and C.-K. Toh.A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network,vol. 13, no. 4, Jul/Aug 1999, pp. 48-54.

....networks is a challenging problem, due to factors such as node mobility, limited wireless transmission range, wireless transmission interference, and changes in the wireless propagation environment. Many proposed ad hoc network routing protocols, including DSR [10] LAR [12] SSA [2] and ABR [13], operate on demand and use a route cache to choose routes; these protocols also use source routing, such that each node maintains a cache of all routes that it has previously discovered or overheard in other packets, and the sender of a packet chooses a route for each packet it wishes to send ....

....invalid links that have already been found to be broken. Other work has focused on reducing the number of links in the cache that entered the cache while the link was valid but have become invalid through network mobility [3] and also on preventing the discovery of links that are soon to expire [2, 4, 13]. Some previous work has used ad hoc techniques, such as limited lifetime negative cache information, to reduce the chance of spreading incorrect information [16] or through multipath routing, to increase the probability of successful delivery in the presence of failed links [18, 17] In this ....

[Article contains additional citation context not shown here]

Sung-Ju Lee, Mario Gerla, and Chai-Keong Toh. A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks. IEEE Network, 13(4):48--54, July 1999.

....Figure 4.2. 25] Most of the early proposals for ad hoc routing fall in the category of table driven routing protocols whereas on demand protocols include various solutions that are more sophisticated. A more thorough taxonomy for routing protocols is presented in [31] Several simulation studies [29, 30, 32, 33] have been carried out in order to compare the performance of both table driven and on demand protocols. On the average, on demand protocols have been found to perform better than table driven protocols, even though there are some scenarios where characteristics of a tabledriven solution ....

Lee S.-J., Gerla M. & Toh C.-K. (1999) A Simulation Study of TableDriven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Networks, Vol. 13, Issue 4, pp. 48-54.

....adaptive routing scheme to cope with the high rate of topology changes. This implies that the routing protocol should propagate topology changes and compute updated routes to the destination. In general, existing routing protocols can be classified as either: Table driven . On demand . Hybrid [1, 2] Table driven protocols attempt to continuously update the routes within the network so that when a packet needs to be forwarded, the route is already known and can immediately be used. The family of distance vector or link state algorithms are examples of table driven schemes. On the other hand, ....

S.-J. Lee, M. Gerla, and C.-K. Toh, "A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks," IEEE Network, July 1999.

....[21] 19] The on demand routing algorithms build or maintain only the routing paths that have changed and are needed to send the data packets currently in the network. Many performance comparisons done till now have shown that on demand algorithms perform better than proactive algorithms [1] [8], 11] and thus claimed as better suited for mobile and ad hoc environments. Based on the published results and our own analysis, we believe that a combination of proactive and on demand techniques are likely to perform better than either approach alone. So we This research has been partially ....

....number change, in contrast to DSDV. Unlike the constant routing overhead transmitted in DSDV, the routing load in ADV increases with increasing offered load thus demonstrating its adaptive capabilities. On demand protocols are preferred over DSDV because DSDV cannot handle high loads [1] [8], 11] Also its packet delivery rates are lower than AODV and DSR. But with ADV performing significantly better than DSDV, especially in sustaining higher loads and giving higher packet delivery rates, it will be interesting to compare it with on demand routing protocols like AODV and DSR. In the ....

S.Lee, Mario Gerla, and C.K.Toh, "A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks," in IEEE Network Magazine, Aug. 1999.

....University of Texas at San Antonio, San Antonio, Texas. E mail: #boppana,skonduru# cs.utsa.edu. changed and are needed to send the data packets currently in the network. Many performance comparisons done till now have shown that on demand algorithms perform better than proactive algorithms [1] [8], 11] and thus claimed as better suited for mobile and ad hoc environments. Based on the published results and our own analysis, we find that a combination of proactive and on demand techniques are likely to perform better than either approach alone. So we analyzed the well known DV routing and ....

....number change, in contrast to DSDV. Unlike the constant routing overhead transmitted in DSDV, the routing load in ADV increases with increasing offered load thus demonstrating its adaptive capabilities. On demand protocols are preferred over DSDV because DSDV cannot handle high loads [1] [8], 11] Also its packet delivery rates are lower than AODV and DSR. But with ADV performing significantly better than DSDV, especially in sustaining higher loads, giving higher packet delivery rates and lower packet latencies, it will be interesting to compare it with on demand routing protocols ....

S.Lee, Mario Gerla, and C.K.Toh, "A simulation study of tabledriven and on-demand routing protocols for mobile ad hoc networks, " in IEEE Network Magazine, Aug. 1999.

.... Our accomplishments, which are elaborated throughout this dissertation, can be broadly listed as follows: ffl Evaluated the routing performance of a traditional table driven algorithm (Bellman Ford) in ad hoc networks, and compared it with on demand protocols with different routing algorithms [87, 96]. ffl Studied and compared the simulation performance of various routing protocols in ad hoc networks [88] Our work is the first to perform a simulation study of various routing styles in a common realistic environment. ffl Performed simulations of up to 10,000 network nodes and evaluated ad ....

....reactive protocol LAR [78] and the location based proactive protocol DREAM [14] are simulated in a common wireless network simulation platform. In addition to routing protocols, we implemented a detailed and realistic model of the physical layer and medium access control protocols. Related works [23, 38, 68, 87] that also performed comparative evaluation of 31 ad hoc routing protocols can be found in the literature. However, these articles compared ranked protocols that are similar in style (e.g. on demand) and used only a single mobility model. These papers evaluate the single class of protocols using ....

[Article contains additional citation context not shown here]

S.-J. Lee, M. Gerla, and C.-K. Toh, "Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks," IEEE Network, vol. 13, no. 4, July/August 1999, pp. 48-54.

....does not require routing state maintenance. AMRoute [2] and AMRIS [14] are examples of proactive, tree based protocols. MAODV exemplifies a reactive, tree based protocol. 11 Performance of MANET Multicast Several studies have evaluated the performance of unicast routing protocols for MANETs [3, 5, 10, 9]. The only performance study of MANET multicast routing protocols was reported in [11] This comparative study analyzed five different protocols including ODMRP and flooding. It concluded that mesh based protocols in general, and ODMRP in particular, perform better than tree based approaches. As ....

S.J. Lee, , M. Gerla, and C.K. Toh. A simulation study of table-driven and on-demand routing protocols for mobile ad-hoc networks. IEEE Network, 13(4):48--54.

....performed. The com This work was funded in part by the Defense Advanced Research Projects Agency (DARPA) under contract DAAB07 97 C D321, as a part of the Global Mobile Information Systems (GloMo) program. parative analysis of ad hoc unicast routing protocols has been reported in [4] 6] 14] [20], but this paper is the first to conduct a performance comparison study of ad hoc wireless multicast protocols in a realistic common simulation environment. By using a detailed simulator, we provide quantitative performance analysis of five protocols with different characteristics: AMRoute [3] ....

....traffic growth in the presence of mobility. WRP s response to link breaks is not immediate, and can incorrectly deduce a link break in the presence of high network load. CAMP may perform better if it is modified so as to operate with an on demand routing protocol. As shown in [4] 6] 14] [20], on demand protocols performed favorably in terms of control packet overhead and response to mobility. If CAMP were able to leverage these advantages, it should dramatically improve its packet delivery ratio and control overhead. B. Related Works As of October 1999, only CAMP and ODMRP ....

S.-J. Lee, M. Gerla, and C.-K. Toh, "A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad-Hoc Networks," IEEE Network, vol. 13, no. 4, Jul. 1999, pp. 48-54.

No context found.

Lee S. J., M. Gerla, and C. K. Toh, "A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks," IEEE Network, pp.48-54, July 1999.

No context found.

S.J. Lee, , M. Gerla, and C.K. Toh. A simulation study of table-driven and on-demand routing protocols for mobile ad-hoc networks. IEEE Network, 13(4):48--54.

No context found.

S.J. Lee, , M. Gerla, and C.K. Toh. A simulation study of table-driven and on-demand routing protocols for mobile ad-hoc networks. IEEE Network, 13(4):48--54.

No context found.

S.-J. Lee, M. Gerla, and C.-K. Toh.A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network,vol. 13, no. 4, Jul/Aug 1999, pp. 48-54.

No context found.

S.-J. Lee, M. Gerla, and C.-K. Toh.A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network,vol. 13, no. 4, Jul/Aug 1999, pp. 48-54.

No context found.

S.-J. Lee, M. Gerla, and C.-K. Toh.A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network,vol. 13, no. 4, Jul/Aug 1999, pp. 48-54.

No context found.

Sung-Ju Lee, Mario Gerla, and Chai-Keong Toh, "A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks," IEEE Network, vol. 13, no. 4, pp. 48--54, July 1999.

No context found.

S.-J. Lee, M. Gerla, and C.-K. Toh.A Simulation Study of TableDriven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network,vol. 13, no. 4, Jul/Aug 1999, pp. 48-54.

No context found.

S.-J. Lee, M. Gerla, C.-K. Toh, A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks, IEEENEEBV' 13 (4) (1999) 48--54.

No context found.

S.-J. Lee, M. Gerla, and C.-K. Toh.A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks. IEEE Network,vol. 13, no. 4, Jul/Aug 1999, pp. 48-54.

No context found.

S.-J. Lee, M. Gerla, and C.-K. Toh, "A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks," vol. 13, no. 4, August 1999, pp. 48--54.

No context found.

S.-J. Lee, M. Gerla, and C.-K. Toh, \A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks," vol. 13, no. 4, August 1999, pp. 48-54.

No context found.

S.-J. Lee, M. Gerla, and C.-K. Toh, "A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks," vol. 13, no. 4, August 1999, pp. 48--54.

No context found.

Lee S. J.; Gerla M., "A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad-Hoc Networks," IEEE Network, 13(4): pp. 48-54, July 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC