Optimal placement of antennae using metaheuristics

Authors:
Enrique Alba;Guillermo Molina;Francisco Chicano
Affiliations:
Departamento de Lenguajes y Ciencias de la Computación, University of Málaga, Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, University of Málaga, Málaga, Spain;Departamento de Lenguajes y Ciencias de la Computación, University of Málaga, Málaga, Spain
Venue:
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
Year:
2006

Citing 5
Cited 2

Parallel island-based genetic algorithm for radio network design

Journal of Parallel and Distributed Computing - Special issue on parallel evolutionary computing
Alternate path routing for multicast

IEEE/ACM Transactions on Networking (TON)
Parallel Genetic Algorithms for Third Generation Mobile Network Planning

PARELEC '04 Proceedings of the international conference on Parallel Computing in Electrical Engineering
Application of the parameter-free genetic algorithm to the fixed channel assignment problem

Systems and Computers in Japan
Automatic mesh generation for mobile network dimensioning using evolutionary approach

IEEE Transactions on Evolutionary Computation

Optimal antenna placement using a new multi-objective chc algorithm

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Optimal Wireless Sensor Network Layout with Metaheuristics: Solving a Large Scale Instance

Large-Scale Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we solve the radio network design problem (RND). This NP-hard combinatorial problem consist of determining a set of locations for placing radio antennae in a geographical area in order to offer high radio coverage using the smallest number of antennae. This problem is originally found in mobile telecommunications (such as mobile telephony), and is also relevant in the rising area of sensor networks. In this work we propose an evolutionary algorithm called CHC as the state of the art technique for solving RND problems and determine its expected performance for different instances of the RND problem.