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

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

Title: Genetic algorithms for optimal design of two-level wireless ATM network
Authors: Din, Der-Rong;Tseng, S. S.
Contributors: 資訊工程系
Keywords: Wireless ATM;Genetic algorithms;Design of algorithms;Assignment problem;Two-level network design
Date: 2001-05
Issue Date: 2012-04-30T04:30:54Z
Publisher: National Science Council
Abstract: Recently there has been some interest in extending ATM (Asynchronous Transfer Mode) technology to the wireless environment. The motivation behind this extension (termed wireless ATM) includes the desire for seamless interconnection of wireless and ATM networks, and the need to support emerging mobile multimedia services. In this paper, we investigate the problem of optimum assignment of cells in PCS (Personal Communication Service) to switches in a wireless ATM network. Given cells and switches in an ATM network (whose locations are fixed
and known), the problem is assigning cells to switches such that the cost can be minimized. 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-complete. Two stochastic search methods, SGA (Simple Genetic Algorithm) and EGA (Extended Genetic Algorithm), based on a genetic approach, are proposed to solve this problem. Simulation results show that genetic algorithms are robust for this problem.
Relation: Proceeding of National Science Council, R. O. C. Part A: Physical Science and Engineering, 25(3): 151-162
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat
index.html0KbHTML500View/Open


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