Advertisement

Radio Network Design Using Population-Based Incremental Learning and Grid Computing with BOINC

  • Miguel A. Vega-Rodríguez
  • David Vega-Pérez
  • Juan A. Gómez-Pulido
  • Juan M. Sánchez-Pérez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4448)

Abstract

Radio Network Design (RND) is a Telecommunications problem that tries to cover a certain geographical area by using the smallest number of radio antennas, and looking for the biggest cover rate. Therefore, it is an important problem, for example, in mobile/cellular technology. RND can be solved by bio-inspired algorithms, among other options, because it is an optimization problem. In this work we use the PBIL (Population-Based Incremental Learning) algorithm, that has been little studied in this field but we have obtained very good results with it. PBIL is based on genetic algorithms and competitive learning (typical in neural networks), being a new population evolution model based on probabilistic models. Due to the high number of configuration parameters of the PBIL, and because we want to test the RND problem with numerous variants, we have used grid computing with BOINC (Berkeley Open Infrastructure for Network Computing). In this way, we have been able to execute thousands of experiments in only several days using around 100 computers at the same time. In this paper we present the most interesting results from our work.

Keywords

RND PBIL BOINC Evolutionary Algorithm Antenna Coverage Grid Computing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Calégari, P., Guidec, F., Kuonen, P., Nielsen, F.: Combinatorial Optimization Algorithms for Radio Network Planning. Theoretical Computer Science 263(1), 235–265 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Alba, E.: Evolutionary Algorithms for Optimal Placement of Antennae in Radio Network Design. NIDISC’2004 Sixth International Workshop on Nature Inspired Distributed Computing, IEEE IPDPS, Santa Fe, USA, pp. 168-175 (April 2004)Google Scholar
  4. 4.
    OPLINK: http://oplink.lcc.uma.es/problems/rnd.html (2006) Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Baluja, S., Caruana, R.: Removing the Genetics from the Standard Genetic Algorithm. Twelfth International Conference on Machine Learning, San Mateo, CA, USA, pp. 38-46 (May 1995)Google Scholar
  7. 7.
    BOINC:http://boinc.berkeley.edu (2006) Google Scholar
  8. 8.
    Anderson, D.P., System, B.A.: for Public-Resource Computing and Storage. 5th IEEE/ACM International Workshop on Grid Computing, Pittsburgh, USA, pp. 365-372, (November 2004)Google Scholar
  9. 9.
    Price, K., Storn, R.: Differential Evolution – A Simple Evolution Strategy for Fast Optimization. Dr. Dobb’s Journal 22(4), 18–24 (1997)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Miguel A. Vega-Rodríguez
    • 1
  • David Vega-Pérez
    • 1
  • Juan A. Gómez-Pulido
    • 1
  • Juan M. Sánchez-Pérez
    • 1
  1. 1.Univ. Extremadura. Dept. Informática, Escuela Politécnica. Campus Universitario s/n. 10071. CáceresSpain

Personalised recommendations