A combinatorial bound for beacon-based routing in orthogonal polygons.
Thomas C. ShermerPublished in: J. Comput. Geom. (2022)
Keyphrases
- digital convexity
- wireless sensor networks
- upper bound
- routing algorithm
- lower bound
- routing problem
- routing protocol
- worst case
- minimum length
- ad hoc networks
- network topology
- localization algorithm
- wireless ad hoc networks
- inter domain
- spatial objects
- shortest path
- error bounds
- data sets
- convex hull
- network coding
- dynamic routing
- cell complexes
- routing decisions
- mobile robot
- minkowski sum