Spectrum sharing using particle swarm optimization

Unlike the static spectrum policy, spectrum sharing uses dynamic spectrum access techniques in order to utilize the spectrum efficiently. The main objective of this work is to maximize the sum throughput for the allowed secondary links that can coexist peacefully with primary links in a cognitive radio network. A binary particle swarm optimization (BPSO) is applied to solve this cognitive radio optimization problem. We also investigate the effect of limiting the link distance of both primary and secondary links on the sum throughput. The results prove the viability of using BPSO to maximize the sum throughput. Moreover, it is shown that the shorter the distance of primary and secondary links the higher the sum throughput.