An EVEBO-Based BTS Localization Algorithm

Koorosh Navi,M. Kelarestaghi,F. Eshghi

Published 2017 in International Joint Conference on Computational Intelligence

ABSTRACT

In this paper, we use EVEBO, an election-inspired optimization algorithm, to solve the BTS (i.e. transceiver) localization problem. The proposed method tries to solve the classic and very important problem of achieving maximum coverage with minimum number of BTSs in a specified geographical area. It also tries to reduce the over-coverage rate, one of the undesirable phenomena in cellular networks. The EVEBO’s merit in solving the problem is measured by a common fitness function, and speed of convergence. Simulation results show that EVEBO solves the problem in much less number of evaluations compared to the best results reported in the literature for square-coverage transceivers. We also show that it can be used in a scenario involving more challenging non-square-coverage (almost circular) transceiver type with satisfactory results.

PUBLICATION RECORD

  • Publication year

    2017

  • Venue

    International Joint Conference on Computational Intelligence

  • Publication date

    Unknown publication date

  • Fields of study

    Computer Science, Engineering

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

CITED BY

  • No citing papers are available for this paper.

Showing 0-0 of 0 citing papers · Page 1 of 1