Sciweavers

2076 search results - page 133 / 416
» Universal Routing in Distributed Networks
Sort
View
147
Voted
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 9 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
INFOCOM
2009
IEEE
15 years 10 months ago
Joint Transport, Routing and Spectrum Sharing Optimization for Wireless Networks with Frequency-Agile Radios
—In this paper, we describe and analyze the design of a joint Transport, Routing and Spectrum Sharing (TRSS) optimization algorithm for wireless networks with frequencyagile radi...
Zhenhua Feng, Yaling Yang
125
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
COLCOM
2005
IEEE
15 years 9 months ago
Symbiotic multi-path routing with attractor selection
In this paper we discuss the effects of symbiosis when using an attractor selection model for multi-path routing in an overlay network. Attractor selection is a biologically inspi...
Kenji Leibnitz, Naoki Wakamiya, Masayuki Murata
140
Voted
WICON
2008
15 years 4 months ago
Optimal stochastic routing in low duty-cycled wireless sensor networks
We study a routing problem in wireless sensor networks where sensors are duty-cycled. When sensors alternate between on and off modes, delay encountered in packet delivery due to ...
Dongsook Kim, Mingyan Liu