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.
This paper describes an event dissemination algorithm that implements a topic-based publish/subscribe abstraction in mobile ad-hoc networks (MANETs). Our algorithm relies on (1) the mobility of the processes and (2) the validity period of the events to ensure the reliability of the dissemination (under reasonable conditions) with a thrifty usage of the memory. The algorithm is inherently portable and does not assume any specific routing protocol. Old events are collected to save the memory and the energy consumption is, in some sense, related to the size of the event scope a subscriber is interested in. We give simulation results in different mobility models and highlight the advantages/drawbacks of our approach as well as we expose some interesting relations between validity periods and reliability.
Jean-Yves Le Boudec, Jean-Pierre Hubaux