Optimal Power Control, Scheduling and Routing in UWB Networks
Graph Chatbot
Chat with Graph Search
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.
In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel solution to DPU. The key idea is to add a level of indirection between the ser ...
We propose a complete design for a scope limited, multi-hop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networks such as a crowd in a city, or car passengers in a busy highway system. We ...
We address the problem of joint path selection and rate allocation in multipath wireless streaming, in order to optimize a media specific quality of service. We leverage on the existence of multiple parallel wireless services, in order to enhance the recei ...
Recent advances in wireless communications and computing technology are enabling the emergence of low-cost devices that incorporate sensing, processing, and communication functionalities. A large number of these devices are deployed in the field to create ...
We consider a wide-band ad-hoc network with coherent radios in a slow-fading environment, and we analyze the performance of different physical layer (PHY) and medium access (MAC) schemes in such a network. Most of the existing analysis assume that PHY is b ...
We address the problem of joint path selection and rate allocation in multipath wireless streaming, in order to optimize a media specific quality of service. We leverage on the existence of multiple parallel wireless services, in order to enhance the recei ...
There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allo ...
In opportunistic routing, each node maintains a group of candidate next-hops to reach a particular destination, and transmits packets to any node in this group. The choice of candidate next-hops at each node is a key question that is central to the perform ...
In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. A well-known instance is with unreliable wireless links, where the probability that at least one node out ofnreceives a packet increas ...
Wireless networking technologies allow computing devices to move while keeping them online, but the device mobility poses considerable technical challenges. Network designers, on the one hand, consider mobility to be harmful because it leads to dynamic and ...
