BSC location in wireless communication network with MSCs and cells fixed = MSC와 셀이 주어진 이동통신망에서의 기지국제어기 위치선정

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 326
  • Download : 0
This thesis considers a BSC location problem in a wireless communication network, where the locations of MSC and Cells are fixed, and the possible locations of BSCs and traffic arrival rate are also given. In the problem, the three issues of (i) constructing BSCs among possible locations, (ii) connecting BSCs to MSC (iii) connecting each BTSs to BSC are jointly determined to minimize the sum of the average queueing delay cost and the cabling cost and the setup cost of BSC. The proposed problem is formulated as a nonlinear binary integer optimization problem, which is NP-complete. A heuristic solution algorithm based on the Lagrangian relaxation and subgradient optimizations method is developed. To test the performance of the heuristic algorithm, a computational experiment is performed with randomly-generated numerical problems. The results show that the Lagrangian heuristic gives good solutions within a reasonable amount of computational time, and so it may be used effectively for practical problems.
Advisors
Sung, Chang-Supresearcher성창섭researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
1999
Identifier
150781/325007 / 000973376
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 1999.2, [ ii, 43 p. ]

Keywords

Wireless communication network; MSC; BSC; BTS; Lagrangian relaxation; 라그랑지안 완화기법; 이동통신망; 교환국; 기지국제어기; 기지국

URI
http://hdl.handle.net/10203/41548
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=150781&flag=dissertation
Appears in Collection
IE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0