Sciweavers

460 search results - page 20 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
TPDS
1998
73views more  TPDS 1998»
13 years 7 months ago
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
Ming-Jer Tsai, Sheng-De Wang
BROADNETS
2004
IEEE
13 years 11 months ago
A Distributed Mobile Backbone Formation Algorithm for Wireless Ad Hoc Networks
In this paper, we present a novel fully distributed version of a Mobile Backbone Network Topology Synthesis Algorithm (MBN-TSA) for constructing and maintaining a dynamic backbone...
Laura Huei-jiun Ju, Izhak Rubin, Kevin Ni, Christo...
PODC
2006
ACM
14 years 1 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 1 months ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
IPSN
2005
Springer
14 years 1 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu