About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
el 22(3): e1

Research Article

Research on Location Selection of Mobile Communication Weak Coverage Network Based on Hierarchical K-means Clustering Algorithm

Download107 downloads
Cite
BibTeX Plain Text
  • @ARTICLE{10.4108/eetel.v8i3.3319,
        author={Yuan Huang and Zezhong  Huang and Shijun Liu and Liying Lan},
        title={Research on Location Selection of Mobile Communication Weak Coverage Network Based on Hierarchical K-means Clustering Algorithm},
        journal={EAI Endorsed Transactions on e-Learning},
        volume={8},
        number={3},
        publisher={EAI},
        journal_a={EL},
        year={2023},
        month={6},
        keywords={Network site planning, Weak coverage, k − means clustering, Dynamic Cluster Analysis Algorithm},
        doi={10.4108/eetel.v8i3.3319}
    }
    
  • Yuan Huang
    Zezhong Huang
    Shijun Liu
    Liying Lan
    Year: 2023
    Research on Location Selection of Mobile Communication Weak Coverage Network Based on Hierarchical K-means Clustering Algorithm
    EL
    EAI
    DOI: 10.4108/eetel.v8i3.3319
Yuan Huang1, Zezhong Huang1, Shijun Liu2, Liying Lan3,*
  • 1: Faculty of Electronic Information Engineering, Gannan University of science and technology, Ganzhou, China
  • 2: Faculty of Intelligent Manufacturing and Automotive Engineering, Gannan University of science and technology, Ganzhou, China
  • 3: Faculty of Humanity and Law, Gannan University of science and technology, Ganzhou, China
*Contact email: lanliying318@126.com

Abstract

At present, the problem of weak coverage of mobile communication still exists. Firstly, this thesis determines the scale of the base station and the location of the network with the hierarchical clustering algorithm. Secondly, this thesis also determines the base station coverage with the sector area of the Archimedes screw, the location of the weak coverage point with the discriminative model of weak coverage point, and the angle of the sector with the coverage model of gradient descent method. Finally, this thesis provides better solutions to the weak coverage problem with the propagation model of cluster analysis, and optimizes the site selection with the correction model of the propagation pass loss. Within the certain cost, we aim to increase the volume of coverage business, decrease the time complexity of the model, and improve the efficiency of the site selection.

Keywords
Network site planning, Weak coverage, k − means clustering, Dynamic Cluster Analysis Algorithm
Received
2023-05-07
Accepted
2023-05-30
Published
2023-06-23
Publisher
EAI
http://dx.doi.org/10.4108/eetel.v8i3.3319

Copyright © 2022 Yuan Huang et al., licensed to EAI. This is an open access article distributed under the terms of the CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.

EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL