Sciweavers

6480 search results - page 1268 / 1296
» Proximity Communication and Time
Sort
View
SIROCCO
2008
13 years 11 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
PEWASUN
2007
ACM
13 years 11 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
WICON
2008
13 years 11 months ago
The effect of cooperation at the network protocol level
Abstract--There has been a great deal of attention on cooperative communication which exploits the spatial diversity among antennas belonging to multiple terminals. Most of the exi...
Beiyu Rong, Anthony Ephremides
WICON
2008
13 years 11 months ago
Risk-aware beacon scheduling for tree-based ZigBee/IEEE 802.15.4 wireless networks
In a tree-based ZigBee network, ZigBee routers (ZRs) must schedule their beacon transmission times to avoid beacon collisions. The beacon schedule determines packet delivery laten...
Li-Hsing Yen, Yee Wei Law, Marimuthu Palaniswami
SIROCCO
2007
13 years 11 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,...
« Prev « First page 1268 / 1296 Last » Next »