Concept

Public data network

Publications associées (39)

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

, , , ,

In this work, we evaluate the exploration of the Solar system by ad-hoc wireless sensor networks (WSN), i.e. networks where all nodes (either moving or stationary) can both provide and relay data. The two aspects of self-organization and localization are t ...

Elsevier2009

Issues in characterizing heterogeneity and connectivity in non-multiGaussian media

Ivan Lunati

The performances of kriging, stochastic simulations and sequential self-calibration inversion are assessed when characterizing a non-multiGaussian synthetic 2D braided channel aquifer. The comparison is based on a series of criteria such as the reproductio ...

2008

Issues in characterizing heterogeneity and connectivity in non-multiGaussian media

Ivan Lunati

2008

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the ...

2007

Concurrent Direct Network Access for Virtual Machine Monitors

Willy Zwaenepoel, Aravind Menon

This paper presents hardware and software mechanisms to enable concurrent direct network access (CDNA) by operating systems running within a virtual machine monitor. In a conventional virtual machine monitor, each operating system running within a virtual ...

2007

We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multihop wireless network with frequently changing topology. To effectively cope with arbitrary malicious disruption of data transmissions, we propose ...

2006

Ad-hoc wireless sensor networks for exploration of solar-system bodies

Herbert Shea

In this work, we evaluate the exploration of the solar system by ad-hoc wireless sensor networks (WSN), i.e. networks where all nodes (either moving or stationary) can both provide and relay data. The two aspects of self-organization and localization are t ...

2006

Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks

Jean-Pierre Hubaux, Jun Luo

Although many energy efficient/conserving routing protocols have been proposed for wireless sensor networks, the concentration of data traffic towards a small number of base stations remains a major threat to the network lifetime. The main reason is that t ...

2005

Algebraic-geometric codes on the erasure channel

Mohammad Amin Shokrollahi, Andrew Brown

This paper investigates the use of algebraic-geometric codes for data transmission over a packet network, by comparing their encoding/decoding speeds to those of the ubiquitous Reed-Solomon Codes. We take advantage of the fact that AG codes allow the const ...

2004

This thesis discusses techniques for sharing the processing load among multiple processing units within systems that act as nodes in a data communications network. Load-sharing techniques have been explored in the field of computer science for many years a ...

EPFL2003