TY - GEN
T1 - Dynamic interference minimization routing game for on-demand cognitive pilot channel
AU - Zhu, Quanyan
AU - Yuan, Zhou
AU - Song, Ju Bin
AU - Han, Zhu
AU - Başar, Tamer
PY - 2010
Y1 - 2010
N2 - In this paper, we introduce a distributed dynamic routing algorithm for secondary users (SUs) to minimize their interference with the primary users (PUs) in multi-hop cognitive radio (CR) networks. We use the medial axis with a relaxation factor as a reference path which is contingent on the states of the PUs. Along the axis, we construct a hierarchical structure for multiple sources to reach cognitive pilot channel (CPC) base stations. We use a temporal and spatial dynamic non-cooperative game to model the interactions among SUs as well as their influences from PUs in the multi-hop structure of the network. A multi-stage fictitious play learning is used for distributed routing in multi-hop CR networks. We obtain a set of mixed (behavioral) Nash equilibrium strategies of the dynamic game in closed form by backward induction. The proposed algorithm minimizes the overall interference and the average packet delay along the routing path from SU nodes to CPC base stations in an optimal and distributed manner.
AB - In this paper, we introduce a distributed dynamic routing algorithm for secondary users (SUs) to minimize their interference with the primary users (PUs) in multi-hop cognitive radio (CR) networks. We use the medial axis with a relaxation factor as a reference path which is contingent on the states of the PUs. Along the axis, we construct a hierarchical structure for multiple sources to reach cognitive pilot channel (CPC) base stations. We use a temporal and spatial dynamic non-cooperative game to model the interactions among SUs as well as their influences from PUs in the multi-hop structure of the network. A multi-stage fictitious play learning is used for distributed routing in multi-hop CR networks. We obtain a set of mixed (behavioral) Nash equilibrium strategies of the dynamic game in closed form by backward induction. The proposed algorithm minimizes the overall interference and the average packet delay along the routing path from SU nodes to CPC base stations in an optimal and distributed manner.
UR - http://www.scopus.com/inward/record.url?scp=79551646317&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79551646317&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2010.5683923
DO - 10.1109/GLOCOM.2010.5683923
M3 - Conference contribution
AN - SCOPUS:79551646317
SN - 9781424456383
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010
Y2 - 6 December 2010 through 10 December 2010
ER -