Optimal Placement of Base Stations in Integrated Design of Wireless Networks

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 fini...

Full description

Saved in:
Bibliographic Details
Published in:Programming and computer software 2023-12, Vol.49 (Suppl 2), p.S82-S90
Main Authors: Pershin, O. Yu, Mukhtarov, A. A., Vishnevsky, V. M., Larionov, A. A.
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Branch and bound methods
Broadband
Combinatorial analysis
Communication networks
Communications networks
Computer Science
Iterative methods
Network topologies
Operating Systems
Placement
Radio communications
Radio equipment
Roads & highways
Software Engineering
Software Engineering/Programming and Operating Systems
Topology
Transportation networks
Variables
Wireless communications
Wireless networks
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768823100055