...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International journal of communication systems >Distributed simultaneous wireless information and power transfer in multiuser amplify-and-forward ad hoc wireless networks
【24h】

Distributed simultaneous wireless information and power transfer in multiuser amplify-and-forward ad hoc wireless networks

机译：多用户放大转发自组织无线网络中的分布式同时无线信息和功率传输

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

摘要

This paper studies the problem of stable node matching for distributed simultaneous wireless information and power transfer in multiuser amplify-and-forward ad hoc wireless networks. Particularly, each source node aims to be paired with another node that takes the role of an amplify-and-forward relay to forward its signal to the destination, such that the achievable rate is improved, in return of some payment made to the relaying node. Each relaying node splits its received signal from its respective source into two parts: one for information processing and the other for energy harvesting. In turn, a matching-theoretic solution based on the one-to-one stable marriage matching game is studied, and a distributed polynomial-time complexity algorithm is proposed to pair each source node with its best potential relaying node based on the power-splitting ratios, such that their utilities or payments are maximized while achieving network stability. For comparison purposes, an algorithm to enumerate all possible stable matchings is also devised to study the impact of different matchings on the source and relay utilities. Simulation results are presented to validate the proposed matching algorithm and illustrate that it yields sum-utility and sum-payment that are closely comparable to those of centralized power allocation and node pairing, with the added merits of low complexity, truth telling, and network stability.
机译：本文研究了多用户放大转发自组织无线网络中分布式同时无线信息和功率传输的稳定节点匹配问题。特别地，每个源节点旨在与承担放大转发中继作用的另一个节点配对，以将其信号转发到目的地，从而提高可实现的速率，以作为对中继节点的一些支付的回报。 。每个中继节点将从其各自的源接收到的信号分为两部分：一个用于信息处理，另一个用于能量收集。反过来，研究了基于一对一稳定婚姻匹配博弈的匹配理论解，并提出了一种分布式多项式时间复杂度算法，基于功率分解将每个源节点与其最佳潜在中继节点配对。比率，以便在实现网络稳定性的同时最大化其效用或支付。为了进行比较，还设计了一种枚举所有可能的稳定匹配的算法，以研究不同匹配对源和中继实用程序的影响。通过仿真结果验证了所提出的匹配算法的有效性，并说明了该算法产生的总和效用和总付与集中式功率分配和节点配对的总效用和总付具有可比性，并具有低复杂度，真实性和网络稳定性的优点。 。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号