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.
We here summarize some recent advances in the study of linear deterministic networks, recently proposed as approximations for wireless channels. This work started by extending the algebraic framework developed for multicasting over graphs in [1] to include ...
Emerging pervasive wireless networks, pocket switched networks, Internet of things, vehicular networks and even sensor networks present very challenging communication circumstances. They might involve up to several hundreds of wireless devices with mobilit ...
In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, spec ...
We consider streaming video content over an overlay network of peer nodes. We propose a novel streaming strategy that is built on utility-based packet scheduling and proportional resource sharing in order to fight against free- riders. Each of the peers em ...
In this work we consider route planning for valuable delivery in an urban environment under the threat of ambushes in which a vehicle, starting from a depot, has to serve a set of predetermined destinations during the day. We provide a method to plan for h ...
For impulse-radio ultra-wide band (IR-UWB) networks without global synchronization, the first step for correct packet reception is packet detection and timing acquisition: Before recovering the payload of the packet, the destination must detect that the pa ...
The paper addresses the media-specific rate allocation problem in multipath networks. The streaming rate on each path is determined such that the end- to-end media distortion is minimized, when the receiving client aggregates packets received via multiple ...
We present a minimum spanning tree based energy aware multicast protocol (MSTEAM), which is a localized geographic multicast routing scheme designed for ad hoc and sensor networks. It uses locally-built minimum spanning trees (MST) as an efficient approxim ...
Face is a well-known localized routing protocol for ad hoc and sensor networks which guarantees delivery of the message as long as a path exists between the source and the destination. This is achieved by employing a left/right hand rule to route the messa ...
A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. By evenly distributing input packets of a router among all its ...
