| Y. C.Hu and D. B. Johnson, "Implicit Source Routing in On-Demand Ad Hoc Network Routing," In ACM MOBIHOC 2001. |
No context found.
Yih-Chun Hu and David B. Johnson. Implicit Source Routing in On-Demand Ad Hoc Network Routing. In Proceedings of the Second Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001.
No context found.
Yih-Chun Hu and David B. Johnson. Implicit Source Routing in On-Demand Ad Hoc Network Routing. In Proceedings of the Second Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001.
No context found.
Yih-Chun Hu and David B. Johnson. Implicit Source Routing in On-Demand Ad Hoc Network Routing. In Proceedings of the Second Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001.
....link from its Route Cache; for subsequent packets to this destination, the sender may use any other route to that destination in its Cache, or it may attempt a new Route Discovery for that target if necessary. The DSR protocol also defines a number of optimizations to these mechanisms (e.g. [18, 19, 26, 27, 28, 32]) Some of these optimizations are relatively easy to secure; for example, flow state [19] requires only broadcast authentication of control messages, whereas link state caching [18] requires some mechanism to authenticate links, whereas Ariadne only attempts to authenticate nodes. In this paper, ....
....to that destination in its Cache, or it may attempt a new Route Discovery for that target if necessary. The DSR protocol also defines a number of optimizations to these mechanisms (e.g. 18, 19, 26, 27, 28, 32] Some of these optimizations are relatively easy to secure; for example, flow state [19] requires only broadcast authentication of control messages, whereas link state caching [18] requires some mechanism to authenticate links, whereas Ariadne only attempts to authenticate nodes. In this paper, we secure only a basic version of DSR, with a limited path cache) without these ....
Yih-Chun Hu and David B. Johnson. Implicit Source Routing in On-Demand Ad Hoc Network Routing. In Proceedings of the Second Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001.
....link from its Route Cache; for subsequent packets to this destination, the sender may use any other route to that destination in its Cache, or it may attempt a new Route Discovery for that target if necessary. The DSR protocol also defines a number of optimizations to these mechanisms (e.g. [17, 18, 25, 26, 27, 31]) Some of these optimizations are relatively easy to secure; for example, flow state [18] requires only broadcast authentication of control messages, whereas link state caching [17] requires some mechanism to authenticate links, whereas Ariadne only attempts to authenticate nodes. In this paper, ....
....to that destination in its Cache, or it may attempt a new Route Discovery for that target if necessary. The DSR protocol also defines a number of optimizations to these mechanisms (e.g. 17, 18, 25, 26, 27, 31] Some of these optimizations are relatively easy to secure; for example, flow state [18] requires only broadcast authentication of control messages, whereas link state caching [17] requires some mechanism to authenticate links, whereas Ariadne only attempts to authenticate nodes. In this paper, we secure only a basic version of DSR, with a limited path cache) without these ....
Yih-Chun Hu and David B. Johnson. Implicit Source Routing in On-Demand Ad Hoc Network Routing. In Proceedings of the Second Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001.
....a continuously moving multihop wireless ad hoc network, using off the shelf Microsoft Windows NetMeeting [26] audio and video software. Since our implementation and demonstration of these mechanisms at the GloMo PI meeting, some simulation results have been shown for these and simular mechanisms [8, 10], but we report here on the first and we believe currently only implementation of these mechanisms; this work thus represents the only experimental results showing the effectiveness of these mechanisms in a real mobile ad hoc network. II. SUMMARY OF THE DSR PROTOCOL We developed our support for ....
....present in the header of each DSR packet could represent considerable total overhead. In addition, we would like to be able to differentiate packets belonging to real time multimedia flows and ordinary data packets. We have designed a general mechanism called flow state to support these goals [10]. We provide a summary of the basic flow state mechanism here. With flow state, most DSR packets do not contain a source route header. Once a node sending a packet to some destination has discovered a source route to that destination, the node sends the packet as a normal DSR packet containing the ....
[Article contains additional citation context not shown here]
Yih-Chun Hu and David B. Johnson. Implicit Source Routing in On-Demand Ad Hoc Network Routing. In Proceedings of the Second Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001.
....overhead needed for security. DSR divides the routing problem into two parts: Route Discovery and Route Maintenance. In this section, we describe the basic form of Route Discovery and Route Maintenance in DSR. The DSR protocol also defines a number of optimizations to these mechanisms [32, 37, 38, 39, 44], but the use of these optimizations is beyond the scope of this paper. In this paper, we thus secure only a basic version of DSR. In DSR, when a node has a packet to send to some destination and does not currently have a route to that destination in its Route Cache, the node initiates a Route ....
Yih-Chun Hu and David B. Johnson. Implicit source routing in on-demand ad hoc network routing. In Proceedings of the Second Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2001.
No context found.
Y. C.Hu and D. B. Johnson, "Implicit Source Routing in On-Demand Ad Hoc Network Routing," In ACM MOBIHOC 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