NDLI: Three novel opportunistic scheduling algorithms in CoMP-CSB scenario

Content Provider	Springer Nature Link
Author	Wang, Hao Liu, Nan Wu, Ping Pan, ZhiWen You, XiaoHu
Copyright Year	2013
Abstract	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.
Starting Page	1
Ending Page	12
Page Count	12
File Format	PDF
ISSN	1674733X
Journal	Science in China Series : Information Sciences
Volume Number	56
Issue Number	8
e-ISSN	18691919
Language	English
Publisher	Springer Berlin Heidelberg
Publisher Date	2013-03-15
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	coordinated multi-point (CoMP) coordinated scheduling/beamforming (CSB) inter-cell interference (ICI) multi-user diversity (MUD) opportunistic scheduling Information Systems and Communication Service
Content Type	Text
Resource Type	Article
Subject	Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Joint MUD exploitation and ICI mitigation based scheduling with limited base station cooperation

Inter-cell coordinated beamforming with opportunistic scheduling

Novel CQI update methods in CoMP transmission

CoMP-CSB for ICI Nulling with User Selection

User pairing transmission scheme in uplink coordinated multi-point reception

A Novel Opportunistic Scheduling Algorithm in Coordinated Multi-Point Transmission Scenario

Clustering-based Assignment within CoMP systems

On the multiuser diversity in SIMO interfering multiple access channels: Distributed user scheduling framework

Novel time offset pre-processing and interference cancellation for downlink OFDMA CoMP system

Three novel opportunistic scheduling algorithms in CoMP-CSB scenario

Similar Documents

Joint MUD exploitation and ICI mitigation based scheduling with limited base station cooperation

Inter-cell coordinated beamforming with opportunistic scheduling

Novel CQI update methods in CoMP transmission

CoMP-CSB for ICI Nulling with User Selection

User pairing transmission scheme in uplink coordinated multi-point reception

A Novel Opportunistic Scheduling Algorithm in Coordinated Multi-Point Transmission Scenario

Clustering-based Assignment within CoMP systems

On the multiuser diversity in SIMO interfering multiple access channels: Distributed user scheduling framework

Novel time offset pre-processing and interference cancellation for downlink OFDMA CoMP system

Three novel opportunistic scheduling algorithms in CoMP-CSB scenario