Abstract
this paper, we investigate the extended cell assignment problem which optimally assigns new and split cells in PCS (Personal Communication Service) to switches in a wireless ATM network. Given cells and switches in an ATM network (whose locations are fixed and known), the problem is assigning cells to switches in an optimum manner. We would like to do the assignment in as attempt to minimize a cost criterion. The cost has two components: one is the cost of handoffs that involve two switches, and the other is the cost of cabling. This problem is modeled as a complex integer programming problem and finding an optimal solution to this problem is NP-complete. A stochastic search method, based on a genetic approach is proposed to solve this problem. Simulation results showtha t genetic algorithm is robust for this problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Cheng, S. Rajagopalan, L. F. Chang, G. P. Pollini, and M. Barton, “PCS Mobility Support over Fixed ATM Networks,” IEEE Communication Magazine, Nov. 1997, pp. 82–91.
Davis, L. (ed) (1991) Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York NY. U. S. A.
Der-Rong Din and S. S. Tseng, “Genetic Algorithms for Optimal design of two-level wireless ATM network,” Technical Report, Department of Computer Science, NCTU, TR-WATM-9902 Taiwan, R.O.C, 1999 or http://aho.cis.nctu.edu.tw/~deron/; to appear in Proceeding of NSC.
Der-Rong Din and S. S. Tseng, “Heuristic Algorithm for Optimal design of two-level wireless ATM network,” Technical Report, Department of Computer Science, NCTU, TR-WATM-9901 Taiwan, R.O.C, 1999 or http://aho.cis.nctu.edu.tw/~deron/; to appear in JISE.
A. Merchant and B. Sengupta, “Assignment of Cells to Switches in PCS Networks”, IEEE/ACM Trans. on Networking, Vol. 3, no. 5, 1995, pp. 521–526.
R. C. V. Macario, Cellular Radio. McGraw-Hill, New York (1993).
Richardson, J. T. M. R. Palmer, G. L. Liepins, and M. Hilliard, (1989) Some guidelines for genetic algorithms with penalty functions. In Proceedings of the 3rd International Conference on Genetic Algorithms (Edited by J. D. Schaffer). George Mason University.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Din, DR., Tseng, SS., Jiang, MF. (2000). Genetic Algorithm for Extended Cell Assignment Problem in Wireless ATM Network. In: Jifeng, H., Sato, M. (eds) Advances in Computing Science — ASIAN 2000. ASIAN 2000. Lecture Notes in Computer Science, vol 1961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44464-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-44464-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41428-5
Online ISBN: 978-3-540-44464-0
eBook Packages: Springer Book Archive