Skip to main content

Genetic Algorithm for Extended Cell Assignment Problem in Wireless ATM Network

  • Conference paper
  • First Online:
Advances in Computing Science — ASIAN 2000 (ASIAN 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1961))

Included in the following conference series:

  • 173 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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.

    Google Scholar 

  2. Davis, L. (ed) (1991) Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York NY. U. S. A.

    Google Scholar 

  3. 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.

  4. 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.

  5. 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.

    Article  Google Scholar 

  6. R. C. V. Macario, Cellular Radio. McGraw-Hill, New York (1993).

    Google Scholar 

  7. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics