Routing for cognitive radio networks consisting of opportunistic links

被引:22
作者
Chen, Kwang-Cheng [1 ]
Cetin, Bilge Kartal [2 ,3 ]
Peng, Yu-Cheng [1 ]
Prasad, Neeli [2 ,3 ]
Wang, Jin [4 ]
Lee, Songyoung [4 ]
机构
[1] Natl Taiwan Univ, Grad Inst Commun Engn, Dept Elect Engn, Taipei 106, Taiwan
[2] Aalborg Univ, Dept Elect Syst, Aalborg, Denmark
[3] Aalborg Univ, CTiF, Aalborg, Denmark
[4] Kyung Hee Univ, Dept Elect & Comp Engn, Seoul, South Korea
关键词
cognitive radio; cognitive radio networks; routing; unidirectional link; cooperative relay networks; opportunistic links; AD HOC NETWORKS; DYNAMIC SPECTRUM ACCESS; WIRELESS NETWORKS; PATH;
D O I
10.1002/wcm.776
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cognitive radio (CR) has been considered a key technology to enhance overall spectrum utilization by opportunistic transmissions in CR transmitter receiver link(s). However, CRs must form a cognitive radio network (CRN) so that the messages can be forwarded from source to destination, on top of a number of opportunistic links from co-existing multi-radio systems. Unfortunately, appropriate routing in CRN of coexisting multi-radio systems remains an open problem. We explore the fundamental behaviors of CR links to conclude three major challenges, and thus decompose general CRN into cognitive radio relay network (CRRN), CR uplink relay network, CR downlink relay network, and tunneling (or core) network. Due to extremely dynamic nature of CR links, traditional routing to maintain end-to-end routing table for ad hoc networks is not feasible. We locally build up one-step forward table at each CR to proceed based on spectrum sensing to determine trend of paths from source to destination, while primary systems (PSs) follow original ways to forward packets like tunneling. From simulations over ad hoc with infrastructure network topology and random network topology, we demonstrate such simple routing concept known as CRN local on-demand (CLOD) routing to be realistic at reasonable routing delay to route packets through. Copyright (C) 2009 John Wiley & Sons, Ltd.
引用
收藏
页码:451 / 466
页数:16
相关论文
共 26 条
[1]  
[Anonymous], PHYS COMMUN
[2]  
[Anonymous], MOBILE COMPUTING
[3]   TRAILS AND U-TURNS IN THE SELECTION OF A PATH BY THE ANT LASIUS-NIGER [J].
BECKERS, R ;
DENEUBOURG, JL ;
GOSS, S .
JOURNAL OF THEORETICAL BIOLOGY, 1992, 159 (04) :397-415
[4]   ExOR: Opportunistic multi-hop routing for wireless networks [J].
Biswas, S ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2005, 35 (04) :133-143
[5]   Opportunistic routing in multi-hop wireless networks [J].
Biswas, S ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (01) :69-74
[6]   Combining on-demand and opportunistic routing for intermittently connected networks [J].
Boice, J. ;
Garcia-Luna-Aceves, J. J. ;
Obraczka, K. .
AD HOC NETWORKS, 2009, 7 (01) :201-218
[7]   Performance evaluation of routing protocols for ad hoc wireless networks [J].
Boukerche, A .
MOBILE NETWORKS & APPLICATIONS, 2004, 9 (04) :333-342
[8]  
BYUN HJ, 2008, SELF ORG FUTURE MOBI
[9]  
CHACHULSKI S, 2007, TRADING STRUCTURE RA
[10]  
CHEN KC, 2008, COGNITIVE RADIO NE 1