Concept

Réseau étendu

Publications associées (174)

Self-Organization Properties of CSMA/CA Systems and Their Consequences on Fairness

Patrick Thiran, Olivier Dousse, Mathilde Durvy

Decentralized medium access control schemes for wireless networks based on CSMA/CA, such as the IEEE 802.11 protocol, are known to be unfair. In multihop networks, they can even favor some links to such an extent that the others suffer from virtually compl ...

Institute of Electrical and Electronics Engineers2009

Functional Forwarding of Channel State Information

Michael Christoph Gastpar

In large relay networks, the assumption of full and perfect channel knowledge at the destination is optimistic in practice. The fading coefficients are typically measured at the relays but not directly known at the destination. Traditionally, each fading c ...

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

Canalizing structure of genetic network dynamics: modelling and identification via mixed-integer programming

Giancarlo Ferrari Trecate

We discuss the identification of genetic networks based on a class of boolean gene activation rules known as hierarchically canalizing functions. We introduce a class of kinetic models for the concentration of the proteins in the network built on a family ...

2009

Designing peer-to-peer overlays

Sarunas Girdzijauskas

The Small-World phenomenon, well known under the phrase "six degrees of separation", has been for a long time under the spotlight of investigation. The fact that our social network is closely-knitted and that any two people are linked by a short chain of a ...

EPFL2009

Competition of Wireless Providers for Atomic Users: Equilibrium and Social Optimality

Bixio Rimoldi, Vojislav Gajic

We study a problem where wireless service providers compete for heterogenous and atomic (non-infinitesimal) wireless users. The users differ in their utility functions as well as in the perceived quality of service of individual providers. We model the int ...

2009

More on Castor: the Scalable Secure Routing for Ad-hoc Networks

Karl Aberer, Panagiotis Papadimitratos, Marcin Poturalski, Wojciech Galuba, Zoran Despotovic

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach, simult ...

2009

Hardware Implementation Issues of the Neighborhood Mechanism in Kohonen Self Organized Feature Maps

Rafal Tomasz Dlugosz

In this paper, we discuss an important problem of the selection of the neighborhood radius in the learning schemes of the Winner Takes Most Kohonen neural network. The optimization of this parameter is essential in case of hardware realization of the netwo ...

2009

Evolution of stochastic switching rates in asymmetric fitness landscapes

Marcel Salathé

Uncertain environments pose a tremendous challenge to populations: The selective pressures imposed by the environment can change so rapidly that adaptation by mutation alone would be too slow. One solution to this problem is given by the phenomenon of stoc ...

2009

Why STM can be more than a Research Toy

Rachid Guerraoui, Vincent Gramoli, Aleksandar Dragojevic, Pascal Felber

Software Transactional Memory (STM) promises to simplify concurrent programming without requiring speciﬁc hardware support. Yet, STM’s credibility lies on the extent to which it can leverage multi-cores to outperform sequential code. A recent CACM paper [8 ...

2009

Tissue micromanipulation in zebrafish embryos

Andrew Charles Oates

Although a common approach in large vertebrate embryos such as chick or frog, manipulation at the tissue level is only rarely applied to zebrafish embryos. Despite its relatively small size, the zebrafish embryo can be readily used for micromanipulations s ...

2009

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