Infinite-message Interactive Function Computation in Collocated Networks
Abstract
An interactive function computation problem in a collocated network is studied in a distributed block source coding framework. With the goal of computing a desired function at the sink, the source nodes exchange messages through a sequence of error-free broadcasts. The infinite-message minimum sum-rate is viewed as a functional of the joint source pmf and is characterized as the least element in a partially ordered family of functionals having certain convex-geometric properties. This characterization leads to a family of lower bounds for the infinite-message minimum sum-rate and a simple optimality test for any achievable infinite-message sum-rate. An iterative algorithm for evaluating the infinite-message minimum sum-rate functional is proposed and is demonstrated through an example of computing the minimum function of three sources.
Keywords
Cite
@article{arxiv.1001.1763,
title = {Infinite-message Interactive Function Computation in Collocated Networks},
author = {Nan Ma and Prakash Ishwar},
journal= {arXiv preprint arXiv:1001.1763},
year = {2016}
}
Comments
5 pages. 2 figures. This draft has been submitted to IEEE International Symposium on Information Theory (ISIT) 2010