請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/46713
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 陳光禎(Kwang-Cheng Chen) | |
dc.contributor.author | Shih-Chun Lin | en |
dc.contributor.author | 林士鈞 | zh_TW |
dc.date.accessioned | 2021-06-15T05:24:58Z | - |
dc.date.available | 2010-07-20 | |
dc.date.copyright | 2010-07-20 | |
dc.date.issued | 2010 | |
dc.date.submitted | 2010-07-16 | |
dc.identifier.citation | [1] NTIA, 'U.S. frequency allocations,' U.S. Department of Commerce, 2003, on-line available: http://www.ntia.doc.gov/osmhome/allochrt.pdf.
[2] K. C. Chen, Y. J. Peng, N. R. Prasad, Y. C. Liang, and S. Sun, 'Cognitive radio network architecture: Part I-general structure,' in ACM ICUIMC, Jan. 2008, pp. 114-119. [3] FCC, 'Spectrum policy task force report,' ET Cocket 02-155, Nov. 2002. [4] I. F. Akyildiz, W. Y. Lee, M. C. Vuran, and S. Mohanty, 'NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey,' Computer Networks, vol. 50, no. 13, pp. 2127-2159, Sept. 2006. [5] Q. Zhao and B. M. Sadler, 'A survey of dynamic spectrum access,' IEEE Signal Process. Mag., vol. 24, no. 3, pp. 79-89, May 2007. [6] Q. Zhao, L. Tong, and A. Swami, 'Decentralized cognitive mac for dynamic spectrum access,' in First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN), Nov. 2005, pp. 224-232. [7] Z. Ji and K. J. R. Liu, 'Cognitive radios for dynamic spectrum access-dynamic spectrum sharing: A game theoretical overview,' IEEE Commun. Mag., vol. 45, no. 5, pp. 88-94, May 2007. [8] DARPA XG WG, 'The xg vision,' The XG Vision RFC V1.0, 2002. [9] S. Haykin, 'Cognitive radio: Brain-empowered wireless communications,' IEEE J. Sel. Areas Commun., vol. 23, no. 2, pp. 201-220, Feb. 2005. [10] J. Mitola and G. M. Jr., 'Cognitive radio: Making software radios more personal,' IEEE Personal Commun. Mag., vol. 6, no. 6, pp. 13-18, Aug. 1999. [11] A. Boukerche, 'Performance evaluation of routing protocols for ad hoc wireless networks,' Mob. Netw. Appl., vol. 9, no. 4, pp. 333-342, Aug. 2004. [12] S. Keshav, An Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network. Addison-Wesley, 1997, chapter 11. [13] C. E. Perkins and E. M. Royer, 'Ad-hoc on-demand distance vector routing,' in IEEE Workshop on Moblie Computing Systems and Applications, 1999, pp. 90-100. [14] D. B. Johnson and D. A. Maltz, 'Dynamic source routing in ad hoc wireless networks,' in Mobile Computing. Kluwer Academic Publishers, 1996, pp. 153-181. [15] S. Geirhofer, L. Tong, and B. M. Sadler, 'Dynamic spectrum access in the time domain: Modeling and exploiting white space,' IEEE Commun. Mag., vol. 45, no. 5, pp. 66-72, May 2007. [16] K. C. Chen, B. K. Centin, Y. C. Peng, N. Prasad, J. Wang, and S. Lee, 'Routing for cognitive radio networks consisting of opportunistic links,' Wireless Communications and Mobile Computing, vol. 10, no. 4, pp. 451-466, 2009. [17] C. Xie, B. Xie, and C. C. Shen, 'A novel layered graph model for topology formation and routing in dynamic spectrum access networks,' in First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks (DySPAN), Nov. 2005. [18] D. S. D. Couto, D. Aguayo, J. Bicket, and R. Morris, 'A high-throughput path metric for multi-hop wireless routing,' in MobiCom '03: Proceedings of the 9th annual international conference on Mobile computing and networking, Sept. 2003, pp. 134-146. [19] S. Biswas and R. Morris, 'Opportunistic routing in multi-hop wireless networks,' ACM SIGCOMM Comput. Commun. Rev., vol. 34, no. 1, pp. 69-74, Jan. 2004. [20] S. Chachulski, M. Jennings, S. Katti, and D. Katabi, 'Trading structure for randomness in wireless opportunistic routing,' in SIGCOMM '07: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications, Aug. 2007, pp. 169-180. [21] R. Zheng and C. Li, 'How good is opportunistic routing?: a reality check under rayleigh fading channels,' in MSWiM '08: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems, Oct. 2008, pp. 260-267. [22] J. Wilson and N. Patwari, 'Radio tomographic imaging with wireless networks,' IEEE Trans. Mobile Comput., vol. 9, no. 5, pp. 621-632, May 2010. [23] D. Bertsekas and R. Gallager, Data Networks. Prentice-Hall, NJ, 1987. [24] C. Perkins and P. Bhagwat, 'Highly dynamic destination-sequenced distance-vector routing (dsdv) for mobile computers,' in ACM SIGCOMM, 1994, pp. 234-244. [25] A. Nasipuri and S. R. Das, 'On-demand multipath routing for mobile ad hoc networks,' in Eight International Conference on Computer Communications and Networks, Aug. 1999, pp. 64-70. [26] J. Raju and J. J. Garcia-Luna-Aceves, 'A new approach to on-demand loop-free multipath routing,' in Eight International Conference on Computer Communications and Networks, Aug. 1999, pp. 522-527. [27] S. J. Lee and M. Gerla, 'Aodv-br: Backup routing in ad hoc networks,' in IEEE Wireless Communications and Networking Conference (WCNC), vol. 3, Aug. 2000, pp. 1311-1316. [28] L. Wang, L. Zhang, Y. Shu, and M. Dong, 'Multipath source routing in wireless ad hoc networks,' in Canadian Conference on Electrical and Computer Engineering, vol. 1, Aug. 2000, pp. 479-483. [29] S. J. Lee and M. Gerla, 'Split multipath routing with maximally disjoint paths in ad hoc networks,' in IEEE International Conference on Communications (ICC), vol. 10, Aug. 2001, pp. 3201-3205. [30] A. Goldsmith, S. A. Jafar, I. Mari'c, and S. Srinivasa, 'Breaking spectrum gridlock with cognitive radios: an information theoretic perspective,' Proc. IEEE, vol. 97, no. 5, pp. 894-914, May 2009. [31] ITU-T, 'Architecture framework for the development of signalling and OA&M protocols using OSI concepts,' ITU-T Recommendation Q. 1400, Mar. 1993. [32] J. F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach. Addison-Wesley, 2008. [33] S. Y. Tu and K. C. Chen, 'General spectrum sensing in cognitive radio networks,' sumbitted to IEEE Trans. Inf. Theory, July 2009, online available: http://arxiv.org/abs/0907.2859. [34] C. K. Yu, K. C. Chen, and S. M. Cheng, 'Radio resource tomography of cognitive radio networks,' IEEE Trans. Veh. Technol., vol. 59, no. 4, pp. 1980-1997, May 2010. [35] J. G. Proakis, Digital Communications. 4th ed. New York: McGraw-Hill, 2001. [36] M. Xie and M. Haenggi, 'Towards an end-to-end delay analysis of wireless multihop networks,' Ad Hoc Networks, vol. 7, no. 5, pp. 849-861, 2009. [37] D. Wu and R. Negi, 'Effective capacity: a wireless link model for support of quality of service,' IEEE Trans. Wireless Commun., vol. 12, no. 4, pp. 630-643, July 2003. [38] C. S. Chang, 'Stability, queue length, and delay of deterministic and stochastic queueing networks,' IEEE Trans. Autom. Control, vol. 39, no. 5, pp. 913-931, May 1994. [39] C. Courcoubetis and R. Weber, 'Effective bandwidth for stationary sources,' Probability in Engineering and Information Sciences, vol. 9, no. 2, pp. 285-294, 1995. [40] F. Khan, LTE for 4G Mobile Broadband: Air Interface Technologies and Performance. Cambrige University Press, 2009. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/46713 | - |
dc.description.abstract | 感知無線電成為一項增進頻譜使用效率的重要技術,創造出臨機傳輸於通訊鏈結上。為了傳送封包於多無線電系統組成的一般感知無線電網路,支援路由於眾多臨機鏈結上是必要的。然而,在現今文獻中缺乏對於此高度動態可使用鏈結的完整了解,且沒有一個可靠的端對端傳輸機制於感知無線電網路。為了滿足此需求,在這篇論文中,我們提出適合於衰弱通道下的感知無線電網路之頻譜認知臨機路由。擁有著由區域性量測資訊所建立出的頻譜地圖和針對臨機鏈結所推導出的路由參數,即臨機鏈結參數、臨機路徑參數和感知無線電點參數,前瞻的頻譜認知臨機路由採用合作式機制啟動多路徑傳輸,且對於實際的應用能維持雙階服務品質保證吞吐量(即臨機服務品質保證和統計服務品質保證)。效能評估的結果驗證了頻譜認知臨機路由,不僅在感知無線電網路中,具有較低的延遲時間和較多的服務品質保證下之吞吐量,在一般的無線網路中也是如此。 | zh_TW |
dc.description.abstract | Cognitive radio (CR) emerges as a key technology to enhance spectrum efficiency and thus creates opportunistic transmissions over communication links. Supporting the routing function on top of numerous opportunistic links is a must to route packets in a general cognitive radio network (CRN) consisting of multi-radio systems. However, there lacks complete understanding of these highly dynamic available links and a reliable end-to-end transportation mechanism over CRN. Aspiring to meet this need, in this thesis, we propose novel spectrum aware opportunistic routing (SAOR) algorithm suited for the CRN under wireless fading channels. With innovative establishment of the spectrum map from local sensing information and the derivation of the routing metric for opportunistic links known as opportunistic link transmission (OLT), the opportunistic path metrics, and the CR node metrics, the promising SAOR employs a cooperative scheme to enable multi-path transmissions and maintains the dual-scale QoS guaranteed throughput (i.e. opportunistic QoS guaranteed throughput and statistical QoS guaranteed throughput) for practical applications. Results in performance evaluation confirm that SAOR enjoys less delay with guaranteed throughput, not only in CRN, but also in general wireless network. | en |
dc.description.provenance | Made available in DSpace on 2021-06-15T05:24:58Z (GMT). No. of bitstreams: 1 ntu-99-R97942056-1.pdf: 1878532 bytes, checksum: 466faead890399e736281deb1de1bf46 (MD5) Previous issue date: 2010 | en |
dc.description.tableofcontents | 口試委員會審定書 ........................................................................................................... #
誌謝 ...................................................................................................................................i 中文摘要 ......................................................................................................................... iii ABSTRACT ...................................................................................................................... v CONTENTS ................................................................................................................... vii LIST OF FIGURES..........................................................................................................xi LIST OF TABLES...........................................................................................................xv Chapter 1 Introduction.............................................................................................. 1 1.1 Cognitive Radio Networks ............................................................................. 1 1.2 Routing Challenges for Cognitive Radio Networks ....................................... 4 1.3 Overview of Spectrum Aware Opportunistic Routing .................................... 5 1.4 Organization ................................................................................................... 7 Chapter 2 Preliminaries ............................................................................................ 8 2.1 Shortest Path Routing and Ad-hoc On-demand Distance Vector (AODV) .... 9 2.2 Opportunistic Routing .................................................................................. 12 2.2.1 Motivation for Opportunistic Routing ................................................ 12 2.2.2 Opportunistic Routing Concept........................................................... 13 2.2.3 System Throughput Gain of Opportunistic Routing ........................... 14 2.2.4 Practical Opprotunistic Routings ........................................................ 16 2.3 Flooding ........................................................................................................ 19 Chapter 3 System Model ......................................................................................... 20 3.1 Cognitive Radio Network Paradigm ............................................................. 20 3.1.1 Cognitive Radio Network Underlay Paradigm................................... 22 3.1.2 Cognitive Radio Network Protocol Stacks.......................................... 22 3.2 Network Topology ........................................................................................ 24 3.3 Link Model ................................................................................................... 24 3.3.1 Spectrum Availability.......................................................................... 27 3.3.2 Wireless Channel Fading..................................................................... 30 3.3.3 Scheduling ........................................................................................... 32 3.4 Traffic Model ................................................................................................ 33 3.4.1 Deterministic Packet Size for Slotted Perspective .............................. 34 3.4.2 Variable Packet Size for Slotted Perspective ...................................... 34 3.4.3 Unslotted Perspective.......................................................................... 34 Chapter 4 Spectrum Aware Opportunistic Routing (SAOR)............................... 38 4.1 Routing Mechanism...................................................................................... 38 4.2 Opportunistic Link Transmission (OLT) Metric........................................... 39 4.2.1 OLT Metric.......................................................................................... 40 4.2.2 Opportunistic Path Metric ................................................................... 42 4.2.3 Node Metric ........................................................................................ 45 4.3 SAOR............................................................................................................ 46 Chapter 5 Dual-scale QoS Guarantee .................................................................... 49 5.1 Opportunistic QoS Guarantee....................................................................... 50 5.2 Statistical QoS Guarantee ............................................................................. 50 5.2.1 Effective Capacity............................................................................... 51 5.3 Three-node Relay Network........................................................................... 52 5.3.1 Opportunistic QoS Guaranteed Performance...................................... 52 5.3.2 Statistical QoS Guaranteed Performance ............................................ 53 Chapter 6 Performance Evaluation........................................................................ 54 6.1 Routing Performance in CRN with Opportunistic Links ............................. 55 6.2 QoS Guaranteed Performance in CRN with Opportunistic Links................ 58 6.2.1 Opportunistic QoS Guaranteed Performance...................................... 59 6.2.2 Statistical QoS Guaranteed Performance ............................................ 60 6.3 Routing Performance in Wireless Networks................................................. 63 6.4 QoS Guaranteed Performance in Wireless Networks................................... 65 6.4.1 Opportunistic QoS Guaranteed Performance...................................... 66 6.4.2 Statistical QoS Guaranteed Performance ............................................ 67 Chapter 7 Conclusion and Future Works .............................................................. 70 7.1 Conclusion .................................................................................................... 70 7.2 Future Works................................................................................................. 72 Bibliography................................................................................................................... 75 | |
dc.language.iso | en | |
dc.title | 頻譜認知臨機路由於感知無線電網路 | zh_TW |
dc.title | Spectrum Aware Opportunistic Routing in Cognitive Radio Networks | en |
dc.type | Thesis | |
dc.date.schoolyear | 98-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 郭斯彥,楊谷章,林嘉慶,陳曉華 | |
dc.subject.keyword | 頻譜認知,動態頻譜接取,感知無線電網路,合作式中繼站,臨機路由,臨機服務品質保證,統計服務品質保證, | zh_TW |
dc.subject.keyword | Spectrum Aware,Dynamic Spectrum Access,Cognitive Radio Network,Cooperative Relay,Opportunistic Routing,Opportunistic QoS Guarantee,Statistical QoS Guarantee, | en |
dc.relation.page | 80 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2010-07-19 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-99-1.pdf 目前未授權公開取用 | 1.83 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。