National Changhua University of Education Institutional Repository : Item 987654321/9917
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6491/11663
造訪人次 : 24748193      線上人數 : 42
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/9917

題名: Heuristic Algorithm for Optimal Design of Two-Level Wireless ATM Network
作者: Din, Der-Rong;Tseng, S. S.
貢獻者: 資訊工程系
關鍵詞: Wireless ATM;Design of algorithms;Assignment problem;Clustering problem;Graph partitioning problem;Personal communication services
日期: 2001-07
上傳時間: 2012-04-30T04:30:53Z
出版者: Institute of Information Science
摘要: In this paper, we investigate the optimal assignment problem of cells in PCS (Personal Communication Service) to switches in a wireless ATM network. Given cells and switches on an ATM network (whose locations are fixed and known), the problem is grouping cells into clusters and assigning these clusters to the switches in an optimum manner. This problem is modeled as a complex integer programming problem and finding
an optimal solution of this problem is NP-complete. A three-phase heuristic algorithm MCMLCF (Maximum cell and minimum local communication first) consisting of Cell Pre-Partitioning Phase, Cell Exchanging Phase, and Cell Migrating Phase, is proposed. First, in the Cell Pre-Partitioning Phase, a three-step procedure (Clustering Step, Packing Step, and Assigning Step) is proposed to group cells into clusters. Second, Cell
Exchanging Phase is proposed to greatly improve the result by repeatedly exchanging two cells in different switches. Finally, Cell Migrating Phase is proposed to reduce cost by repeatedly migrating all cells in a used switch to an empty switch. Experimental results indicate that the proposed algorithm runs efficiently. Comparing the results of the algorithm to a naive heuristic called NSF, we have shown that the computation time is
reduced by 30.1%. Experimental results show that Cell Exchanging and Cell Migrating phases can reduce the total cost by 34.1% on average. By comparing the results of the proposed algorithm to the genetic algorithm, the heuristic method came close to optimum- on average within 5%.
關聯: Journal of Information Science and Engineering, 17(4): 674-665
顯示於類別:[資訊工程學系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
index.html0KbHTML533檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 


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