62 search results - page 2 / 13 » Non-Uniform Robust Network Design in Planar Graphs |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
SIGMETRICS
2006
ACM
13 years 11 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
MOBIHOC
2005
ACM
14 years 4 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...