Avoiding Counting to Infinity in Distance Vector Routing.

Andreas Schmid Olaf Kandel Christoph Steigner

Published in: ICN (1) (2001)

Keyphrases

distance measure
feature vectors
euclidean distance
routing problem
dissimilarity measure
ad hoc networks
vector space
distance metric
ant algorithm
vector data
network topology
neural network
data sets
routing algorithm
routing protocol
shortest path
response time
wireless ad hoc networks
search engine