• 沒有找到結果。

Genetic algorithm for extended cell assignment problem in wireless ATM network

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "Genetic algorithm for extended cell assignment problem in wireless ATM network"

Copied!
1
0
0

加載中.... (立即查看全文)

立即下載 ( 1 頁 )

全文

(1)

題名: Genetic algorithm for extended cell assignment problem in wireless ATM network

作者: D. R. Din;S. S. Tseng

貢獻者: Department of Information Science and Applications 日期: 2000

上傳時間: 2009-11-30T08:03:16Z 出版者: Asia University

摘要: this paper, we investigate the extended cell assignment problem which optimally assigns new and split 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 in an optimum manner. We would like to do the assignment in as 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-complete. A stochastic search method, based on a genetic approach is proposed to solve this problem. Simulation results showtha t genetic algorithm is robust for this problem.

參考文獻

立即下載 ( DOC - 1 頁 - 38.00 KB )

相關文件

(1)A CLASS OF INTERIOR PROXIMAL-LIKE ALGORITHMS FOR CONVEX SECOND-ORDER CONE PROGRAMMING∗ SHAOHUA PAN† AND JEIN-SHAN CHEN‡ Abstract

In this paper, we extended the entropy-like proximal algo- rithm proposed by Eggermont [12] for convex programming subject to nonnegative constraints and proposed a class of

2 A smoothing-type algorithm

In summary, the main contribution of this paper is to propose a new family of smoothing functions and correct a flaw in an algorithm studied in [13], which is used to guarantee

Constructions of complementarity functions and merit functions for circular cone complementarity problem

In this paper, we have shown that how to construct complementarity functions for the circular cone complementarity problem, and have proposed four classes of merit func- tions for

with Time Delay

In Paper I, we presented a comprehensive analysis that took into account the extended source surface brightness distribution, interacting galaxy lenses, and the presence of dust

3 Two classes of merit functions

In this paper, we extend this class of merit functions to the second-order cone complementarity problem (SOCCP) and show analogous properties as in NCP and SDCP cases.. In addition,

Softswitch in Wireless Networks

Overview of NGN Based on Softswitch Network Architectures of Softswitch- Involved Wireless Networks.. A Typical Call Scenario in Softswitch- Involved

The Primality Problem

• If we know how to generate a solution, we can solve the corresponding decision problem. – If you can find a satisfying truth assignment efficiently, then sat is

Routing in Ad Hoc Wireless Networks

• As RREP travels backwards, each node sets pointer to sending node and updates destination sequence number and timeout entry for source and destination routes.. “Ad-Hoc On