Sciweavers

24 search results - page 3 / 5
» Self-stabilizing Deterministic Gathering
Sort
View
IPL
2010
112views more  IPL 2010»
13 years 5 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
TMC
2010
139views more  TMC 2010»
13 years 5 months ago
Optimize Storage Placement in Sensor Networks
—Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. Storage nodes are introdu...
Bo Sheng, Qun Li, Weizhen Mao
SODA
2012
ACM
229views Algorithms» more  SODA 2012»
11 years 9 months ago
Approximation algorithms for stochastic orienteering
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath ...
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 5 months ago
RoboCast: Asynchronous Communication in Robot Networks
Abstract. This paper introduces the RoboCast communication abstraction. The RoboCast allows a swarm of non oblivious, anonymous robots that are only endowed with visibility sensors...
Zohir Bouzid, Shlomi Dolev, Maria Potop-Butucaru, ...
MOBIHOC
2006
ACM
14 years 6 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao