TY - GEN
T1 - Throughput-optimized cross-layer routing for cognitive radio networks
AU - Zhan, Minghao
AU - Ren, Pinyi
AU - Zhang, Chao
AU - Li, Fan
PY - 2012
Y1 - 2012
N2 - Cognitive radio (CR) is a promising technology to solve the spectrum scarcity problem by enabling secondary users (SU) to utilize the spectrum holes of primary users (PU) caused by static spectrum allocation. However, SUs need to avoid the interference to PUs, imposing new challenges in routing protocol designs and throughput improvement in CR networks (CRN). In this paper we propose a cross-layer channel assignment and routing (CCAR) algorithm. Specifically, our CCAR algorithm aims at throughput maximization while addressing the interference avoidance issue in CRNs. Solving for the optimal solution towards throughput maximization is a NP problem. In contrast, we simplify this optimization problem by taking advantage of the correlation of data flow and routing information across the network nodes. Then, further making use of the adjacent hop interference (AHI) Information, we develop a heuristic approach to obtain a suboptimal solution. Theoretical analysis and simulation results show that our proposed CCAR algorithm can achieve polynomial complexity at the cost of only 20% throughput loss as compared to the optimal solution.
AB - Cognitive radio (CR) is a promising technology to solve the spectrum scarcity problem by enabling secondary users (SU) to utilize the spectrum holes of primary users (PU) caused by static spectrum allocation. However, SUs need to avoid the interference to PUs, imposing new challenges in routing protocol designs and throughput improvement in CR networks (CRN). In this paper we propose a cross-layer channel assignment and routing (CCAR) algorithm. Specifically, our CCAR algorithm aims at throughput maximization while addressing the interference avoidance issue in CRNs. Solving for the optimal solution towards throughput maximization is a NP problem. In contrast, we simplify this optimization problem by taking advantage of the correlation of data flow and routing information across the network nodes. Then, further making use of the adjacent hop interference (AHI) Information, we develop a heuristic approach to obtain a suboptimal solution. Theoretical analysis and simulation results show that our proposed CCAR algorithm can achieve polynomial complexity at the cost of only 20% throughput loss as compared to the optimal solution.
UR - https://www.scopus.com/pages/publications/84871497279
U2 - 10.1109/ICCChina.2012.6356982
DO - 10.1109/ICCChina.2012.6356982
M3 - 会议稿件
AN - SCOPUS:84871497279
SN - 9781467328159
T3 - 2012 1st IEEE International Conference on Communications in China, ICCC 2012
SP - 745
EP - 750
BT - 2012 1st IEEE International Conference on Communications in China, ICCC 2012
T2 - 2012 1st IEEE International Conference on Communications in China, ICCC 2012
Y2 - 15 August 2012 through 17 August 2012
ER -