Abstract
Topology synthesis in integrated design of wireless communication networks is considered. An iterative method has been developed for placing base stations of a broadband network along extended transportation routes. The problem of base station placement is formulated as an extremal problem on a finite set in the form of a special combinatorial model. An algorithm of the branch and bound method (BBM) has been developed to solve this problem. This algorithm serves as the basis for finding a sequence of best variants for the placement of base stations. Numerical calculations confirming the efficiency of the proposed algorithm are described.
REFERENCES
Vishnevskii, V.M., Teoreticheskie osnovy proektirovaniya komp’yuternykh setei (Theoretical Bases for Computer Network Design), Moscow: Tekhnosfera, 2003.
Guerna, A., Bitam, S., and Calafate, C.T., AC-RDV: A novel ant colony system for roadside units deployment in vehicular ad hoc networks, Peer-to-Peer Network Appl., 2021, vol. 14, no. 2, pp. 627–643.
Gao, Z., Chen, D., Cai, Sh., et al., Optimal and greedy algorithms for the one-dimensional RSU deployment problem with new model, IEEE Trans. Veh. Technol., 2018, vol. 67, no. 8, pp. 7643–7657.
Jalooli, A., Song, M., and Wang, W., Message coverage maximization in infrastructure-based urban vehicular networks, Veh. Commun., 2019, vol. 16, pp. 1–14.
Mavromatis, I., Tassi, A., Piechocki, R.J., et al., Efficient millimeter-wave infrastructure placement for city-scale ITS, in IEEE 89th Vehicular Technology Conference (VTC2019-Spring), Kuala Lumpur, Malaysia, 2019, pp. 1–5, https://doi.org/10.1109/VTCSpring.2019.8746518.
Amine, O.M. and Khireddine, A., Base station placement optimisation using genetic algorithms approach, Int. J. Comput. Aided Eng. Technol., 2019, vol. 11, no. 6, pp. 635–652.
Skakov, E.S., et al., Bee optimization algorithm for solving the problem of planning a wireless network, Int. J. Software Prod. Syst., 2016, vol. 32, pp. 67–73.
Chirkova, Yu.V., Problem of choosing and placing base stations in a wireless network, in Upravlenie bol’shimi sistemami: sbornik trudov (Management of Large Systems: Collection of Works), 2020, vol. 87, pp. 26–46.
Liu, C., Huang, H., and Du, H., Optimal RSUs deployment with delay bound along highways in VANET, J. Comb. Optim., 2017, vol. 33, no. 4, pp. 1168–1182.
Lazareva, B.E., Larionov, A.A., and Mukhtarov, A.A., The calculation of end-to-end delays and queue sizes in a tandem network using machine learning methods, in Materialy Vserossiiskoi konferentsii s mezhdunarodnym uchastiem ITTMM 2020 (Proceedings of the All-Russian Conference with International Attendance – Information and Telecommunication Technologies and Mathematical Modeling of High-Tech Systems ITTMM 2020), Moscow: RUDN, 2020, pp. 43–48.
Vishnevsky, V.M., Larionov, A.A., and Mukhtarov, A.A., Calculation of a tandem network performance characteristics with fixed incoming packet size using machine learning, Materialy 13-i konferentsii ICAM-2020 (Proceedings of the 13th Conference ICAM-2020), Tomsk: Izd. dom Tomsk. gos. univ., 2020, p. 82.
Larionov, A., Vishnevsky, V., Semenova, O., and Dudin, A., et al., A multiphase queueing model for performance analysis of a multi-hop IEEE 802.11 wireless network with DCF channel access, IEEE Trans. Wireless Commun., 2019. p. 162–176.
Kozyrev, D. and Radkevich, D., Reliability estimation of a broadband wireless network with linear topology and cross redundancy, AIP Conf. Proc., 2019, vol. 2116, no. 1, p. 090008.
Vishnevsky, V., Larionov, A., Ivanov, R., et al., Estimation of IEEE 802.11 DCF access performance in wireless networks with linear topology using PH service time approximations and MAP input, in IEEE 11th International Conference on Application of Information and Communication Technologies (AICT), Moscow, 2017, pp. 1–5.
Kim, J., Dudin, A., Dudin, S., and Kim, C., Analysis of a semi-open queueing network with Markovian arrival process, Perform. Eval., 2018, vol. 120, pp. 1–19.
Ivanov, R., Mukhtarov, A., and Pershin, O., A problem of optimal location of given set of base stations in wireless networks with linear topology, Commun. Comput. Inf. Sci., 2019, p. 53–64.
Gary, M and Johnson, D., Computing Machines and Intractable Problems, Moscow: Mir, 1982.
Emelichev, V.A. and Komlik, V.I., Metod postroeniya posledovatel’nosti planov dlya resheniya zadach diskretnoi optimizatsii (Method for Constructing a Sequence of Plans for Solving Discrete Optimization Problems), Moscow: Nauka, 1981.
Burke, P.J., The output of a queuing system, Oper. Res., 1956, vol. 4, no. 6, pp. 699–704.
Smirnova, E.V., Proletarskii, A.V., and Romashkina, E.A., Tekhnologiya sovremennykh besprovodnykh setei Wi-Fi (Technology of Modern Wireless Wi-Fi Networks), Moscow: MGTU im. N.E. Baumana, 2017.
Little, J.D.C., A proof for the queuing formula: L = λW, Oper. Res., 1961, vol. 9, no. 3, p. 383–387.
Funding
This work was supported by the Russian Foundation for Basic Research, project no. 19-29-06043.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
The authors of this work declare that they have no conflicts of interest.
Additional information
Translated by V. Arutyunyan
Publisher’s Note.
Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Pershin, O.Y., Mukhtarov, A.A., Vishnevsky, V.M. et al. Optimal Placement of Base Stations in Integrated Design of Wireless Networks. Program Comput Soft 49 (Suppl 2), S82–S90 (2023). https://doi.org/10.1134/S0361768823100055
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0361768823100055