...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Multicasting in Large Wireless Networks: Bounds on the Minimum Energy Per Bit
【24h】

Multicasting in Large Wireless Networks: Bounds on the Minimum Energy Per Bit

机译：大型无线网络中的多播：每比特最小能量的界限

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

摘要

In this paper, we consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied—dense random networks and constant density (extended) random networks. In addition, we also study finite size regular networks in order to understand how regularity in node placement affects energy consumption. We first establish an information-theoretic lower bound on the minimum energy per bit for multicasting in arbitrary wireless networks when the channel state information is not available at the transmitters. Upper bounds are obtained by constructing a simple flooding scheme that requires no information at the receivers about the channel states or the locations and identities of the nodes. The gap between the upper and lower bounds is only a constant factor for dense random networks and regular networks, and differs by a poly-logarithmic factor for extended random networks. Furthermore, we show that the proposed upper and lower bounds for random networks hold almost surely in the node locations as the number of nodes approaches infinity.
机译：在本文中，随着网络中节点数量的增加，我们考虑了缩放定律，以实现将消息传递到无线网络中所有节点的最大能量效率。研究了大型无线网络的两种情况-密集随机网络和恒定密度（扩展）随机网络。此外，我们还研究了有限大小的规则网络，以了解节点放置的规则性如何影响能耗。首先，当信道状态信息在发送器上不可用时，在任意无线网络中用于多播的每位最小能量上建立一个信息理论下限。通过构造一个简单的泛洪方案即可获得上限，该泛洪方案在接收器上不需要有关信道状态或节点的位置和身份的信息。上限和下限之间的差距对于密集的随机网络和常规网络而言只是一个常数，而对于扩展的随机网络而言，其对数因子却有所不同。此外，我们表明，随着节点数量接近无穷大，随机网络的拟议上限和下限几乎可以肯定地保持在节点位置。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号