(Enter summary)
Abstract: We consider the problem of route discovery in a mesh network with faulty nodes. The number and the positions of the faulty nodes are unknown. It is known that a flooding strategy like expanding ring search can route a message linear in the minimum number of steps d while it causes a traffic (i.e. the total number of messages) of O(d^2). For optimizing traffic a single-path strategy is optimal producing traffic O(d + p), where p is the number of nodes that are adjacent to faulty nodes. In... (Update)
Active bibliography (related documents): More All
2.0: Online Routing in Faulty Meshes with Sub-linear.. - Rührup, Schindelhauer (2005)
(Correct)
0.5: Leaving an Unknown Maze Using an Error-Prone Compass - Kamphans, Langetepe (2006)
(Correct)
0.4: Aligned Virtual Coordinates for Greedy Geometric Routing .. - Ke Liu, Nael..
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
@techreport{ ruehrup06improved,
author = {Stefan R{\"u}hrup and Christian Schindelhauer},
title = {Improved Bounds for Online Multi-Path Routing in Faulty Mesh Networks},
institution = {University of Paderborn},
number = {TR-RSFB-06-078},
year = {2006},
url = {citeseer.ist.psu.edu/747508.html} }
Citations (may not include all citations):
723
Dynamic Source Routing in Ad Hoc Wireless Networks
- Johnson, Maltz - 1996
315
Routing with guaranteed delivery in ad hoc wireless networks
- Bose, Morin et al. - 2001
280
Online Computation and Competitive Analysis (context) - Borodin, El-Yaniv - 1998
223
Ad hoc on-demand distance vector (context) - Perkins, Belding-Royer et al. - 2003
83
Navigating in unfamiliar geometric terrain
- Blum, Raghavan et al. - 1997
79
Path-planning strategies for a point mobile automaton moving.. (context) - Lumelsky, Stepanov - 1987
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
Beyond competitive analysis
- Koutsoupias, Papadimitriou - 2000
47
Robot navigation in unknown terrains: Introductory survey of..
- Rao, Kareti et al. - 1993
36
Online routing in triangulations
- Bose, Morin - 2004
21
Asymptotically optimal geometric mobile ad-hoc routing
- Kuhn, Wattenhofer et al. - 2002
19
line searching and navigation (context) - Berman - 1998
14
Algorithmic and complexity issues of robot motion in an unce.. (context) - Lumelsky - 1987
8
Reconfiguring Arrays with Faults Part I: Worstcase Faults
- Cole, Maggs et al. - 1997
5
Shortest paths without a map (context) - Papadimitriou, Yannakakis - 1989
5
Fault-tolerant message routing for multiprocessors
- Zakrevski, Karpovsky - 1998
4
Fault-tolerant adaptive and minimal routing in mesh-connecte..
- Wu - 2000
4
Competitive online routing in geometric graphs
- Bose, Morin - 2004
2
Robot navigation with distance queries
- Angluin, Westbrook et al. - 2000
2
Extended minimal routing in 2-d meshes with faulty blocks (context) - Wu, Jiang - 2002
2
Competitive time and traffic analysis of positionbased routi.. (context) - Rhrup, Schindelhauer - 2005
1
dynamic path planning for a mobile automation with limited i.. (context) - Lucas - 1988
1
Online routing in faulty mesh networks with sublinear compar.. (context) - Rhrup, Schindelhauer - 2005
Documents on the same site (http://wwwcs.uni-paderborn.de/cs/ag-madh/WWW/sr/publications.html): More
Online Multi-Path Routing in a Maze - Rührup, Schindelhauer (2005)
(Correct)
Competitive Time and Traffic Analysis of Position-based.. - Rührup, Schindelhauer (2005)
(Correct)
Performance Analysis of the Hierarchical Layer Graph.. - Rührup.. (2005)
(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