Comments on “Optimal Target Channel Sequence Design for Multiple Spectrum Handoffs in Cognitive Radio Networks”

Ahmed Y. Zakariya, Ahmed F. Tayel, Sherif I. Rabia

IEEE Transactions on Communications · 2015 · 13 citations · 3 references

Concepts

Abstract

This paper elaborates on the suboptimal greedy algorithm for target channel sequence selection as presented by Wang <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><i>et al.</i></b> in the paper, “Optimal Target Channel Sequence Design for Multiple Spectrum Handoffs in Cognitive Radio Networks,” <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><i>IEEE Transactions on Communications</i></b> , vol. 60, no. 9, pp. 2444–2455, September 2012. They claimed that the greedy algorithm requires comparing six target channel sequences. We prove that only five target channel sequences comparisons are sufficient. Hence, we present a modified algorithm and test it with a set of numerical results. It appears that the new algorithm reduces the processing time compared to the original one especially for a network with a large number of candidate channels.

References

3