Publication

Wireless Network Secrecy with Public Feedback

Publications associées (46)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Network coded multipath and related techniques

Emre Telatar, Arno Schneuwly, Derya Malak

Techniques are disclosed for adaptive coding and scheduling of packets in wireless networks. The adaptive coding and scheduling can be achieved by utilizing a discrete water filling (DWF) scheme. In an example, a computer-implemented method to adaptively c ...

2020

Measurement system design using multi-criteria decision making

A huge part of bridges has been designed and built during the 20th century. As they are, ageing, they are reaching their lifetime. The demand of new infrastructures is increasing worldwide, new infrastructures have to be built and ageing infrastructures ne ...

2018

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

Jean-Pierre Hubaux, Bryan Alexander Ford, Mahdi Zamani, Italo Ivan Dacosta Petrocelli, Ludovic Barman

Popular anonymity mechanisms such as Tor provide low communication latency but are vulnerable to traffic analysis attacks that can de-anonymize users. Moreover, known traffic-analysis-resistant techniques such as Dissent are impractical for use in latency- ...

ACM2016

Low Complexity Scheduling and Coding for Wireless Networks

Siddhartha Brahma

The advent of wireless communication technologies has created a paradigm shift in the accessibility of communication. With it has come an increased demand for throughput, a trend that is likely to increase further in the future. A key aspect of these chall ...

EPFL2015

Physical Layer Cooperation

Ayan Sengupta

Information theory has long pointed to the promise of physical layer cooperation in boosting the spectral efficiency of wireless networks. Yet, the optimum relaying strategy to achieve the network capacity has till date remained elusive. Recently however, ...

EPFL2015

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Michael Christoph Gastpar, Jasper Goseling

Compute-and-Forward (CF), also known as reliable physical layer network coding, is a technique that provides the possibility of exploiting the features of broadcast and superposition in wireless networks. It has been shown that the throughput for multiple ...

Institute of Electrical and Electronics Engineers2014

Topology Optimization For Energy-Efficient Communications In Consensus Wireless Networks

Martin Vetterli, Benjamin Bejar Haro

Over the past years there has been an increasing interest in developing distributed computation methods over wireless networks. A new communication paradigm has emerged where distributed algorithms such as consensus have played a key role in the developmen ...

IEEE2014

Probing the network. Architecturality of Wireless Infrastructure

Selena Savic

Mobile devices and wireless networks have a prominent place in our interaction with the environment and with each other. Like every new technology, it has been a subject to inflated expectations. Scholars, writers, artists and architects have explored how ...

ACM2014

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

Exchanging Pairwise Secrets Efficiently

Christina Fragouli, Suhas Diggavi, Iris Safaka

We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...

Institute of Electrical and Electronics Engineers Inc.2013