153 search results - page 10 / 31 » An experimental study of greedy routing algorithms |
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
SLS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
The main goal of this paper is to develop deeper insights into viable placement-level optimization of routing. Two primary contributions are made. First, an experimental framework...
ADHOC
2007
14 years 9 months ago
2007
Geographic protocols are very promising for wireless ad hoc and sensor networks due to the low state storage and low message overhead. Under certain idealized conditions, geograph...