Table 1 Computational complexity upper bounds of four algorithms

Initialization

O(K×N^sense)

Initialization topology

O(K²×K×N^sense)

Adapting of subchannel

O(K×N^sense×N^pso)

G_best and $P_{\text{best}}^i$ Renew of subchannel

O(N^pso)

Updating of subchannel

O(N^sense×N^pso)

Adapting of power

O(K×N^sense×N^pso)

G_best and $P_{\text{best}}^i$ Renew of Power

O(N^pso)

Updating of power

O(N^sense×N^pso)

Total

O(K³×N^sense×N^pso)