62 search results - page 3 / 13 » Non-Uniform Robust Network Design in Planar Graphs |
DIALM
2003
ACM
14 years 1 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
DIALM
2005
ACM
13 years 10 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
COCOA
2009
Springer
14 years 1 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
SENSYS
2004
ACM
14 years 1 months ago
2004
ACM
Existing geographic face routing algorithms use planarization techniques that rely on the unit-graph assumption, and thus can exhibit persistent routing failure when used with rea...