TY - GEN
T1 - Location-aware distributed routing in cognitive radio networks
AU - Li, Fangyong
AU - Zhang, Jun
AU - Letaief, Khaled B.
PY - 2012/12/28
Y1 - 2012/12/28
N2 - In cognitive radio networks, multi-hop communication with efficient routing can improve the connectivity and spectrum efficiency for cognitive users. Many routing algorithms have been proposed, but they may provide unnecessarily long routing paths as the existence of primary users and especially their locations have not been explicitly taken into consideration. In this paper, we investigate distributed routing in cognitive radio networks based on the location information of the primary users. The main idea is to navigate the routing path to avoid large interference to the primary users. We introduce a novel concept of guide strip as the navigation direction for routing. This guide strip is determined based on the visibility graph, which ensures a short packet travel distance, while the width of the guide strip is selected to guarantee a predefined successful routing probability. Simulation results demonstrate that the proposed distributed routing algorithm provides performance close to the globally optimal one.
AB - In cognitive radio networks, multi-hop communication with efficient routing can improve the connectivity and spectrum efficiency for cognitive users. Many routing algorithms have been proposed, but they may provide unnecessarily long routing paths as the existence of primary users and especially their locations have not been explicitly taken into consideration. In this paper, we investigate distributed routing in cognitive radio networks based on the location information of the primary users. The main idea is to navigate the routing path to avoid large interference to the primary users. We introduce a novel concept of guide strip as the navigation direction for routing. This guide strip is determined based on the visibility graph, which ensures a short packet travel distance, while the width of the guide strip is selected to guarantee a predefined successful routing probability. Simulation results demonstrate that the proposed distributed routing algorithm provides performance close to the globally optimal one.
UR - http://www.scopus.com/inward/record.url?scp=84871524056&partnerID=8YFLogxK
U2 - 10.1109/ICCChina.2012.6356980
DO - 10.1109/ICCChina.2012.6356980
M3 - Conference article published in proceeding or book
AN - SCOPUS:84871524056
SN - 9781467328159
T3 - 2012 1st IEEE International Conference on Communications in China, ICCC 2012
SP - 733
EP - 738
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 -