首页> 外文会议>IEEE Annual International Symposium on Personal, Indoor, and Mobile Radio Communications >Performance optimization of co-existing underlay secondary networks
【24h】

Performance optimization of co-existing underlay secondary networks

机译:共存底层辅助网络的性能优化

获取原文

摘要

In this paper, we analyze the throughput performance of two co-existing downlink multiuser underlay secondary networks that use fixed-rate transmissions (FRT). We assume that the interference temperature limit (ITL) is apportioned to accommodate two concurrent transmissions using an apportioning parameter to ensure that the overall interference to the primary receiver does not exceed the ITL. Using the derived analytical expressions for throughput, when there is only one secondary user in each network, or when the secondary networks do not employ opportunistic user selection (use round robin scheduling for example), there exists a critical fixed-rate below which sum throughput with co-existing secondary networks transmitting concurrently is higher than the throughput achieved by a single secondary network. We derive an expression for this critical fixed-rate. Below this critical rate, we show that careful apportioning of the ITL is critical to maximize the sum throughput of the co-existing networks. We derive an expression for this apportioning parameter. Throughput is seen to increase with increase in number of users in each of the secondary networks employing opportunistic selection. Computer simulations demonstrate accuracy of the derived expressions.
机译:在本文中,我们分析了两个同时使用固定速率传输(FRT)的下行链路多用户底层辅助网络的吞吐性能。我们假定使用分配参数对干扰温度限制(ITL)进行分配,以适应两次并发传输,以确保对主接收器的总体干扰不超过ITL。使用导出的吞吐量的解析表达式,当每个网络中只有一个辅助用户时,或者当辅助网络不采用机会用户选择(例如,使用轮循调度)时,存在一个关键的固定速率,低于该速率时,吞吐量之和与并存的辅助网络同时发送的数据要高于单个辅助网络所实现的吞吐量。我们得出了这个关键固定利率的表达式。在此临界速率以下,我们表明,仔细分配ITL对最大化共存网络的总吞吐​​量至关重要。我们为此分摊参数导出表达式。在使用机会选择的每个辅助网络中,吞吐量随着用户数量的增加而增加。计算机仿真证明了导出表达式的准确性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号