J.J.Garcia-Luna-Aceves and M. Spohn, "Source-Tree Routing in Wireless Networks", In Proc. IEEE ICNP 99, 7th Intl. Conf. On Network Protocols, Toronto, Canada, Oct 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....are exchanged periodically to reflect the changes in topological information. Popular proactive routing protocols for adhoc networks include the Destination Sequenced Distance Vector (DSDV) Protocol [3] the Wireless Routing Protocol [4] and the Source Tree Adaptive Routing (STAR) Protocol [5]. If on the other hand, reactive routing is used, a node would attempt to compute a route to a given destination when it needs to route data to that destination, i.e. on demand. Numerous on demand routing protocols have been proposed. Some of the on demand routing protocols are the Adaptive ....

J.J.Garcia-Luna-Aceves and M. Spohn, "Source-Tree Routing in Wireless Networks", In Proc. IEEE ICNP 99, 7th Intl. Conf. On Network Protocols, Toronto, Canada, Oct 1999.

....E mail: soumya,jj cse.ucsc.edu This work was supported in part by the Defense Research Projects Agency (DARPA) under grant F30602 97 2 0338 either by time outs or by ROUTE ERROR messages. Recently, a routing protocol based on partial topology information named STAR (source tree adaptive routing [7]) was proposed in which wireless routers communicate to their neighbors their source trees, i.e. the state of links in the preferred paths to all destinations. Although STAR has been shown to be as efficient as such on demand routing protocols as DSR [7] it requires each node to keep routing ....

....named STAR (source tree adaptive routing [7] was proposed in which wireless routers communicate to their neighbors their source trees, i.e. the state of links in the preferred paths to all destinations. Although STAR has been shown to be as efficient as such on demand routing protocols as DSR [7], it requires each node to keep routing information for all network destinations, which may be undesirable in very large ad hoc networks or networks in which battery life of nodes is at a premium. This paper presents the source tree on demand adaptive routing protocol (SOAR) which is an on demand ....

J.J.Garcia Luna-Aceves and M. Spohn, "Source-Tree Routing in Wireless Networks," in Proc. of IEEE ICNP99, November 1999.

....decreases. However, an update is sent when the distance to a destination increases, because this condition has the potential to cause a loop. Conditions A and B used in DST are also incorporated in BEST to prevent data packet looping. These rules are much simpler than those introduced in STAR [8] which uses the link state information in source trees, rather than distance and second to last hop information to a destination in the tree. V. PERFORMANCE EVALUATION We ran simulations for two different experimental scenarios to compare the average performance of DST, DSR and BEST. These ....

J.J. Garcia-Luna-Aceves and M. Spohn. Source-Tree Routing in Wireless Networks. In Proc. IEEE ICNP 99, 7th International Conference on Network Protocols, Toronto, Canada, 1999.

....the same or better delivery rates and average delays as DSR using either path caches or link caches. Perhaps, more importantly, NSR scales well for a large number of routers and varied data workload. The text of this dissertation includes material that has previously been published in [20] 21] [22], 23] 24] and [53] The co author listed in these publications directed and supervised the research which forms the basis for this dissertation. 5.2 Future Work One important area for future research is the optimization of local path computations. A major drawback of link state protocols is ....

J.J. Garcia-Luna-Aceves and M. Spohn. Source-Tree Routing in Wireless Networks. Proc. International Conference on Network Protocols, October 1999.

....a unicast update to m because m is its successor on the path to j. This follows from condition A. When m gets the update, it detects a loop and resets its distance to in nity, thus breaking the loop. The rules used in BEST to avoid permanent loops are much simpler than those introduced in STAR [9] which uses the link state information in source trees, rather than distance and second to last hop information to a destination in the tree. 5. PERFORMANCE EVALUATION We ran simulations for two di erent experimental scenarios to compare DST s average performance against the performance of DSR ....

....table driven routing protocols. Simple rules were introduced in DST for the use of source tracing on demand, and simple rules were introduced in BEST for the ecient use of source tracing within the context of table driven routing. The rules used in BEST are simpler than those introduced for STAR [9], which is the only other table driven routing protocol that has been shown to be as ecient as on demand routing protocols. Simulations were used to compare DST and BEST with DSR, which is one of the most ecient on demand routing protocols. The results showed that DST provides comparable average ....

J.J. Garcia-Luna-Aceves and M. Spohn. Source-Tree Routing in Wireless Networks. In Proc. IEEE ICNP 99, 7th International Conference on Network Protocols, Toronto, Canada, 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