IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0298352.html
   My bibliography  Save this article

Joint downlink user association and interference avoidance with a load balancing approach in backhaul-constrained HetNets

Author

Listed:
  • Maryam Chinipardaz
  • Somaieh Amraee
  • Ahmad Sarlak

Abstract

In heterogeneous networks (HetNets), different lower-power base stations are added in a typically unplanned manner to the well-planned macro-only network, bringing new challenges to the network functions. Small cells experience limited backhaul capacity since cost-effective backhaul is not easily accessible to them. This study focuses on the issue of user association in backhaul-constrained HetNets. It shows that it is necessary to associate users with cells using a load balancing approach in order to fully leverage the addition of small cells. The cell association needs to be done jointly with an interference management technique that protects offloaded users and those prone to harmful interference. After modeling the system and describing the interference model, the problem of cell and subband allocation is formulated. We first examine the problem in a time-sharing mode and present a centralized heuristic solution to the cell and subband allocation problem. This is accomplished by solving the convex problem using the gradual removal method. The importance of providing distributed algorithms for HetNets leads to the development of a new algorithm through the application of the dual decomposition method to a reformulated problem and the use of an admission control mechanism. In the achieved algorithm, all computations are performed locally, with each user and base station relying only on local information. This algorithm obtains near-optimal answers, as confirmed by the simulation results. Compared with conventional cell allocation methods, our distributed algorithm prevents intensive interference for all users and achieves better load balance between network tiers, resulting in improved network utility.

Suggested Citation

  • Maryam Chinipardaz & Somaieh Amraee & Ahmad Sarlak, 2024. "Joint downlink user association and interference avoidance with a load balancing approach in backhaul-constrained HetNets," PLOS ONE, Public Library of Science, vol. 19(3), pages 1-31, March.
  • Handle: RePEc:plo:pone00:0298352
    DOI: 10.1371/journal.pone.0298352
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0298352
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0298352&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0298352?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Humayun Zubair Khan & Mudassar Ali & Muhammad Naeem & Imran Rashid & Adil Masood Siddiqui & Muhammad Imran & Shahid Mumtaz, 2021. "Joint admission control, cell association, power allocation and throughput maximization in decoupled 5G heterogeneous networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 76(1), pages 115-128, January.
    2. Lorena, Luiz Antonio N. & Narciso, Marcelo G., 1996. "Relaxation heuristics for a generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 600-610, June.
    3. Maryam Chinipardaz & Majid Noorhosseini, 2017. "A study on cell association in heterogeneous networks with joint load balancing and interference management," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 66(1), pages 55-74, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    2. Majumdar, J. & Bhunia, A.K., 2007. "Elitist genetic algorithm for assignment problem with imprecise goal," European Journal of Operational Research, Elsevier, vol. 177(2), pages 684-692, March.
    3. Lorenzo Ros-McDonnell & Norina Szander & María Victoria de-la-Fuente-Aragón & Robert Vodopivec, 2019. "Scheduling Sustainable Homecare with Urban Transport and Different Skilled Nurses Using an Approximate Algorithm," Sustainability, MDPI, vol. 11(22), pages 1-14, November.
    4. Lorenzo Ros-McDonnell & M. de-la-Fuente-Aragon & Marija Bogataj, 2012. "An approximate algorithm for optimal logistics of heavy and variable size items," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 1-17, March.
    5. Norina Szander & Lorenzo Ros-McDonnell & María Victoria De-la-Fuente-Aragón & Robert Vodopivec, 2018. "Sustainable Urban Homecare Delivery with Different Means of Transport," Sustainability, MDPI, vol. 10(2), pages 1-12, February.
    6. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    7. Diaz, Juan A. & Fernandez, Elena, 2001. "A Tabu search heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 22-38, July.
    8. Galvao, Roberto D. & Gonzalo Acosta Espejo, Luis & Boffey, Brian, 2000. "A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem," European Journal of Operational Research, Elsevier, vol. 124(2), pages 377-389, July.
    9. Igor Litvinchev & Socorro Rangel & Jania Saucedo, 2010. "A Lagrangian bound for many-to-many assignment problems," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 241-257, April.
    10. Lorena, Luiz Antonio N. & Goncalves Narciso, Marcelo, 2002. "Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems," European Journal of Operational Research, Elsevier, vol. 138(3), pages 473-483, May.
    11. Jafar Rezaei & Negin Salimi, 2015. "Optimal ABC inventory classification using interval programming," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(11), pages 1944-1952, August.
    12. Osorio, Maria A. & Laguna, Manuel, 2003. "Logic cuts for multilevel generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 151(1), pages 238-246, November.
    13. Gregory Tauer & Rakesh Nagi & Moises Sudit, 2013. "The graph association problem: Mathematical models and a lagrangian heuristic," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(3), pages 251-268, April.
    14. Li, Jing-Quan & Borenstein, Denis & Mirchandani, Pitu B., 2008. "Truck scheduling for solid waste collection in the City of Porto Alegre, Brazil," Omega, Elsevier, vol. 36(6), pages 1133-1149, December.
    15. Maryam Chinipardaz & Seyed Majid Noorhosseini & Ahmad Sarlak, 2022. "Inter-cell interference in multi-tier heterogeneous cellular networks: modeling and constraints," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 81(1), pages 67-81, September.
    16. H. Edwin Romeijn & Dolores Romero Morales, 2001. "Generating Experimental Data for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 49(6), pages 866-878, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0298352. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.