367 search results - page 23 / 74 » Set connectivity problems in undirected graphs and the direc... |
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
INFOCOM
1996
IEEE
14 years 18 days ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
DCOSS
2009
Springer
14 years 1 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...