Advertisement

A Simulated Annealing Algorithm for Extended Cell Assignment Problem in a Wireless ATM Network

  • Der-Rong Din
  • Shian-Shyong Tseng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)

Abstract

In this paper, we investigate the extended cell assignment problem which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) to switches in a wireless ATM (Asynchronous Transfer Mode) network. Given cells in a PCS and switches on an ATM network (whose locations are fixed and known), we would like to do the assignment in an 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-hard. A simulated annealing algorithm are proposed to solve this problem. The simulated annealing algorithm, ESA (enhanced simulated annealing), generates constraint-satisfy configurations, and uses three configuration perturbation schemes to change current configuration to a new one. Experimental results indicate that ESA algorithm has good performances.

Keywords

wireless ATM PCS optimization simulated annealing cell assignment problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    R.C.V. Macario, Cellular Radio. McGraw-Hill, New York (1993).Google Scholar
  3. 3.
    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.CrossRefGoogle Scholar
  4. 4.
    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; to appear in Proceeding of NSC.Google Scholar
  5. 5.
    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; to appear in JISE.Google Scholar
  6. 6.
    Der-Rong Din and S.S. Tseng, “Genetic Algorithm for Extended Cell Assignment Problem in Wireless ATM Network,” accepted by ASIAN’00, Asian Computing Science Conference, Penang, Malaysia, November 25-27, 2000, to appear in Lecture Note on Computer Science.Google Scholar
  7. 7.
    Kirkpatrick S., Gelatt C.D. and Vecchi M.P. “Optimization by simulated annealing”, Science 220,671–680, 1983.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    D. Raychaudhuri and N. Wilson, “ATM Based Transport Architecture for Multi-services Wireless Personal Communication Network,” IEEE JSAC, Oct. 1994.Google Scholar
  9. 9.
    Ravinda K Ahuja, James B. Orlin and Dushyant Sharma, “Very large-scale neigbourhood search”, Int’l. Trans. in Op. Res. 7 (2000) 301–317.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Der-Rong Din
    • 1
  • Shian-Shyong Tseng
    • 1
  1. 1.Department of Computer and Information ScienceNational Chiao-Tung UniversityHsinchuTaiwan

Personalised recommendations