460 search results - page 11 / 92 » Bounding the locality of distributed routing algorithms |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
IPPS
1999
IEEE
13 years 12 months ago
1999
IEEE
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
PERCOM
2008
ACM
14 years 7 months ago
2008
ACM
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
IPPS
2002
IEEE
14 years 18 days ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
—Recently, network localization systems that are based on inter-node ranges have received significant attention. Geographic routing has been considered an application which can u...