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 study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failures) and the dynamic case (node failures). For static networks, we derive upp ...
In this work, we address the question of how to enable a system to operate despite the presence of misbehavior. Specifically, in a mobile ad-hoc network, how can we keep the network functional for normal nodes when other nodes do not route and forward corr ...
We give a lower bound of Ω(n) rounds for broadcasting in a mobile ad hoc network, where n is the number of nodes in the network. A round is the time taken by a node to successfully transmit a message to all its neighbors. It has been shown by Brus ...
In this work, we address the question of how to enable a system to operate despite the presence of misbehavior. Specifically, in a mobile ad-hoc network, how can we keep the network functional for normal nodes when other nodes do not route and forward corr ...
We present a scheme for secure and privacy-preserving communication in hybrid ad hoc networks. Our scheme enables users to secure communication and to protect their anonymity and location privacy. Our approach is based on frequently changing node pseudonym ...
This thesis discusses techniques for sharing the processing load among multiple processing units within systems that act as nodes in a data communications network. Load-sharing techniques have been explored in the field of computer science for many years a ...
We propose FResher Encounter SearcH (FRESH), a simple algorithm for efficient route discovery in mobile ad hoc networks. Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source nod ...
This thesis discusses techniques for sharing the processing load among multiple processing units within systems that act as nodes in a data communications network. Load-sharing techniques have been explored in the field of computer science for many years a ...
Solid Oxide Fuel Cell (SOFC) application development is very well represented in Switzerland by two companies. Sulzer Hexis AG is one of the world leaders in the commercialization of SOFC systems for single family houses. A smaller company, HTceramix, is a ...
We measure and analyze the single-hop packet delay through operational routers in the Sprint Internet protocol (IP) backbone network. After presenting our delay measurements through a single router for OC-3 and OC-12 link speeds, we propose a methodology t ...
