TY - GEN
T1 - Capacity and delay scaling laws for cognitive radio networks with routing and network coding
AU - Wang, Zheng
AU - Sagduyu, Yalin Evren
AU - Li, Jason H.
AU - Zhang, Junshan
PY - 2010
Y1 - 2010
N2 - We characterize the asymptotic behavior of the throughput capacity and packet delay in cognitive radio (CR) networks. For the model where the network density grows, we derive the scaling laws for secondary users (SUs) who opportunistically access the spectrum when primary users (PUs) are idle. More specifically, we assume that SUs do not know PU (transmitter or receiver) locations a priori, and access local channels only after sensing them idle. We consider general overlay networks with arbitrary scaling of the number of PUs and SUs, and assume that PU transmissions are on and off intermittently in a dynamic network operation. Accordingly, the asymptotic SU performance is characterized in terms of the average area covered by PU transmissions. It is clear that shortest path routing (SPR) yields higher capacity whereas multipath routing (MPR) yields smaller delay. When compared with SPR and MPR, our findings show that source-based network coding (NC) with opportunistic routing, achieves the same capacity performance as SPR and the same delay performance as MPR.
AB - We characterize the asymptotic behavior of the throughput capacity and packet delay in cognitive radio (CR) networks. For the model where the network density grows, we derive the scaling laws for secondary users (SUs) who opportunistically access the spectrum when primary users (PUs) are idle. More specifically, we assume that SUs do not know PU (transmitter or receiver) locations a priori, and access local channels only after sensing them idle. We consider general overlay networks with arbitrary scaling of the number of PUs and SUs, and assume that PU transmissions are on and off intermittently in a dynamic network operation. Accordingly, the asymptotic SU performance is characterized in terms of the average area covered by PU transmissions. It is clear that shortest path routing (SPR) yields higher capacity whereas multipath routing (MPR) yields smaller delay. When compared with SPR and MPR, our findings show that source-based network coding (NC) with opportunistic routing, achieves the same capacity performance as SPR and the same delay performance as MPR.
KW - Cognitive radio networks
KW - Dynamic spectrum access
KW - Network coding
KW - Packet delay
KW - Routing
KW - Scaling laws
KW - Throughput capacity
UR - http://www.scopus.com/inward/record.url?scp=79951655577&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79951655577&partnerID=8YFLogxK
U2 - 10.1109/MILCOM.2010.5680137
DO - 10.1109/MILCOM.2010.5680137
M3 - Conference contribution
AN - SCOPUS:79951655577
SN - 9781424481804
T3 - Proceedings - IEEE Military Communications Conference MILCOM
SP - 1375
EP - 1380
BT - 2010 IEEE Military Communications Conference, MILCOM 2010
T2 - 2010 IEEE Military Communications Conference, MILCOM 2010
Y2 - 31 October 2010 through 3 November 2010
ER -