• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IEEE Global Communications Conference >Interference-aware dual-hop cooperative relaying in a poisson field of interferers
【24h】

Interference-aware dual-hop cooperative relaying in a poisson field of interferers

机译：干扰者泊松场中具有干扰感知的双跳协作中继

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper, we study amplify-and-forward dual-hop cooperative relaying protocols in the presence of Rayleigh fading, additive noise at the relay, as well as additive noise and symmetric alpha-stable interference at the destination. A quasi-static interference scenario is considered, which arises, e.g., when the same interferers are active during broadcast and relaying phases. At the destination, a maximal ratio combining demodulator is developed and studied, by assuming that the aggregate interference can be estimated, i.e., interference-aware design. A closed-form expression of the end-to-end moment generating function is provided and the achievable diversity order is studied. Two main results emerge from the paper: 1) if the ratio of the transmit-powers of cooperative and interfering networks is a constant, the diversity order is equal to 1 and 2) if the transmit-power of the interfering network is a constant, the diversity order is equal to 1 + 1/b, where b > 1 is the amplitude path-loss exponent. In the latter case, thus, second-order diversity is achieved asymptotically, as the amplitude path-loss exponent tends to one. Mathematical frameworks and findings are validated with the aid of Monte Carlo simulations.
机译：在本文中，我们研究了存在瑞利衰落，中继器的加性噪声​​以及目的地的加性噪声​​和对称α稳定干扰的情况下的放大转发双跳协作中继协议。考虑了准静态干扰情况，例如，当相同的干扰源在广播和中继阶段处于活动状态时，就会出现这种情况。在目的地，通过假定可以估计总干扰，即干扰感知设计，来开发和研究最大比率组合解调器。提供了端到端矩生成函数的闭式表达式，并研究了可实现的分集阶数。本文得出两个主要结果：1）如果协作网络和干扰网络的发射功率之比为常数，则分集阶数等于1和2）如果干扰网络的发射功率为常数，分集阶数等于1 + 1 / b，其中b> 1是幅度路径损耗指数。因此，在后一种情况下，随着幅度路径损耗指数趋向于1，渐近地实现了二阶分集。数学框架和发现在蒙特卡洛模拟的帮助下得到了验证。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号