**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Person# David Cavin

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related units

Loading

Courses taught by this person

Loading

Related research domains

Loading

Related publications

Loading

People doing similar research

Loading

Related publications (18)

People doing similar research (97)

Loading

Loading

Loading

Related research domains (3)

Related units (1)

Courses taught by this person

Consensus (computer science)

A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes. This often requires coordinating proce

Wireless sensor network

Wireless sensor networks (WSNs) refer to networks of spatially dispersed and dedicated sensors that monitor and record the physical conditions of the environment and forward the collected data to a ce

Computer network

A computer network is a set of computers sharing resources located on or provided by network nodes. Computers use common communication protocols over digital interconnections to communicate with eac

No results

David Cavin, Yoav Sasson, André Schiper

We study the time complexity for deterministic broadcasting algorithms in mobile radio networks. The broadcast operation consists of a source node successfully communicating its message to every other node. In multi-hop radio networks such as MANETs, the message may traverse multiple other nodes. Nodes have no prior knowledge besides the number n of nodes in the network and its diameter D. The problem we address has been extensively studied for static networks. Our work quantifies the impact of mobility. We consider three families of graphs: undirected graphs of constant contention degree, undirected graphs of non-constant contention degree and directed graphs of non-constant contention degree. We prove the lower bounds of Omega(n log n) time slots for the first family, Omega(n(2)/D-2 log D + D) time slots for the second and Omega(n(2)/D-2 log D + n log D) for the third. At the time of writing, the corresponding tightest lower bounds derived in the static case are, respectively, Omega(D log n), Omega(n log n log n/D) and Omega(n log D).

2011David Cavin, Alaeddine El Fawal, Jean-Yves Le Boudec, Yoav Sasson

Network coding is an area that has emerged in 2000, and has since then attracted an increasing interest, as it promises to have a significant impact in both the theory and practice of networks. To evaluate its performance in realistic situation, we developed a network coding based framework for challenged wireless networks where disconnection and reconnection is frequent as in PANs (Personal Area Networks) or vehicular networks, resulting in a new appelation for these scenarios as Delay Tolerant networks (DTN). For living in such hostile environment our development complies with several constraints as portability, flexibility, genericity, etc. Moreover to reduce the development effort using our framework, a single implementation might be used as standalone as well as inside a simulation environment.

2006David Cavin, Yoav Sasson, André Schiper

We propose a single source reliable broadcasting algorithm for linear grid-based networks where a message is guaranteed to be delivered to all the nodes of the network. The nodes are mobile and can move from one grid point to another. The solution does not require the nodes to know the network size or its diameter. The only information a node has is its identity and its position. On average, only a subset of nodes transmit and they transmit only once to achieve reliable broadcast. The protocol is contention-free and energy-efficient. We show that reliable broadcast can be achieved in O(Dlog n) time-slots despite node mobility, where D is the diameter of the network and n the number of nodes.

2006