Concept

Internet Relay Chat

Related publications (33)

Relay selection for grouped-relay networks using the average SLNR measure

In this paper, a distributed grouped-relay network with multiple source and destination nodes is introduced, and its distributed beamforming based on an average signal-to-leakage-plus-noise ratio (SLNR) is proposed to mitigate interference and colored nois ...

IEEE2009

Distributed MMSE Relay Strategies for Wireless Sensor Networks

Ali H. Sayed

A fundamental task in a wireless sensor network is to broadcast some measured data from an origin sensor to a destination sensor. Since the sensors are typically small, power limited, and low cost, they are only able to broadcast low-power signals. As a re ...

Institute of Electrical and Electronics Engineers2007

Type-based event dissemination

Sébastien Bähni

With the explosion of broadband Internet connections in the late 80s, new types of applications, called distributed applications, came to light. These applications typically seek to provide a user with remote services that appear to that user as if they we ...

EPFL2006

Misbehaving detection method for contention-based wireless communications

Jean-Pierre Hubaux, Imad Aad, Maxime Raya

The aim of the present invention is to provide a method to detect misbehavior use of the IEEE 802.11 standard without modifying the standard itself. This aim is reached according to a method for detecting misbehavior in a contention based communication net ...

2005

Multi-relay strategy for imperfect channel information in sensor networks

Ali H. Sayed

This paper describes a multi-relay strategy for wireless networks and examines the influence of imperfect channel information on system performance. A modified relay scheme is proposed to compensate for such imperfections. ...

2005

Secure communications over insecure channels based on short authenticated strings

Serge Vaudenay

We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g. 15 bits. We call this SAS-based authentication as for authentication based on short a ...

2005

On the capacity of erasure relay channel: Multi-relay case

Ramin Khalili

We consider here a single sender-destination multirelay channel. The links connecting the nodes are supposed to be erasure where symbols are received correctly without any error, or lost. We consider that the nodes are not able to use any interference canc ...

2005

Secure Communications over Insecure Channels Using an Authenticated Channel

Sylvain Pasini

A secure communication over an insecure channel without any prior exchanged key can be established with the help of an authentication step to exchange a public key and then using public-key cryptography such as RSA. In this work, we concentrate on message ...

2005

Cooperation of Nodes. In: L. Buttyan and J.-P. Hubaux (eds.), Report on a Working Session on Security in Wireless Ad Hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

In mobile ad-hoc networks nodes need to cooperate to communicate, but there are many reasons for non-cooperation. Saving power or preventing other nodes from obstructing a service are merely selfish reasons for non-cooperation, whereas nodes may also activ ...

2002

Implementing e-Transactions with Asynchronous Replication

Rachid Guerraoui

An e-Transaction is one that executes exactly-once despite failures. This paper describes a distributed protocol that implements the abstraction of e-Transactionsin three-tier architectures. Three-tier architectures are typically Internet-oriented architec ...

2000

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.