390 search results - page 33 / 78 » Computing shortest paths for any number of hops |
115
click to vote
MOBICOM
2003
ACM
15 years 7 months ago
2003
ACM
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
127
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
ICCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
220
Voted
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
124
click to vote
INFOCOM
2010
IEEE
15 years 11 days ago
2010
IEEE
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...