全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

感知中继网络中依据检测结果的频谱共享机制

DOI: 10.13190/jbupt.201005.41.365, PP. 41-46

Keywords: 感知中继网络,频谱共享,中断概率,符号错误概率

Full-Text   Cite this paper   Add to My Lib

Abstract:

在感知中继网络中,为实现授权频带在主次用户间的高效利用,提出一种基于检测结果的频谱共享机制,允许次用户根据频谱检测的结果自适应地选择传输方式.并在该机制下,考虑主次用户间的干扰情况,进而根据信干噪比(SINR)推导出次用户网络的中断概率和符号错误概率的闭式表达式.仿真结果表明,本机制与传统的频谱共享机制相比,能在保证主用户通信的前提下,使次用户网络获得较高的性能增益.

References

[1]  Haykin S. Cognitive radio: brain-empowered wireless communications[J]. IEEE Journal on Selected Areas in Communications, 2005, 23(2): 201-220.
[2]  Sun Chunhua, Letaief K B. User cooperation in heterogeneous cognitive radio networks with interference reduction// IEEE ICC 2008. Beijing: IEEE Press, 2008: 337-341.
[3]  Lee K, Yener A. Outage performance of cognitive wireless relay networks// IEEE GLOBECOM 2006. San Francisco: IEEE Press, 2006: 1-5.
[4]  Suraweera H A, Smith P G, Surobhi N A. Exact outage probability of cooperative diversity with opportunistic spectrum access// IEEE ICC 2008. Beijing: IEEE Press, 2008: 79-84.
[5]  Digham F F, Alouini M S, Simon M K. On the energy detection of unknown signals over fading channels// IEEE ICC 2003. Anchorage: IEEE Press, 2003: 3575-3579.
[6]  Ghasemi A, Sousa E S. Collaborative spectrum sensing for opportunistic access in fading environments// IEEE DySPAN 2005. Baltimore: IEEE Press, 2005: 131-136.
[7]  Chen Shuping, Wang Wenbo, ZhangXing. Performance analysis of multiuser diversity in cooperative multi-relay networks under Rayleigh-fading channels[J]. IEEE Trans on Wireless Communications, 2009, 8(8): 3415-3419. (上接第21页)
[8]  Huang Cheng, Wang A, Li Jin, et al. Understanding hybrid CDN-P2P: why limelight needs its own red swoosh? //NOSSDAV 2008. Braunschweig: ACM Press, 2008: 75-80.
[9]  Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for improved performance?[J]. ACM SIGCOMM Computer Communication Review, 2007, 37(3): 29-40.
[10]  Xie Haiyong, Yang Y R, Krishnamurthy A, et al. P4P: provider portal for applications [J]. ACM SIGCOMM Computer Communication Review, 2008, 38(4): 351-362.
[11]  Donnet B, Friedman T. Internet topology discovery: a survey[J]. IEEE Communications Surveys & Tutorials, 2007, 9(4): 56-69.
[12]  Boccalettia S, Latora V, Moreno Y, et al. Complex networks: structure and dynamics [J]. Physics Reports, 2006, 424(4-5): 175-308.
[13]  Stutzbach D, Rejaie R, Sen S. Characterizing unstructured overlay topologies in modern P2P file-sharing systems[J]. IEEE/ACM Trans on Networking, 2008, 16(2): 267-280.
[14]  Jelasity M,Voulgaris S,Guerraoui R, et al. Gossip-based peer sampling[J]. ACM Trans on Computer Systems, 2007, 25(3):1-35.
[15]  Ganesh A J, Kermarrec A M, Massoulie L. Peer-to-peer membership management for gossip-based protocols[J]. IEEE Trans on Computers, 2003, 52(2):139-149.
[16]  Clauset A, Newman M E J, Moore C. Finding community structure in very large networks[J]. Physical Review E, 2004, 70(6):066111.
[17]  Newman M E J. Analysis of weighted networks[J]. Physical Review E, 2004, 70(5):056131.
[18]  Bakhshi R, Cloth L, Fokkink W, et al. Mean-field analysis for the evaluation of gossip protocols[J]. ACM SIGMETRICS Performance Evaluation Review, 2008, 36(3):31-39.
[19]  Karlin S, Taylor H M. A first course in stochastic processes[M].Singapore: Elsevier Pte Ltd, 2007.
[20]  Huang Cheng, Li Jin, Ross K W. Can Internet video-on-demand be profitable?[J]. ACM SIGCOMM Computer Communication Review, 2007, 37(4):133-144.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133