Skip to main content

Table 2 Computational complexity

From: Energy efficiency optimization-oriented control plane and user plane adaptation with a frameless network architecture for 5G

Scheme ES GA PL-MaxSINR PL-Random
Complexity \( \mathcal{O}\left(K{N}^{K{N}_a}{M}^{K{N}_s}{N}_a{N}_s\right) \) \( \mathcal{O}\left(K{N}_g{N}_p{N}_a{N}_s\right) \) \( \mathcal{O}\left(K{M}^{N_s}+K{N}_a{N}_s\right) \) \( \mathcal{O}\left(K{N}_a{N}_s\right) \)
  1. Moreover, we can achieve lower complexity by further improving the proposed GA algorithm. For example, by adopting the PL-Random algorithm in the initial process to produce the first population of GA, the number of generations can be further reduced