S. Roy and J.J. Garcia-Luna-Aceves. Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks. INFOCOM 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... groups are actively using our extensions to support their own research on ad hoc networks, including groups at INRIA [1] The University of Illinois at Urbana Champaign [75, 103] Columbia University [8] the Swedish Institute of Computer Science [31] the University of California at Santa Cruz [97], Ericsson [8, 48] the University of Maryland at College Park [46] UCLA [67] Microsoft Research [108] the University of Pennsylvania, the University of Texas at Dallas, Texas A M, Nokia, Telcordia, and many others. 8.3. Metrics for Analyzing Protocols The metrics used in this thesis are not ....

Soumya Roy and J. J. Garcia-Luna-Aceves. Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks. In Proceedings of IEEE INFOCOM 2001.

No context found.

S. Roy and J.J. Garcia-Luna-Aceves. Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks. INFOCOM 2001.

No context found.

S. Roy and J.J. Garcia Luna Aceves. Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks . In Proc. IEEE Conference on Computer Communications (Infocom), pages 1172-1181, Anchorage, Alaska, April 22-26 2001.

No context found.

S. Roy and J. J. Garcia-Luna-Aceves, " Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks," Proc. IEEE INFOCOM 2001.

No context found.

S. Roy and J.J. Garcia Luna Aceves. Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks . In Proc. IEEE Conference on Computer Communications (Infocom), pages 1172-1181, Anchorage, Alaska, April 22-26 2001.

No context found.

Roy, S. and Garcia-Luna-Aceves, J. J. (2001). Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks. IEEE Infocom.

No context found.

S. Roy and J.J. Gracia Luna Aceves, "Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks ," in IEEE Infocom, Anchorage, Alaska, 2001.

....only by the failure of transmission of data packets over links, which implies route failure propagation will not improve by extended caching of netmarks, in which the basic idea is to maintain correct paths in absence of data traffic also. The source tree on demand adaptive routing (SOAR) [5] protocol is a link state routing protocol in which routers exchange minimal source trees in their control packets, consisting of the state of the links along the paths used by the routers to reach active (important) destinations. Implementing a network layer Hello mechanism at the netmarks is ....

....when a route is first found for the netmarks. B. Hybrid Routing based on SOAR We have chosen SOAR as the routing protocol to illustrate the benefits of node centric hybrid routing over on demand routing because of the following reasons : 1. SOAR has been shown to be more efficient than DSR [5] and our own results, presented in Sec. IV, show that SOAR completely outperforms AODV. 2. Modifications in SOAR to adopt hybrid routing are much simpler than in both DSR or AODV. The Netmark Enhanced Source Tree (NEST) routing protocol adopts the routing mechanisms of SOAR to maintain proactive ....

[Article contains additional citation context not shown here]

S. Roy and J.J. Gracia Luna Aceves, "Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks ," in IEEE Infocom, Anchorage, Alaska, 2001.

....have the information about failed routes. However as in AODV, anytime the route to a netmark is broken, the basic route discovery mechanism of DSR can be easily modified to send RREQs for netmarks, irrespective of the presence of traffic for them. The source tree on demand adaptive routing (SOAR) [8] protocol is a link state routing protocol in which routers exchange minimal source trees in their control packets. A minimal source tree consists of the state of the links along the paths used by the routers to reach active (important) destinations. Important destinations are active receivers, ....

....to all the nodes in the network when a route to a netmark is first discovered. 3 Hybrid Routing Using SOAR We have chosen SOAR as the basic routing protocol to illustrate the benefits of node centric hybrid routing over on demand routing because SOAR has been shown to be more efficient than DSR [8] and the results presented in Sec. 4 show that SOAR outperforms AODV. Furthermore, the modifications needed in SOAR to adopt hybrid routing are much simpler than the modifications required in DSR and AODV. e g f Source Tree advertised by e in SOAR Source Tree advertised Source Tree at e ....

[Article contains additional citation context not shown here]

S. Roy and J. J. Garcia-Luna-Aceves. Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks, 2001. IEEE Infocom.

.... to maintain routing tables efficiently in ad hoc networks (e.g. dynamic source routing (DSR) 1] ad hoc on demand distance vector (AODV) 2] routing, temporally ordered routing algorithm (TORA) 3] routing on demand acyclic multipath (ROAM) 4] source tree on demand adaptive routing(SOAR) [5]) In link state routing protocols, meant for mobile ad hoc networks, partial link state information, instead of complete linkstate information can be used for computation of paths to destinations, because all nodes need not have to compute paths to every other destination. Moreover, complete ....

....work has been done for exploring the use of link sate information on demand in routing. Most of the link state routing protocols that have been devised for mobile ad hoc networks are pro active, like OLSR [6] STAR [8] FSR [7] TBRPF [10] while the source tree on demand adaptive routing (SOAR) [5] is the only protocol reported to date that uses link state information on demand. The key idea in SOAR is for wireless routers to exchange minimal source trees, consisting of the state of the links that are in the paths used by the routers to reach only important destinations. Important ....

S. Roy and J.J. Garcia Luna Aceves, "Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks ," in IEEE Infocom, Anchorage, Alaska, 2001.

....node centric hybrid routing with purely on demand routing protocols. For our study, we use the ad hoc on demand distance vector routing (AODV) protocol [Perkins et al. 2002] the dynamic source routing (DSR) protocol[Johnson and Maltz, 1994] and the source tree on demand adaptive routing (SOAR) [Roy and Garcia Luna Aceves, 2001] protocol. Previous simulation studies [Roy a b c d e f g h i j k l m n o p q r s t netmark Figure 1. Figure showing an ad hoc network with a single netmark and Garcia Luna Aceves, 2001] Broch et al. 1998] Das et al. 2000] have reported the performance of on demand ....

....have the information about failed routes. However as in AODV, anytime the route to a netmark is broken, the basic route discovery mechanism of DSR can be easily modi ed to send RREQs for netmarks, irrespective of the presence of trac for them. The source tree on demand adaptive routing (SOAR) [Roy and GarciaLuna Aceves, 2001] protocol is a link state routing protocol in which routers exchange minimal source trees in their control packets. A minimal source tree consists of the state of the links along the paths used by the routers to reach active (important) destinations. Important destinations are active receivers, ....

[Article contains additional citation context not shown here]

Roy, S. and Garcia-Luna-Aceves, J. J. (2001). Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks. IEEE Infocom.

....algorithms based on distance vectors have been proposed in the literature ( 7] 8] 9] 11] 16] to name a few) However, with the exception of DASM[16] all of them are single path algorithms. A few routing algorithms have been proposed that use partial topology information (refer [6] [12] and the references therein) to eliminate the main limitation of topology broadcast algorithms; however, these algorithms are not loop free at every instant. Recently, we introduced MPDA [15] which is the first routing algorithm based on link state information that construct multipaths to each ....

S. Roy and J.J. Garcia-Luna-Aceves. Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks. INFOCOM

....algorithms based on distance vectors have been proposed in the literature ( 7] 8] 9] 11] 16] to name a few) However, with the exception of DASM[16] all of them are single path algorithms. A few routing algorithms have been proposed that use partial topology information (refer [6] [12] and the references therein) to eliminate the main limitation of topology broadcast algorithms; however, these algorithms are not loop free at every instant. Recently, we introduced MPDA [15] which is the first routing algorithm based on link state information that construct multipaths to each ....

S. Roy and J.J. Garcia-Luna-Aceves. Using Minimal Source Trees for On-Demand Routing in Ad Hoc Networks. INFOCOM 2001, 2001.

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