Concept

Comparaison de topologies

Publications associées (57)

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

On the Fairness of Large CSMA 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 ...

Institute of Electrical and Electronics Engineers2009

On Cooperative Wireless Network Secrecy

Emre Telatar, Suhas Diggavi, Etienne Perron

Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-to-point communication is sought, and hence a fundamental question is whether w ...

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

Network-Coded Broadcast: from Canonical Networks to Random Topologies

Christina Fragouli, Jörg Widmer

We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the ...

2008

Convolution Operators And Homomorphisms Of Locally Compact Groups

Let 1 < p < infinity, let G and H be locally compact groups and let c) be a continuous homomorphism of G into H. We prove, if G is amenable, the existence of a linear contraction of the Banach algebra CVp (G) of the p-convolution operators on G into CVp (H ...

Cambridge University Press2008

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

Patrick Thiran, Olivier Dousse, Mathilde Durvy

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

On Cooperative Wireless Network Secrecy

Emre Telatar, Suhas Diggavi, Etienne Perron

2008

Modeling and Numerical Simulation of a Complete Hydrolelectric Production Site

François Avellan, Jean-Jacques Simond

For many years the EPFL Laboratory for Electrical Machines develops SIMSEN, a numerical software package for the simulation in transient and steady-state conditions of electrical power systems and adjustable speed drives, having an arbitrary topology. SIMS ...

2007

MODELING AND NUMERICAL SIMULATION OF A COMPLETE HYDROELECTRIC PRODUCTION SITE

François Avellan, Jean-Jacques Simond, Christophe Nicolet, Philippe Allenbach

2007

An analytic finite capacity queueing network model capturing blocking, congestion and spillbacks

Michel Bierlaire, Carolina Osorio Pizano

Analytic queueing network models often assume infinite capacity for all queues. For real systems this infinite capacity assumption does not hold, but is often maintained due to the difficulty of grasping the between-queue correlation structure present in f ...

2007

Diffusion Least-Mean Squares Over Adaptive Networks

Ali H. Sayed

Distributed adaptive algorithms are proposed to address the problem of estimation in distributed networks. We extend recent work by relying on static and adaptive diffusion strategies. The resulting adaptive networks are robust to node and link failures an ...

IEEE2007