44 search results - page 2 / 9 » Fast shortest path distance estimation in large networks |
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approx...
SIGMOD
2008
ACM
13 years 5 months ago
2008
ACM
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...