Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

Journal of Beijing University of Posts and Telecommunications ›› 2020, Vol. 43 ›› Issue (4): 21-26.doi: 10.13190/j.jbupt.2019-260

• PAPERS • Previous Articles     Next Articles

Quaternion-Based Particle Swarm Optimization Algorithms for Mobile Communication Network Coverage

QIN Yun-hui, HUANGFU Wei, LONG Ke-ping   

  1. 1. Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, University of Science and Technology Beijing, Beijing 100083, China;
    2. Beijing Advanced Innovation Center for Materials Genome Engineering, Beijing 100083, China
  • Received:2019-12-07 Published:2020-08-15

Abstract: Aiming at the inherent correlation of azimuths and tilts of the antennas installed on the base stations, a quaternion-based particle swarm optimization algorithms is proposed to optimize the coverage performance for mobile networks, in which the quaternions represents the antenna orientations, and the rotations formed by the multiplication in the quaternion field ensures that the feasible solutions, that is the particles, update along the shortest paths. Moreover, the author considers the process to perform infinitesimal movements towards different directions in turn and thus introduced a blending quaternion-based particle swarm optimization algorithm to overcome the problems that the destination of the particle movement depends upon the order of directions including along the inertial velocity, towards the individual historical optimal solution and towards the global optimal solution, which is indeed caused by the anti-commutative law of quaternions. Simulations show that the proposed algorithms, especially the latter, perform better than the canonical particle swarm algorithm, firefly algorithm and genetic algorithm both in the convergence efficiency and the final optimized coverage.

Key words: coverage optimization, quaternion, particle swarm optimization, mobile communication network

CLC Number: