Publication

On the Throughput of Ad Hoc Networks using Connectivity Graphs

Publications associées (77)

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 Broadcast Capacity of Wireless Networks With Cooperative Relays

Michael Christoph Gastpar

A fundamental problem in wireless networks is determining the broadcast capacity, i.e., the maximum data transfer rate from a given node to every other node in a relay network. This paper studies the scaling of the broadcast capacity for a network with a s ...

2010

Routing and search on large scale networks

Dominique Florian Tschopp

In this thesis, we address two seemingly unrelated problems, namely routing in large wireless ad hoc networks and comparison based search in image databases. However, the underlying problem is in essence similar and we can use the same strategy to attack t ...

EPFL2010

Throughput-Delay Tradeoff for Hierarchical Cooperation in Ad Hoc Wireless Networks

Olivier Lévêque, Ayfer Özgür Aydin

Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-end delay of this scheme turns out to be s ...

Institute of Electrical and Electronics Engineers2010

Networks of limit cycle oscillators with parametric learning capability

Max-Olivier Hongler, Julio Rodriguez

The fundamental idea that synchronized patterns emerge in networks of interacting oscillators is revisited by allowing a parametric learning mechanism to operate on the local dynamics. The local dynamics consist of stable limit cycle oscillators which, due ...

Springer2009

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

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

Distributed Spatio-Temporal Sampling of Diffusion Fields from Sparse Instantaneous Sources

Martin Vetterli, Yue Lu

We study the spatio-temporal sampling of a diffusion field driven by K unknown instantaneous source distributions. Exploiting the spatio-temporal correlation offered by the diffusion model, we show that it is possible to compensate for insufficient spatial ...

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

Network Resource Allocation for Competing Multiple Description Transmissions

Suhas Diggavi

Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple description (MD) coding is one approach to transmit the media over diverse (mult ...

2008

Identity Aware Sensor Networks

Christina Fragouli, Suhas Diggavi, Lorenzo Keller, Mahdi Jafari Siavoshani

In a significant class of sensor-network applications, the identities of the reporting sensors are an essential part of the reported information. For instance, in environmental monitoring, the goal is to reconstruct physical quantities over space and time; ...

2008