Algorithmic and complexity issues of robot motion in an uncertain environment
Journal of Complexity
Navigating in Unfamiliar Geometric Terrain
SIAM Journal on Computing
Reconfiguring Arrays with Faults Part I: Worst-Case Faults
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
SIAM Journal on Computing
Robot Navigation with Distance Queries
SIAM Journal on Computing
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Extended Minimal Routing in 2-D Meshes with Faulty Blocks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
On-line Searching and Navigation
Developments from a June 1996 seminar on Online algorithms: the state of the art
Competitive online routing in geometric graphs
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Online routing in faulty meshes with sub-linear comparative time and traffic ratio
ESA'05 Proceedings of the 13th annual European conference on Algorithms
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
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 ${\mathcal O}(d^2)$. For optimizing traffic a single-path strategy is optimal producing traffic ${\mathcal O}(d+p)$, where p is the number of nodes that are adjacent to faulty nodes. We present a deterministic multi-path online routing algorithm that delivers a message within ${\mathcal O}(d)$ time steps causing traffic ${\mathcal O}(d + p \log^2 d)$. This algorithm is asymptotically as fast as flooding and nearly traffic-optimal up to a polylogarithmic factor.