Sciweavers

1370 search results - page 194 / 274
» On grids in topological graphs
Sort
View
PODC
2009
ACM
16 years 13 days ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
CORR
2007
Springer
122views Education» more  CORR 2007»
14 years 12 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
WG
2010
Springer
14 years 10 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
TON
2010
196views more  TON 2010»
14 years 6 months ago
Fast Recovery From Dual-Link or Single-Node Failures in IP Networks Using Tunneling
Abstract--This paper develops novel mechanisms for recovering from failures in IP networks with proactive backup path calculations and IP tunneling. The primary scheme provides res...
Shrinivasa Kini, S. Ramasubramanian, Amund Kvalbei...
PODC
2011
ACM
14 years 2 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses