David A. Maltz. Resource Management in Multi-hop Ad Hoc Networks. Technical Report CMU-CS-00-150, School of Computer Science, Carnegie Mellon University, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Ensuring Cache Freshness in On-Demand Ad Hoc Network Routing.. - Hu, Johnson (2002) (3 citations) (Correct)
....If so, the epoch number is set to a special value (such as 0) and nodes hearing this link can cache it only if it does not conflict with a previously held broken link. The end to end delay estimates required by the protocol can be provided by the network, for example using QoS extensions to DSR [14]. It can also be chosen by multiplying a large factor (such as 10) times prior delay measurements to achieve a conservative estimate of the upper bound on end to end delay. Finally, in Section 3.4, we present a technique to provide hard guarantees on end to end delay in a wireless ad hoc network. ....
David A. Maltz. Resource Management in Multi-hop Ad Hoc Networks. Technical Report Technical Report CMU-CS-00150, CMU School of Computer Science, November 1999.
On-Demand Routing in Multi-hop Wireless Mobile Ad Hoc Networks - Maltz (2001) (2 citations) Self-citation (Maltz) (Correct)
....Aggregating information about the network topology at the source of each packet al..lows the node that cares most about the packet, namely its source, to expend the appropriate amount of effort to deliver the packet. It also enables the explicit management of the resources in the ad hoc network [70]. In some sense, DSR has an even stronger end to end philosophy than the Internet itself. Intermediate nodes in a DSR network maintain even less state than nodes in the core of the Internet, which must maintain up to date routing tables for all destinations in the network. Basing the routing ....
....are currently being tested by the packets flowing along them. Although DSR uses source routes, and each packet is routed based on a discovered source route, recent improvements to DSR have made it so that most packets do not need to incur the overhead of carrying an explicit source route header [16, 70]. This allows DSR to achieve the benefits of information aggregation, loop freedom, and source routing with out the significant overhead cost in terms of bytes shown in Section 5.4.1. 2.2. Route Discovery Route Discovery works by flooding a request through the network in a controlled manner, ....
[Article contains additional citation context not shown here]
David A. Maltz. Resource Management in Multi-hop Ad Hoc Networks. Technical Report CMU CS TR00-150, School of Computer Science, Carnegie Mellon University, November 1999. Available from http://www.monarch.cs.cmu.edu/papers.html.
Quantitative Lessons From a Full-Scale Multi-Hop Wireless.. - Maltz, Broch, Johnson (2000) (8 citations) Self-citation (Maltz) (Correct)
....with the entirely on demand nature of the protocol, eliminates the need for the periodic route advertisement and neighbor detection packets present in other protocols. Although DSR uses source routes, most packets do not need to incur the overhead of carrying an explicit source route header [3] [11]. The DSR protocol consists of two mechanisms: Route Discovery and Route Maintenance. Route Discovery is the mechanism by which a node S wishing to send a packet to a destination D obtains a source route to D. To reduce the cost of Route Discovery, each node maintains a Route Cache of source ....
....the network. The result is a burst of back to back packet arrivals at the destination when the partition heals. As an area for future research, more sophisticated packet handling algorithms might detect these delayed but timesensitive packets and drop them inside the network to conserve resources [11]. When the most extreme 2 of jitter samples are removed as outliers, the range of jitter drops to between 1:04 s and 1.02 s. The mean jitter is 0.001 s, and the standard deviation 0.143 s. Figure 3 shows the distribution of jitter samples using a histogram. The y axis is on a log scale for ....
David A. Maltz. Resource Management in Multi-hop Ad Hoc Networks. Technical Report CMU CS 00-150, School of Computer Science, Carnegie Mellon University, July 2000. Available from http://www.monarch.cs.cmu.edu/papers.html.
Securing Quality-of-Service Route Discovery in - On-Demand Routing For (Correct)
No context found.
David A. Maltz. Resource Management in Multi-hop Ad Hoc Networks. Technical Report CMU-CS-00-150, School of Computer Science, Carnegie Mellon University, 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