Memory Requirements for Local Geometric Routing and Traversal in Digraphs.
Maia FraserEvangelos KranakisJorge UrrutiaPublished in: CCCG (2008)
Keyphrases
- memory requirements
- memory space
- memory usage
- low memory
- routing algorithm
- computational power
- computational complexity
- shortest path
- network topology
- computational speed
- qos routing
- case study
- dynamic routing
- geometric structure
- high order
- routing protocol
- data structure
- geometric features
- geometric information
- mobile ad hoc networks
- wireless ad hoc networks
- network topologies
- path selection
- inter domain