Browse > Article

Mobile Base Station Placement with BIRCH Clustering Algorithm for HAP Network  

Chae, Jun-Byung (홍익대학교 컴퓨터공학과)
Song, Ha-Yoon (홍익대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computing Practices and Letters / v.15, no.10, 2009 , pp. 761-765 More about this Journal
Abstract
This research aims an optimal placement of Mobile Base Station (MBS) under HAP based network configurations with the restrictions of HAP capabilities. With clustering algorithm based on BIRCH, mobile ground nodes are clustered and the centroid of the clusters will be the location of MBS. The hierarchical structure of BIRCH enables mobile node management by CF tree and the restrictions of maximum nodes per MBS and maximum radio coverage are accomplished by splitting and merging clusters. Mobility models based on Jeju island are used for simulations and such restrictions are met with proper placement of MBS.
Keywords
HAP; BIRCH; MBS; Clustering;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Anggoro K.Widiawan, Pahim Tafazolli, “High Altitude Platform Station (HAPS): A Review of New Infrastructure Development for Future Wire-less Communications,” Wireless Personal Commu-nications, Springer Netherlands, pp.387-404, 2006   DOI
2 신영민, 조관식, 송하윤 "HAP기반 네크워크 시뮬레이션을 위한 노드 모빌리티 구성", 한국정보과학회 2008년 가을 학술발표논문집, vol.35, pp.267-272, 2008
3 Cianca, E. Prasad, R. De Sanctis, M. De Luise, A. Antonini, M. Teotino, D. Ruggieri, M. "Integrated satellite - HAP systems," IEEE Communications Magazine, vol.43 Issue: 12, pp.33-39, Dec. 2005   DOI   ScienceOn
4 Giggenbach, Dirk. Epple, Bernhard. Horwath, Joachim. Moll, Florian, "Optical Satellite Downlinks to Optcal Ground Station and High-Altitude Platforms," VIews of the 16th IST Mobile and Wire-less Communication Summit, Springer, pp.331-349, 2008   DOI
5 Ha Yoon Song, “A Method of Mobile Base Sta-tion Placement for High Altitude Platform Based Network with Geographical Clustering of Mobile Ground Nodes,” Proceedings of the International Multiconference on Computer Science and In-formation Technology, vol.3 pp.869- 876, 2008
6 Frank Dellaert, "The Expectation Maximization Algorithm," College of Computing, Georgia Insti-tute of Technology, Machine Learning, vol.39 Issue 2-3, pp.103-134, May-June 2000   DOI
7 T. Kanungo, D. M, Mount, N. Netanyahu, C. Piatko, R. Silverman, and A. Y. Wu, “An Efficient K-means Clustenng Algorithm: Analysis and Imple-mentation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol.24 no.7, pp.881-892, 2002   DOI   ScienceOn
8 Tian Zhang, Raghn Ranmakrishnan and Niron Liny, "BIRCH : An Efficient Data Clustering Method for Very Large Databases," SIGMOD, pp.103-114, 1996   DOI   ScienceOn
9 이우춘, "이 단계 군집분석 방법에 관한 연구", 중앙대 대학원, 2004