32 search results - page 5 / 7 » An Efficient Construction of Node Disjoint Paths in OTIS Net... |
JMLR
2010
13 years 1 months ago
2010
For a given target node T and a given depth k 1, we propose an algorithm for discovering a local causal network around the target T to depth k. In our algorithm, we find parents,...
TMC
2008
13 years 6 months ago
2008
We consider the problem of finding "backbones" in multihop wireless networks. The backbone provides end-toend connectivity, allowing non-backbone nodes to save energy sin...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
JNW
2008
13 years 6 months ago
2008
Recently overlay networks have emerged as an efficient and flexible method for content distribution. An overlay network is a network running on top of another network, usually the ...
TMC
2008
13 years 6 months ago
2008
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...