Publications de Jean-Yves Le Boudec

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

In this paper, we propose a re-dispatch scheme for radial distribution grids hosting stochastic Distributed Energy Resources (DERs) and controllable batteries. At each re-dispatch round, the proposed scheme computes a new dispatch plan that modifies and ex ...

Efficiently handling reputation is important in dealing with free-riding, malicious attacks and random failures in self-organized communication systems. At the same time, work in this context is often found to be relevant in many other disciplines, in particular the social sciences. A number of distributed reputation systems have been proposed and analyzed, although research has not been very coherent. In this paper, for the first time, we provide an overview of the state-of-the-art in the various computer

Mobile ad-hoc networks rely on the cooperation of nodes for routing and forwarding. For individual nodes there are however several advantages resulting from noncooperation, the most obvious being power saving. Nodes that act selfishly or even maliciously pose a threat to availability in mobile ad-hoc networks. Several approaches have been proposed to detect noncooperative nodes. In this paper, we investigate the effect of using rumors with respect to the detection time of misbehaved nodes as well as the rob

It is well known that a simple binary feedback rate--based congestion avoidance scheme cannot ensure a fairness goal of the Available Bit Rate (ABR) service, namely, max-min fairness. In this paper we show how the rates are distributed for the network consisting of the binary switches, and end-systems employing an additive-increase/multiplicative decrease rate control. The modeling assumptions fairly resemble the ABR congestion avoidance, and apply to an arbitrary network topology. The results are obtained

Advanced applications for Distributed Hash Tables (DHTs), such as Peer-to-Peer Information Retrieval, require a DHT to quickly and efficiently process a large number (in the order of millions) of requests. In this paper we study mechanisms to optimize the ...

In mobile ad-hoc networks nodes need to cooperate to communicate, but there are many reasons for non-cooperation. Saving power or preventing other nodes from obstructing a service are merely selfish reasons for non-cooperation, whereas nodes may also actively and maliciously deny service or divert traffic for all sorts of attacks. However, without an infrastructure to rely on, nodes depend on each other`s cooperation. In game-theoretic terms, this is a dilemma. The dominating strategy for individual nodes i

Energy-detection is appealing for IEEE 802.15.4a receivers as it allows to exploit the ranging capabilities and the multipath resistance of impulse-radio UWB at a reasonable complexity. IEEE 802.15.4a receivers operate with interference created by uncontro ...

Demand response (DR) has traditionally targeted peak shaving for the optimal allocation of electricity consumption on a time scale that ranges from minutes to hours. However, with the availability of advanced monitoring and communication infrastructure, th ...

We propose an alternative approach, based on ``service curves", which uses the following two ingredients. (1) The rate at which a consumer may draw power from the grid may be controlled by real time signals. Typical concerned devices would be heating syste ...

The traffic generated by multimedia applications presents a great amount of burstiness, which can hardly be described by a static set of traffic parameters. The dynamic and efficient usage of the resources is one of the fundamental aspects of multimedia networks: the traffic specification should first reflect the real traffic demand, but optimise, at the same time, the resources requested. This chapter presents: a model for dynamically renegotiating the traffic specification (RVBR), how this can be integrat

An algorithm for connection admission control (CAC) in the case where connections are of the variable bit rate (VBR) type and the trunk carrying the multiplexed VBR connections is itself a VBR connection.

We consider the problem of broadcasting in an ad-hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless netwo ...

We consider a network implementing scheduling per aggregate flow. We show that the derivation of bounds that was published in [1] is false. We give a worst case bound which is valid for any network topology, given the maximum hop count for every flow and the utilization at every link.

We define "random trip", a generic mobility model for random, independent node motions, which contains as special cases: the random waypoint on convex or nonconvex domains, random walk on torus, billiards, city section, space graph, intercity and other mod ...

The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With our work, we provide a first step to analyzing robustness of a reputation system based on a deviation test. Using a mean-field approach to our stochastic process model, we show that liars have no impact unless their number exceeds a certain threshold (phase

The present invention concerns a receiver and a method for retrieving data from Ultra wideband radio transmission signals received by a receiver and transmitted in packets containing at least a preamble known to the receiver and a payload containing data u ...

In mobile ad-hoc networks, nodes do not rely on any routing infrastructure but relay packets for each other. Thus communication in mobile ad-hoc networks functions properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate, for example to save power or to launch security attacks such as denial-of-service. In this paper, we give an overview of potential vulnerabilities and requirements of mobile ad-hoc networks, and of p

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 (D

The high penetration of electric vehicles (EVs) charging stations (CSs), together with the progressive availability of distributed energy resources, increases the risk of grid overloading and power-quality degradation. Real-time control has been advocated ...

Practical impulse radio ultra-wideband (IR-UWB) ranging systems always have to work in multi-user and weak non-line-of-sight (NLOS) environments. In this paper, we derive a novel IR-UWB ranging estimator under multi-user and weak NLOS environments. We mode ...

Jean-Yves Le Boudec

Chattez avec Graph Search

A Receding Horizon Control Approach For Re-Dispatching Stochastic Heterogeneous Resources Accounting for Grid and Battery Losses

Reputation in Self-Organized Communication Systems and Beyond (Invited Paper)

The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-hoc Networks

How (Un)Fair are the ABR Binary Schemes, Actually?

Improving the Throughput of Distributed Hash Tables Using Congestion-Aware Routing

Cooperation of Nodes. In: L. Buttyan and J.-P. Hubaux (eds.), Report on a Working Session on Security in Wireless Ad Hoc Networks

Robust IEEE 802.15.4a Energy Detection Receiver Using Statistical Interference Modeling

GECN: Primary Voltage Control for Active Distribution Networks via Real-Time Demand-Response

Demand Response Using Service Curves

A Model for Dynamic QoS Negotiation Applied to an MPEG4 Applications

A CAC algorithm for VBR Connections over a VBR Trunk

Efficient Broadcasting Using Network Coding

A Proven Delay Bound for a Network with Aggregate Scheduling

The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation

Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars

Method for retrieving data from Ultra Wideband radio transmission signals

Cooperative Routing in Mobile Ad-hoc Networks: Current Efforts Against Malice and Selfishness

A framework for network coding in challenged wireless network

Experimental Validation of the Real-Time Control of an Electric-Vehicle Charging Station

Impulse Radio Ultra-Wideband Ranging Algorithm under Multi User Environments