English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6507/11669
Visitors : 30718673      Online Users : 346
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/9919

Title: A Simulated Annealing Algorithm for Extended Cell Assignment Problem in Wireless ATM Network
Authors: Din, Der-Rong;Tseng, S. S.
Contributors: 資訊工程系
Keywords: Wireless ATM;PCS;Optimization;Simulated annealing;Cell assignment problem
Date: 2001
Issue Date: 2012-04-30T04:30:55Z
Publisher: Springer
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.
Relation: Lecture Notes in Computer Science (LNCS), 2037: 150-160
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat

All items in NCUEIR are protected by copyright, with all rights reserved.


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback