跳到主要內容

臺灣博碩士論文加值系統

(44.200.86.95) 您好!臺灣時間:2024/05/20 07:17
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:凌韻婷
研究生(外文):Ling, Yun-Ting
論文名稱:在無線感知網路下動態調整使用頻道數協定
論文名稱(外文):Dynamically Adjusting the Number of Hopping Channels Protocol for Cognitive Radio Networks
指導教授:趙志民趙志民引用關係
指導教授(外文):Chao, Chih-Min
口試委員:張志勇石貴平許智舜趙志民
口試委員(外文):Chang, Chih-YungShih, Kuei-PingHsu, Chih-ShunChao, Chih-Min
口試日期:2015-07-22
學位類別:碩士
校院名稱:國立臺灣海洋大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2015
畢業學年度:103
語文別:中文
論文頁數:32
中文關鍵詞:無線感知網路跳頻吞吐量
外文關鍵詞:Cognitive radio networksChannel hoppingThroughput
相關次數:
  • 被引用被引用:0
  • 點閱點閱:145
  • 評分評分:
  • 下載下載:1
  • 收藏至我的研究室書目清單書目收藏:0
在無線感知網路中,兩個次要節點能通訊的前提是彼此碰面(同時切換到相同頻道)。現存提供碰面的跳頻協定中,次要節點大多是使用所有可用頻道跳頻。因碰面間隔時間通常與使用頻道數成正比,因此,讓次要節點使用所有可用頻道跳頻,會有較長的碰面間隔時間。實際上,當節點數較少時,可使用較少的頻道以降低碰面間隔時間。在本文中,我們將嘗試解決跳頻協定中「給定次要節點個數,到底該使用幾個頻道」這個根本問題。此外,我們提出了一個在無線感知網路下動態調整節點使用頻道數協定(DANC)。執行DANC的每個節點根據鄰居數與頻道可用機率調整自己使用的頻道數,以最大化其single-hop throughput。DANC運作於現存跳頻協定之上,可增加原跳頻協定效能。模擬結果顯示DANC確實能有效降低碰面間隔時間並提升了網路throughput。
In a cognitive radio network (CRN), two secondary users (SUs) must have a rendezvous (tuning to the same channel at the same time) before they can communicate with each other. Most of existing channel hopping protocols requiring an SU to switch among all available channels. Because the time to rendezvous (TTR) is proportional to the number of channels being used generally, these channel hopping protocols usually produces long TTR. In fact, as few nodes in the network, they can communicate with lesser channels to reduce TTR. In this paper, we try to solve the fundamental problem “How many channels should be used given the number of SUs in a CRN”. In addition, we propose a protocol (DANC) that can dynamically adjust the number of channels being used for each SU in a CRN. An SU running DANC adjusts the number of channels based its number of neighbors and availability of channels to maximize its single-hop throughput. DANC can operate on top of existing channel hopping protocols and enhance them. Simulation results verify the improvement of DANC when applied to existing channel hopping protocols, Jump-Stay and E-AHW.
目次
摘要 I
Abstract II
目次 III
圖目次 IV
表目次 V
第1章 簡介 1
第2章 相關文獻 4
第3章 系統模式與問題定義 7
3.1網路環境和假設 7
3.2問題定義 8
第4章 提出的解決方案 8
4.1 Single-hop throughput定義 9
4.2 Single-hop最佳頻道數演算法 11
4.2.1預估頻道數演算法 13
4.2.2調整頻道數演算法 14
4.3動態調整使用頻道數協定的運作 15
4.4 DANC的性質 18
第5章 模擬 20
第6章 結論 30
參考文獻 31

[1] Federal Communications Commission Spectrum Policy Task Force. Report of the Spectrum Efficiency Working Group. ET Docket no. 02-155, Nov. 02, 2002.
[2] I. Akyildiz, W. Lee, M. Vuran, and S. Mohanty. NeXt Generation/Dynamic Spectrum Access/Cognitive Radio Wireless Networks: A Survey. Computer Networks, 50(13):2127–2159, 2006.
[3] Q. Zhao and A. Swami. A Survey of Dynamic Spectrum Access: Signal Processing and Networking Perspectives. IEEE International Conference on Acoustics, Speech and Signal Processing, 2007.
[4] Y.-C. Liang, K.-C. Chen, G. Y. Li and P. Mähönen. Cognitive Radio Networking and Communications: An Overview. IEEE Transactions on vehicular technology. vol. 60, no. 7, Sep. 2011.
[5] A. Goldsmith, S. A. Jafar, I. Maric and S. Srinivasa. Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective. Proceedings of the IEEE, vol. 97, no. 5, May. 2009.
[6] P. Bahl, R. Chandra, and J. Dunagan. SSCH: Slotted Seeded Channel Hopping for Capacity Improvement in IEEE 802.11 Ad-Hoc Wireless Networks. Proc. ACM MobiCom, 2004.
[7] H. Liu, Z. Lin, X. Chu, and Y.-W. Leung. Ring-Walk Based Channel-Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks. IEEE/ACM International Conference on Green Computing and Communications, 2010 &;IEEE/ACM International Conference on Cyber, Physical and Social Computing, 2010.
[8] H. Liu, Z. Lin, X. Chu and Y.-W. Leung. Jump-Stay Rendezvous Algorithm for Cognitive Radio Networks. IEEE Transactions on parallel and distributed systems, vol. 23, no. 10, Oct. 2012.
[9] C.M. Chao and H.Y. Fu. Providing Complete Rendezvous Guarantee for Cognitive Radio Networks by Quorum Systems and Latin Squares. Proc. IEEE WCNC, 2013.
[10] Z. Gu, Q.-S. Hua, Y. Wang and F. C.M. Lau. Nearly Optimal Asynchronous Blind Rendezvous Algorithm for Cognitive Radio Networks. IEEE International Conference on Sensing, Communications and Networking, 2013.
[11] K. Bian and J.-M. Park. Maximizing Rendezvous Diversity in Rendezvous Protocols for Decentralized Cognitive Radio Networks. IEEE Transactions on Mobile Computing, 2013.
[12] K. Wu, F. Han, F. Han and D. Kong. Rendezvous Sequence Construction in Cognitive Radio Ad-Hoc Networks based on Difference Sets. IEEE 24th International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC), 2013.
[13] I.-H. Chuang, H.-Y. Wu, Y.-H. Kuo. A Fast Blind Rendezvous Method by Alternate Hop-and-Wait Channel Hopping in Cognitive Radio Networks. IEEE Transactions on Mobile Computing, Oct. 2014.
[14] T.-Y. Wu, W. Liao and C.-S. Chang. CACH: Cycle-Adjustable Channel Hopping for Control Channel Establishment in Cognitive Radio Networks. Proc. IEEE INFOCOM, 2014.
[15] G.-Y. Chang, W.-H. Teng, H.-Y. Chen, and J.-P. Sheu. Novel Channel-Hopping Schemes for Cognitive Radio Networks. IEEE Transactions on Mobile Computing, 2014.
[16] G.-Y. Chang, J.-F. Huang, and Y.-S. Wang. Matrix-based Channel Hopping Algorithms for Cognitive Radio Networks. IEEE Transactions on Wireless Communications, 2015.
[17] J. Jia, Q. Zhang and X. Shen. HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management. IEEE Journal on selected areas in communications, vol. 26, no.1, Jan. 2008.
[18] G. Bianchi. Performance Analysis of the IEEE 802.11 Distributed Coordination Function. IEEE Journal on selected areas in communications, vol. 18, no.3, Mar. 2000.
[19] C.-S. Hsu, J.-P. Sheu and Y.-C. Tseng. Minimize waiting time and conserve energy by scheduling transmissions in IEEE 802.11-based ad hoc networks. International Conference on Telecommunications, 2003.
[20] Y.C. TAY and K.C. CHUA. A Capacity Analysis for the IEEE 802.11 MAC Protocol. Wireless Networks, 2001.
[21] X. Liu and J. Xie. A Practical Self-Adaptive Rendezvous Protocol in Cognitive Radio Ad Hoc Networks. Proc. IEEE INFOCOM, 2014.

連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
1. 王千維,「德國民法債編修正有關消滅時效制度之變動」,月旦法學教室,第8期,台北,2003年。
2. 尤重道,「消滅時效制度在不動產權利上之適用」,法律評論,第68卷,第7期,台北,2002年。
3. 尹章華,「論消滅時效與除斥期間」,軍法專刊,第37卷,第12期,台北,1991年。
4. 江朝國,「保險契約中延長消滅時效期間約款之效力」,月旦法學教室〈2〉─私法學篇,台北,2001年。
5. 朱柏松,「論侵權行為損害賠償請求權之消滅時效 (下)」,法學叢刊,第44卷,第1期,台北,1999年。
6. 朱柏松,「論侵權行為損害賠償請求權之消滅時效 (上)」,法學叢刊,第43卷,第4期,台北,1998年。
7. 吳明軒,「試論與起訴中斷時效有同一效力之事項」,法令月刊,第43卷,第2期,台北,1992年。
8. 吳明軒,「試論中斷消滅時效之起訴」,法令月刊,第41卷,第4期,台北,1990年。
9. 吳明軒,「試論因起訴而中斷消滅時效之效力」,法令月刊,第40卷,第3期,台北,1988年。
10. 吳明軒,「試論消滅時效之特別期間」,法律評論,第53卷,第10期,1987年。
11. 吳光陸,「民法第一四四條第二項以契約承認債務之研究」,法令月刊,第2卷,第8期,1984年。
12. 吳光陸,「消滅時效與債務人異議之訴」,月旦法學,第75期,台北,2001年。
13. 林誠二,「消滅時效之期間」,月旦法學教室,第1期,台北,2002年。
14. 林錫璋,「催告與消滅時效之中斷」,法學叢刊,第14卷,第3期,台北,1969年。
15. 陳瑞和,「消滅時效與除斥期間」,空大學訊,第196期,台北,1997年。