459 search results - page 57 / 92 » Approximation Algorithms for Buy-at-Bulk Geometric Network D... |
MSWIM
2005
ACM
14 years 2 months ago
2005
ACM
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication ...
DIALM
2008
ACM
13 years 10 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
GLOBECOM
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
In complex distributed applications, a problem is often decomposed into a set of subproblems that are distributed to multiple agents. We formulate this class of problems with a tw...