Local Routing in Sparse and Lightweight Geometric Graphs.
Vikrant AshvinkumarJoachim GudmundssonChristos LevcopoulosBengt J. NilssonAndré van RenssenPublished in: ISAAC (2019)
Keyphrases
- lightweight
- graph theoretical
- network topology
- gaussian graphical models
- wireless sensor networks
- graph matching
- directed acyclic
- high dimensional
- routing problem
- dos attacks
- routing protocol
- routing algorithm
- sparse representation
- graph theory
- topological information
- user interface
- reeb graph
- geometric structure
- geometric constraints
- weighted graph
- ad hoc networks