Publication

Efficient and Adjustable Recipient Anonymity in Mobile Ad Hoc Networks

Related publications (33)

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.

Degraded two-message multicast over graphs

Christina Fragouli, Shirin Saeedi Bidokhti

We consider communication of two degraded mes- sage sets over graphs where a common source sends two prioritized messages (a common and a private message) to several receivers. All receivers require the common message and a subset of the receivers require ...

2011

Degraded two-message multicast over graphs

Christina Fragouli, Shirin Saeedi Bidokhti

In this work we consider a graph G where a common source sends two messages W1 and W2 to several receivers D1, D2, . . . , DK. The first two receivers D1 and D2 would like to receive message W1, while receivers D3, . . . , DK would like to receive both mes ...

2011

Bringing Stability to Wireless Mesh Networks

Adel Aziz

Wireless mesh networks were designed as a mean to rapidly deliver large-scale communication capabilities without the support of any prior infrastructure. Among the different properties of mesh networks, the self-organizing feature is particularly interesti ...

EPFL2011

Network coding node placement for delay minimization in streaming overlays

Pascal Frossard, Nikolaos Thomos, Nicolae Cleju

Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and e ...

2010

Information-theoretic secrecy for wireless networks

Etienne Perron

The aim of information-theoretic secrecy is to ensure that an eavesdropper who listens to the wireless transmission of a message can only collect an arbitrarily small number of information bits about this message. In contrast to cryptography, there are no ...

EPFL2009

Self-Organized Anonymous Authentication in Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Julien Freudiger, Maxime Raya

Pervasive communications bring along new privacy challenges, fueled by the capability of mobile devices to communicate with, and thus "sniff on", each other directly. We design a new mechanism that aims at achieving location privacy in these forthcoming mo ...

2009

EZ-Flow: Removing Turbulence in IEEE 802.11 Wireless Mesh Networks without Message Passing

Patrick Thiran, Alaeddine El Fawal, Adel Aziz, David Starobinski

Recent analytical and experimental work demonstrate that IEEE 802.11-based wireless mesh networks are prone to turbulence. Manifestations of such turbulence take the form of large buffer build-up at relay nodes, end-to-end delay fluctuations, and traffic c ...

2009

Border effects, fairness, and phase transition in large wireless networks

Patrick Thiran, Olivier Dousse, Mathilde Durvy

We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, such as IEEE 802.11, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of the protocol in small network topologie ...

IEEE Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Wireless Network Secrecy with Public Feedback

Emre Telatar, Suhas Diggavi, Etienne Perron

In this paper we consider secret communication between two special nodes ("source" and "destination") in a wireless network with authenticated relays: the message communicated to the destination is to be kept information-theoretically (unconditionally) sec ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Chain-Based Anonymous Routing for Wireless Ad Hoc Networks

Reza Shokri

Wireless ad hoc networks are so vulnerable to passive attacks and eavesdropping adversaries due to their shared medium which makes network traffic easy to capture and analyze. Therefore, security and privacy protections are of extreme importance for protoc ...

IEEE2007