Abstract
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor networks. This problem consists in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest cover rate. To date, several radio antenna models have been used: square coverage antennas, omnidirectional antennas that cover a circular area, etc. In this work we use omnidirectional antennas. On the other hand, RND is an NP-hard problem; therefore its solution by means of evolutionary algorithms is appropriate. In this work we study different evolutionary approaches to tackle this problem. PBIL (Population-Based Incremental Learning) is based on genetic algorithms and competitive learning (typical in neural networks). DE (Differential Evolution) is a very simple population-based stochastic function minimizer used in a wide range of optimization problems, including multi-objective optimization. SA (Simulated Annealing) is a classic trajectory descent optimization technique. Finally, CHC is a particular class of evolutionary algorithm which does not use mutation and relies instead on incest prevention and disruptive crossover. Due to the complexity of such a large analysis including so many techniques, we have used not only sequential algorithms, but also grid computing with BOINC in order to execute thousands of experiments in only several days using around 100 computers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Calégari, P., Guidec, F., Kuonen, P., Kobler, D.: Parallel Island-Based Genetic Algorithm for Radio Network Design. Journal of Parallel and Distributed Computing 47(1), 86–90 (1997)
Calégari, P., Guidec, F., Kuonen, P., Nielsen, F.: Combinatorial Optimization Algorithms for Radio Network Planning. Theoretical Computer Science 263(1), 235–265 (2001)
Alba, E.: Evolutionary Algorithms for Optimal Placement of Antennae in Radio Network Design. In: NIDISC 2004 Sixth International Workshop on Nature Inspired Distributed Computing, IEEE IPDPS, Santa Fe, USA, pp. 168–175 (April 2004)
OPLINK: (May 2007), http://oplink.lcc.uma.es/problems/rnd.html
Baluja, S.: Population-based Incremental Learning: A Method for Integrating Genetic Search based Function Optimization and Competitive Learning. Technical Report CMU-CS-94-163, Carnegie Mellon University (June 1994)
Baluja, S., Caruana, R.: Removing the Genetics from the Standard Genetic Algorithm. 12th Int. Conference on Machine Learning, San Mateo, CA, USA, pp. 38–46 (May 1995)
Price, K., Storn, R.: Differential Evolution – A Simple Evolution Strategy for Fast Optimization. Dr. Dobb’s Journal 22(4), 18–24 (1997)
Price, K., Storn, R.: DE website (May 2007), http://www.ICSI.Berkeley.edu/~storn/code.html
Abbass, H.A., Sarker, R.: The Pareto Differential Evolution Algorithm. Int. Journal on Artificial Intelligence Tools 11(4), 531–552 (2002)
Mendes, S., Gómez, J.A., Vega, M.A., Sánchez, J.M.: The Optimal Number and Locations of Base Station Transmitters in a Radio Network. In: 3rd Int. Workshop on Mathematical Techniques and Problems in Telecommunications, Leiria, Portugal, pp.17–20 (September 2006)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)
Cerny, V.: A Thermodynamical Approach to the Travelling Salesman Problem: an Efficient Simulation Algorithm. Journal of Optimization Theory and Applications 45, 41–51 (1985)
Eshelman, L.J.: The CHC Adaptive Search Algorithm: How to Have Safe Search when Engaging in Nontraditional Genetic Recombination. In: Foundations of Genetic Algorithms, pp. 265–283. Morgan Kaufmann, San Francisco (1991)
Eshelman, L.J., Schaffer, J.D.: Preventing Premature Convergence in Genetic Algorithms by Preventing Incest. In: 4th Int. Conf. on Genetic Algorithms, CA, USA, pp. 115–122 (1991)
BOINC: (May 2007), http://boinc.berkeley.edu
Anderson, D.P.: BOINC: A System for Public-Resource Computing and Storage. In: 5th IEEE/ACM Int. Workshop on Grid Computing, Pittsburgh, USA, pp. 365–372 (November 2004)
Alba, E., Almeida, F., Blesa, M., Cotta, C., Díaz, M., Dorta, I., Gabarró, J., León, C., Luque, G., Petit, J., Rodríguez, C., Rojas, A., Xhafa, F.: Efficient Parallel LAN/WAN Algorithms for Optimization: The MALLBA Project. Parallel Computing 32(5-6), 415–440 (2006)
Lampinen, J., Zelinka, I.: On Stagnation of the Differential Evolution Algorithm. In: 6th International Mendel Conference on Soft Computing, MENDEL 2000, Brno, Czech Republic, pp. 76–83 ( June 2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Alba, E., Vega-Pérez, D., Priem-Mendes, S., Molina, G. (2007). Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2007. EUROCAST 2007. Lecture Notes in Computer Science, vol 4739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75867-9_107
Download citation
DOI: https://doi.org/10.1007/978-3-540-75867-9_107
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75866-2
Online ISBN: 978-3-540-75867-9
eBook Packages: Computer ScienceComputer Science (R0)