Local search study of honeycomb clustering problem for cellular planning

International Journal of Mobile Network Design and Innovation

Volumn 1, Issue 2, 2006, Pages 153-160

  Créput, Jean Charles ^a   Koukam, Abderrafiaa ^a  

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

Author keywords

adaptive mesh generation; cellular network; evolutionary algorithms; network dimensioning

Indexed keywords

EID: 39449113845     PISSN: 17442869     EISSN: 17442850     Source Type: Journal    
DOI: 10.1504/IJMNDI.2006.010816     Document Type: Article

References (18)

1. Arora, S. (1998) ‘The approximability of NP-hard problems’, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC’98, pp.337–348.
2. Bern, M. and Eppstein, D. (1995) ‘Mesh generation and optimal triangulation’, in D-Z. Du and F.K. Hwang (Eds). Computing in Euclidean Geometry, 2nd editon, World Scientific, pp.47–123.
3. Calégari, P., Guidec, F., Kuonen, P. and Kobler, D. (1997) ‘Parallel island-based genetic algorithm for radio network design’, Journal of Parallel and Distributed Computing, No. 47, pp.86–90.
4. Coello Coello, C.A. (1999) ‘A comprehensive survey of evolutionary-based multiobjective optimization techniques’, Knowledge and Information Systems, An International Journal, Vol. 1, No. 3, pp.269–308.
5. Créput, J.C., Koukam, A., Lissajoux, T. and Caminada, A. (2005) ‘Automatic mesh generation for mobile network dimensioning using evolutionary approach’, IEEE Transactions on Evolutionary Computation, Vol. 9, No. 1, pp.18–30.
6. Dyer, M.E. and Frieze, A.M. (1986) ‘Planar 3DM is NP-complete’, Journal of Algorithms, Vol. 7, pp.174–184.
7. Eidenbenz, S., Stamm, C. and Widmayer, P. (1998) ‘Positioning guard at fixed height above a terrain – an optimum inapproximability result’, Lecture Notes in Computer Science, Vol. 1461, pp.187–198.
8. Feige, U. (1996) ‘A threshold of ln n for approximating set cover’, Proceedings of the 28th Annual Symposium on the Theory of Computing, ACM, pp.314–318.
9. Hurley, S. (2001) ‘Planning effective cellular mobile radio networks’, IEEE Transactions on Vehicular Technology, Vol. 51, No. 2, pp.443–472.
10. Lichtenstein, D. (1982) ‘Planar formulae and their uses’, SIAM Journal on Computing, Vol. 11, No. 2, pp.329–343.
11. Moscato, P. (1999) ‘Memetic algorithms: a short introduction’, in D. Corne, M. Dorigo and F. Glover (Eds). New Ideas in Optimization, McGraw Hill.
12. Mühlenbein, H. (1991) ‘Evolution in time and space – the parallel genetic algorithm’, in G. Rawlins (Ed). Foundations of Genetic Algorithms, Los Altos, CA: Morgan Kaufmann.
13. Pferschy, U., Rudolf, R. and Woeginger, G.J. (1994) ‘Some geometric clustering problems’, Nordic Journal of Computing, Vol. 1, No. 2, pp.246–263.
14. Stojmenovic, I. (1997) ‘Honeycomb networks topological properties and communication algorithms’, IEEE Transactions On Parallel and Distributed Systems, Vol. 8, No. 10, pp.1036–1041.
15. Vasquez, M. and Hao, J.K. (2001) ‘A heuristic approach for antenna positioning in cellular networks’, Journal of Heuristics, Vol.7, pp.443–472.
16. Walke, B.H. (2002) Mobile Radio Networks, John Wiley.
17. Zhang, H. and Wang, G. (2002) ‘Honeycomb subdivision’, Journal of Software, Vol. 14, No. 4.
18. Zimmermann, J., Hons, R. and Muhlenbein, H. (2003) ‘ENCON: evolutionary algorithm for the antenna placement problem’, Computers and Industrial Engineering, Vol. 44, pp.209–226.