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

Author

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

Author_Institution

Dept. of Eng. Math. & Phys., Alexandria Univ., Alexandria, Egypt

Volume

63

Issue

8

fYear

2015

fDate

Aug. 2015

Firstpage

3021

Lastpage

3024

Abstract

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

Keywords

cognitive radio; greedy algorithms; mobility management (mobile radio); radio networks; cognitive radio networks; multiple spectrum handoffs; optimal target channel sequence design; suboptimal greedy algorithm; Algorithm design and analysis; Cognitive radio; Greedy algorithms; Mobile radio mobility management; Cognitive radio; greedy algorithm; preemptive priority; spectrum handoff;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2015.2450209

Filename

7137636