Browse > Article
http://dx.doi.org/10.3837/tiis.2011.05.011

Optimal Base Station Clustering for a Mobile Communication Network Design  

Hong, Jung-Man (Business Consultant at Entrue Consulting Partners, LG CNS)
Lee, Jong-Hyup (Department of Information and Communications Engineering, Inje University)
Lee, Soong-Hee (Department of Information and Communications Engineering, Inje University)
Publication Information
KSII Transactions on Internet and Information Systems (TIIS) / v.5, no.5, 2011 , pp. 1069-1084 More about this Journal
Abstract
This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.
Keywords
Base station; mobile communication network; clustering; branch-and-bound; LP;
Citations & Related Records

Times Cited By Web Of Science : 0  (Related Records In Web of Science)
Times Cited By SCOPUS : 0
연도 인용수 순위
  • Reference
1 K. Lim and Y.H. Lee, "Optimal partitioning of heterogeneous traffic sources in mobile communication networks," IEEE Transactions on Computers, vol. 46, no. 3, pp. 312-325, 1997.   DOI   ScienceOn
2 Rajalakshmi K., Prakash K. and Hima M. B., "Hybridizing Iterative local search algorithm for assigning cells to switch in cellular mobile network," International Journal of Soft Computing 5(1), pp. 7-12, 2010.   DOI
3 Madhubanti M. Amitava M. and Debashis S., "Integrated Interswitch Cable and Handoff Cost Minimizing Heuristics for Cell-to-Switch Assignment in Wireless Cellular Networks," IEEE Transactions on Vehicular Technology, vol. 58, no. 9, pp. 5074-5082, 2009.   DOI
4 C.S. Sung and J.M. Hong, "Branch-and-price algorithm for a multicast routing problem," Journal of the Operational Research Society 50, pp. 1168-1175, 1999.   DOI
5 J. Hong and S. Lim, "Branch and Price Algorithm for Content Allocation Problem in VOD Network," Lecture Notes in Computer Science, vol. 3483, pp. 642-651, 2005.
6 Monique Guignard, "Lagrangean Relaxation," Top, vol. 11, no. 2, pp. 151-228, 2003.   DOI   ScienceOn
7 D. Plassmann and N. Silva, "Mobility management functions for MBS," R2067/WP211/034.b1, Project Report, Aachen University of Technology, 1993.
8 C.E. Ferreira, A. Martin, C.C. Desouza, R. Weismantel and L.A. WOLSEY, "Formulation and valid inequalities for the node capacitated graph partitioning problem," Mathematical Programming, vol. 74, no. 3, pp. 247-266, 1996.   DOI   ScienceOn
9 Chun-hyun Paik and Samit Soni, "A simulated annealing based solution approach for the two-layered location registration and paging areas partitioning problem in cellular mobile networks," European Journal of Operational Research, vol. 178, no. 2, pp. 579-594, 2007.   DOI   ScienceOn
10 S. Chopra and M.R. Rao, "The partition problem," Mathematical Programming, vol. 59, no. 1-3, pp. 87-115, 1993.   DOI   ScienceOn
11 Merchant A. and Sengupta B., "Assignment of Cells to Switches in PCS Networks," IEEE/ACM Transactions on Networking, vol. 3, no. 5, pp. 521-526, 1995.   DOI   ScienceOn
12 J. Hong, S. Lim and W. Lee, "Wavelength Converter Assignment Problem in All Optical WDM Networks," Lecture Notes in Computer Science, vol. 3681, pp. 1004-1013, 2005.
13 D.W. Tcha, T.J. Choi and Y.S. Myung, "Location-area partition in a cellular radio network," Journal of the Operational Research Society 48, pp. 1076-1081, 1997.   DOI
14 Erdal Cayirci and Ian F. Akyildiz, "Optimal Location Area Design to Minimize Registration Signaling Trace in Wireless Systems," IEEE Transactions on Mobile Computing, vol. 2, no. 1, pp. 76-85, 2003.   DOI   ScienceOn
15 Plehn J., "The design of location areas in a GSM-network," in Proc. of the IEEE 45th Vehicular Technology Conference, Chicago, USA, pp. 871-875, 1995.
16 Mark V. and Evelyn C. B., "A grouping genetic algorithm for registration area planning," Omega vol. 34, no. 3, pp. 220-230, 2006.   DOI   ScienceOn
17 E.L. Johnson and A. Mehrotra and G.L. Nemhauser, "Min-cut clustering," Mathematical programming, vol. 62, no. 1-3, pp. 133-151, 1993.   DOI
18 Tabitha James, Mark Vroblefski and Quinton Nottingham, "A hybrid grouping genetic algorithm for the registration area planning problem" Computer Communications, vol. 30, no. 10, pp. 2180-2190, 2007.   DOI   ScienceOn
19 Ian F. Akyildiz and Josep S.M. Ho, "On location management for personal communications networks," IEEE Communications magazine, vol. 34, no. 9, pp. 138-145, 1996.   DOI   ScienceOn
20 Abutaleb A. and Victor O.K Li, "Location update optimization in personal communication systems," Wireless Networks, vol. 3, no. 3, pp. 205-216, 1997.   DOI   ScienceOn
21 Chew Y.H., Yeo B.S. and Kuan D.C.M., "Sensitivity study of location management area partitioning in cellular communication systems," Computer Networks, vol. 51, no. 6, pp. 1555-1573, 2007.   DOI   ScienceOn
22 Javid T., Albert Y.Z. and Mohsin I., "Fuzzy online location management in mobile computing environments," accepted for publication in Journal of Parallel and Distributed Computing, 2011.
23 Selvan C., Shanmugalakshmi R. and Nirmala V., "Location Management Technique to Reduce Complexity in Cellular Networks," International Journal of Computer Science Issues, vol. 7, no. 4, no. 1, pp. 37-40, 2010.