Sciweavers

2149 search results - page 109 / 430
» Distributed Algorithms for Approximating Wireless Network Ca...
Sort
View
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
15 years 4 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 1 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
GLOBECOM
2007
IEEE
15 years 7 months ago
Joint Computation and Communication Scheduling to Enable Rich Mobile Applications
Abstract—Increasing interest in sensor networking and ubiquitous computing has created a trend towards embedding more and more intelligence into our surroundings. This enables th...
Shoubhik Mukhopadhyay, Curt Schurgers, Sujit Dey
TON
2008
76views more  TON 2008»
15 years 1 months ago
Minimizing file download time in stochastic peer-to-peer networks
The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show th...
Yuh-Ming Chiu, Do Young Eun
MOBICOM
2012
ACM
13 years 3 months ago
AutoMAC: rateless wireless concurrent medium access
Current wireless network design is built on the ethos of avoiding interference. In this paper we question this long-held design principle. We show that with appropriate design, su...
Aditya Gudipati, Stephanie Pereira, Sachin Katti