Content

•  
   Introduction
•  
  Related Work
•  
   Position-based Routing
•  
   Greedy forwarding
•  
   Face Traversal
•  
   Graph Planarization
•  
   Beacon-less routing
•  
   Position-based Multi-path Strategies
•  
   Geographic Clustering
•  
   Location Services
•  
   Related Online Routing Problems
•  
   Routing in Faulty Networks
•  
   Online Problems and Performance Measures
•  
  Online Navigation and Searching
•  
   Navigation
•  
   Searching and Exploration
•  
   Maze Traversal Algorithms
•  
   Complexity of Labyrinth Problems
•  
  Robot Motion-Planning Algorithms
•  
   Online Planning in Continuous Environments
•  
   Motion Planning in Grid-based Environments
•  
   Position-based Routing using a Cell Structure
•  
   The Network Model
•  
   Proactive Versus Reactive Information Dissemination
•  
   The Cell-based Geographic Forwarding Protocol
•  
   Establishing the Cell Structure
•  
   Cell-based Routing
•  
   Equivalence of Network and Cell Structure
•  
   Distributed Route Construction
•  
   Conclusion and Outlook
•  
   Online Routing in Faulty Mesh Networks
•  
  Basic Definitions and Techniques
•  
   Barriers, Borders and Traversals
•  
  Comparative Measures
•  
   The Competitive Time Ratio
•  
   The Comparative Traffic Ratio
•  
   Lower Bounds
•  
   A Trade-off between Time and Traffic
•  
  Basic Strategies
•  
   Lucas' Algorithm
•  
   Expanding Ring Search
•  
   Continuous Ring Search
•  
   The Alternating Algorithm
•  
  The JITE Algorithm
•  
   Overview
•  
   Fast Exploration
•  
   Slow Search
•  
   Time Analysis
•  
   Traffic Analysis
•  
   Conclusion and Outlook
•  
   Summary
•  
   Bibliography
•  
   Index