Genetic approach to base station placement from pre-defined candidate sites for wireless communications

Byoung Seong Park, Jong Gwan Yook, Han Kyu Park

Research output: Contribution to journalLetter

4 Citations (Scopus)

Abstract

In this letter, base station placement is automatically determined from pre-defined candidate sites using a genetic approach, and the transmit power is obtained taking the interference situation into account in cases of interference-dominant systems. In order to apply a genetic algorithm to the base station placement problem, a real-valued representation scheme is proposed. Corresponding operators such as crossover and mutation are also introduced. The proposed algorithm is applied to an inhomogeneous traffic density environment, where a base station's coverage may be limited by offered traffic loads. An objective function is designed for performing the cell planning in a coverage- and cost-effective manner.

Original languageEnglish
Pages (from-to)1153-1156
Number of pages4
JournalIEICE Transactions on Communications
VolumeE86-B
Issue number3
Publication statusPublished - 2003 Jan 1

Fingerprint

Base stations
Communication
Genetic algorithms
Planning
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{a2fde57c7f4741d0b5bc8f7d78bbe3a0,
title = "Genetic approach to base station placement from pre-defined candidate sites for wireless communications",
abstract = "In this letter, base station placement is automatically determined from pre-defined candidate sites using a genetic approach, and the transmit power is obtained taking the interference situation into account in cases of interference-dominant systems. In order to apply a genetic algorithm to the base station placement problem, a real-valued representation scheme is proposed. Corresponding operators such as crossover and mutation are also introduced. The proposed algorithm is applied to an inhomogeneous traffic density environment, where a base station's coverage may be limited by offered traffic loads. An objective function is designed for performing the cell planning in a coverage- and cost-effective manner.",
author = "Park, {Byoung Seong} and Yook, {Jong Gwan} and Park, {Han Kyu}",
year = "2003",
month = "1",
day = "1",
language = "English",
volume = "E86-B",
pages = "1153--1156",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "3",

}

Genetic approach to base station placement from pre-defined candidate sites for wireless communications. / Park, Byoung Seong; Yook, Jong Gwan; Park, Han Kyu.

In: IEICE Transactions on Communications, Vol. E86-B, No. 3, 01.01.2003, p. 1153-1156.

Research output: Contribution to journalLetter

TY - JOUR

T1 - Genetic approach to base station placement from pre-defined candidate sites for wireless communications

AU - Park, Byoung Seong

AU - Yook, Jong Gwan

AU - Park, Han Kyu

PY - 2003/1/1

Y1 - 2003/1/1

N2 - In this letter, base station placement is automatically determined from pre-defined candidate sites using a genetic approach, and the transmit power is obtained taking the interference situation into account in cases of interference-dominant systems. In order to apply a genetic algorithm to the base station placement problem, a real-valued representation scheme is proposed. Corresponding operators such as crossover and mutation are also introduced. The proposed algorithm is applied to an inhomogeneous traffic density environment, where a base station's coverage may be limited by offered traffic loads. An objective function is designed for performing the cell planning in a coverage- and cost-effective manner.

AB - In this letter, base station placement is automatically determined from pre-defined candidate sites using a genetic approach, and the transmit power is obtained taking the interference situation into account in cases of interference-dominant systems. In order to apply a genetic algorithm to the base station placement problem, a real-valued representation scheme is proposed. Corresponding operators such as crossover and mutation are also introduced. The proposed algorithm is applied to an inhomogeneous traffic density environment, where a base station's coverage may be limited by offered traffic loads. An objective function is designed for performing the cell planning in a coverage- and cost-effective manner.

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

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

M3 - Letter

AN - SCOPUS:0041743279

VL - E86-B

SP - 1153

EP - 1156

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 3

ER -