arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1004.5570cs.ITcs.NImath.IT
收藏

树型网络中对称布尔函数的优化计算

Optimal computation of symmetric Boolean functions in Tree networks

Hemant Kowshik, P. R. Kumar

摘要:

在本文中,我们解决的情况下,传感器数据的节点连接在一个树型网络,每个节点要计算一个给定的对称布尔函数的传感器数据。我们首先考虑计算两个节点的整数测量函数的问题。我们允许块计算,以提高数据融合的效率,并确定最小的最坏情况下的总位数进行交换,以执行所需的计算。我们利用愚弄集建立了下界,并利用信息论的工具给出了一个新的达到下界的方案。对于一类称为和阈值函数的函数,该方案是最优的。然后,我们转向树网络,并通过将其视为两个节点的问题,推导出每个链路上交换的比特数的下限。我们证明了递归网络聚合协议在和阈值函数的情况下达到了这个下界。因此,我们提供了一个通信和网络内的计算策略,是最佳的每个环节。所有结果都可以推广到非二进制字母表的情况。在一般图的情况下,我们提出了一个割集下界,和一个可实现的计划的基础上沿树聚集。对于完全图,该方案的复杂性不超过最优方案的两倍。

英文摘要:

In this paper, we address the scenario where nodes with sensor data are connected in a tree network, and every node wants to compute a given symmetric Boolean function of the sensor data. We first consider the problem of computing a function of two nodes with integer measurements. We allow for block computation to enhance data fusion efficiency, and determine the minimum worst-case total number of bits to be exchanged to perform the desired computation. We establish lower bounds using fooling sets, and provide a novel scheme which attains the lower bounds, using information theoretic tools. For a class of functions called sum-threshold functions, this scheme is shown to be optimal. We then turn to tree networks and derive a lower bound for the number of bits exchanged on each link by viewing it as a two node problem. We show that the protocol of recursive innetwork aggregation achieves this lower bound in the case of sumthreshold functions. Thus we have provided a communication and in-network computation strategy that is optimal for each link. All the results can be extended to the case of non-binary alphabets. In the case of general graphs, we present a cut-set lower bound, and an achievable scheme based on aggregation along trees. For complete graphs, the complexity of this scheme is no more than twice that of the optimal scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑