P. Morin, Online routing in Geometric Graphs, Ph.D. thesis, Carleton University School of Computer Science, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Localized Routing for Wireless Ad Hoc Networks - Li, Wang, Frieder (Correct)
....node v as forwarding #. GREEDY COMPASS(GCMP) Node u nds the neighbors v 1 and v 2 that forms the smallest clockwise and counterclockwise angle respectively among all N 1 (u) with the segment ut. The packet is forwarded to the node of v 1 , v 2 with the minimum distance to t. See [15] [26] v u v 2 v 1 v u Compass Random Compass Greedy u v a a v Most Forwarding Nearest Neighbor Farthest Neighbor Fig. 1. Various localized routing methods. Shaded area is empty of nodes. The compass routing, random compass routing and the greedy routing guarantee to deliver the packets if ....
....u v a a v Most Forwarding Nearest Neighbor Farthest Neighbor Fig. 1. Various localized routing methods. Shaded area is empty of nodes. The compass routing, random compass routing and the greedy routing guarantee to deliver the packets if Del is used as network topology [9] 17] Morin [26] proved that: 1) the greedy routing guarantees the delivery of the packets if the underlying structure is Del ; 2) the compass routing guarantees the delivery of the packets if the regular triangulation is used as the underlying structure. 3) the greedy compass routing works for all ....
[Article contains additional citation context not shown here]
P. Morin, Online routing in Geometric Graphs, Ph.D. thesis, Carleton University School of Computer Science, 2001.
Quality Guaranteed Localized Routing for Wireless Ad Hoc Networks - Li, Wang (Correct)
No context found.
P. Morin, Online routing in Geometric Graphs, Ph.D. thesis, Carleton University School of Computer Science, 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