Sciweavers

203 search results - page 12 / 41
» On greedy geographic routing algorithms in sensing-covered n...
Sort
View
ICNP
2006
IEEE
14 years 1 months ago
Reducing Congestion Effects in Wireless Networks by Multipath Routing
Abstract—We propose a solution to improve fairness and increase throughput in wireless networks with location information. Our approach consists of a multipath routing protocol, ...
Lucian Popa 0002, Costin Raiciu, Ion Stoica, David...
TAMC
2009
Springer
14 years 2 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
COR
2007
95views more  COR 2007»
13 years 7 months ago
Inventory routing with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
IPPS
2010
IEEE
13 years 5 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
TIT
2010
82views Education» more  TIT 2010»
13 years 2 months ago
Average message delivery time for small-world networks in the continuum limit
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Hazer Inaltekin, Mung Chiang, H. Vincent Poor