Fast Cooperative Energy Detection under Accuracy Constraints in Cognitive Radio Networks

الملخص EN

Cooperative energy detection (CED) is a key technique to identify the spectrum holes in cognitive radio networks.

Previous study on this technique mainly aims at improving the detection accuracy, while paying little attention to the performance of detection time.

This paper concentrates on the issue of fast CED, which is achieved by minimizing its detection time subject to the constraints on detection accuracy.

Firstly, the prevalent counting rule based CED algorithm is optimized.

Taking the special cases of counting rule (AND rule and OR rule), for example, we show that detection time can be minimized by selecting an optimal number of secondary users.

Moreover, we prove that OR rule is superior to AND rule in detection time, and thus OR rule based CED is faster than AND rule based CED.

Then, a sequential test (ST) based CED algorithm is proposed to exploit the benefit of ST and detect primary user even faster.

After analyzing its detection time, we illustrate that ST based CED is able to spend the minimal detection time in satisfying the accuracy constraints by choosing an optimal sample number.

Simulation results are provided to verify the effectiveness of both fast algorithms discussed in this paper.