...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on mobile computing >Efficient In-Network Computing with Noisy Wireless Channels
【24h】

Efficient In-Network Computing with Noisy Wireless Channels

机译：带有嘈杂无线通道的高效网络内计算

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we study distributed function computation in a noisy multihop wireless network. We adopt the adversarial noise model, for which independent binary symmetric channels are assumed for any point-to-point transmissions, with (not necessarily identical) crossover probabilities bounded above by some constant $(epsilon)$. Each node takes an $(m)$-bit integer per instance, and the computation is activated after each node collects $(N)$ readings. The goal is to compute a global function with a certain fault tolerance in this distributed setting; we mainly deal with divisible functions, which essentially cover the main body of interest for wireless applications. We focus on protocol designs that are efficient in terms of communication complexity. We first devise a general protocol for evaluating any divisible functions, addressing both one-shot $((N = O(1)))$ and block computation, and both constant and large $(m)$ scenarios. We also analyze the bottleneck of this general protocol in different scenarios, which provides insights into designing more efficient protocols for specific functions. In particular, we endeavor to improve the design for two exemplary cases: the identity function, and size-restricted type-threshold functions, both focusing on the constant $(m)$ and $(N)$ scenario. We explicitly consider clustering, rather than hypothetical tessellation, in our protocol design.
机译：在本文中，我们研究了嘈杂的多跳无线网络中的分布函数计算。我们采用对抗性噪声模型，对于任何点对点传输，都假定具有独立的二进制对称信道，交叉概率（不一定相同）在上面被某个常数ε限制。每个节点每个实例取一个$（m）$位整数，并且在每个节点收集$（N）$个读数后激活计算。目标是在此分布式设置中计算具有一定容错能力的全局函数。我们主要处理可分割的功能，这些功能实际上涵盖了无线应用感兴趣的主体。我们专注于在通信复杂性方面高效的协议设计。我们首先设计一种通用协议，用于评估任何可除的函数，同时解决一次性$（（N = O（1）））$和块计算以及常量和大型$（m）$情况。我们还将分析此通用协议在不同情况下的瓶颈，从而为设计针对特定功能的更有效协议提供了见识。特别是，我们努力改进两种示例情况的设计：恒等函数和大小受限制的类型阈值函数，它们都专注于不变的$（m）$和$（N）$方案。在协议设计中，我们明确考虑了群集，而不是假设的细分。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号