(Enter summary)
Abstract: this paper we study local routing algorithms on geometric networks. Formally speaking, suppose that we want to travel from a vertex s to a vertex t of a geometric network. A routing algorithm is called a local routing algorithm if it satisfies the following conditions: (Update)
Cited by: More
Routing And Scheduling For Real-Time Data - Dissemination In Sensor
(Correct)
On a Conjecture Related to Geometric Routing - Christos Papadimitriou And
(Correct)
Geographic Routing without Planarization - Ben Leong Barbara
(Correct)
Similar documents (at the sentence level):
10.6%: Routing with Guaranteed Delivery in Geometric and Wireless Networks - Urrutia (2002)
(Correct)
Active bibliography (related documents): More All
0.5: A Simple DFS-Based Algorithm for Linear Interval Routing - Eilam, Moran, Zaks (1997)
(Correct)
0.4: Compact Routing Tables for Graphs of Bounded Genus - Gavoille, Hanusse (1999)
(Correct)
0.4: A Theoretical Model for Routing - Universit
(Correct)
Similar documents based on text: More All
0.2: Maximal Length Common Non-Intersecting Paths - Czyzowicz, Kranakis, Krizanc.. (1996)
(Correct)
0.2: Detecting Intra-enterprise Scanning Worms based on Address.. - David Whyte Paul
(Correct)
0.2: Routing with Guaranteed Delivery in ad hoc Wireless.. - Bose, Morin.. (1999)
(Correct)
Related documents from co-citation: More All
53: Routing with guaranteed delivery in ad hoc wireless networks
- Bose, Morin et al. - 1999
31: GPSR: Greedy perimeter stateless routing for wireless networks
- Karp, Kung - 2000
28: Optimal Transmission Ranges for Randomly Distributed Packet Radio Terminals (context) - Takagi, Kleinrock - 1984
BibTeX entry: (Update)
E. Kranakis, H. Singh and J. Urrutia, Compass routing on geometric networks, Proc. 11 th Canadian Conference on Computational Geometry, Vancouver, August, 1999. http://citeseer.ist.psu.edu/kranakis99compass.html More
@inproceedings{ kranakiscompass,
author = "Evangelos Kranakis and Harvinder Singh and Jorge Urrutia",
title = "Compass Routing on Geometric Networks",
booktitle = "Proc. 11 th Canadian Conference on Computational Geometry",
year = "1999",
month = "August",
address = "Vancouver",
pages = "51--54",
url = "citeseer.ist.psu.edu/kranakis99compass.html" }
Citations (may not include all citations):
101
Labeling and implicit routing in networks (context) - Santoro - 1985
73
A distance Routing Effect Algorithm for Mobility (context) - Basagni, Chlamatac et al. - 1998
61
Designing Networks with Compact Routing Tables (context) - Frederickson, Janardan - 1988
25
Location-aided Routing in Mobile ad hoc Networks (context) - Ko - 1998
19
Efficient Message Routing in Planar Networks (context) - Frederickson, Janardan - 1989
13
Geographic Distance Routing in ad hoc Wireless Networks (context) - Stojmenovic - 1999
12
Universal Routing Schemes
- Fraigniau, Gavoille - 1997
3
Boolean Routing on Cayley Networks
- Kranakis, Krizanc - 1997
2
Lower Bounds for Shortest Path Interval Routing
- Gavoille, Perennes - 1997
1
wwwgeog uclacuk=casa=martin=atla=isp maphtml (context) - of, www et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csi.uottawa.ca/~jorge/Publications.html): More
Stage-Graph Representations - Kranakis, Krizanc, Maheshwari, Noy..
(Correct)
Maximal Length Common Non-Intersecting Paths - Czyzowicz, Kranakis, Krizanc.. (1996)
(Correct)
Optimal Guarding of Polygons and Monotone Chains.. - Chen..
(Correct)
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