Abstract
Cellular wireless network architectures employing a tiered structure, consisting of traditional macro-cells and small-cells, have attracted much attention recently because of their potential to dramatically increase network capacity. These architectures can reduce the distances of transmit-receiver pairs, thus enhancing radio link qualities. However, a tiered cell deployment could incur severe cochannel interference. Prior work for single-tier networks has proposed coordinated multi-point (CoMP) transmission, which includes joint transmission, as a possible solution for overcoming the rate limitations induced by cochannel interference. Because users in each cell experience various interference conditions, each cell needs to support single transmission (in which only one cell transmits to a single user) and joint transmission. In a conventional implementation, a particular combination of transmissions over the entire network is fixed in advance for each time slot and opportunistic scheduling chooses one of the users supported by each transmission. However, when the number of users to be scheduled is small, the throughput improvement from opportunistic scheduling becomes limited. To overcome this problem, we propose a cumulative distribution function-based scheduling scheme which jointly chooses the transmitter set and the corresponding scheduled users in a two-tier network. It is shown that the throughput performance can be improved compared to those of the fixed slot resource allocation scheme because more users "compete" for slot resources.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.