Skip to content
naulon
Not checkedNot checked for notices yet.

Analysis of SIR and Rate Meta Distributions for 3D Heterogenous Ultra-Dense Networks With Joint Offloading and Resource Partitioning

Yong Luo, Zhiping Shi, Fan Bu

IEEE Access · 2020

doi:10.1109/access.2020.2976492 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In heterogeneous ultra-dense networks (HUDNs), load balancing is always considered by offloading users from the macro base station (MBS) tier to the small base station (SBS) tier, to alleviate the data traffic of the MBS tier, while it causes a serious problem that the offloaded users will suffer strong interference from the MBS tier, and hence the signal-to-interference ratio (SIR) is in low region for the offloaded users. In order to improve the performance of these offloaded users, an interference mitigation scheme based on resource partitioning is employed in the literature. Specifically, a fraction of resource blocks (RBs) is reserved for the offloaded users, and then the SIRs of these users will be enhanced because there is only interference from the SBS tier. In summary, the combination of offloading and resource partitioning is called joint offloading and resource partitioning scheme, which has been investigated in the HUDNs built on the 2D space, while it has rarely been deliberated in 3D HUDNs that are used to model the scenario of high-rise buildings. Moreover, a two-tier 3D HUDN is proposed in this paper, and the MBS and SBS tiers are modeled as two independent Poisson point processes. Then, the SIR and rate meta distributions, which are used to characterize the fraction of users that achieve a desired link reliability given SIR or rate thresholds, are formulated for the proposed 3D HUDN. Lastly, numerical results show that with the usage of the joint offloading and resource partitioning scheme, the performance of the proposed 3D HUND can be significantly improved.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.