【24h】

On the interdependence of routing and data compression in multi-hop sensor networks

机译:关于多跳传感器网络中路由和数据压缩的相互依赖性

获取原文

摘要

We consider a problem of broadcast communication in a multi-hop sensor network, in which samples of a random field are collected at each node of the network, and the goal is for all nodes to obtain an estimate of the entire field within a prescribed distortion value. The main idea we explore in this paper is that of jointly compressing the data generated by different nodes as this information travels over multiple hops, to eliminate correlations in the representation of the sampled field. Our main contributions are: (a) we obtain, using simple network flow concepts, conditions on the rate/distortion function of the random field, so as to guarantee that any node can obtain the measurements collected at every other node in the network, quantized to within any prescribed distortion value; and (b), we construct a large class of physically-motivated stochastic models for sensor data, for which we are able to prove that the joint rate/distortion function of all the data generated by the whole network grows slower than the bounds found in (a). A truly novel aspect of our work is the tight coupling between routing and source coding, explicitly formulated in a simple and analytically tractable model---to the best of our knowledge, this connection had not been studied before.
机译:我们考虑了多跳传感器网络中的广播通信问题,其中在网络的每个节点上收集随机场的样本,目标是让所有节点在规定的失真范围内获得整个场的估计值价值。我们在本文中探讨的主要思想是,随着信息在多跳上的传播,共同压缩由不同节点生成的数据,以消除采样字段表示中的相关性。我们的主要贡献是:(a)我们使用简单的网络流概念来获取随机字段的速率/失真函数的条件,以确保任何节点都可以获取网络中每个其他节点收集的测量值并进行量化在任何规定的失真值之内; (b)我们为传感器数据构造了一类物理动机的随机模型,对于这些模型,我们能够证明整个网络生成的所有数据的联合速率/失真函数的增长速度都比在图2中找到的边界要慢。 (一种)。我们工作中一个真正新颖的方面是路由和源代码之间的紧密耦合,这是在简单且易于分析处理的模型中明确提出的-就我们所知,这种连接以前从未研究过。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号