Efficient decentralized communications in sensor networks
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.
In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generated at various sets of source nodes and have to be transmitted to some set of sink nodes ...
This paper presents an evaluation of three software implementations of release consistency. Release consistent protocols allow data communication to be aggregated, and multiple writers to simultaneously modify a single page. We evaluated an eager invalidat ...
In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generated at various sets of source nodes and have to be transmitted to some set of sink nodes ...
We study the distributed infrastructures required for location-independent communication between mobile agents. These infrastructures are problematic: different applications may have very different patterns of migration and communication, and require diffe ...
Sensors acquire data, and communicate this to an interested party. The arising coding problem is often split into two parts: First, the sensors compress their respective acquired signals, potentially applying the concepts of distributed source coding. Then ...
We present a protocol for controlling a shared ATM multicast tree supporting many-to-many communication. The protocol supports one or several ATM VCCs of the many-to-many type. The number of VCCs is independent of the number of endpoints. The protocol guar ...
We consider a queuing problem in which both the service rate of a finite-buffer queue and its rate of arrivals are functions of the same partially observed Markov chain. Basic performance indices of this device, such as long term throughput and loss rates, ...
Distributed systems are the basis of widespread computing facilities enabling many of our daily life activities. Telebanking, electronic commerce, online booking-reservation, and telecommunication are examples of common services that rely on distributed sy ...
In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that opt ...
Feedback can considerably simplify the task of approaching and achieving the performance limits predicted by information theory. This paper determines some of the potential offered by feedback in a typical sensor network situation that could be termed moni ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2004
