151 search results - page 25 / 31 » Distributed algorithms for minimum cost multicast with netwo... |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
DIALM
2003
ACM
14 years 28 days ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
IPPS
2003
IEEE
14 years 29 days ago
2003
IEEE
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
MASS
2010
13 years 5 months ago
2010
We address the energy-efficient data redistribution problem in data intensive sensor networks (DISNs). The key question in sensor networks with large volumes of sensory data is how...