首页> 外文会议>2014 IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications >Cooperative beamforming in ad-hoc networks with sublinear transmission power
【24h】

Cooperative beamforming in ad-hoc networks with sublinear transmission power

机译:具有亚线性传输功率的ad-hoc网络中的协作波束成形

获取原文
获取原文并翻译 | 示例

摘要

The efficiency of routing algorithms in ad-hoc networks is measured by delay, throughput, and energy. Here, we focus on routing algorithms optimizing energy consumption while providing small routing delay. For this, we exploit the sender beamforming gain in the line-of-sight path-loss model, where multiple nodes (each with a single antenna) cooperate for beamforming and the routing algorithms provide distributed self-synchronization. While direct point-to-point communication over distance d in the line-of-sight model needs transmission power Θ(d), and multi-hop power needs power Θ(d) and delay Θ(d), we can reduce the power to Θ(√d) or Θ(log d) depending on the geometry. We present three algorithms with different trade-offs. The first algorithm is designed for grid nodes in the plane and has a point-to-point delay of Θ(log d) and overall power consumption of Θ(√d). The second algorithm for the same geometry decreases the delay to Θ(1 over ε log log d) with power Θ((√d)) for ε > 0. The third algorithm requires a three-dimensional grid network and achieves a delay of Θ(log d) and reduces the energy needed by all nodes to Θ(log d).
机译:ad-hoc网络中路由算法的效率由延迟,吞吐量和能量来衡量。在这里,我们专注于优化能耗的路由算法,同时提供较小的路由延迟。为此,我们在视线路径损耗模型中利用了发送方波束成形增益,其中多个节点(每个节点都有一个天线)协作进行波束成形,而路由算法则提供了分布式自同步。在视线模型中,距离d上的直接点对点通信需要传输功率Θ(d),而多跳功率则需要功率Θ(d)和延迟Θ(d),但我们可以降低功率取决于几何形状为θ(√d)或Θ(log d)。我们提出三种具有不同权衡的算法。第一种算法是针对平面中的网格节点设计的,点对点延迟为Θ(log d),总功耗为Θ(√d)。对于相同几何结构的第二种算法,对于ε> 0,具有幂Θ((√d)),将延迟降低到Θ(相对于εlog log d)。第三种算法需要三维网格网络,并实现Θ的延迟。 (log d),并将所有节点所需的能量减少到Θ(log d)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号