Publication

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Publications associées (97)

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

QoSNC: A Novel Approach to QoS-Based Network Coding for Fixed Networks

Amir Hesam Salavati

In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, spec ...

2010

Fire Detection and Localization Using Wireless Sensor Networks

Martin Hasler, Alireza Khadivi

A Wireless Sensor Network (WSN) is a network of usually a large number of small sensor nodes that are wirelessly connected to each other in order to remotely monitor an environment or phenomena. Sensor nodes use the data aggregation method as an effective ...

Springer, 233 Spring Street, New York, Ny 10013, United States2010

Fire Detection and Localization Using Wireless Sensor Networks

Martin Hasler, Alireza Khadivi

Springer2010

Fire Detection and Localization Using Wireless Sensor Networks

Martin Hasler, Alireza Khadivi

Springer, 233 Spring Street, New York, Ny 10013, United States2010

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

On uncoordinated wireless ad-hoc networks

Alaeddine El Fawal

Emerging pervasive wireless networks, pocket switched networks, Internet of things, vehicular networks and even sensor networks present very challenging communication circumstances. They might involve up to several hundreds of wireless devices with mobilit ...

EPFL2009

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

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

Local restoration for trees and arborescences

Laura Sanità

Protocols belonging to the Spanning Tree Protocol (STP) route traffic demands on tree topologies that are evaluated through shortest path procedures. In this paper we deal with the problem of assigning costs to the arcs of a network in order to guarantee t ...

Springer Berlin / Heidelberg2009

Elucidating the Instability of Random Access Wireless Mesh Networks

Patrick Thiran, Adel Aziz, David Starobinski

We investigate both theoretically and experimentally the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. We identify two key factors that impac ...

2009