(Enter summary)
Abstract: In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first ad-hoc algorithm to be both asymptotically optimal and average-case e#cient. For our simulations we identify a network density range critical for any routing algorithm. We study a dozen of routing algorithms and show that GOAFR outperforms other prominent algorithms, such as GPSR or AFR. (Update)
Cited by: More
Routing And Scheduling For Real-Time Data - Dissemination In Sensor
(Correct)
Geographic Routing without Planarization - Ben Leong Barbara
(Correct)
Path Vector Face Routing: Geographic Routing with Local Face.. - Ben Leong Sayan (2005)
(Correct)
Active bibliography (related documents): More All
0.6: Asymptotically Optimal Geometric Mobile Ad-Hoc Routing - Kuhn, Wattenhofer, Zollinger (2002)
(Correct)
0.5: Geometric Ad-Hoc Routing: Of Theory and Practice - Kuhn, Wattenhofer, Zhang.. (2003)
(Correct)
0.4: Aligned Virtual Coordinates for Greedy Geometric Routing .. - Ke Liu, Nael..
(Correct)
Similar documents based on text: More All
1.0: Geometric Ad-Hoc Routing for Unit Disk Graphs and General .. - Kuhn, Wattenhofer.. (2002)
(Correct)
0.8: Ad-Hoc Networks Beyond Unit Disk Graphs - Kuhn, Wattenhofer, Zollinger (2003)
(Correct)
0.4: XTC: A Practical Topology Control Algorithm for Ad-Hoc.. - Wattenhofer, Zollinger (2003)
(Correct)
Related documents from co-citation: More All
19: Routing with guaranteed delivery in ad hoc wireless networks
- Bose, Morin et al. - 1999
17: GPSR: Greedy perimeter stateless routing for wireless networks
- Karp, Kung - 2000
10: Compass routing on geometric networks
- Kranakis, Singh et al. - 1999
BibTeX entry: (Update)
F. Kuhn, R. Wattenhofer, and A. Zollinger. "Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing". ACM MOBIHOC 2003. http://citeseer.ist.psu.edu/kuhn03worstcase.html More
@inproceedings{ kuhn-worstcase,
author = {Fabian Kuhn and Roger Wattenhofer and Aaron Zollinger},
title = {{Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing}},
booktitle = {Proc. $\mathit{4}^{th}$ ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc)},
year = {2003},
location = {Annapolis, Maryland, USA},
url = {citeseer.ist.psu.edu/kuhn03worstcase.html} }
Citations (may not include all citations):
723
Dynamic source routing in ad hoc wireless networks
- Johnson, Maltz - 1996
592
A performance comparison of multi-hop wireless ad hoc networ..
- Broch, Maltz et al. - 1998
315
Routing with guaranteed delivery in ad hoc wireless networks
- Bose, Morin et al. - 1999
262
GPSR: greedy perimeter stateless routing for wireless networ..
- Karp, Kung - 2000
115
Optimal transmission ranges for randomly distributed packet .. (context) - Takagi, Kleinrock - 1984
87
Routing and addressing problems in large metropolitan-scale .. (context) - Finn - 1987
87
Geocast - geographic addressing and routing
- Navas, Imielinski - 1997
75
A survey on position-based routing in mobile ad-hoc networks
- Mauve, Widmer et al. - 2001
75
Compass routing on geometric networks
- Kranakis, Singh et al. - 1999
66
Geocasting in mobile ad hoc networks: Location-based multica..
- Ko, Vaidya - 1998
64
A survey of routing techniques for mobile communications net..
- Ramanathan, Steenstrup - 1996
58
Transmission range control in multihop packet radio networks (context) - Hou, Li - 1986
38
Geometric spanner for routing in mobile networks
- Gao, Guibas et al. - 2001
36
Online routing in triangulations
- Bose, Morin - 1999
34
Connectivity in ad-hoc and hybrid networks
- Dousse, Thiran et al. - 2002
25
Discrete mobile centers
- Gao, Guibas et al. - 2001
22
Message-optimal connected dominating sets in mobile ad hoc n.. (context) - Alzoubi, Wan et al. - 2002
21
Asymptotically optimal geometric mobile ad-hoc routing
- Kuhn, Wattenhofer et al. - 2002
19
Online routing in convex subdivisions
- Bose, Morin et al. - 2000
14
Internal node and shortcut based routing with guaranteed del..
- Datta, Stojmenovic et al. - 2001
11
Position based routing algorithms for ad hoc networks: a tax..
- Giordano, Stojmenovic et al. - 2001
7
A scalable location management scheme in mobile ad-hoc netwo..
- Xue, Li et al. - 2001
4
Geometric ad-hoc routing for unit disk graphs and general co..
- Kuhn, Wattenhofer et al. - 2002
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.distcomp.ethz.ch/publications.html): More
Towards a Theory of Peer-to-Peer Computability - Giesen, Wattenhofer, Zollinger (2002)
(Correct)
Competitive Concurrent Distributed Queuing - Herlihy, Tirthapura, Wattenhofer (2001)
(Correct)
Asymptotically Optimal Geometric Mobile Ad-Hoc Routing - Kuhn, Wattenhofer, Zollinger (2002)
(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