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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Alba, E., Molina, G., & Chicano, F. (2007). Optimal placement of antennae using metaheuristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4310 LNCS, pp. 214–222). Springer Verlag. https://doi.org/10.1007/978-3-540-70942-8_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
