Sciweavers

1502 search results - page 78 / 301
» Node weighted scheduling
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Understanding Sub-stream Scheduling in P2P Hybrid Live Streaming Systems
—The P2P pull-push hybrid architecture has achieved great success in delivering live video traffic over the Internet. However, a formal study on the sub-stream scheduling proble...
Zhenjiang Li, Danny H. K. Tsang, Wang-Chien Lee
TCOM
2010
167views more  TCOM 2010»
13 years 8 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
ICALP
2009
Springer
14 years 10 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
ICECCS
2009
IEEE
156views Hardware» more  ICECCS 2009»
13 years 7 months ago
Energy Efficient Duty Allocation Protocols for Wireless Sensor Networks
Wireless sensor networks require shared medium access management to prevent collisions, message corruption and other unhelpful effects. Cellular sensornets require minimal energy ...
Jonathan Tate, Iain Bate
ISAAC
2003
Springer
95views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Finding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao