Automatic mesh generation for mobile network dimensioning using evolutionary approach

IEEE Transactions on Evolutionary Computation

Volumn 9, Issue 1, 2005, Pages 18-30

  Créput, Jean Charles ^a   Koukam, Abderrafiaa ^a   Lissajoux, Thomas ^a   Caminada, Alexandre ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE BELFORT MONTBÉLIARD   (France)

Author keywords

Adaptive mesh generation; Cellular network; Evolutionary algorithms; Network dimensioning

Indexed keywords

CELLULAR RADIO SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; OPTIMIZATION; TELECOMMUNICATION TRAFFIC;

ADAPTIVE MESH GENERATION; HYBRID ISLAND EVOLUTIONARY STRATEGY; NETWORK DIMENSIONING;

EVOLUTIONARY ALGORITHMS;

EID: 14844314855     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2004.837923     Document Type: Article

References (41)

1. S. Arora, "The approximability of NP-hard problems," in Proc. 30th Annu. ACM Symp. Theory Comput., STOC'98, 1998, pp. 337-348.
2. T. Bäck, F. Hoffmeister, and H. P. Schwefel, "A survey of evolution strategies," presented at the 4th Int. Conf. Genetic Algorithms, La Jolla, CA, 1991.
3. M. Bern and D. Eppstein, "Mesh generation and optimal triangulation," in Computing in Euclidean Geometry, 2nd ed, D.-Z. Du and F. K. Hwang, Eds. Singapore: World Scientific, 1995, pp. 47-123.
4. E. Bonomi, "Generation of structured adaptive grids based upon molecular dynamics," in Comptes Rendus des Journées D'électronique. Lausanne, Switzerland: Polytechniques Romandes, 1989.
5. P. Calégari, F. Guidec, P. Kuonen, and D. Wagner, "Genetic approach to radio network optimization for mobile systems," IEEE, 0-7803-3659-3/ 97, 1997.
6. P. Calegari, F. Guidec, P. Kuonen, and D. Kobler, "Parallel island-based genetic algorithm for radio network design," J. Parallel Distrib. Comput., no. 47, pp. 86-90, 1997.
7. G. F. Carey, Computational Grids: Generation, Adaptation and Solution Strategies. New York: Taylor & Francis, 1997.
8. M. Carey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New-York: Freeman, 1979.
9. A. Carlos and C. Coello, "A comprehensive survey of evolutionary-based multiobjective optimization techniques," Knowl. Inf. Sys. Int. J. vol. 1, no. 3, pp. 269-308, Aug. 1999.
10. J. C. Créput, T. Lissajoux, and A. Koukam, "A connexionnist approach to hexagonal mesh generation," presented at the 16th IMACS World Congr., Lausanne, Switzerland, 2000.
11. W. Christaller, Central Places in Southern Germany. Englewood Cliffs: Prentice-Hall, 1933. Translated by C. W. Baskin.
12. W. Crompton, S. Hurley, and N. M. Stephens, "A parallel genetic algorithm for frequency assignment problems," in Proc. IMACS SPRANN'94, 1994, pp. 81-84.
13. S. K. Das, S. K. Sen, and R. Jayaram, "A dynamic load balancing strategy for channel assignment using selective borrowing in cellular mobile environment," in Wireless Netw., vol. 3, 1997, pp. 333-347.
14. R. Dome and J. K. Hao, "An evolutionary approach for frequency assignment in cellular radio networks," in Proc. IEEE Int. Conf. Evol. Comput., ICEC'95, Perth, Australia, Nov./Dec. 1995, pp. 539-544.
15. P. L. George, Génération Automatique de Maillages. Applications aux Méthodes d'éléments Finis Masson, 1991, vol. 16, RMA.
16. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1994.
17. T. Kohonen, Self-Organization Maps and Associative Memory, 3rd ed. Berlin, Germany: Springer-Verlag, 2001.
18. M. Krivanek, "Hexagonal unit network - A tool for proving the NP-completeness results of geometric problems," Inf. Process. Lett. vol. 22, pp. 37-41, 1986.
19. S. Hurley, "Planning effective cellular mobile radio networks," IEEE Trans. Veh. Technol., vol. 51, pp. 443-472, 2001.
20. T. Lissajoux, V. Hilaire, A. Koukam, and A. Caminada, Lecture Notes in Artificial Intelligence. Berlin, Germany: Springer-Verlag, 1998, vol. 1437, Genetic Algorithms as Prototyping Tools for Multi-Agent Systems: Application to the Antenna Parameter Setting Problem.
21. H. Meunier and E. G. Talbi, "A multiobjective genetic algorithm for radio network optimization," in Proc. Congr. Evol. Comput. CEC'2000 2000, pp. 317-324.
22. P. Moscato, "Memetic algorithms: A short introduction," in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds. New York: McGraw-Hill, 1999.
23. S. J. Owen, "A survey of unstructured mesh generation technology," in Proc. 7th Int. Meshing Roundtable, Oct. 1998, pp. 239-267.
24. P. Reininger and A. Caminada, "Multicriteria design model for cellular network," Ann. Oper. Res., vol. 107, pp. 251-265, 2001.
25. D. Renaud and A. Caminada, "Evolutionary methods and operators for frequency assignment problem," Speedup J., vol. 11, no. 2, pp. 27-32, 1997.
26. H. Ritter and K. Schulten, "On the stationary state of Kohonen's self-organizing sensory mapping," Biol. Cybern., vol. 54, pp. 99-106, 1986.
27. H. G. Sandalidis, P. P. Stavroulakis, and J. Rodriguez-Tellez, "An efficient evolutionary algorithm for channel resource management in cellular mobile systems," IEEE Trans. Evol. Comput., vol. 2, no. 4, pp. 125-137, Nov. 1998.
28. O. Sarzeaud, Y. Stéphan, and C. Touzet, "Finite element meshing using Kohonen's self-organizing maps," presented at the Int. Conf. Artif. Neural Netw., ICANN'91, Helsinki, Finland, Jun. 1991.
29. I. Stojmenovic, "Honeycomb networks topological properties and communication algorithms," IEEE Trans. Parallel Distrib. Syst., vol. 8, no. 10, pp. 1036-1041, Oct, 1997.
30. S. Tiourine, C. Hurkens, and J. K. Lenstra, "An overview of algorithmic approaches to frequency assignment problems," in Proc. CALMA Symp. Final Report, Scheveningen, Nov. 1995, pp. 53-62.
31. M. Vasquez and J. K. Hao, "A heuristic approach for antenna positioning in cellular networks," J. Heuristics, vol. 7, pp. 443-472, 2001.
32. B. H. Walke, Mobile Radio Networks. New York: Wiley, 2002.
33. H. Zhang and G. Wang, "Honeycomb subdivision," J. Softw., vol. 14, no. 4, 2002.
34. J. Zimmermann, R. Hons, and H. Muhlenbein, "ENCON: Evolutionary algorithm for the antenna placement problem," Comput. Ind. Eng., vol. 44, pp. 209-226, 2003.
35. U. Pferschy, R. Rudolf, and G. J. Woeginger, "Some geometric clustering problems," Nordic J. Comput., vol. 1, no. 2, pp. 246-263, 1994.
36. N. Megiddo and K. J. Supowit, "On the complexity of some common geometric location problems," SIAM J. Comput., vol. 13, pp. 182-196, 1984.
37. M. E. Dyer and A. M. Frieze, "Planar 3DM is NP-complete," J. Algorithms, vol. 7, pp. 174-184, 1986.
38. P. Rosentiehl and R. E. Tarjan, "Rectilinear planar layout of planar graphs and bipolar orientations," Discrete Comput. Geometry, vol. 1, pp. 343-353, 1986.
39. A. Oganian and J. Domingo-Ferrer, "On the complexity of microaggregation," presented at the Conf. Eur. Statisticians, Skopje, Mar. 14-16, 2001.
40. S. Eidenbenz, C. Stamm, and P. Widmayer, "Positioning guard at fixed height above a terrain - An optimum inapproximability result," Lecture Notes in Computer Science, vol. 1461, pp. 187-198, 1998.
41. U. Feige, "A threshold of ln n for approximating set cover," in Proc. 28th Annu. Symp. Theory Comput., ACM, 1996, pp. 314-318.