A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons.
Thomas C. ShermerPublished in: CCCG (2015)
Keyphrases
- digital convexity
- upper bound
- wireless sensor networks
- routing algorithm
- routing protocol
- lower bound
- network topology
- error bounds
- minimum length
- routing problem
- wireless ad hoc networks
- worst case
- shortest path
- position information
- ad hoc networks
- convex hull
- data sets
- inter domain
- localization algorithm
- cell complexes
- optimal solution
- ant algorithm
- neural network
- multicast routing
- network coding
- estimation error
- end to end