Abstract
Low-power base stations (BSs), such as pico BSs, femto BSs, and relay nodes, are introduced to the heterogeneous cellular networks to enhance coverage and improve system capacity. Compare with macro BS, low-power BS has much lower transmission power, smaller physical size and lower cost. Deploying low-power BSs within the coverage of macro BSs is considered as a cost-efficient way to meet the sharp increase of wireless applications, leading to a new radio network planning paradigm for the next generation cellular networks. In this paper, we study the minimum cost cell planning problem in such heterogeneous networks, where planning task is how to select a subset of possible BS sites, including macro BSs, pico BSs and relay nodes, to minimize the total deployment cost while satisfying all rate requirements of demand nodes. We develop an approximation algorithm to tackle the formulated NP-hard problem, which guarantees an approximation ratio of O(log R) to the optimal solution, where R is the maximal achievable capacity of BSs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
