J.J.Garcia Luna-Aceves and M. Spohn, "Source-Tree Routing in Wireless Networks," in Proc. of IEEE ICNP99, November 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....about STAR is that it can adopt Least Overhead Routing Approach (LORA) Compared with Optimal Routing Approach (ORA) In order to save bandwidth, LORA does not guarantee shortest paths. This property is especially meaningful to ad hoc networks whose topologies change frequently ( 1] 3] 4] [5], 9] 10] The goals of this project include: 1. Study the characteristics and performance of STAR by simulation; 2. Analyze the simulation results, comparing with other typical routing protocols; The simulation tool used is PARSEC provided by UCLA parallel lab. There is a wireless network ....

....neighbor detection packets present in other protocols. The basic mechanisms of DSR deal with 3 Route Discovery and Route Maintenance. DSR and AODV were reported as among the most ecient on demand protocols. 2. Simulation scenarios (a) Node density and environmental parameters Based on [2] and [5], I choose 20 nodes running in an area of 5000m 3000m. Power range at physical layer is 250m. Bandwidth is 2Mb sec. The duration of each simulation is 900 second. b) Mobility patterns Nodes in the simulation move according to a pattern called random waypoint . Each node begins thesimulation by ....

J.J.Garcia-Luna-Aceves and M.Spohn. Source-Tree Routing in Wireless Networks. Proceedings of 7th International Conference on Network Protocols, 1999.

....dis S R R R R R Join Reply Join Query Figure 1. On demand procedure for membership setup and maintenance. tance vector algorithm (e.g. Wireless Routing Protocol (WRP) 32] or link state algorithm (e.g. Adaptive Link State Protocol (ALP) 16] or Source Tree Adaptive Routing (STAR) [15]) is required for CAMP to operate. Core nodes are used to limit the traffic required when a node joins a multicast group. The remainder of the paper is organized as follows. Section 2 illustrates the protocol in detail. Protocol performance improvements using mobility prediction are introduced in ....

J.J. Garcia-Luna-Aceves and M. Spohn, "Source-Tree Routing in Wireless Networks," Proceedings of IEEE ICNP'99, Toronto, Canada, Nov. 1999, pp. 273-282.

....(LRR) 131] and the protocol by Lin and Liu [100] Second, there are protocols that are based on link state [108, 110] algorithms. Protocols such as Global State Routing (GSR) 28] Fisheye State Routing (FSR) 123] Adaptive Link State Protocol (ALP) 53] Source Tree Adaptive Routing (STAR) [52], Optimized Link State Routing (OLSR) protocol [63] and Landmark Ad Hoc Routing (LANMAR) 124] fall into this category. Third, there are on demand routing protocols [105] that are proposed for ad hoc networks only. On demand routing protocols do not maintain route to each destination of the ....

....updates in the event of a change in link status, they are not well suited for mobile networks. A network composed of moderately moving nodes will result in a high number of triggered updates, consuming bandwidth and making route convergence difficult, if not impossible. The protocols described in [18, 52, 70, 114, 123, 127, 150] each present a modified version of one of these protocols. For instance, 70] 123] and [150] each utilize a prioritized connectivity information exchange algorithm, whereby information about parts of the network more distant from the sending node is sent less frequently than information about ....

J.J. Garcia-Luna-Aceves and M. Spohn, "Source-Tree Routing in Wireless Networks," Proceedings of the IEEE International Conference on Network Protocols (ICNP), Toronto, Canada, October, 1999, pp. 273-282.

....isolate these nodes from within the actual routing protocol for the network. However, this would add signi cant complexity to protocols whose behavior must be very well de ned. In fact, current versions of mature ad hoc routing algorithms, including DSR [12] AODV [7] TORA [5] DSDV [19] STAR [9], and others [16] only detect if the receiver s network interface is accepting packets, but they otherwise assume that routing nodes do not misbehave. Although trusting all nodes to be well behaved increases the number of nodes available for routing, it also admits misbehaving nodes to the ....

J.J. Garcia-Luna-Aceves and M. Spohn. Source-Tree Routing in Wireless Networks. In Proceedings IEEE ICNP 99: 7th International Conference on Network Protocols, Toronto, Canada, October 31November 3, 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. The MPDA protocol presented in [8] is also a link state protocol based on partial topology ....

J.J.Garcia Luna-Aceves and M. Spohn, "Source-Tree Routing in Wireless Networks," in Proc. of IEEE ICNP99, November 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