z-logo
open-access-imgOpen Access
Optimising coverage efficiency in heterogeneous wireless cellular networks
Author(s) -
Phan Ca V.,
Vien QuocTuan
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2020.0313
Subject(s) - computer science , mathematical optimization , heuristic , telecommunications link , constraint (computer aided design) , path loss , cellular network , wireless network , interference (communication) , wireless , power (physics) , lossy compression , computer network , mathematics , telecommunications , channel (broadcasting) , physics , geometry , quantum mechanics , artificial intelligence
In this study, the authors first propose an analytical model for investigating the impacts of power allocation (PA) and cell density allocation (CDA) on coverage efficiency (CE) of heterogeneous wireless cellular networks (HWCNs) under limited resources. It is shown that the interference among cells that belong to different tiers is reduced significantly in higher path loss environment and results in a higher coverage. The network coverage of the HWCN can be further extended with the deployment of a higher cell density in a more lossy environment. This accordingly leads us to develop an optimisation problem (OP) to maximise the CE by optimising the PA and CDA under the constraint of limited cell power and total power available in the downlink HWCN. In particular, they proposed a two‐stage approach for solving the OP to sequentially obtain the heuristic value of the CDA and PA due to complicated objective function along with various involved parameters. Numerical results reveal that the coverage obtained by the heuristic solution at the first‐stage is significantly improved with lower power than the conventional approach. Furthermore, an enhanced overall CE is achieved for all cases of the power constraint when applying fully two stages in their proposed algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here