Sciweavers

460 search results - page 61 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
TWC
2008
141views more  TWC 2008»
13 years 8 months ago
Progressive Accumulative Routing: Fundamental Concepts and Protocol
This paper considers a multi-hop network in which relay nodes cooperate to minimize the total energy consumed in transmitting a (unicast) packet from a source to a destination. We...
Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch,...
CCR
2006
117views more  CCR 2006»
13 years 9 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
SIROCCO
2007
13 years 10 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
14 years 2 months ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
MONET
2007
111views more  MONET 2007»
13 years 8 months ago
Resource Discovery in Activity-Based Sensor Networks
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...
Doina Bucur, Jakob E. Bardram