Ant Colony Approach in Optimization of Base Station Position

被引:0
作者
Vilovic, Ivan [1 ]
Burum, Niksa [1 ]
Sipus, Zvonimir [2 ]
机构
[1] Univ Dubrovnik, Dept Elect Engn & Comp, Dubrovnik, Croatia
[2] Univ Zagreb, Fac Elect Engn & Comp, Zagreb, Croatia
来源
2009 3RD EUROPEAN CONFERENCE ON ANTENNAS AND PROPAGATION, VOLS 1-6 | 2009年
关键词
ALGORITHMS;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We are witnesses of the growing interest in providing and improving signal strength coverage for mobile phones and Wireless Local Area Networks (WLANs) in indoor environments. In such cases it is difficult to rigorously obtain the signal strength distribution. A neural network is used as alternative technique to predict signal strength at any point of given environment. It has advantages of deterministic (high accuracy) and empirical (short computation) approaches. The neural network architecture, based on the multilayer perceptron, is used to absorb the knowledge about the given environment through training based on measurements. Such network is capable to predict signal strength that includes absorption and reflection effects. In our approach we used neural network model as a cost function in the optimization of the base station and access point's positions. In this paper we used an algorithm based on global search method known as the ant colony optimization (ACO) method. This optimization method is based on the behaviour of ant colonies in obtaining food and carrying it back to the nest. This algorithm is well suited for discrete problems, so in our case it is needed some modifications to satisfy continuous problem. The pheromone matrix is generated with matrix elements that represent a location for ant movement, i.e. they represent locations of base stations. The population of ants is randomly distributed along the pheromone matrix. They move from one position to another on probabilistic manner that depends of pheromone concentration. The achieved minimum of the cost function represents optimal position of base station or access point. The ACO results are compared with PSO and GA results.
引用
收藏
页码:2776 / +
页数:2
相关论文
共 8 条
  • [1] Pattern nulling of linear antenna arrays by controlling only the element positions with the use of improved touring ant colony optimization algorithm
    Akdagli, A
    Güney, K
    Karaboga, D
    [J]. JOURNAL OF ELECTROMAGNETIC WAVES AND APPLICATIONS, 2002, 16 (10) : 1423 - 1441
  • [2] Investigation of simulated annealing, ant-colony optimization, and genetic algorithms for self-structuring antennas
    Coleman, CM
    Rothwell, EJ
    Ross, JE
    [J]. IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2004, 52 (04) : 1007 - 1014
  • [3] Ant algorithms for discrete optimization
    Dorigo, M
    Di Caro, G
    Gambardella, LM
    [J]. ARTIFICIAL LIFE, 1999, 5 (02) : 137 - 172
  • [4] Ant system: Optimization by a colony of cooperating agents
    Dorigo, M
    Maniezzo, V
    Colorni, A
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01): : 29 - 41
  • [5] Haykin S., 1999, NEURAL NETWORKS COMP, DOI DOI 10.5555/521706
  • [6] NAGY L, 2007, P EUCAP 07
  • [7] Linear array synthesis using an ant-colony-optimization-based algorithm
    Rajo-Iglesias, Eva
    Quevedo-Teruel, Oscar
    [J]. IEEE ANTENNAS AND PROPAGATION MAGAZINE, 2007, 49 (02) : 70 - 79
  • [8] VILOVIC I, 2007, P EUCAP 07, P29