# Olivier DousseHere Maps · Automotive

Olivier Dousse

Ph.D.

## About

49

Publications

13,516

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

6,800

Citations

Introduction

Additional affiliations

August 2008 - September 2012

April 2006 - June 2008

September 2001 - March 2006

## Publications

Publications (49)

Consider a set of probes, called “agents”, who sample, based on opportunistic contacts, a population moving between a set of discrete locations. An example of such agents are Bluetooth probes that sample the visible Bluetooth devices in a population. Based on the obtained measurements, we construct a parametric statistical model to jointly estimate...

Disclosed is an apparatus, method and computer program device which send a prediction request to a prediction service to construct a prediction result, receives a prediction result and an estimation of accuracy of the prediction result from the prediction service and configures an application to adapt to at least one of user preferences, behavior a...

Human mobility prediction is an important problem which has a large number of applications, especially in context-aware services. This paper presents a study on location prediction using smartphone data, in which we address modeling and application aspects. Building personalized location prediction models from smartphone data remains a technical ch...

This paper presents an overview of the Mobile Data Challenge (MDC), a large-scale research initiative aimed at generating innovations around smartphone-based research, as well as community-based evaluation of mobile data analysis methodologies. First, we review the Lausanne Data Collection Campaign (LDCC), an initiative to collect unique longitudin...

Most current mobile devices are able to determine their location, which has become part of the contextual information available to applications. However, in many cases, the exact position of the device in terms of longitude and latitude is not necessary. On the contrary, applications might benefit more from a discrete context variable that indicate...

The connectivity graph of wireless networks, under many models as well as in practice, may contain unidirectional links. The simplifying assumption that such links are useless is often made, mainly because most wireless protocols use per-hop acknowledgments. However, two-way communication between a pair of nodes can be established as soon as there...

We conduct an experiment where ten attendees of an open-air music festival are acting as Bluetooth probes. We then construct a parametric statistical model to estimate the total number of visible Bluetooth devices in the festival area. By comparing our estimate with ground truth information provided by probes at the entrances of the festival, we sh...

Wireless Multi-Hop CSMA/CA Networks are challenging to analyze. On the one hand, their dynamics are complex and rather subtle effects may severely affect their performance. Yet, understanding these effects is critical to operate upper layer protocols, such as TCP/IP. On the other hand, their models tend to be very complex in order to reproduce all...

In this paper we study the dynamic aspects of the coverage of a mobile sensor
network resulting from continuous movement of sensors. As sensors move around,
initially uncovered locations are likely to be covered at a later time. A
larger area is covered as time continues, and intruders that might never be
detected in a stationary sensor network can...

We show that CSMA is able to spontaneously synchronize transmissions in a wireless network with constant-size packets, and that this property can be used to devise efficient synchronized CSMA scheduling mechanisms without message passing. Using tools from queuing theory, we prove that for any connected wireless networks with arbitrary interference...

Mobile phones have recently been used to collect large-scale continuous data about human behavior. In a paradigm known as people centric sensing, users are not only the carriers of sensing devices, but also the sources and consumers of sensed events. This paper describes a data collection campaign wherein Nokia N95 phones are allocated to a heterog...

Vehicular Ad Hoc Networks (VANETs) are a peculiar subclass of mobile ad
hoc networks that raise a number of technical challenges, notably from
the point of view of their mobility models. In this paper, we provide a
thorough analysis of the connectivity of such networks by leveraging on
well-known results of percolation theory. By means of simulatio...

The one tutorial and 22 papers in this special issue focus on geometry and random graph for the analysis and design of wireless networks. The papers are organized into five groups: Topology; Outage, throughput, capacity, and scaling laws; Connectivity and coverage; Co-existence of disparate wireless networks and cognitive radio; and Distributed alg...

Wireless networks are fundamentally limited by the intensity of the received signals and by their interference. Since both of these quantities depend on the spatial location of the nodes, mathematical techniques have been developed in the last decade to provide communication-theoretic results accounting for the networks geometrical configuration. O...

We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of these protocols in small network topologies does not always persist in large topologies. In regular networks, this unfairness is essentially due to the un...

Decentralized medium access control schemes for wireless networks based on CSMA/CA, such as the IEEE 802.11 protocol, are known to be unfair. In multihop networks, they can even favor some links to such an extent that the others suffer from virtually complete starvation. This observation has been reported in quite a few works, but the factors causi...

Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to detect intruders moving along restricted crossing paths in rectangular areas. We present a complete solution to this problem for sensors that are distributed according to...

We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, such as IEEE 802.11, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of the protocol in small network topologies does not always persist in large topologies. This unfairness is essentially due to the unfai...

This paper reviews some of our recent results in [1] and [2] on the fairness of decentralized medium access control protocols based on CSMA/CA, such as IEEE 802.11, in large multi-hop wireless networks. We focus on the trade-off between high spatial reuse and fairness. In particular, we show that the widely observed unfairness of the protocol in sm...

We look at a multihop wireless path with relay nodes running some CSMA/CA protocol. We show that current buffering schemes with a drop-tail policy lead to low throughput, independently of any other MAC layer issues. We propose a simple alternative buffering policy, where relay nodes are essentially bufferless. We show that even without buffering, t...

Decentralized medium access control schemes for wireless networks based on CSMA/CA, such as the 802.11 protocol, are known to be unfair. In multi-hop networks, they can even favor some connections to such an extent that the others suffer from virtually complete starvation. This observation has been reported in quite a few works, but the factors cau...

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the same 1/radicn transmission rate of arbitrarily located nodes. This contrasts with previous re...

The throughput of wireless networks is known to scale poorly when the number of users grows. The rate at which an arbitrary pair of nodes can communicate must decrease to zero as the number of users tends to infinity, under various assumptions. One of them is the requirement that the network is fully connected: the computed rate must hold for any p...

Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range of each other have been extensively studied. This paper considers a variation in which a connection between two points depends not only on their Euclidean distance, but also on the positions of all other point...

Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range of each other have been extensively studied. This paper considers a variation in which a connection between two points depends not only on their Euclidean distance, but also on the positions of all other point...

In this paper we consider sensor networks for intrusion detection, such that node deployment, node failures and node behavior result in coverage gaps and a fraction of disconnected nodes in an otherwise dense and well-connected network. We focus on the time delay for a mobile intruder to be detected by a sensor with a connected path to the sink, in...

As in every other network, nodes of a wireless multi-hop network must be well connected. Unlike many other networks, some wireless multi-hop networks (e.g., sensor net-works), do not necessarily require full connectivity of all the nodes of the networks. In this paper, we show the benefits of replacing this usual requirement by that of a partial, η...

Previous work on the coverage of mobile sensor networks focuses on algorithms to reposition sensors in order to achieve a static configuration with an enlarged covered area. In this paper, we study the dynamic aspects of the coverage of a mobile sensor network that depend on the process of sensor movement. As time goes by, a position is more likely...

We study the impact of interferences on the connectivity of large-scale ad hoc networks, using percolation theory. We assume that a bi-directional connection can be set up between two nodes if the signal to noise ratio at the receiver is larger than some threshold. The noise is the sum of the contribution of interferences from all other nodes, weig...

The throughput of wireless networks is known to scale poorly when the number of users grows. The rate at which an arbitrary pair of nodes can communicate must decrease to zero as the number of users tends to infinity, under various assumptions. One of them is the requirement that the network is fully connected: the computed rate must hold for any p...

- Cet article résume des résultats récents obtenus en utilisant des processus ponctuels (plus précisémment, des bruits impulsionnels) pour deux applications dans le contexte des réseaux de communication: d'une part, la modélisation du trafic TCP/IP dans les réseaux d'épine dorsale, et d'autre part les propriétés de connectivité des réseaux ad hoc s...

In this dissertation, we consider wireless multi-hop networks, where the nodes are randomly placed. We are particularly interested in their asymptotic properties when the number of nodes tends to infinity. We use percolation theory as our main tool of analysis. As a first model, we assume that nodes have a fixed connectivity range, and can establis...

We study the impact of interferences on the connectivity of large-scale ad-hoc networks, using percolation theory. We assume that a bi-directional connection can be set up between two nodes if the signal to noise ratio at the receiver is larger than some threshold. The noise is the sum of the contribution of interferences from all other nodes, weig...

We consider the problem of how throughput in a wireless network with randomly located nodes scales as the number of users grows. Following the physical model of Gupta and Kumar, we show that randomly scattered nodes can achieve the optimal 1/(n)<sup>1</sup>2/ per-node transmission rate of arbitrarily located nodes. This contrasts with previous achi...

We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuation functions, connectivity scales, and the available rate per node is known to decrease like...

We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuation functions, connectivity scales, and the available rate per node is known to decrease like...

We consider a wireless sensor network, where nodes switch between an active (on) and a sleeping (off) mode, to save energy. Their switching on/off schedules are completely non-coordinated. Their positions are distributed according to a Poisson process, and their connectivity range is larger or equal to their sensing range. The durations of active a...

Requiring all nodes of a wireless multihop network to be connected is expensive and results in a poor scalability of properties such as transport capacity. We show however that it is no longer the case if we only slightly loosen the connectivity requirement, by just imposing that most nodes be connected to each other (so that the network ``percolat...

Principles of self-organisation are presented and are applied to the fields of the Web, which has developed its form from the bottom up; e-science, in which a grid of intelligent components interacted towards a greater understanding of the science concerned; peer-to-peer systems, that lend themselves to information systems that do not work with cen...

A review on the physical connectivity of self-organized ad hoc wireless networks was presented. In wireless cellular networks nodes connect to each other through a dense network of antennas linked by a wired network. Percolation was found to be instrumental in analyzing the higher layers of self-organized networks.

We consider a large-scale wireless network, but with a low density of nodes per unit area. Interferences are then less critical, contrary to connectivity. This paper studies the latter property for both a purely ad-hoc network and a hybrid network, where fixed base stations can be reached in multiple hops. We assume here that power constraints are...

We consider a large-scale wireless network, but with a low density of nodes per unit area. Interferences are then less critical, contrary to connectivity. This paper studies the latter property for both a purely ad-hoc network and a hybrid network, where fixed base stations can be reached in multiple hops. We assume here that power constraints are...

We consider the problem of how throughput in a wireless network with randomly lo- cated nodes scales as the number of users grows. Fol- lowing the physical model of Gupta and Kumar, we show that randomly scattered nodes can achieve the optimal1= p n per-node transmission rate of arbitrarily located nodes. This contrasts with previous achiev- able r...

The supercritical regime of a percolation model refers to the range of probabilities (discrete) or densities (con-tinuous) above a critical value for which there exists a unique unbounded cluster almost surely. In this paper, we provide an upper bound to the linear distance from the origin to this giant connected component for both the discrete and...

We consider the problem of how throughput in a wireless network with randomly located nodes scales as the number of users n grows. We show that randomly scattered nodes can achieve the same 1/ √ n per-node transmission rate of arbitrarily located nodes. This contrasts with previous achievable results suggesting that a 1/ √ n log n reduced rate is t...