Radio network optimization with maximum independent set search

Chamaret, Blaise; Josselin, S.; Kuonen, Pierre; Pizarroso, M.; Salas-Manzanedo, B.; Ubéda, Stéphane; Wagner, Daniel S.

doi:10.1109/vetec.1997.600433

Cited by 46 publications

(21 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm described in the previous section was TDAs are square as shown in Figure 2 and 6. The traffic demand at each TDA has uniformly distributed with integer values (in Erlang) over [1,6] in AMPS and [1,9] in CDMA. The locations of candidate base stations are randomly generated.…”

Section: Computational Resultsmentioning

confidence: 99%

“…The above cell planning problem is equivalent to the set covering problem [6] when the coverage factor α=1.0. The problem seeks a set of base stations that covers the traffic demand areas in a specified region.…”

Section: Problem Formulationmentioning

confidence: 99%

“…Several nonlinear optimization algorithms are investigated to solve the problem. In [6] the radio coverage optimization problem is converted to a maximum independent set problem. The objective is to achieve a large coverage of traffic demand areas with a small number of base stations.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cell planning with capacity expansion in mobile communications: a tabu search approach

Lee

Kang

2000

IEEE Trans. Veh. Technol.

178

View full text Add to dashboard Cite

Cell planning problem with capacity expansion is examined in wireless Computational results show that the proposed tabu search is highly effective. 10% cost reduction is obtained by the diversification strategies. The gap from the optimal solutions is approximately 1∼5 % in problems that can be handled in appropriate time limits. The proposed tabu search also outperforms the parallel genetic algorithm. The cost reduction by the tabu search approaches 10~20 % in problems with 2,500 traffic demand areas in CDMA.2

show abstract

Section: Computational Resultsmentioning

confidence: 99%

Section: Problem Formulationmentioning

confidence: 99%

See 1 more Smart Citation

Cell planning with capacity expansion in mobile communications: a tabu search approach

Lee

Kang

2000

IEEE Trans. Veh. Technol.

178

View full text Add to dashboard Cite

show abstract

“…Several initiatives have been developed on the STORMS platform. Chamaret et al [18] followed Calégari's work and tested seven different heuristics on the STORMS framework, employing the maximum independent-set search method.…”

Section: A Rnd Research Foundationsmentioning

confidence: 99%

Benchmarking a Wide Spectrum of Metaheuristic Techniques for the Radio Network Design Problem

Priem-Mendes

Molina

Vega‐Rodríguez

et al. 2009

IEEE Trans. Evol. Computat.

View full text Add to dashboard Cite

Abstract-The radio network design (RND) is an NP-hard optimization problem which consists of the maximization of the coverage of a given area while minimizing the base station deployment. Solving RND problems efficiently is relevant to many fields of application and has a direct impact in the engineering, telecommunication, scientific, and industrial areas. Numerous works can be found in the literature dealing with the RND problem, although they all suffer from the same shortfall: a noncomparable efficiency. Therefore, the aim of this paper is twofold: first, to offer a reliable RND comparison base reference in order to cover a wide algorithmic spectrum, and, second, to offer a comprehensible insight into accurate comparisons of efficiency, reliability, and swiftness of the different techniques applied to solve the RND problem. In order to achieve the first aim we propose a canonical RND problem formulation driven by two main directives: technology independence and a normalized comparison criterion. Following this, we have included an exhaustive behavior comparison between 14 different techniques. Finally, this paper indicates algorithmic trends and different patterns that can be observed through this analysis.

show abstract

“…Different and interesting solutions have already been proposed [3][4][5][6][7][8][9]. One of the most interesting is based on a technique inspired to the natural evolution, represented by the Genetic Algorithms (GAs) [8][9][10], which are good candidates, thanks to their versatility, to solve a complex and multi-parametric problem such as the considered one.…”

Section: Introductionmentioning

confidence: 99%

UMTS network planning using genetic algorithms

Garzia

Perna

Cusani

2005

Environmental Health Risk III

View full text Add to dashboard Cite

The continuously growing of cellular net complexity, that followed the introduction of UMTS technology, has reduced the usefulness of traditional design tools, making them quite unworthy.The purpose of this paper is to illustrate a design tool for UMTS optimized net planning based on genetic algorithms. In particular, some utilities for 3G net designers, useful to respect important aspects (such as the environmental one) of the cellular net, are shown.

show abstract

Radio network optimization with maximum independent set search

Cited by 46 publications

References 1 publication

Cell planning with capacity expansion in mobile communications: a tabu search approach

Cell planning with capacity expansion in mobile communications: a tabu search approach

Benchmarking a Wide Spectrum of Metaheuristic Techniques for the Radio Network Design Problem

UMTS network planning using genetic algorithms

Contact Info

Product

Resources

About