Scaling Laws for Heterogeneous Cognitive Radio Networks with Cooperative Secondary Users

被引:0
作者
Jia, Riheng [1 ]
Zhang, Jinbei [1 ]
Wang, Xinbing [1 ]
Tian, Xiaohua [1 ,3 ]
Zhang, Qian [2 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Elect Engn, Shanghai 200030, Peoples R China
[2] Hong Kong Univ Sci & Technol, Dept Comp Sci & Engn, Hong Kong, Hong Kong, Peoples R China
[3] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Beijing, Peoples R China
来源
2014 PROCEEDINGS IEEE INFOCOM | 2014年
关键词
WIRELESS NETWORKS; THROUGHPUT; CAPACITY;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Cognitive radio (CR) technique is considered an effective mechanism to relieve the spectrum scarcity issue, where the secondary users (SUs) can utilize the idle spectrum of the primary users (PUs). How the performance of the wireless network will be influenced by the introduction of CR technique has been attracting much attention in past years. While many efforts have been made to study the cognitive radio network, where the data source and the destination (S-D) is homogeneously distributed, the research on cognitive radio networks (CRN) with heterogeneous S-D distribution is still very limited. In this paper, we investigate the throughput and delay scaling law in the heterogeneous cognitive radio network (HCRN), where the S-D pair follows a rank based model and SUs provide relay service for PUs in reciprocating the utilization of PUs' idle spectrum. By applying a cellular TDMA scheduling scheme, we show that the primary network throughput is the same for different heterogeneous extents of S-D distribution owing to the flexible assistance of SUs, while the throughput of secondary networks is proven to be changing with respect to the S-D heterogeneity exponent denoted by a. In addition, the delay scaling are derived for both primary and secondary networks and shown to be altering in accordance with a. Further, we reveal that the density of SUs required to assist PUs can be dramatically reduced when considering the S-D heterogeneity, while achieving the same primary network throughput.
引用
收藏
页码:880 / 888
页数:9
相关论文
共 16 条
[1]  
Ahn YY, 2007, WWW '07: Proceedings of the 16th international conference on World Wide Web, P835
[2]  
Azimdoost B., 2011, 2011 IEEE First International Network Science Workshop (NSW 2011), P30, DOI 10.1109/NSW.2011.6004655
[3]   Optimal throughput-delay scaling in wireless networks - Part I: The fluid model [J].
El Gamal, Abbas ;
Mammen, James ;
Prabhakar, Balaji ;
Shah, Devavrat .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (06) :2568-2592
[4]   Closing the gap in the capacity of wireless networks via percolation theory [J].
Franceschetti, Massimo ;
Dousse, Olivier ;
Tse, David N. C. ;
Thiran, Patrick .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (03) :1009-1018
[5]  
Fu L., 2011, CAPACITY WIRELESS SO
[6]   Throughput and Delay Scaling in Supportive Two-Tier Networks [J].
Gao, Long ;
Zhang, Rui ;
Yin, Changchuan ;
Cui, Shuguang .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2012, 30 (02) :415-424
[7]   The capacity of wireless networks [J].
Gupta, P ;
Kumar, PR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (02) :388-404
[8]   Cognitive Networks Achieve Throughput Scaling of a Homogeneous Network [J].
Jeon, Sang-Woon ;
Devroye, Natasha ;
Vu, Mai ;
Chung, Sae-Young ;
Tarokh, Vahid .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (08) :5103-5115
[9]  
Kumar R., 2005, MITCSAILTR2005040
[10]   Geographic routing in social networks [J].
Liben-Nowell, D ;
Novak, J ;
Kumar, R ;
Raghavan, P ;
Tomkins, A .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2005, 102 (33) :11623-11628