TY - GEN
T1 - Routing management algorithm based on spectrum trading and spectrum competition in cognitive radio networks
AU - Alrabaee, Saed
AU - Agarwal, Anjali
AU - Goel, Nishith
AU - Zaman, Marzia
AU - Khasawneh, Mahmoud
PY - 2012
Y1 - 2012
N2 - Traditionally in routing approaches, each node allows a maximum load through the selected route. The existing routing approaches in cognitive radio networks (CRN) do not take into account spectrum trading as well as spectrum competition among licensed users (PUs). This paper introduces a novel routing algorithm that is based on spectrum trading and spectrum competition for cognitive radio networks while supporting different QoS levels for unlicensed users (SUs). The proposed path selection algorithm among different paths is based on user profiles which contain parameters such as SU identification, number of hops, channel identification, neighbor identification, probabilities of idle slots and PU presence. Each node shares its profile with the neighbor PU, which then exchanges its profile with other PUs and decides based on the information received. In spectrum trading phase a PU calculates its price based on the SU requirements. In spectrum competition phase a new coefficient α is defined that controls the price because of competition among PUs and depends on many factors such as the number of primary users, available channels, and duration of the usage. All possible paths are managed and categorized based on the level of QoS requested by SUs and the price offered by the PU.
AB - Traditionally in routing approaches, each node allows a maximum load through the selected route. The existing routing approaches in cognitive radio networks (CRN) do not take into account spectrum trading as well as spectrum competition among licensed users (PUs). This paper introduces a novel routing algorithm that is based on spectrum trading and spectrum competition for cognitive radio networks while supporting different QoS levels for unlicensed users (SUs). The proposed path selection algorithm among different paths is based on user profiles which contain parameters such as SU identification, number of hops, channel identification, neighbor identification, probabilities of idle slots and PU presence. Each node shares its profile with the neighbor PU, which then exchanges its profile with other PUs and decides based on the information received. In spectrum trading phase a PU calculates its price based on the SU requirements. In spectrum competition phase a new coefficient α is defined that controls the price because of competition among PUs and depends on many factors such as the number of primary users, available channels, and duration of the usage. All possible paths are managed and categorized based on the level of QoS requested by SUs and the price offered by the PU.
KW - Cognitive Radio Network (CRN)
KW - Profile
KW - Routing
KW - Spectrum Competition
KW - Spectrum Trading
UR - http://www.scopus.com/inward/record.url?scp=84874284815&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84874284815&partnerID=8YFLogxK
U2 - 10.1109/BWCCA.2012.106
DO - 10.1109/BWCCA.2012.106
M3 - Conference contribution
AN - SCOPUS:84874284815
SN - 9780769548425
T3 - Proceedings - 2012 7th International Conference on Broadband, Wireless Computing, Communication and Applications, BWCCA 2012
SP - 614
EP - 619
BT - Proceedings - 2012 7th International Conference on Broadband, Wireless Computing, Communication and Applications, BWCCA 2012
PB - IEEE Computer Society
T2 - 2012 7th International Conference on Broadband, Wireless Computing, Communication and Applications, BWCCA 2012
Y2 - 12 November 2012 through 14 November 2012
ER -