簡易檢索 / 詳目顯示

回結果列表
研究生： 吳曉昀
Wu, Hsiao-Yun
論文名稱： 在感知無線電網路上基於跳躍等待交錯模式之保證聚合跳頻演算法
An Alternate Hop-and-Wait Channel-Hopping Algorithm with Guaranteed Rendezvous for Cognitive Radio Networks
指導教授： 郭耀煌
Kuo, Yau-Hwang
學位類別： 碩士
Master
系所名稱： 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年： 2012
畢業學年度： 100
語文別： 英文
論文頁數： 93
中文關鍵詞： 感知無線電 、跳頻演算法 、聚合
外文關鍵詞： cognitive radio, rendezvous, channel-hopping
相關次數： 點閱：156  下載：1 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 近年來由於對無線電頻譜的需求快速增加，因已授權頻譜使用率低落導致頻譜短缺的問題逐漸受到重視。感知無線電網路（Cognitive Radio Networks）的提出將能紓解這個問題，而動態頻譜存取（Dynamic Spectrum Access）技術則將進一步應用在感知無線電網路上。現今在動態頻譜存取技術上的一個主要議題為聚合問題（Rendezvous Problem），其代表的是次級使用者們（Secondary Users）能在不干擾主要使用者（Primary Users）的情況下在一個共同頻道完成聚合，而由於缺乏共同控制頻道的支援，盲目聚合問題則更是難以解決。
    為了解決盲目聚合問題，在本論文中我們將提出一個稱之為跳躍等待交錯模式的跳頻演算法。有別於現有方法，本方法不但能保證聚合發生，而且能在沒有同步化支援的情況下，應用在對稱式或非對稱式環境中兩人/多人/多跳躍的情境。此外，我們證實了，不論在理論分析或模擬結果上，本方法的最長聚合等待時間和平均聚合等待時間較其他方法更短。更進一步探討單位時間內平均聚合次數及聚合的間距，我們發現此方法將能提供比現有方法更佳的保證效能及更穩定的通訊環境。

    Due to the booming demand for radio spectrum in the past decades, the underutilized problem of licensed spectrum which leads to spectrum shortage attracts much attention. Cognitive Radio Networks are proposed to alleviate the problem and the Dynamic Spectrum Access technology is further applied. In addition, the rendezvous problem which indicates the secondary users can rendezvous on a common channel without interfering primary users, is a major issue in the Dynamic Spectrum Access. And, the blind rendezvous problem is most troublesome due to the lack of Common Control Channel support.
    In the thesis, a novel channel hopping algorithm, called alternate Hop-and-Wait algorithm, is proposed to deal with the blind rendezvous problem. Different from existing methods, the proposed algorithm not only ensures the occurrence of rendezvous, but also adapts to two or multi-users/multi-hops scenarios under both symmetric and asymmetric models without time-synchronization support. Moreover, in both theoretical analyses and simulation results, we prove the proposed algorithm has shorter maximum Time-to-Rendezvous and expected Time-to-Rendezvous than existing methods. We further investigate the number of guaranteed rendezvous in a specific time unit and the average time interval between rendezvous. The results show that the proposed algorithm provides better guaranteed performance and a more stable communication environment.

    LIST OF TABLES IX LIST OF FIGURES X CHAPTER 1 INTRODUCTION 1 1.1 BACKGROUND OF COGNITIVE RADIO NETWORKS 1 1.2 THE RENDEZVOUS PROBLEM 4 1.3 MOTIVATION AND CONTRIBUTION 5 1.4 ORGANIZATION OF THIS THESIS 6 CHAPTER 2 RELATED WORK 7 2.1 CLASSIFICATION OF RENDEZVOUS SYSTEM 7 2.2 EXISTING ALGORITHM FOR BLIND RENDEZVOUS 8 CHAPTER 3 ASSUMPTIONS AND SYSTEM MODEL 12 3.1 PARAMETER DEFINITION 12 3.1.1 Notation Definition 12 3.1.2 The Definition of Time Slot 13 3.2 ASSUMPTIONS 14 3.3 SYSTEM MODEL 15 CHAPTER 4 ALTERNATE HOT-AND-WAIT ALGORITHM 17 4.1 BASIC IDEA OF HOP-AND-WAIT ALGORITHM 17 4.2 HOP-AND-WAIT ALGORITHM FOR 2-USER UNDER SYMMETRIC MODEL 19 4.2.1 Generating of Alternate Channel Hopping Sequence 20 4.2.2 Verification of The Correctness of Hop-and-Wait Algorithm 23 4.2.3 The Expected TTR under Symmetric Model 35 4.3 HOP-AND-WAIT ALGORITHM FOR 2-USER UNDER ASYMMETRIC MODEL 39 4.3.1 Extend the Hop-and-Wait Algorithm to Asymmetric Model 39 4.3.2 The Expected TTR under Asymmetric Model 41 4.4 HOP-AND-WAIT ALGORITHM FOR MULTI-USER MULTI-HOP SCENARIOS 42 CHAPTER 5 ENHANCED HOP-AND-WAIT ALGORITHM 45 5.1 ENHANCED HOP-AND-WAIT ALGORITHM FOR 2-USERS UNDER SYMMETRIC MODEL 45 5.1.1 Generation of Alternate Channel Hopping Sequence 46 5.1.2 Verification of Rendezvous Guarantee in Hop-and-Wait Algorithm 48 5.1.3 The Expected TTR of Enhanced Hop-and-Wait Algorithm under Symmetric Model 58 5.2 ENHANCED HOP-AND-WAIT ALGORITHM FOR 2-USERS UNDER ASYMMETRIC MODEL 68 5.3 ENHANCED HOP-AND-WAIT ALGORITHM FOR MULTI-USER AND MULTI-HOP SCENARIOS 69 CHAPTER 6 COMPARISON AND ANALYSIS 71 6.1 COMPARISON 71 6.2 ANALYSIS OF THE NUMBER OF RENDEZVOUS 72 CHAPTER 7 SIMULATIONS AND RESULTS 80 7.1 RENDEZVOUS FOR 2-USERS 80 7.1.1 Under Symmetric Model 81 7.1.2 Under Asymmetric Model 82 7.2 RENDEZVOUS FOR MULTI-USER AND MULTI-HOP SCENARIOS 84 7.2.1 Under Symmetric Model 84 7.2.2 Under Asymmetric Model 85 7.3 SIMULATION FOR TIME INTERVAL BETWEEN RENDEZVOUS 87 CHAPTER 8 CONCLUSIONS AND FUTURE WORK 89 8.1 CONCLUSIONS 89 8.2 FUTURE WORK 90 REFERENCES 91

    [AKY08] I.F. Akyildiz , Won-Yeol Lee, Vuran, M.C., Mohanty, S., “A Survey on Spectrum Management in Cognitive Radio Networks,” Communications Magazine, IEEE, Apr.2008.
    [BIA09] K. Bian, J.-M. Park, and R. Chen, “A Quorum-based Framework for Establishing Control Channels in Dynamic Spectrum Access Networks,” Proc. of ACM MobiCom’09, pp. 25-36, Sept. 2009.
    [BIA11] K. Bian, J.-M. Park, “Asynchronous Channel Hopping for Establishing Rendezvous in Cognitive Radio Networks,”INFOCOM, 2011 Proceedings IEEE, Apr.2011.
    [BRO04] R.W. Brodersen, A. Wolisz, D. Cabric, S. M. Mishra,“Corvus: A cognitive radio approach for usage of virtual unlicensed spectrum,” 2004.
    Webpage - http://citeseer.ist.psu.edu/756492.html
    [CHA08] J. Chanaka., A. Liyana, Venkatesan, S., & Mittal, N., “An synchronous Neighbor Discovery Algorithm for Cognitive Radio Networks,” 3rd IEEE Symposium on New Frontiers in Dyanmic Spectrums Access Networks (DySPAN), (pp. 1-5). Chicago.,2008.
    [DAS08] L. DaSilva and I. Guerreiro, “Sequence-based Rendezvous for Dynamic Spectrum Access,” Proc. of IEEE DySPAN 2008, pp. 1-7, Oct. 2008.
    [FCC02] FCC, “Spectrum Policy Task Force Report (ET Docket no. 02-135),” Nov. 2002.
    [GHA08] A. Ghasemi, E.S. Sousa, “Spectrum Sensing in Cognitive Radio Networks: Requirements, Challenges and Design Trade-offs,” Communications Magazine, IEEE, Apr.2008.
    [GRO10] A. Gross, R. Thomas, “Handshaking Protocols and Jamming Mechanisms for Blind Rendezvous in a DSA Environment,” 2010.
    [LIH10] H. Li, D. Grace, P.D.,Mitchell, "Cognitive Radio Multiple Access Control for Unlicensed and Open Spectrum with Reduced Spectrum Sensing Requirements," Wireless Communication Systems (ISWCS), Sept.2010.
    [LIN11] Z. Lin, H. Liu, X. Chu, and Y.-W. Leung, “Jump-Stay Based Channel-hopping Algorithm with Guaranteed Rendezvous for Cognitive Radio Networks,” INFOCOM, 2011 Proceedings IEEE, Apr.2011.
    [LIU10] H. Liu, Z. Lin, X. Chu, and Y.-W. Leung, “Ring-Walk Based Channel-Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks,” Green Computing and Communications (GreenCom), 2010 IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social Computing (CPSCom).
    [LIU12] H. Liu, Z. Lin, X.Chu, Y.Leung, “Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks,” Parallel and Distributed Systems, IEEE Transactions on, Jan.2012.
    [MCH05] M. A. McHenry, “NSF Spectrum Occupancy Measurements Project Summary,” shared spectrum co. report, Aug. 2005.
    [ROM11] S. Romaszko, P. Mahonen, “Grid-based channel mapping in cognitive radio ad hoc networks,” Personal Indoor and Mobile Radio Communications (PIMRC), Sept.2011.
    [SAM07] Sampath, A., Dai, H., Zheng, H., & Zhao, B. Y.(2007). “Multi-channel Jamming Attacks using Cognitive Radios,” Santa Barbara: IEEE, 2007.
    [SHI10] J. Shin, D. Yang, and C. Kim, ”A Channel Rendezvous Scheme for Cognitive Radio Networks,” IEEE Communications Letters, vol. 14, no. 10, pp. 954-956, 2010.
    [THE09] N. C. Theis, “The Modular Clock Algorithm for Blind Rendezvous. Wright- Patterson AFB, “ Ohio: Air Force Institute of Technology, 2009.
    [THE10] N. C. Theis, R. W. Thomas, and L. A. DaSilva, “Rendezvous for Cognitive Radios,” IEEE Transactions on Mobile Computing, vol. 10, pp.216-227, 2010.
    [YAN10] D. Yang, J. Shin, and C. Kim, “Deterministic Rendezvous Scheme in Multichannel Access Networks,” Electronics Letters, vol. 46, no. 20, pp. 1402-1404, 2010.

    下載圖示 校內：2017-08-30公開
    校外：2017-08-30公開
    QR CODE