Sciweavers

73 search results - page 13 / 15
» The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner ...
Sort
View
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
13 years 8 months ago
Inapproximability of Survivable Networks
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...
Yuval Lando, Zeev Nutov
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 19 days ago
Compact Multicast Routing
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...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
COMCOM
2007
136views more  COMCOM 2007»
13 years 6 months ago
Demand-scalable geographic multicasting in wireless sensor networks
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...
Shibo Wu, K. Selçuk Candan
INFOCOM
2008
IEEE
14 years 14 days ago
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
—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...
Animashree Anandkumar, Lang Tong, Ananthram Swami,...
ICDCS
2006
IEEE
14 years 3 days ago
GMP: Distributed Geographic Multicast Routing in Wireless Sensor Networks
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...
Shibo Wu, K. Selçuk Candan