Optimal Placement of Base Stations in Integrated Design of Wireless Networks

IF 0.7 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Programming and Computer Software Pub Date : 2024-03-12 DOI:10.1134/s0361768823100055

O. Yu. Pershin, A. A. Mukhtarov, V. M. Vishnevsky, A. A. Larionov

引用次数: 0

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.

Abstract Image

查看原文本刊更多论文

无线网络集成设计中基站的优化布局

摘要考虑了无线通信网络综合设计中的拓扑合成。本文开发了一种迭代方法，用于沿扩展交通路线布置宽带网络的基站。基站布置问题以特殊组合模型的形式被表述为有限集合上的极值问题。为解决这一问题，开发了分支与边界法（BBM）算法。该算法可作为寻找基站位置最佳变体序列的基础。数值计算证实了所提算法的效率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Programming and Computer Software 工程技术-计算机：软件工程

CiteScore

1.60

自引率

28.60%

发文量

审稿时长

>12 weeks

期刊介绍： Programming and Computer Software is a peer reviewed journal devoted to problems in all areas of computer science: operating systems, compiler technology, software engineering, artificial intelligence, etc.