460 search results - page 22 / 92 » Bounding the locality of distributed routing algorithms |
DCOSS
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
ICDCS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we propose a novel Geographic Multicast routing Protocol (GMP) for wireless sensor networks1 . The proposed protocol is fully distributed and stateless. Given a set...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
On-line routing strategies for communication in a dynamic network on chip (DyNoC) environment are presented. The DyNoC has been presented as a medium supporting communication amon...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...