Sciweavers

67 search results - page 4 / 14
» Transport in networks with multiple sources and sinks
Sort
View
IOR
2007
89views more  IOR 2007»
14 years 10 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
ISCAS
2002
IEEE
94views Hardware» more  ISCAS 2002»
15 years 3 months ago
Video transport over ad-hoc networks using multiple paths
Enabling video transport over ad-hoc networks is more challenging than over other wireless networks because a connection path in an ad-hoc network is highly error-prone and a path...
Shunan Lin, Yao Wang, Shiwen Mao, Shivendra S. Pan...
GI
2005
Springer
15 years 3 months ago
On-demand Construction of Non-interfering Multiple Paths in Wireless Sensor Networks
: In this paper we present a routing scheme for on-demand construction of multiple non-interfering paths in wireless sensor networks. One usage of this multipath scheme is to provi...
Thiemo Voigt, Adam Dunkels, Torsten Braun
TOC
2008
104views more  TOC 2008»
14 years 10 months ago
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
Henning Bruhn, Jakub Cerný, Alexander Hall,...
ICNP
2003
IEEE
15 years 3 months ago
Non-Uniform Information Dissemination for Sensor Networks
Future smart environments will be characterized by multiple nodes that sense, collect, and disseminate information about environmental phenomena through a wireless network. In thi...
Sameer Tilak, Amy L. Murphy, Wendi Rabiner Heinzel...