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

同位广播叠加网络中类型阈值函数的交互式计算

Interactive Computation of Type-Threshold Functions in Collocated Broadcast-Superposition Networks

Chien-Yi Wang, Sang-Woon Jeon, Michael Gastpar

摘要:

在无线传感器网络中,各种应用涉及学习由传感器观察到的测量的一个或多个函数,而不是测量本身。本文重点讨论类型阈值函数,例如,最大值和指示器功能。以前的工作研究了这个问题下的同位碰撞网络模型,并表明,在许多概率模型的测量,可实现的计算速率收敛到零的传感器的数量增加。本文考虑了两种同时反映无线信道广播和叠加特性的网络模型:同位线性有限域网络和同位高斯网络。一个通用的多轮编码方案开发不仅利用广播属性,但特别是也叠加属性的网络。通过仔细调度的并发传输,以减少冗余,它表明,任何独立的测量分布,所有类型的阈值函数可以可靠地计算与非零率在同位高斯网络,即使传感器的数量趋于无穷大。

英文摘要:

In wireless sensor networks, various applications involve learning one or multiple functions of the measurements observed by sensors, rather than the measurements themselves. This paper focuses on type-threshold functions, e.g., the maximum and indicator functions. Previous work studied this problem under the collocated collision network model and showed that under many probabilistic models for the measurements, the achievable computation rates converge to zero as the number of sensors increases. This paper considers two network models reflecting both the broadcast and superposition properties of wireless channels: the collocated linear finite field network and the collocated Gaussian network. A general multi-round coding scheme exploiting not only the broadcast property but particularly also the superposition property of the networks is developed. Through careful scheduling of concurrent transmissions to reduce redundancy, it is shown that given any independent measurement distribution, all type-threshold functions can be computed reliably with a non-vanishing rate in the collocated Gaussian network, even if the number of sensors tends to infinity.

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

↑