Network Flows for Function Computation
DSpace at IIT Bombay
View Archive InfoField | Value | |
Title |
Network Flows for Function Computation
|
|
Creator |
SHAH, V
DEY, BK MANJUNATH, D |
|
Subject |
Function computation
generalized flow conservation fractional packing graph embedding BROADCAST NETWORK TREES SUM |
|
Description |
We consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given. Some nodes in the network generate data, e. g., like sensor nodes in a sensor network. An arbitrary function of this distributed data is to be obtained at a terminal node. The structure of the function is described by a given computation schema, which in turn is represented by a directed tree. We design computing and communicating schemes to obtain the function at the terminal at the maximum rate. For this, we formulate linear programs to determine network flows that maximize the computation rate. We then develop a fast combinatorial primal-dual algorithm to obtain near-optimal solutions to these linear programs. As a subroutine for this, we develop an algorithm for finding the minimum cost embedding of a tree in a network with any given set of link costs. We then briefly describe extensions of our techniques to the cases of multiple terminals wanting different functions, multiple computation schemas for a function, computation with a given desired precision, and to networks with energy constraints at nodes.
|
|
Publisher |
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
|
|
Date |
2014-10-15T08:37:27Z
2014-10-15T08:37:27Z 2013 |
|
Type |
Article
|
|
Identifier |
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 31(4)714-730
http://dx.doi.org/10.1109/JSAC.2013.130409 http://dspace.library.iitb.ac.in/jspui/handle/100/14701 |
|
Language |
en
|
|