English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 30082300      線上人數 : 896
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

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

題名: Heuristic and simulated annealing algorithms for wireless ATM backbone network design problem
作者: Din, Der-Rong
貢獻者: 資訊工程系
關鍵詞: Wireless ATM;Heuristic algorithm;Simulated annealing;NP-hard;Backbone network design
日期: 2008-03
上傳時間: 2012-04-30T04:32:39Z
出版者: Institute of Information Science
摘要: Personal Communication Network (PCN) is an emerging wireless network that promises many new services for the telecommunication industry. The high speed backbone network (asynchronous transfer mode, ATM or wavelength division multiplexing, WDM) is one possible approach to provide broadband wireless transmission with PCN’s using the ATM switches for interconnection of PCN cells. The wireless ATM backbone
network design (WABND) problem is to allocate backbone links among ATM switches such that the effects of terminal mobility on the performance of ATM-based PCN’s can be reduced. In this paper, the WABND problem is formulated and studied. The goal of the WABND is to minimize the location update cost under constraints. Since WABND is an NP-hard problem, two heuristic algorithms and a simulated annealing algorithm were proposed and used to find the close-to-optimal solutions. The simulated annealing algorithm was able to achieve good performance as indicated from the simulated results.
關聯: Journal of Information Science and Engineering, 24(2) : 483-501
顯示於類別:[資訊工程學系] 期刊論文

文件中的檔案:

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


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

 


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