A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons.
Thomas C. ShermerPublished in: CoRR (2015)
Keyphrases
- digital convexity
- wireless sensor networks
- routing algorithm
- upper bound
- routing protocol
- lower bound
- ad hoc networks
- minimum length
- network topology
- worst case
- mobile ad hoc networks
- network coding
- localization algorithm
- ant algorithm
- convex hull
- location information
- cell complexes
- multicast routing
- minkowski sum
- qos routing
- data sets
- geometric objects
- network topologies
- routing problem
- error bounds
- shortest path
- routing decisions
- data streams
- neural network