Automatic base station placement and dimensioning for mobile network planning
24 Sep 2000-Vol. 4, pp 1544-1549
TL;DR: A highly efficient optimization strategy forms the core of the proposed algorithm that determines the number of base stations, their sites, and parameters to achieve a high-quality network that meets the requirements of area coverage, traffic capacity, and interference level.
Abstract: This paper presents an innovative algorithm for automatic base station placement and dimensioning. A highly efficient optimization strategy forms the core of the proposed algorithm that determines the number of base stations, their sites, and parameters to achieve a high-quality network that meets the requirements of area coverage, traffic capacity, and interference level, while trying to minimize system costs, including the frequency and financial costs. First, the hierarchical approach is outlined and it is applied to place base stations (BSs) for a large-scale network design. Also a fuzzy expert system is developed to exploit the expert experience to adjust BS parameters, e.g., the transmitted power, to improve the network performance. Simulation results are presented and analyzed.
Citations
More filters
07 Oct 2001
TL;DR: A new representation describing base station placement with a real number is proposed, and new genetic operators are introduced that can describe not only the locations of the base stations but also the number of those.
Abstract: In this paper, we find the best base station placement using a genetic approach. A new representation describing base station placement with a real number is proposed, and new genetic operators are introduced. This new representation can describe not only the locations of the base stations but also the number of those. Considering both coverage and economic efficiency, we also suggest a weighted objective function. Our algorithm is applied to an obvious optimization problem and then is verified. Moreover, our approach is tried in an inhomogeneous traffic density environment. The simulation result proves that the algorithm enables one to find near optimal base station placement and the efficient number of base stations.
96Â citations
19 May 2008
TL;DR: A general framework for solving the minimum cost RS placement problem in 802.16J Mobile Multi-hop Relay (MMR) networks is provided and it is demonstrated that the most significant advantages of the dual-relay architecture lie in the ability of achieving high throughput for the systems.
Abstract: Cooperative relaying is one of the most effective techniques in coverage extension and capacity enhancement by virtue of spatial diversity. To fully explore the benefits of adopting relay stations (RSs), a vital issue is the placement of RSs by jointly considering an advanced coding scheme. In this paper, we aim to provide a general framework for solving the minimum cost RS placement problem in 802.16J Mobile Multi-hop Relay (MMR) networks. We first introduce a novel dual-relay architecture, where all the users, i.e., the mobile stations (MSs) and the fixed subscriber stations (SSs), are connected to the BS via two active RSs through decoded-and-forwarding scheme. We will then demonstrate that the most significant advantages of the dual-relay architecture lie in the ability of achieving high throughput for the systems. In addition, the users can be subject to better fault tolerance, robustness, and power saving. We formulate the dual- relay RS placement problem, and solve it through a two-phase algorithm to deal with the NP-hardness. Numerical analysis is conducted to evaluate the performance gain due to cooperative RS placement in the proposed framework, and demonstrate that the proposed approach can lead to a well acceptable solution compared with that by exhaustively searching.
79Â citations
Cites background from "Automatic base station placement an..."
...networks [5], wireless sensor networks [6] [7], wireless local area networks [8]....
[...]
TL;DR: The underlying radio propagation and WCDMA simulations are described and the design issues of the optimization loop are discussed and the power coverage and bit-error rate are considered for optimizing locations of a specified number of transmitters across the feasible region of the design space.
Abstract: A global optimization technique is applied to solve the optimal transmitter placement problem for indoor wireless systems. An efficient pattern search algorithm - DIviding RECTangles (DIRECT) of Jones et al.- has been connected to a parallel three-dimensional radio propagation ray tracing modeler running on a 200-node Beowulf cluster of Linux workstations. Surrogate functions for a parallel wideband code-division multiple-access (WCDMA) simulator were used to estimate the system performance for the global optimization algorithm. Power coverage and bit-error rate are considered as two different criteria for optimizing locations of a specified number of transmitters across the feasible region of the design space. This paper briefly describes the underlying radio propagation and WCDMA simulations and focuses on the design issues of the optimization loop.
53Â citations
Cites background from "Automatic base station placement an..."
...The system described here, the site-speific system simulator for wireless system design ( ), is among the few known wireless system tools for in-building network design besides [2], [6], [8], and [12]....
[...]
10 Dec 2002
TL;DR: The base station placement is automatically determined using genetic approach, and the transmit power is estimated considering the interference situation in the case of interference-dominant systems, and a new representation scheme with real numbers is proposed.
Abstract: In this paper, the base station placement is automatically determined using genetic approach, and the transmit power is estimated considering the interference situation in the case of interference-dominant systems. For applying a genetic algorithm to the base station placement problem, a new representation scheme with real numbers is proposed. And, corresponding operators such as crossover and mutation are introduced. A weighted objective function is designed for performing the cell planning coverage, cost-effectively. To verify the proposed algorithm, the situation where the optimum positions and number of base stations are obvious is considered. The proposed algorithm is applied to an inhomogeneous traffic density environment, where a base station's coverage may be limited by offered traffic loads. Simulation result proves that the algorithm enables us to find near optimal base station placement and the efficient number of base stations.
43Â citations
Cites background or methods from "Automatic base station placement an..."
...[2] and [3] utilized genetic approaches for the network planning....
[...]
...In order to reduce the computational complexity, a hierarchical approach is considered in [3]....
[...]
21 Mar 2004
TL;DR: This paper gives some novel adaptation to the recent bio-inspired optimization approach, Particle Swarm Optimization (PSO), to form a suitable algorithm for the base station placement problem, and shows that the proposed approach is efficient and effective, especially for large-scale network design.
Abstract: The tremendous growth in the demand for mobile services results in an explosion in base station (BS) density and network complexity, making the conventional manual planning processes highly inefficient. In this paper, we give some novel adaptation to the recent bio-inspired optimization approach, Particle Swarm Optimization (PSO), to form a suitable algorithm for the base station placement problem. Considering the two most important factors simultaneously, coverage and economy efficiency, we can get a Pareto optimal set by using the Divided Range Multiobjective Particle Swarm Optimization (DRMPSO) which is performed in distributed computing. The Pareto optimal set is a set of solutions which are optimal with respect to constrained conditions and non-inferior to each other. The simulation results show that the proposed approach is efficient and effective, especially for large-scale network design.
43Â citations
References
More filters
01 Dec 1974
TL;DR: In this article, the authors describe a scheme in which a fuzzy algorithm is used to control plant, in this case, a laboratory-built steam engine, implemented as an interpreter of a set of rules expressed as fuzzy conditional statements.
Abstract: The paper describes a scheme in which a fuzzy algorithm is used to control plant, in this case, a laboratory-built steam engine. The algorithm is implemented as an interpreter of a set of rules expressed as fuzzy conditional statements. This implementation on a digital computer is used online, to control the plant. The merit of such a controller is discussed in the light of the results obtained.
3,916Â citations
TL;DR: An empirical formula for propagation loss is derived from Okumura's report in order to put his propagation prediction method to computational use.
Abstract: An empirical formula for propagation loss is derived from Okumura's report in order to put his propagation prediction method to computational use. The propagation loss in an urban area is presented in a simple form: A + B log 10 R, where A and B are frequency and antenna height functions and R is the distance. The introduced formula is applicable to system designs for UHF and VHF land mobile radio services, with a small formulation error, under the following conditions: frequency range 100-1500 MHz, distance 1-20 km, base station antenna height 30-200 m, and vehicular antenna height 1-10 m.
2,763Â citations
15 Feb 2000
TL;DR: An innovative approach for automatic BS placement with powerful optimization strategy forms the core of the automatic process, which determines the number of BS, their locations and configurations to achieve a high-quality network.
Abstract: The tremendous growth in the demand for mobile services has resulted in an explosion in base station (BS) density and network complexity, making the conventional manual planning processes highly inefficient. An innovative approach for automatic BS placement is presented in this paper. The powerful optimization strategy forms the core of the automatic process, which determines the number of BS, their locations and configurations to achieve a high-quality network.
12Â citations
01 Jan 1999
TL;DR: In this paper, the authors proposed an algorithm for automatic cell site growth planning in an existing network, where new cell sites are added at optimum locations while keeping the topology of the existing network undisturbed.
Abstract: The last few years have seen a tremendous demand for wireless services. This has resulted in an explosion in cell site density and network complexity, making the conventional manual planning process highly inefficient. Automatic processes are increasingly finding their way into network planning, to replace their manual counterparts. Powerful optimization algorithms form the core of these techniques. This paper proposes one such innovative algorithm for automatic cell site growth planning in an existing network. The method employs a unique technique where new cell sites are added at optimum locations while keeping the topology of the existing network undisturbed.
5Â citations