National Changhua University of Education Institutional Repository : Item 987654321/9921

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 30026982 Online Users : 676

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Engineering > Department and Graduate Institute of Computer Science and Information Engineering > Periodical Articles > Item 987654321/9921

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

Title:	Heuristic and Simulated Annealing Algorithms for Solving Extended Cell Assignment Problem in Wireless ATM Network
Authors:	Din, Der-Rong;Tseng, S. S.
Contributors:	資訊工程系
Keywords:	Wireless ATM;PCS;Optimization;Heuristic algorithm;Simulated annealing;Cell assignment problem
Date:	2002-02
Issue Date:	2012-04-30T04:31:07Z
Publisher:	John Wiley & Sons Inc.
Abstract:	In this paper, we investigate the extended cell assignment problem which optimally assigns new adding and splitting cells in Personal Communication Service (PCS) to switches in a wireless Asynchronous Transfer Mode (ATM) network. Given cells in a PCS network 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 heuristic algorithm and a simulated annealing algorithm are proposed to solve this problem. The heuristic algorithm, Extended Assignment Algorithm (EEA), consists of two phases, initial assigning phase and cell exchanging phase. First, in the initial assigning phase, the initial assignments of cells to switches are found. Then, these assignments are improved by performing cell exchanging phase in which two cells are repeatedly exchanged in different switches with great reduction of the total cost. The simulated annealing algorithm, ESA (enhanced simulated annealing), generates constraint-satisfied configurations, and uses three configuration perturbation schemes to change current configuration to a new one. Experimental results indicate that EAA and ESA algorithms have good performances.
Relation:	International Journal of Communication Systems, 15(1): 47-65
Appears in Collections:	[Department and Graduate Institute of Computer Science and Information Engineering] Periodical Articles

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	557	View/Open

Loading...