460 search results - page 34 / 92 » Bounding the locality of distributed routing algorithms |
IPSN
2004
Springer
14 years 2 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
IJFCS
2006
13 years 9 months ago
2006
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
ICCCN
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— One of the major advantages of wireless communication over wired is the flexibility when creating links between nodes. But this comes at a price as influences from ou...
DCOSS
2008
Springer
13 years 10 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local ada...