Publication

Algorithms for Location-Independent Communication between Mobile Agents

Related publications (99)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

EKF SLAM vs. FastSLAM -- A comparison

Michael Calonder

The two algorithms are described with a planar robot application in mind. Generalization to any spatial SLAM scenarios is straightforward. ...

2006

Architectural Issues of JMS Compliant Group Communication

Nils Richard Ekwall, Arnas Kupsys

Group communication provides one-to-many communication primitives that simplify the development of highly available services. Despite advances in research and numerous prototypes, group communication stays confined to small niches. To facilitate the accept ...

2005

DO PARTNERS CARE ABOUT THEIR MUTUAL LOCATION? Spatial awareness in virtual environments.

Pierre Dillenbourg, Nicolas Nova

This paper reports on four experimental studies concerning regard to how people use space so as to solve problems collaboratively in virtual environments. Prior to presenting the results, it summarizes the wide range of literature concerning social uses of ...

2005

Adaptive Distributed Algorithms for Power-Efficient Data Gathering in Sensor Networks

Razvan Cristescu, Jugoslava Acimovic

In this work, we consider the problem of designing adaptive distributed processing algorithms in large sensor networks that are efficient in terms of minimizing the total power spent for gathering the spatially correlated data from the sensor nodes to a si ...

2005

On Network Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two c ...

2004

Efficient decentralized communications in sensor networks

Razvan Cristescu

This thesis is concerned with problems in decentralized communication in large networks. Namely, we address the problems of joint rate allocation and transmission of data sources measured at nodes, and of controlling the multiple access of sources to a sha ...

EPFL2004

A lower bound to the scaling behavior of sensor networks

Martin Vetterli, Michael Christoph Gastpar

For a class of sensor networks, the task is to monitor an underlying physical phenomenon over space and time through a noisy observation process. The sensors can communicate back to a data collector over a noisy channel. The key parameters in such a se ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2004

Group communication based on standard interfaces

André Schiper, Matthias Wiesmann, Xavier Défago

While group communication system have been proposed for some time, they are still not used much in actual systems. We believe that one reason for this is the lack of standardisation of group communication system interfaces. The paper proposes an architectu ...

2003

Practical impact of group communication theory

André Schiper

Practical impact of group communication theory Andre Schiper Group communication is an important topic in fault-tolerant distributed applications. The paper summarizes the main contributions of practical importance that contributed to our current understan ...

2003

Dynamic Group Communication

André Schiper

Group communication is the basic infrastructure for implementing fault-tolerant replicated servers. While group communication is well understood in the context of static systems (in which all processes are created at the start of the computation), current ...

2003