...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Capacity of wireless erasure networks
【24h】

Capacity of wireless erasure networks

机译：无线擦除网络的容量

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

摘要

In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring each node to send the same signal on all outgoing channels. However, we assume there is no interference in reception. Such models are therefore appropriate for wireless networks where all information transmission is packetized and where some mechanism for interference avoidance is already built in. This paper looks at multicast problems over these networks. The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained. It turns out that the capacity region has a nice max-flow min-cut interpretation. The definition of cut-capacity in these networks incorporates the broadcast property of the wireless medium. It is further shown that linear coding at nodes in the network suffices to achieve the capacity region. Finally, the performance of different coding schemes in these networks when no side information is available to the destinations is analyzed.
机译：在本文中，考虑了一种特殊的无线网络，称为无线擦除网络。在这些网络中，每个节点通过可能相关的擦除通道连接到一组节点。网络模型通过要求每个节点在所有传出信道上发送相同的信号来合并无线环境的广播性质。但是，我们假设对接收没有干扰。因此，这样的模型适用于所有信息传输都已打包并且已经内置某种避免干扰机制的无线网络。本文着眼于这些网络上的组播问题。在将网络的所有链路上的擦除位置提供给目的地的假设下获得容量。事实证明，容量区域具有很好的最大流量最小割值解释。这些网络中的削减容量定义结合了无线媒体的广播属性。进一步示出，在网络中的节点处的线性编码足以实现容量区域。最后，分析了没有辅助信息可用于目的地时这些网络中不同编码方案的性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号