以作者查詢圖書館館藏 、以作者查詢臺灣博碩士 、以作者查詢全國書目 、勘誤回報 、線上人數:73 、訪客IP:13.59.46.85
姓名 范振緯(Chen-wei Fan) 查詢紙本館藏 畢業系所 通訊工程學系 論文名稱 在感知無線電網路下群體資料共享機制之研究
(The Study of Group Data Sharing Mechanism on Cognitive Radio Network)相關論文 檔案 [Endnote RIS 格式] [Bibtex 格式] [相關文章] [文章引用] [完整記錄] [館藏目錄] [檢視] [下載]
- 本電子論文使用權限為同意立即開放。
- 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
- 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
摘要(中) 在無線網路資源的使用上是透過頻譜的劃分來分配給不同的無線網路通訊技術來利用,頻譜上的通道狀況與頻寬都不相同,這同時也影響了傳輸速度與品質。若該通訊技術的使用人數或是使用的頻率很低,就會形成整體頻譜使用率低落或是極度不均勻的情形。動態頻譜接取技術(Dynamic Spectrum Access, DSA)便是在這種情形下成為研究的重點。在眾多動態頻譜接取技術之中感知無線電(Cognitive Radio, CR)技術更是學者們的熱門研究目標。
在感知無線電網路中若是有一個使用者想要與其他使用者共享資料或是交換資訊,該使用者必須先要和傳送對象在同一個頻道上並且建立連線,這樣的行為稱為「相遇(Rendezvous)」。而不同的相遇演算法有不同的適用環境和限制,此種環境限制可以成為評比相遇演算法的依據,例如:分散式系統、不依靠共同控制通道(不需要額外資訊)、不需時間同步、非對稱模型和擁有相遇保證。本論文便是基於這樣的條件下,提出一個有效率的群體資料共享機制。
本論文設計出一個可以將欲共享資料的感知無線電網路使用者經由通道競爭取得使用權,之後快速結合成一個新群體的機制。並透過分享門檻值控制在群體內共享資料的時機,以提升資料傳送的使用效率避免不必要的浪費與節省大量的網路資源能提供給更多使用者。摘要(英) The use of resources in a wireless network is through the division of the spectrum to be assigned to different wireless network communication technology to take advantage. Channel condition on the spectrum and bandwidth are not the same, this also affects the transmission speed and quality. If the number of users of communication technology or the frequency of use is low, it will form a whole spectrum usage is extremely low or uneven situation. In this case, dynamic spectrum access technologies (DSA) become a research focus. In many dynamic spectrum access technologies, cognitive radio (CR) technology is the most popular research objectives.
In cognitive radio networks if there is a user wants to share data with other users or to exchange information, these users must first stay in the same channel, and the connection is established. This behavior is called "Rendezvous". There are many different environments and constraints for different rendezvous algorithms, environmental constraints can become the basis for appraisal rendezvous algorithms. This thesis is based on these conditions, proposed an efficient group data sharing mechanism.
In this thesis, cognitive radio network users that want to join the data sharing can be merged via channel competition that we proposed. Sharing threshold value controls the timing of when the group data sharing start. Enhance the efficiency of data transfer to avoid unnecessary waste and can save a lot of network resources to more users.關鍵字(中) ★ 感知無線電
★ 群體
★ 資料共享關鍵字(英) 論文目次 目錄
摘要 I
ABSTRACT II
誌謝 III
目錄 IV
圖目錄 VI
表目錄 VIII
第1章 緒論 1
1.1 研究背景 1
1.2 研究動機 2
1.3 章節概要 2
第2章 相關背景研究 4
2.1 Cognitive Radio Network基本介紹 4
2.2 相遇演算法介紹 7
2.3 相關文獻探討 11
第3章 研究方法 14
3.1 系統架構介紹 14
3.2 PU應對策略介紹 15
3.3 通道競爭機制介紹 16
3.4 資料共享機制介紹 20
3.5 系統流程介紹 21
第4章 模擬與分析 27
4.1 模擬環境介紹 27
4.2 模擬結果分析 31
4.2.1 時間的影響 32
4.2.2 感知無線電網路使用者數目的影響 33
4.2.3 K1、K2門檻值的影響 40
4.2.4 檔案大小的影響 46
4.2.5 群體資料共享機制比較 47
第5章 結論 49
參考文獻 50參考文獻 [1] FCC, ET Docket No 03-322 Notice of Proposed Rule Making and Order, Dec 2003.
[2] S. Haykin, “Cognitive Radio: Brain-Empowered Wireless Communications,” IEEE JSAC, vol. 23, no. 2, Feb. 2005, pp. 201–20.
[3] O. Ileri, D. Samardzija, and N. B. Mandayam, “Demand Responsive Pricing and Competitive Spectrum Allocation via Spectrum Server,” Proc. IEEE DySPAN 2005, Nov. 2005, pp. 194–202.
[4] Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran, and Shantidev Mohanty, “A Survey on Spectrum Management in Cognitive Radio Networks,” IEEE Communications Magazine , April 2008.
[5] Hai Liu, Zhiyong Lin, Xiaowen Chu, Yiu-Wing Leung, “Taxonomy and Challenges of Rendezvous Algorithms in Cognitive Radio Networks,” International Conference on Computing, Networking and Communications Invited Position Paper Track, 2012.
[6] J. Zhao, H. Zheng and G.-H. Yang, “Distributed coordination in dynamic spectrum allocation networks,” in Proc of IEEE DySPAN 2005, pp. 259-268, Nov. 2005.
[7] L. Lazos, S. Liu and M. Krunz, “Spectrum opportunity-based control channel assignment in cognitive radio networks,” in Proc. of IEEE SECON 2009, pp. 1-9, Jun. 2009.
[8] Kaigui Bian and Jung-Min “Jerry” Park, “Asynchronous Channel Hopping for Establishing Rendezvous in Cognitive Radio Networks,” IEEE INFOCOM 2011.
[9] Srinivasan Krishnamurthy, Mansi Thoppian, S. Venkatesan, and Ravi Prakash, “CONTROL CHANNEL BASED MAC-LAYER CONFIGURATION, ROUTING AND SITUATION AWARENESS FOR COGNITIVE RADIO NETWORKS,” Military Communications Conference, 2005. MILCOM 2005. IEEE.
[10] N. C. Theis, R. W. Thomas and L. A. DaSilva, “Rendezvous for cognitive radios,” IEEE Transactions on Mobile Computing, Vol. 10, pp.216-227, 2011.
[11] C. Cormio and K. R. Chowdhury, “Common control channel design for cognitive radio wireless ad hoc networks using adaptive frequency hopping,” Ad Hoc Networks, Vol. 8, pp. 430-438, 2010.
[12] N. C. Theis, R. W. Thomas and L. A. DaSilva, “Rendezvous for cognitive radios,” IEEE Transactions on Mobile Computing, Vol. 10, pp.216-227, 2011
[13] H. Liu, Z.Y. Lin, X.W. Chu and Y.-W. Leung, “Ring-walk Based Channel Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks”, in Proc. of 2nd IEEE International Workshop on Wireless Sensor, Actuator and Robot Networks (WiSARN2010-FALL), in conjunction with IEEE/ACM CPSCom, Dec, 2010.
[14] Zhiyong Lin, Hai Liu, Xiaowen Chu, and Yiu-Wing Leung, “Jump-Stay Based Channel-hopping Algorithm with Guaranteed Rendezvous for Cognitive Radio Networks,” IEEE INFOCOM 2011.
[15] ECMA International, “MAC and PHY for Operation in TV White Space,” Standard ECMA-392, 2012.
[16] Kaushik R. Chowdhury, Ian F. Akyildiz,, “Cognitive Wireless Mesh Networks with Dynamic Spectrum Access”, IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 26, NO. 1, JANUARY 2008.指導教授 陳彥文 審核日期 2013-8-29 推文 facebook plurk twitter funp google live udn HD myshare reddit netvibes friend youpush delicious baidu 網路書籤 Google bookmarks del.icio.us hemidemi myshare