73 search results - page 13 / 15 » The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner ... |
101
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
101
click to vote
COMCOM
2007
14 years 11 months ago
2007
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
100
click to vote
ICDCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we propose a novel Geographic Multicast routing Protocol (GMP) for wireless sensor networks1 . The proposed protocol is fully distributed and stateless. Given a set...