首页> 中文期刊>信号处理 >中继协作异构网用户对级联方案及安全概率分析

中继协作异构网用户对级联方案及安全概率分析

     

摘要

This paper proposes a model of relay cooperative multi-tier heterogeneous networks (HetNets),which consists of different types of relays and user pairs communicate with each other through the relay.All network elements are modeled as independent Poisson point process (PPP).Different from the traditional single-hop network,the user-pair associated depending on dual-hop link.To this end,the paper proposes a maximum-minimum user-pair association (MM-UPA) criterion against this novel network.Meanwhile,in order to overcome the bottleneck effect of MM-UPA criterion,a new UPA scheme which called maximum harmonic mean user-pair association (MHM-UPA) is further proposed in this paper,and this MHM-UPA criterion considers jointly dual-hop link.Posteriorly,by means of stochastic geometry and PPP,the user pair association probabilities of MM-UPA and MHM-UPA scheme are obtained,respectively.In the end,as an implementation of the proposed UPA criterions,the physical layer security of the considered HetNets is investigated,and the total average security probabilities are gained.The results show that proposed two UPA criterions consider jointly the performance of the source-relay and relay-destination two-hop links,and both are superior to single-hop user association scheme,so are suitable for relay assisted multi-tier HetNets.%文章提出了一种基于中继协作的多层异构网(heterogeneous networks,HetNets)模型,其由不同类型的中继和在中继协助下通信的用户对构成,这些网络元素均建模为独立的泊松点过程(Poisson point process,PPP).不同于传统的单跳网络,该网络中用户对的级联由两跳链路决定,为此,文章面向该网络首先提出了最大-最小用户对级联(maximum-minimum user-pair association,MM-UPA)方案.同时,为了克服MM-UPA准则的瓶颈效应,文章又提出了联合考虑两跳链路质量的最大和谐均值用户对级联(maximum harmonic mean user-pair association,MHM-UPA)方案.其次,借助于随机几何和PPP方法,分别得到了MM-UPA和MHM-UPA方案的用户对级联概率.最后,作为所提方案的应用,研究了网络物理层安全性能,获得了网络平均安全概率.研究结果表明,两种方案均联合考虑了信源-中继和中继-信宿两跳链路的性能,优于基于单跳的用户级联方案,适用于中继协作的多层HetNets.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号