### Abstract

In 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.

Original language | English |
---|---|

Title of host publication | Advances in Computing Science - ASIAN 2000 - 6th Asian Computing Science Conference, Proceedings |

Editors | Jifeng He, Masahiko Sato |

Publisher | Springer Verlag |

Pages | 69-87 |

Number of pages | 19 |

ISBN (Print) | 3540414282, 9783540414285 |

Publication status | Published - 2000 Jan 1 |

Event | 6th Asian Computing Science Conference, ASIAN 2000 - Penang, Malaysia Duration: 2000 Nov 25 → 2000 Nov 27 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1961 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 6th Asian Computing Science Conference, ASIAN 2000 |
---|---|

Country | Malaysia |

City | Penang |

Period | 00-11-25 → 00-11-27 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Advances in Computing Science - ASIAN 2000 - 6th Asian Computing Science Conference, Proceedings*(pp. 69-87). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1961). Springer Verlag.

}

*Advances in Computing Science - ASIAN 2000 - 6th Asian Computing Science Conference, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1961, Springer Verlag, pp. 69-87, 6th Asian Computing Science Conference, ASIAN 2000, Penang, Malaysia, 00-11-25.

**Genetic algorithm for extended cell assignment problem in wireless ATM network.** / Din, Der-Rong; Tseng, Shian Shyong; Jiang, Mon Fong.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Genetic algorithm for extended cell assignment problem in wireless ATM network

AU - Din, Der-Rong

AU - Tseng, Shian Shyong

AU - Jiang, Mon Fong

PY - 2000/1/1

Y1 - 2000/1/1

N2 - In 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.

AB - In 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.

UR - http://www.scopus.com/inward/record.url?scp=84957798139&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84957798139&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84957798139

SN - 3540414282

SN - 9783540414285

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 69

EP - 87

BT - Advances in Computing Science - ASIAN 2000 - 6th Asian Computing Science Conference, Proceedings

A2 - He, Jifeng

A2 - Sato, Masahiko

PB - Springer Verlag

ER -