Three novel opportunistic scheduling algorithms in CoMP-CSB scenario
Three novel opportunistic scheduling algorithms in CoMP-CSB scenario
复制标题
CoMP-CSB场景下三种新颖的机会调度算法
DOI：
10.1007/s11432-013-4822-9
复制
发表时间：
2013-03
期刊：
影响因子：
--
通讯作者：
You XiaoHu
中科院分区：
文献类型：
--
作者：
Wang Hao;Liu Nan;Wu Ping;Pan ZhiWen;You XiaoHu
协作调度/波束成形（CSB）属于协作多点（CoMP）传输，由于其在降低小区间干扰（ICI）和提高小区边缘吞吐量方面的巨大潜力，同时它只需要有限的基站协作，易于实现，近年来受到了广泛关注。然而，据我们所知，有没有有效的调度算法，低复杂度和开销的CoMP-CSB场景。因此，在本文中，我们提出了三个新的机会调度算法在CoMP-CSB场景。所有这些算法都综合考虑了被调度用户在其服务小区的预期信道条件以及预期信道与相邻小区中并发调度用户的干扰信道之间的正交性，从而在利用多用户分集（MUD）的同时减轻ICI。算法1在所有用户具有大的本地信道反馈的候选用户集合内协作地选择最正交的用户对，而算法2在同一候选用户集合内并发地调度具有本地信道反馈和前述正交性之间的最大比率的用户对。算法3以类似于比例公平调度的方式执行，同时对其在CoMP-CSB场景中的使用进行适当的修改。所提出的调度算法的性能进行了评估，通过仿真。结果表明，它们都能在较好的公平性保证下显著提高接收信号干扰噪声比（SINR），从而获得比几种已知调度算法更大的吞吐量和效用。当上述候选用户集在大小上足够大并且具有稍多的开销/复杂度时，算法2甚至优于算法1。此外，算法3是所有三个提出的算法中最好的一个，但它需要更多的开销/复杂度比算法1和2。最后，我们给出了所有三个算法的最佳参数，这可以使性能和开销/复杂度之间的良好权衡。
Coordinated scheduling/beamforming (CSB), which belongs to the coordinated multi-point (CoMP) transmission, has received lots of attention recently due to its great potential to mitigate inter-cell interference (ICI) and to increase the cell-edge throughput, and meanwhile it only requires limited base station cooperation and is easy to implement. However, to the best of our knowledge, there are no effective scheduling algorithms with low complexity and overhead in CoMP-CSB scenario as yet. Thus, in this paper, we propose three novel opportunistic scheduling algorithms in CoMP-CSB scenario. All of them jointly consider the intended channel condition of the scheduled user from its serving cell and the orthogonality between the intended channel and the corresponding interference channels to concurrently scheduled users in nearby cells, thus exploiting multi-user diversity (MUD) and mitigating ICI at the same time. Algorithm 1 cooperatively chooses the most orthogonal user pair within a candidate user set in which all users have a large local channel feedback, while Algorithm 2 concurrently schedules the user pair with the largest ratio between the local channel feedbacks and the aforementioned orthogonality within the same candidate user set. Algorithm 3 performs in the way similar to the proportional fairness scheduling, while making a proper modification for its usage in CoMP-CSB scenario. The performance of the proposed scheduling algorithms are evaluated through simulation. Results show that, they all can significantly enhance the received signal to interference plus noise ratio (SINR) with relatively good fairness guarantee, thus achieving larger throughputs and utilities than several well-known scheduling algorithms. Algorithm 2 even outperforms Algorithm 1 when the aforementioned candidate user set is big enough in size and has a bit more overhead/complexity. Furthermore, Algorithms 3 is the best one among all the three proposed algorithms, but it requires more overhead/complexity than Algorithm 1 and 2. Finally, we give the optimal parameter for all of the three proposed algorithms, which can make a good tradeoff between performance and overhead/complexity.
登录
查看更多内容
DOI：
10.1109/glocom.2011.6133534
发表时间：
2011-12
期刊：
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011
影响因子：
--
作者：
Hao Wang;Lianghui Ding;Zhiwen Pan;Nan Liu;X. You
通讯作者：
Hao Wang;Lianghui Ding;Zhiwen Pan;Nan Liu;X. You
DOI：
10.1109/glocomw.2008.ecp.79
发表时间：
2008-11
期刊：
2008 IEEE Globecom Workshops
影响因子：
--
作者：
Patrick Hosein
通讯作者：
Patrick Hosein
影响因子：
11.2
作者：
Irmer, Ralf;Droste, Heinz;Jungnickel, Volker
通讯作者：
Jungnickel, Volker
DOI：
10.1109/ciss.2008.4558565
发表时间：
2008-03
期刊：
2008 42nd Annual Conference on Information Sciences and Systems
影响因子：
--
作者：
H. Dahrouj;Wei Yu
通讯作者：
H. Dahrouj;Wei Yu
影响因子：
12.9
作者：
Sawahashi, Mamoru;Kishiyama, Yoshihisa;Tanno, Motohiro
通讯作者：
Tanno, Motohiro