IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v16y2024i2p43-d1327216.html
   My bibliography  Save this article

A Spectral Gap-Based Topology Control Algorithm for Wireless Backhaul Networks

Author

Listed:
  • Sergio Jesús González-Ambriz

    (Centro de Investigación y Desarrollo de Tecnología Digital, Instituto Politécnico Nacional, Tijuana 22435, Mexico)

  • Rolando Menchaca-Méndez

    (Centro de Investigación en Computación, Instituto Politécnico Nacional, Ciudad de México 07700, Mexico)

  • Sergio Alejandro Pinacho-Castellanos

    (Corteza.ai, San Andrés Cholula 72830, Mexico)

  • Mario Eduardo Rivero-Ángeles

    (Centro de Investigación en Computación, Instituto Politécnico Nacional, Ciudad de México 07700, Mexico)

Abstract

This paper presents the spectral gap-based topology control algorithm (SGTC) for wireless backhaul networks, a novel approach that employs the Laplacian Spectral Gap (LSG) to find expander-like graphs that optimize the topology of the network in terms of robustness, diameter, energy cost, and network entropy. The latter measures the network’s ability to promote seamless traffic offloading from the Macro Base Stations to smaller cells by providing a high diversity of shortest paths connecting all the stations. Given the practical constraints imposed by cellular technologies, the proposed algorithm uses simulated annealing to search for feasible network topologies with a large LSG. Then, it computes the Pareto front of the set of feasible solutions found during the annealing process when considering robustness, diameter, and entropy as objective functions. The algorithm’s result is the Pareto efficient solution that minimizes energy cost. A set of experimental results shows that by optimizing the LSG, the proposed algorithm simultaneously optimizes the set of desirable topological properties mentioned above. The results also revealed that generating networks with good spectral expansion is possible even under the restrictions imposed by current wireless technologies. This is a desirable feature because these networks have strong connectivity properties even if they do not have a large number of links.

Suggested Citation

  • Sergio Jesús González-Ambriz & Rolando Menchaca-Méndez & Sergio Alejandro Pinacho-Castellanos & Mario Eduardo Rivero-Ángeles, 2024. "A Spectral Gap-Based Topology Control Algorithm for Wireless Backhaul Networks," Future Internet, MDPI, vol. 16(2), pages 1-17, January.
  • Handle: RePEc:gam:jftint:v:16:y:2024:i:2:p:43-:d:1327216
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/16/2/43/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/16/2/43/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    2. Changhua Yao & Lei Zhu & Yongxing Jia & Lei Wang, 2019. "Demand-aware traffic cooperation for self-organizing cognitive small-cell networks," International Journal of Distributed Sensor Networks, , vol. 15(1), pages 15501477188, January.
    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. Alfandari, Laurent, 2004. "Choice Rules with Size Constraints for Multiple Criteria Decision Making," ESSEC Working Papers DR 04002, ESSEC Research Center, ESSEC Business School.
    2. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    3. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    4. M Horn, 1996. "Analysis and Computational Schemes for p-Median Heuristics," Environment and Planning A, , vol. 28(9), pages 1699-1708, September.
    5. Eliş, Haluk & Tansel, Barbaros & Oğuz, Osman & Güney, Mesut & Kian, Ramez, 2021. "On guarding real terrains: The terrain guarding and the blocking path problems," Omega, Elsevier, vol. 102(C).
    6. Daoqin Tong & Alan T. Murray, 2009. "Maximising coverage of spatial demand for service," Papers in Regional Science, Wiley Blackwell, vol. 88(1), pages 85-97, March.
    7. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    8. Fredriksson, Anders, 2017. "Location-allocation of public services – Citizen access, transparency and measurement. A method and evidence from Brazil and Sweden," Socio-Economic Planning Sciences, Elsevier, vol. 59(C), pages 1-12.
    9. Gianmarco I P Ottaviano & Jacques-François Thisse, 2005. "New Economic Geography: What about the N?," Environment and Planning A, , vol. 37(10), pages 1707-1725, October.
    10. Schnepper, Teresa & Klamroth, Kathrin & Stiglmayr, Michael & Puerto, Justo, 2019. "Exact algorithms for handling outliers in center location problems on networks using k-max functions," European Journal of Operational Research, Elsevier, vol. 273(2), pages 441-451.
    11. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    12. Wen, Meilin & Iwamura, Kakuzo, 2008. "Fuzzy facility location-allocation problem under the Hurwicz criterion," European Journal of Operational Research, Elsevier, vol. 184(2), pages 627-635, January.
    13. Hong Gao & Kai Liu & Xinchao Peng & Cheng Li, 2020. "Optimal Location of Fast Charging Stations for Mixed Traffic of Electric Vehicles and Gasoline Vehicles Subject to Elastic Demands," Energies, MDPI, vol. 13(8), pages 1-16, April.
    14. Davood Shishebori & Lawrence Snyder & Mohammad Jabalameli, 2014. "A Reliable Budget-Constrained FL/ND Problem with Unreliable Facilities," Networks and Spatial Economics, Springer, vol. 14(3), pages 549-580, December.
    15. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    16. Behrens, Kristian, 2007. "On the location and lock-in of cities: Geography vs transportation technology," Regional Science and Urban Economics, Elsevier, vol. 37(1), pages 22-45, January.
    17. Kenneth Carling & Mengjie Han & Johan Håkansson, 2012. "Does Euclidean distance work well when the p-median model is applied in rural areas?," Annals of Operations Research, Springer, vol. 201(1), pages 83-97, December.
    18. Holzapfel, Andreas & Potoczki, Tobias & Kuhn, Heinrich, 2023. "Designing the breadth and depth of distribution networks in the retail trade," International Journal of Production Economics, Elsevier, vol. 257(C).
    19. Jiwon Baik & Alan T. Murray, 2022. "Locating a facility to simultaneously address access and coverage goals," Papers in Regional Science, Wiley Blackwell, vol. 101(5), pages 1199-1217, October.
    20. Csiszár, Csaba & Csonka, Bálint & Földes, Dávid & Wirth, Ervin & Lovas, Tamás, 2020. "Location optimisation method for fast-charging stations along national roads," Journal of Transport Geography, Elsevier, vol. 88(C).

    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:gam:jftint:v:16:y:2024:i:2:p:43-:d:1327216. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.