Sciweavers

103 search results - page 12 / 21
» Approximating rooted Steiner networks
Sort
View
COMCOM
2007
136views more  COMCOM 2007»
13 years 10 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
2010
IEEE
13 years 8 months ago
Deploying Mesh Nodes under Non-Uniform Propagation
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
Joshua Robinson, Mohit Singh, Ram Swaminathan, Edw...
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
13 years 10 months ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 10 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
MOBIHOC
2006
ACM
14 years 10 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano