Bounds on hop distance in greedy routing approach in wireless ad hoc networks.
Swades DeAntonio CarusoTamalika ChairaStefano ChessaPublished in: Int. J. Wirel. Mob. Comput. (2006)
Keyphrases
- upper bound
- greedy algorithm
- upper and lower bounds
- search algorithm
- lower bound
- dynamic programming
- distance measure
- distance function
- euclidean distance
- error bounds
- routing table
- neural network
- lower and upper bounds
- hamming distance
- distance metric
- routing algorithm
- network topology
- routing problem
- ad hoc networks
- feature selection
- path length
- minimum distance
- inter domain
- machine learning