Bounds on the coverage probability of heterogeneous cellular networks

2016

Full text Open access: Green Metadata (CSL-JSON)
DOI 10.1109/iccw.2016.7503878
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

In a heterogeneous cellular network (HCN), multiple tiers are employed to improve the network coverage probability. For this purpose, different properties of the coverage probability of an HCN should be studied carefully. This paper is classified into two main parts. First, a tight upper bound for the coverage probability of an HCN is derived. It is shown that this upper bound can be used as a good approximation for computing the network coverage probability. At the first glance, one may suppose that adding a new tier to an HCN improves the total coverage probability. In the second part, we study and formulate this problem and investigate the circumstances under which the coverage probability is improved by adding a new tier. Simulation results confirm the validity of our work and show that adding more base stations in the form of a new tier in populated areas can significantly increase the coverage probability, while in less dense areas adding a new tier is not much efficient in terms of improving the coverage probability.