By Topic

Capacity and delay scaling laws for cognitive radio networks with routing and network coding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zheng Wang ; Dept. of Electr. Eng., Univ. of California, Santa Cruz, Santa Cruz, CA, USA ; Sagduyu, Y.E. ; Li, J.H. ; Junshan Zhang

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.

Published in:


Date of Conference:

Oct. 31 2010-Nov. 3 2010