Sciweavers

1204 search results - page 3 / 241
» Optimal Routing in a Small-World Network
Sort
View
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 5 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
13 years 10 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
ICDCS
2011
IEEE
12 years 4 months ago
The Routing Continuum from Shortest-Path to All-Path: A Unifying Theory
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...
Yanhua Li, Zhi-Li Zhang, Daniel Boley
ICRA
2006
IEEE
125views Robotics» more  ICRA 2006»
13 years 11 months ago
Optimal Information Propagation in Sensor Networks
Abstract— This paper studies the effect of communicationlink weighting schemes and long-range connections in speeding convergence to consensus on the average of the inputs to age...
Peng Yang, Randy A. Freeman, Kevin M. Lynch
ICUIMC
2011
ACM
12 years 8 months ago
Overhead analysis of query localization optimization and routing
Query localization is an improved extension of on-demand routing protocols for ad hoc networks. It makes use of prior routing histories to localize the query flood to a limited re...
Wenzheng Xu, Yongmin Zhang, Weifa Liang