Sciweavers

46 search results - page 3 / 10
» QoS-based Routing in Networks with Inaccurate Information: T...
Sort
View
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
13 years 9 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer
CCS
2011
ACM
12 years 7 months ago
Trust-based anonymous communication: adversary models and routing algorithms
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on ano...
Aaron Johnson, Paul F. Syverson, Roger Dingledine,...
ICNP
1997
IEEE
13 years 11 months ago
On path selection for traffic with bandwidth guarantees
Transmission ofmultimedia streams imposesa minimum-bandwidth requirementon the path being usedto ensureend-to-endQuality-ofService (QoS) guarantees. While any shortest-path algori...
Qingming Ma, Peter Steenkiste
ICUIMC
2011
ACM
12 years 11 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
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang