Sciweavers

298 search results - page 15 / 60
» Minimizing Flow Time in the Wireless Gathering Problem
Sort
View
TWC
2010
13 years 1 months ago
Lifetime-resource tradeoff for multicast traffic in wireless sensor networks
In this paper, we study the problem of supporting multicast traffic in wireless sensor networks with network coding. On one hand, coding operations can reduce power consumption and...
Vahid Shah-Mansouri, Vincent W. S. Wong
INFOCOM
2011
IEEE
12 years 10 months ago
Feasibility and optimization of delay guarantees for non-homogeneous flows in IEEE 802.11 WLANs
—Due to the rapid growth of real-time applications and the ubiquity of IEEE 802.11 MAC as a layer-2 protocol for wireless local area networks (WLANs), it is of increasing interes...
Yan Gao, Chee Wei Tan, Ying Huang, Zheng Zeng, P. ...
BROADNETS
2007
IEEE
14 years 1 months ago
On energy aware routing in wireless networks
—Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flo...
Aravind B. Mohanoor, Sridhar Radhakrishnan, Venkat...
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 8 months ago
Flow Algorithms for Parallel Query Optimization
In this paper we address the problem of minimizing the response time of a multi-way join query using pipelined (inter-operator) parallelism, in a parallel or a distributed environ...
Amol Deshpande, Lisa Hellerstein
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 6 months ago
Polynomial-time algorithms for coding across multiple unicasts
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
Tracey Ho