跳到主要內容

簡易檢索 / 詳目顯示

回結果列表
研究生： 郭恆
Heng Kuo
論文名稱： 在無線感測網路下的快速且可抵抗攻擊式跳頻演算法
A Fast Anti-Jamming Channel Hopping Algorithm for Cognitive Radio Networks
指導教授： 張貴雲
Guey-Yun Chang
口試委員:
學位類別： 碩士
Master
系所名稱： 資訊電機學院 - 資訊工程學系
Department of Computer Science & Information Engineering
論文出版年： 2016
畢業學年度： 104
語文別： 英文
論文頁數： 53
中文關鍵詞： 無線感測網路 、跳頻演算法 、防禦攻擊
外文關鍵詞： Cognitive radio, Channel hopping, Jamming attack
相關次數： 點閱：5  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 在無線感測網路中以跳頻為主的通訊方式被廣泛的用來解決頻譜短缺的問題。然而，因為次要用戶在無線感測網路中沒有自己的專屬頻譜，所以很容易受到惡意的攻擊。大部份可以抵抗攻擊的分法都需要傳送端和接收端預先分享的資訊(如自己跳頻序列)，並利用此資訊建立一條互相連通的通訊，藉以閃躲這些惡意的攻擊。但是因為無線感測網路中的節點的鄰居資訊會動態的改變，所以這種預先分享的資訊的防禦方法在無線感測網路中是不實際的。因此，發展可以抵抗攻擊而且不用預先分享資訊的跳頻演算法變得越來越重要雖然有一些不用預先分享的資訊的防禦方法被提了出來，但是這些方法要不無法保證兩個節點在有限的時間相遇，要不然就是需要先預設節點所扮演的角色(傳送端或接收端)。但是預設角色這種做法在無線感測網路中也是不太可行的，因為一個節點時常會同時進行資料的傳送和接收。在這篇論文中，我們提出了一個可以抵抗攻擊而且不用預先分享資訊的跳頻演算法，SP-CH，同時我們的演算法也能在有限的時間內相遇，並且不需要先預設節點扮演的角色。

    Cognitive radio network (CRN) is a promising technology to solve unlicensed spectrum shortage problem and enhance the utilization of licensed spectrum. Channel hopping scheme are widely used to develop communication links between users (SU) in CRNs. However, existing channel hopping for CRNs, which have fixed hopping patterns, are extremely vulnerable to malicious attacks in CRNs. Most of existing anti-jamming CH protocols need pre-shared informations (e.g. hopping sequences) to the communication link between the communication pairs. Due to the nature of opportunistic spectrum access, pre sharing informations is impractical in CRNs. Hence, anti-jamming channel hopping approaches without pre-shared secrets have gained more and more research interests. For anti-jamming CH protocols without pre-shared informations, they either have unbounded time to rendezvous or require role pre-assignment (i.e. every SU is pre-assigned as either a sender or a receiver). Role pre-assignment is inapplicable to scenarios that a SU may be a sender and receiver simultaneously. In this paper, we propose an anti-jamming channel hopping algorithm, SP CH, with bounded rendezvous time, but without pre-shared secrets.

    Contents 中文摘要 i Abstract ii 1 Introduction 1 2 Related Work 4 2.1 Channel hopping schemes for CRNs . . . . . . . . . . . . . . . . . . . . 4 2.2 Anti-jamming channel hopping approaches . . . . . . . . . . . . . . . . 6 3 Preliminary 7 3.1 Channel hopping scheme . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 Metrics of channel hopping scheme . . . . . . . . . . . . . . . . . . . . 8 3.3 Attack Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.4 Metrics of Jamming Resistance . . . . . . . . . . . . . . . . . . . . . . . 9 3.5 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 4 The Proposed Algorithm 11 4.1 Main Idea . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 4.1.1 Guaranteeing Effective Rendezvous in Time Synchronous Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.1.2 Guaranteeing Effective Rendezvous in Time Asynchronous Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.2 The Proposed Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 19 4.3 The Numeral System Used to Represent ID String . . . . . . . . . . . . . 21 4.4 P-columns in a P-matrix . . . . . . . . . . . . . . . . . . . . . . . . . . 22 5 Performance Analysis 27 5.1 Derivability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 5.2 Jammer Hit Ratio . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 5.3 Rendezvous of SP-CH sequences . . . . . . . . . . . . . . . . . . . . . . 30 6 Simulation 35 6.1 Performance under jamming attacks . . . . . . . . . . . . . . . . . . . . 36 6.1.1 Effect of number of jammers . . . . . . . . . . . . . . . . . . . . 36 6.1.2 Effect of number of channels . . . . . . . . . . . . . . . . . . . . 37 6.2 Performance when no jamming attack occurs . . . . . . . . . . . . . . . 38 7 Conclusion 40 Reference 41

    [1] ET FCC. Docket no 03-222 notice of proposed rule making and order, 2003.
    [2] IHsun Chuang, Hsiao-Yun Wu, Kuan-Rong Lee, and Yau-Hwang Kuo. Alternate hopand-
    wait channel rendezvous method for cognitive radio networks. In INFOCOM,
    2013 Proceedings IEEE, pages 746–754. IEEE, 2013.
    [3] Kaigui Bian et al. Maximizing rendezvous diversity in rendezvous protocols for
    decentralized cognitive radio networks. IEEE Transactions on Mobile Computing,
    12(7):1294–1307, 2013.
    [4] Zhiyong Lin, Hai Liu, Xiaowen Chu, and Yiu-Wing Leung. Jump-stay based channelhopping
    algorithm with guaranteed rendezvous for cognitive radio networks. In INFOCOM,
    2011 Proceedings IEEE, pages 2444–2452. IEEE, 2011.
    [5] Jen-Feng Huang, Guey-Yun Chang, and Jian-Xun Huang. Anti-jamming rendezvous
    scheme for cognitive radio networks.
    [6] Qian Wang, Ping Xu, Kui Ren, and Xiang-yang Li. Delay-bounded adaptive ufh-based
    anti-jamming wireless communication. In INFOCOM, 2011 Proceedings IEEE, pages
    1413–1421. IEEE, 2011.
    [7] Yongle Wu, Beibei Wang, KJ Ray Liu, and T Charles Clancy. Anti-jamming games
    in multi-channel cognitive radio networks. IEEE Journal on Selected Areas in Communications,
    30(1):4–15, 2012.
    [8] Salil P Vadhan et al. Pseudorandomness, volume 56. Now, 2012.

    QR CODE
    :::