請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/60720
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 周俊廷(Chun-Ting Chou) | |
dc.contributor.author | Chin-Fen Tung | en |
dc.contributor.author | 董錦芬 | zh_TW |
dc.date.accessioned | 2021-06-16T10:27:23Z | - |
dc.date.available | 2016-08-20 | |
dc.date.copyright | 2013-08-20 | |
dc.date.issued | 2013 | |
dc.date.submitted | 2013-08-15 | |
dc.identifier.citation | [1] 'Unlicensed Operation in the TV broadcast bands,' FCC ET Docket No. 04-186.
[2] Shih-Lin Wu, et al., 'A New Multi-Channel MAC Protocol with On-Demand Channel Assignment for Multi-Hop Mobile Ad Hoc Networks,' in Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, pp. 232 - 237, Dec. 2000 [3] Shih-Lin Wu, et al., 'A Multi-Channel MAC protocol with Power Control for Multi-Hop Mobile Ad Hoc Networks,' in Proceedings of the International Conference on Distributed Computing Systems Workshop, pp. 419 - 424, Apr. 2001 [4] Nitin Jain, et al., 'A Multichannel CSMA MAC Protocol with Receiver-Based Channel Selection for MultihopWireless Networks,' in Proceedings of the Tenth International Conference on Computer Communications and Networks, pp. 432 - 439, Oct. 2001 [5] Loukas Lazos, et al., 'Mitigating Control-Channel Jamming Attacks in Multi- Channel Ad Hoc Networks,' in Proceedings of the Second ACM Conference on Wireless Network Security, pp. 169 - 180, Mar. 2009 [6] Christian Doerr, et al., 'Dynamic Control Channel Assignment in Cognitive Radio Networks Using Swarm Intelligence,' in Proceedings of the IEEE Global Telecommunications Conference, pp. 1 - 6, Dec. 2008 [7] Jun Zhao, et al., 'Distributed Coordination in Dynamic Spectrum Allocation Networks,' in Proceedings of the First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, pp. 259 - 268, Nov. 2005 [8] Carlos Cordeiro and Kiran Challapali, 'C-MAC: A Cognitive MAC Protocol for Multi-Channel Wireless Networks,' in Proceedings of the IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, pp. 147 - 157, Apr. 2007 [9] Juncheng Jia, et al., 'HC-MAC: A Hardware-Constrained Cognitive MAC for E cient Spectrum Management,' IEEE Journal on Selected Areas in Commu- nications, vol. 26, no. 1, pp. 106 - 117, Jan. 2008 [10] Long Le and Ekram Hossain, 'OSA-MAC: A MAC Protocol for Opportunistic Spectrum Access in Cognitive Radio Networks,' in Proceedings of the IEEE Wireless Communications and Networking Conference, pp. 1426 - 1430, Mar. 2008 [11] Bechir Hamdaoui and Kang G. Shin, 'OS-MAC: An E cient MAC Protocol for Spectrum-Agile Wireless Networks,' IEEE Transactions on Mobile Computing, vol. 7, no. 8, pp. 915 - 930, Aug. 2008 [12] Luiz A. DaSilva and Igor Guerreiro, 'Sequence Based Rendezvous for Dynamic Spectrum Access,' in Proceedings of the IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks, pp. 1 - 7, Oct. 2008 [13] D. Yang, et al., 'Deterministic rendezvous scheme in multichannel access net- works,' Electronics Letter, vol. 46, no.20, pp. 1402 - 1404, Sep. 2010 [14] Kaigui Bian and Jung-Min Park , 'Asynchronous channel hopping for establish- ing rendezvous in cognitive radio networks,' in Proceedings of the IEEE INFO- COM, pp. 236 - 240, Apr. 2011 [15] Hoi-Sheung Wilson So, et al., 'McMAC: A Parallel Rendezvous Multi-Channel MAC Protocol,' in Proceedings of the IEEE Wireless Communications and Net- working Conference, pp. 334 - 339, Mar. 2007 [16] Stephen K. Park and Keith W. Miller, 'Random number generators: good ones are hard to nd,' ACM Communications, vol. 31, no. 10, pp. 1192 - 1201, Oct. 1988 [17] Claudia Cormio and Kaushik. R. Chowdhury, 'An Adaptive Multiple Ren- dezvous Control Channel for Cognitive Radio Wireless Ad Hoc Networks,' in Proceedings of the 2010 8th IEEE International Conference on Pervasive Com- puting and Communications Workshops, pp. 346 - 351, May. 2010 [18] Paramvir Bahl, et al., 'SSCH: Slotted Seeded Channel Hopping for Capacity Improvement in IEEE 802.11 Ad-Hoc Wireless Networks,' in Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, pp. 216 - 230, Sep. 2004 [19] Nick C. Theis, et al., ' Rendezvous for Cognitive Radios,' IEEE Transactions on Mobile Computing, vol. 10, no. 2, pp. 216 - 227, Feb. 2011 [20] Chao-Fong Shih, et al., 'DH-MAC: A Dynamic Channel Hopping MAC Pro- tocol for Cognitive Radio Networks,' in Proceedings of the IEEE International Conference on Communications, pp. 1 - 5, May. 2010 [21] Zhiyong Lin, et al., 'Jump-Stay Based Channel-hopping Algorithm with Guar- anteed Rendezvous for Cognitive Radio Networks,' in Proceedings of the IEEE INFOCOM, pp. 2444 - 2452, May. 2011 [22] Jongmin Shin, et al., 'A Channel Rendezvous Scheme for Cognitive Radio Net- works,' in Proceedings of the IEEE Communications Letters, pp. 954 - 956, Oct. 2010 [23] Hai Liu, et al., 'Ring-Walk Based Channel-Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks,' in Proceedings of the IEEE/ACM Int'l Conference on Green Computing and Communications (GreenCom), and Int'l Conference on Cyber, Physical and Social Computing, pp. 755 - 760, Dec. 2010 [24] Yifan Zhang, et al., 'ETCH: E cient Channel Hopping for Communication Ren- dezvous in Dynamic Spectrum Access Networks,' in Proceedings of the IEEE INFOCOM, pp. 2471 - 2479, Apr. 2011 [25] Wai-Shing Luk and Tien-Tsin Wong, 'Two New Quorum Based Algorithms for Distributed Mutual Exclusion,' in Proceedings of the 17th International Confer- ence on Distributed Computing Systems, pp. 100 - 106, May. 1997 [26] Jehn-Ruey Jiang, et al., 'Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802.11 Ad Hoc Networks,' in Proceedings of the 2003 International Conference on Parallel Processing, pp. 257 - 264, Oct. 2003 [27] Junhyung Kim, et al., 'A Repeated Group Sequence Rendezvous Scheme for Cognitive Radio Networks,' in Proceedings of the 2012 Spring Congress on En- gineering and Technology, pp. 1 - 4, May. 2012 [28] Kaigui Bian, et al., 'A Quorum-based Framework for Establishing Control Chan- nels in Dynamic Spectrum Access Networks,' in Proceedings of the 15th annual international conference on Mobile computing and networking , pp. 25 - 36, Sep. 2009 [29] Sylwia Romaszko, 'Making a blind date the guaranteed rendezvous in Cogni- tive Radio Ad Hoc Networks,' in Proceedings of the 18th European Wireless Conference, pp. 1 - 9, Apr. 2012 [30] Fen Hou, et al., 'Asynchronous Multichannel MAC Design With Di erence-Set- Based Hopping Sequences,' IEEE Transactions on Vehicular Technology , vol. 60, no. 4, pp. 1728 - 1739, May. 2011 [31] Majid Altamimi, et al., 'Parallel Link Rendezvous in Ad Hoc Cognitive Radio Networks,' in Proceedings of the IEEE Global Telecommunications Conference, pp. 1 - 6, Dec. 2010 [32] Chien-Wei Chu, 'Sequence-Based Neighbor Discovery in Dynamic Spectrum Ac- cess (DSA) Networks,' National Taiwan University, Master Thesis, Oct. 2010 [33] S. Tsutsui, et al., 'Node histogram vs. edge histogram: A comparison of pmbgas in permutation domains,' tech. rep., 2006. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/60720 | - |
dc.description.abstract | 隨著雲端運算和機器間通訊的日益發達,對於無線頻譜的需求也越來越大,很快地,無線頻譜將消耗殆盡。動態頻譜存取是一個極有希望能夠解決這樣大量頻譜需求的技術。動態頻譜存取的主要概念是讓次要使用者能夠投機地使用未在使用的付費頻帶。在動態頻譜存取網路中,付費使用者有絕對的權力使用其付費頻帶。次要使用者可能會因付費使用者無預警地佔領頻帶而被迫立刻停止傳輸。這對於被打斷傳輸的次要使用者來說,他們是沒有時間溝通要到哪一個通道繼續傳輸的。就算它們能夠跳到一樣的通道,但這個新通道也可能被付費使用者所佔領,這樣被打斷傳輸的次要使用者還是無法找到彼此。因此,一個可靠的方法讓次要使用者能夠快速發現彼此是很重要的。
在本論文中,我們使用以序列為基礎的協定來實現在動態頻譜存取網路中使次要使用者能夠發現鄰近裝置。我們提供了兩個以序列為基礎採用自適應序列設計的方法,且不需要事先的同步及溝通就能夠解決在動態頻譜存取網路中尋找鄰近裝置的問題。我們提出的兩個方法,在至少存在一個一對傳輸對的兩個裝置都認為是可以使用的通道的前提下,保證一對傳輸對一定可以找到對方。因為我們的方法是用自適應的序列設計,所以次要使用者可以多跳到沒有付費使用者的通道更多次,這樣的話我們就可以得到較高的通道使用率及較低的平均遇到時間。不管是分析或是模擬結果都顯示我們的方法比現有的多種方法能夠達到較佳的表現。 | zh_TW |
dc.description.abstract | With rapid growth in cloud computing and machine-to-machine communications, demands for wireless transmission increases exponentially and soon will exhaust the wireless spectrum. Dynamic spectrum access (DSA) is one of the promising technologies to address such fast-growing demands. The main idea of DSA is to enable radio devices to search for underutilized spectral bands and utilize them on an opportunistic basis. In a DSA network, channel access is subject to the usage of licensed users. DSA devices could be forced to vacate a channel without any notice in advance.
Therefore, determination of a new channel via negotiation may not be possible. Even if the devices switch to the same channel, they may be unable to access that channel if it happens to be occupied by licensed users. The devices may then lose contact with each other and their communication could be interrupted inde finitely. Therefore, how to ensure DSA devices to (re)discover each other in a timely and reliable manner is the most challenging task for providing seamless communication in a DSA network. In this thesis, sequence-based protocols are considered to realize neighbor discovery in DSA networks. We provide two sequence-based schemes that adopt the adaptive sequence design and require no sequence-level synchronization or prior negotiation. The proposed two schemes guarantee that a transmission pair can find each other as long as they have at least one commonly available channel. Thanks to our adaptive sequence design, unlicensed users access available channels more frequently and thus a higher utilization and a lower average rendezvous time could be achieved. Both analytical and simulation results show that the proposed two schemes outperform many existing sequence-based schemes. | en |
dc.description.provenance | Made available in DSpace on 2021-06-16T10:27:23Z (GMT). No. of bitstreams: 1 ntu-102-R00942042-1.pdf: 2353949 bytes, checksum: a199dc4981b1e5ff504914c27335c654 (MD5) Previous issue date: 2013 | en |
dc.description.tableofcontents | ABSTRACT . . . . . . . . . . . . . . . . . . . . . . . . . ii
LIST OF TABLES . . . . . . . . . . . . . . . . . . . . . . v LIST OF FIGURES . . . . . . . . . . . . . . . . . . . . . vi CHAPTER 1 INTRODUCTION . . . . . . . . . . . . . . . . . . 1 1.1 An introduction to dynamic spectrum access networks . .1 1.2 The main problem and objectives . . . . . . . . . . . .2 CHAPTER 2 RELATED WORK . . . . . . . . . . . . . . . . . 10 2.1 Random-based hopping sequences . . . . . . . . . . . .11 2.2 Modulo-based hopping sequences . . . . . . . . . . . .14 2.3 Quorum-based hopping sequences . . . . . . . . . . . .19 2.4 Summary . . . . . . . . . . . . . . . . . . . . . . . 24 CHAPTER 3 THE PROPOSED SEQUENCE DESIGNS . . . . . . 28 3.1 The Proposed Scheme I-A modified scheme using adaptive sequences 29 3.1.1 The original sequence design . . . . . . . . . . . .29 3.1.2 The modified sequence design . . . . . . . . . . . .31 3.2 The Proposed Scheme II-An adaptive sequence design . .35 CHAPTER 4 NUMERICAL ANALYSIS AND PERFORMANCE COMPARISON 46 4.1 System utilization . . . . . . . . . . . . . . . . . 46 4.2 Average rendezvous time . . . . . . . . . . . . . . . 54 4.3 Maximum time to rendezvous . . . . . . . . . . . . . .58 4.4 Summary . . . . . . . . . . . . . . . . . . . . . . . 61 CHAPTER 5 CONCLUSIONS . . . . . . . . . . . . . . . . . . 63 | |
dc.language.iso | en | |
dc.title | 在分散式動態頻譜存取網路中以自適應跳頻序列尋找鄰近裝置 | zh_TW |
dc.title | Neighbor Discovery in Distributed Dynamic Spectrum Access
(DSA) Networks Using Adaptive Sequences | en |
dc.type | Thesis | |
dc.date.schoolyear | 101-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 廖婉君(Wan-Jiun Liao),魏宏宇(Hung-Yu Wei),馮輝文(Huei-Wen Ferng) | |
dc.subject.keyword | 動態頻譜存取,感知無線電,裝置偵測,盲遇,媒體接取層通訊協定,多頻道媒體接取層通訊協定, | zh_TW |
dc.subject.keyword | dynamic spectrum access,DSA,cognitive radio,neighbor discovery,blind rendezvous,MAC protocol,multi-channel MAC, | en |
dc.relation.page | 68 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2013-08-15 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 電信工程學研究所 | zh_TW |
顯示於系所單位: | 電信工程學研究所 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-102-1.pdf 目前未授權公開取用 | 2.3 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。