...
首页> 外文期刊>Wireless Communications, IEEE Transactions on >Robust Scheduling and Power Control for Vertical Spectrum Sharing in STDMA Wireless Networks
【24h】

Robust Scheduling and Power Control for Vertical Spectrum Sharing in STDMA Wireless Networks

机译:STDMA无线网络中用于垂直频谱共享的鲁棒调度和功率控制

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

摘要

We study the robust transmission scheduling and power control problem for spectrum sharing between secondary and primary users in a spatial reuse time-division multiple access (STDMA) network. The objective is to find a robust minimum-length schedule for secondary users (in terms of time slots) subject to the interference constraints for primary users and the traffic demand of secondary users. We consider the fact that power allocation based on average (or estimated) link gains can be improper since actual link gains can be different from the average link gains. Therefore, transmission of the secondary links may fail and require more time slots. We also consider this demand uncertainty arising from channel gain uncertainty. We propose a column generation-based algorithm to solve the scheduling and power control problem for secondary users. The column generation method breaks the problem down to a restricted master problem and a pricing problem. However, the classical column generation method can have convergence problem due to primal degeneracy. We propose an improved column generation algorithm to stabilize and accelerate the column generation procedure by using the perturbation and exact penalty methods. Furthermore, we propose an efficient heuristic algorithm for the pricing problem based on a greedy algorithm. For the simulation scenario considered in this paper, the proposed stabilized column generation algorithm can obtain the optimal schedules with 18.85% reduction of the number of iterations and 0.29% reduction of the number of time slots. Also, the heuristic algorithm can achieve the optimality with 0.39% of cost penalty but 1.67x10^4 times reduction of runtime.
机译:我们研究了空间复用时分多址(STDMA)网络中次要用户和主要用户之间频谱共享的鲁棒传输调度和功率控制问题。目的是找到受次要用户干扰约束和次要用户业务需求的鲁棒的次要用户最小长度调度表(根据时隙)。我们认为,基于实际(或估算)链路增益的功率分配可能不适当,因为实际链路增益可能与平均链路增益不同。因此,辅助链路的传输可能会失败,并需要更多的时隙。我们还考虑了由通道增益不确定性引起的需求不确定性。我们提出了一种基于列生成的算法来解决二级用户的调度和功率控制问题。列生成方法将问题分解为受限的主问题和定价问题。但是,由于原始简并性,经典列生成方法可能会出现收敛问题。我们提出了一种改进的列生成算法,通过使用扰动和精确罚分方法来稳定和加速列生成过程。此外,我们针对贪婪算法提出了一种有效的启发式定价算法。对于本文中考虑的仿真方案,所提出的稳定列生成算法可以获得最佳调度,迭代次数减少了18.85%,时隙数量减少了0.29%。同样,启发式算法可以以0.39%的成本损失实现最优性,但运行时间减少了1.67x10 ^ 4倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号