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 work, we consider four problems in the context of Internet traffic control. The first problem is to understand when and why a sender that implements an equation-based rate control would be TCP-friendly, or not—a sender is said to be TCP-friendly if ...
In military and rescue applications of mobile ad hoc networks, all the nodes belong to the same authority; therefore, they are motivated to cooperate in order to support the basic functions of the network. In this paper, we consider the case when each node ...
We propose a micro-payment scheme for multi-hop cellular networks that encourages collaboration in packet forwarding by letting users benefit from relaying others` packets. At the same time as proposing mechanisms for detecting and rewarding collaboration, ...
We present an overview of research activities on space-time coding for broadband wireless transmission performed at AT & T Shannon Laboratory over the past two years. The emphasis is on physical layer modem algorithms such as channel estimation, equalizati ...
The traditional layered networking approach is not efficient in ad-hoc net-works. We are interested in finding a jointly optimal scheduling, routing and power control that achieves max-min fair rate allocation in a multi-hop wireless network. This is a hig ...
Devices in mobile ad hoc networks work as network nodes and relay packets originated by other nodes. Mobile ad hoc networks can work properly only if the participating nodes cooperate in routing and forwarding. For individual nodes it might be advantageous ...
Traditionally, reliable multicast protocols are deterministic in nature. It is precisely this determinism which tends to become their limiting factor when aiming at reliability and scalability, particularly in highly dynamic networks, e.g., ad hoc networks ...
Although far from optimal, flooding is an in- dispensable message dissemination technique for network- wide broadcast within mobile ad hoc networks (MANETs). As such, the plain flooding algorithm provokes a high number of unnecessary packet rebroadcasts, c ...
We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate \fpp and time-average window \taw for some known parti ...
Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive ...
