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

This paper elaborates on the suboptimal greedy algorithm for target channel sequence selection as presented by Wang <bold>et al.</bold> in the paper, “Optimal Target Channel Sequence Design for Multiple Spectrum Handoffs in Cognitive Radio Networks,” <bold>IEEE Transactions on Communications</bold>, 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. [ABSTRACT FROM PUBLISHER]