Publication

Performance Analysis of the CONFIDANT Protocol: Cooperation Of Nodes - Fairness In Dynamic Ad-hoc NeTworks

Related publications (57)

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.

OS-Based Sensor Node Platform and Energy Estimation Model for Health-Care Wireless Sensor Networks

Giovanni De Micheli, David Atienza Alonso, Francisco Javier Rincon Vallejos

Accurate power and performance figures are critical to assess the effective design of possible sensor node architectures in Body Area Networks (BANs) since they operate on limited energy storage. Therefore, accurate power models and simulation tools that c ...

2008

Least-Cost Opportunistic Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In opportunistic routing, each node maintains a group of candidate relays to reach a particular destination, and transmits packets to any node in this group. If a single candidate relay receives the packet, it becomes the effective relay to forward the pac ...

2007

Compositional reflectance and transmittance model for multilayer specimens

Roger Hersch, Mathieu Hébert

We propose a compositional model for predicting the reflectance and the transmittance of multilayer specimens composed of layers having possibly distinct refractive indices. The model relies on the laws of geometrical optics and on a description of the mul ...

2007

GridVine: an Infrastructure for Peer Information Management

Karl Aberer, Philippe Cudré-Mauroux

GridVine is a semantic overlay infrastructure based on a peer-to-peer (P2P) access structure. Built following the principle of data independence, it separates a logical layer — in which data, schemas, and schema mappings are managed — from a physical layer ...

2007

Anypath routing

Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. A well-known instance is with unreliable wireless links, where the probability that at least one node out ofnreceives a packet increas ...

EPFL2006

Diffractive moire features for optically variable devices

Roger Hersch, Isaac Amidror, Sylvain Chosson

We present diffractive second-line security features based on the moire phenomenon, that are designed for use in Optically Variable Devices (OVDs). After a short introduction of our 2D and 1D moire methods, we first present the integration of line-based, 1 ...

International Society for Optical Engineering, Bellingham WA, WA 98227-0010, United States2006

Model-based synthesis of band moire images for authenticating security documents and valuable products

Roger Hersch, Sylvain Chosson

The present invention relies on a band moiré image layout model capable of predicting the band moiré image layer layout produced when superposing a base band grating layer of a given layout and revealing line grating layer of a given layout. Both the base ...

2006

A new relaying scheme for cheap wireless relay nodes

Ramin Khalili

In this paper we will propose a relaying scheme for wireless multi-hop networks. It is based on collaboration of intermediate relays at network layer to forward useful side information in place of dumbly forwarding packets. In our scheme we assume that the ...

2005

A cross-layer design of wireless ad-hoc networks

We consider a cross-layer design of wireless ad-hoc networks. Traditional networking approaches optimize separately each of the three layers: physical layer, medium access and routing. This may lead to largely suboptimal network designs. In this work, we p ...

EPFL2005

On Survivable Routing of Mesh Topologies in IP-over-WDM Networks

Patrick Thiran, Maciej Kurant

Failure restoration at the IP layer in IP-over-WDM networks requires to map the IP topology on the WDM topology in such a way that a failure at the WDM layer leaves the IP topology connected. Such a mapping is called survivable. Finding a survivable mappin ...

2005