Abstract
The performance of wireless networks can be largely enhanced by coordinated multipoint (CoMP). To design an efficient CoMP in multiuser multiple-input multiple-output scenario, conventional transmission scheduling and power allocation are usually performed in a static and centralized manner. In this paper, we focus on dynamic and distributed transmission scheduling and power allocation. We first determine the coordinated base-station sets (defined as CBSs) candidates in each subband by the channel energy ( i.e., square Frobenius norm of channel matrix) of each user. Each CBS candidate contains a set of coordination base-stations and edge users. By chordal distance, we can measure the orthogonality between space spanned of users in the same CBS candidate. Then, we propose two heuristic user scheduling algorithms based on channel energy and chordal distance between users to determine the set of users served by each CBS candidate. The first algorithm is based on an open problem, which reveals the philosophy of user scheduling with orthogonalization threshold guarantee. The second one deals with user scheduling by selecting a set of edge users with the largest total channel energy and orthogonalization threshold guarantee. With the total channel energy per CBS candidate, the CBSs and their served edge users can be determined. Then, water-filling power allocation is further applied to CBSs with block diagonalization precoding. Algorithm performance is demonstrated by extensive simulations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have