A distributed minimum-distortion routing algorithm with in-network data processing
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We consider sensor networks that measure spatio-temporal correlated processes. An important task in such settings is the reconstruction at a certain node, called the sink, of the data at all points of the field. We consider scenarios where data is time cri ...
Multi-hop hybrid networks can help providing both high bandwidth and broad coverage for wireless data networks. We focus on CSMA/CA-based networks and take IEEE 802.11 as a concrete example. We show that the three fundamental operations of synchronization, ...
The analysis and design of routing algorithms for finite buffer networks requires solving the associated queue network problem which is known to be hard. We propose alternative and more accurate approximation models to the usual Jackson’s Theorem that give ...
We consider data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information, collected by the nodes, to the sink node. This problem requires a joint ...
We derive performance expressions for the throughput and blocking probability for a class of wireless networks with a clustering protocol. The nodes are assumed stationary and establish connections with the master node according to a priority scheme that r ...
We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failures) and the dynamic case (node failures). For static networks, we derive upp ...
The Short Messaging Service(SMS) which has become very popular in cellular networks is very highly priced. We show in this paper how self-organizing ad-hoc networks can be used to provide the short messaging service, at a much lower price. We propose a rou ...
In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes self-organize with the goal of forming an efficient overlay tree, one that meets pe ...
We consider the issue of which criteria to use when evaluating the design of a wireless multihop network. It is known, and we illustrate in this paper, that maximizing the total capacity, or transport capacity, leads to gross imbalance and is not suitable. ...
