Erased Secrets: Practical Information-Theoretic Group Secrecy
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.
We consider the question of what performance metric to maximize when designing ad hoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery-lifetime and power constraints. Commonly used metrics are total capacity (in ...
Securing ad hoc networks is notoriously challenging, notably due to the lack of an on-line infrastructure. In particular, key management is a problem that has been addressed by many researchers but with limited results. In this paper, we consider the case ...
We propose a probabilistic routing algorithm for wireless ad-hoc networks. The focus is on applications that can tolerate end-to-end delays and those for which the final destination for the packets is a small region. The nodes are assumed stationary and es ...
We propose resource allocation strategies for a class of wireless networks with a clustering protocol. The nodes are assumed stationary and establish connections with the master node according to a priority scheme that relates to their distances from the m ...
A robust algorithm is developed for jointly controlling the power and rate of flow in a distributed wireless network. The dynamics of the network is modelled as a discrete-time state-delayed system with uncertainties and the proposed algorithm achieves bet ...
We derive performance expressions for the throughput and blocking probability for a class of wireless networks with a clustering protocol. The nodes are assumed stationary and establish connections with the master node according to a priority scheme that r ...
We consider the problem of how throughput in a wireless network with randomly located nodes scales as the number of users grows. Following the physical model of Gupta and Kumar, we show that randomly scattered nodes can achieve the optimal 1/sqrt(n) per-no ...
So far, the problem of positioning and distance measurements in wireless networks has been studied in a non-adversarial setting. In this work, we analyze the resistance of positioning techniques to position and distance modification attacks; we propose two ...
The automatic configuration of Access Points (APs) is a new subject, since the Wi-Fi technology, which underlies hotspots by a wireless local area network, appears on the world market in 2001. The first market relevance has been in 2002. APs channel assign ...
New portable consumer embedded devices must execute multimedia and wireless network applications that demand extensive memory footprint. Moreover, they must heavily rely on Dynamic Memory (DM) due to the unpredictability of the input data (e.g. 3D streams ...
