Efficient Key Exchange for Wireless Multi-hop Networks
Graph Chatbot
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.
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 ...
In this paper we present the main challenges in mobile ad-hoc wide area networks (MAWANs). A MAWAN is a wide area, large, (potentially) entirely wireless networks. We describe the Terminodes Project (a 10-year-long research program (2000-2010) in MAWANs, s ...
Ad-hoc networks are a key in the evolution of wireless networks. Ad-hoc networks are typically composed of equal nodes, which communicate over wireless links without any central control. Ad-hoc wireless networks inherit the traditional problems of wireless ...
There is an important trend toward personal mobile communications. People use more and more handheld devices to keep in touch with friends or business partners. One possible way to connect these devices is provided by wireless radio technologies. The emerg ...
In this paper we present the main challenges in mobile ad-hoc wide area networks (MAWANs). A MAWAN is a wide area, large, (potentially) entirely wireless networks. We describe the Terminodes Project (a 10-year-long research program (2000-2010) in MAWANs, s ...
Mobile ad-hoc networking works properly only if the par- ticipating nodes cooperate in routing and forwarding. How- ever, it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattrac ...
