An EVEBO-Based BTS Localization Algorithm

Koorosh Navi, Manoochehr Kelarestaghi, Farshad Eshghi

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.

Download


Paper Citation


in Harvard Style

Navi K., Kelarestaghi M. and Eshghi F. (2017). An EVEBO-Based BTS Localization Algorithm.In Proceedings of the 9th International Joint Conference on Computational Intelligence - Volume 1: IJCCI, ISBN 978-989-758-274-5, pages 265-272. DOI: 10.5220/0006500902650272


in Bibtex Style

@conference{ijcci17,
author={Koorosh Navi and Manoochehr Kelarestaghi and Farshad Eshghi},
title={An EVEBO-Based BTS Localization Algorithm},
booktitle={Proceedings of the 9th International Joint Conference on Computational Intelligence - Volume 1: IJCCI,},
year={2017},
pages={265-272},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006500902650272},
isbn={978-989-758-274-5},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 9th International Joint Conference on Computational Intelligence - Volume 1: IJCCI,
TI - An EVEBO-Based BTS Localization Algorithm
SN - 978-989-758-274-5
AU - Navi K.
AU - Kelarestaghi M.
AU - Eshghi F.
PY - 2017
SP - 265
EP - 272
DO - 10.5220/0006500902650272