Concept

Réseau superposé

Publications associées (526)

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

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

On Source Transmission over Deterministic Relay Networks

Suhas Diggavi

Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all ...

2010

Self-organized fault-tolerant routing in peer-to-peer overlays

Karl Aberer, Wojciech Galuba, Zoran Despotovic

In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and d ...

IEEE2009

Delay-based overlay construction in P2P video broadcast

Pascal Frossard

We consider streaming video content over an overlay network of peer nodes. Each of the nodes employs a mesh-pull mechanism to organize the download of data units from its neighbours. We propose a novel algorithm for constructing the distribution overlay, w ...

2009

Utility-based Packet Scheduling in P2P Mesh-based Multicast

Pascal Frossard

We consider streaming video content over an overlay network of peer nodes. We propose a novel streaming strategy that is built on utility-based packet scheduling and proportional resource sharing in order to fight against free- riders. Each of the peers em ...

2009

On the capacity of multisource non-coherent network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the r ...

2009

A method of calculating path observation likelihood from GPS data

Michel Bierlaire, Jingmin Chen, Jeffrey Newman

A method is proposed to probabilistically map location observations to the underlying network. Instead of generating a single path as the map matching algorithms do, this method aims at calculating a likelihood for each potentially true path to have been t ...

2009

A method of probabilistic map distribution of path likelihood

Michel Bierlaire, Jingmin Chen, Jeffrey Newman

A method is proposed to robabilistically map location observations to the underlying network. Instead of generating a single path as the map matching algorithms do, this method aims at calculating a likelihood for each potentially true path to have been th ...

2009