博碩士論文 102522108 詳細資訊




以作者查詢圖書館館藏 以作者查詢臺灣博碩士 以作者查詢全國書目 勘誤回報 、線上人數:164 、訪客IP:18.224.33.135
姓名 王嗣詠(Szu-Yung Wang)  查詢紙本館藏   畢業系所 資訊工程學系
論文名稱 在感知網路中的一個防禦攻擊跳頻演算法
(An Anti-Jamming Channel Hopping Scheme in Cognitive Radio Networks)
相關論文
★ 基於OP-TEE的可信應用程式軟體生態系統★ SeFence: 基於安全感測的可信任周邊存取控制
★ 高解析度二維地理影像的三維建模:旋轉變換投影與傳統方法的比較研究★ 在低軌道衛星無線通訊中的CSI預測方法
★ 為多流量低軌道衛星系統提出的動態換手策略★ 基於Trustzone的智慧型設備語音隱私保護系統
★ 一種減輕LEO衛星網路干擾的方案★ TruzGPS:基於TrustZone的位置隱私權保護系統
★ 衛星地面整合網路之隨機接入前導訊號設計與偵測★ SatPolicy: 基於Trustzone的衛星政策執行系統
★ TruzMalloc: 基於TrustZone 的隱私資料保 護系統★ 衛星地面網路中基於物理層安全的CSI保護方法
★ 低軌道衛星地面整合網路之安全非正交多重存取傳輸★ 低軌道衛星地面網路中的DRX機制設計
★ 衛星地面整合網路之基於集合系統的前導訊號設計★ 基於省電的低軌衛星網路路由演算法
檔案 [Endnote RIS 格式]    [Bibtex 格式]    [相關文章]   [文章引用]   [完整記錄]   [館藏目錄]   [檢視]  [下載]
  1. 本電子論文使用權限為同意立即開放。
  2. 已達開放權限電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。
  3. 請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。

摘要(中) 在無線感測網路中,以跳頻為主的通訊方式被廣泛的用來解決頻譜短缺的問題。然而,由於頻譜高度的可用性加上沒有嚴格的管理,讓惡意攻擊變成一種主要的威脅。預先分享資訊是一種可以抵抗攻擊的方法。傳送端和接收端可以利用預先分享的資訊來幫助之後通訊的建立,藉以閃躲這些惡意的攻擊。但是這樣的防禦方法在無線感測網路中卻是不甚實際的,因為在無線感測網路中的節點的鄰居資訊會動態的改變。因此,發展可以抵抗攻擊而且不用預先分享資訊的跳頻演算法變得越來越重要。大部分現今的跳頻演算法,通常沒辦法在有限的時間相遇或者它們需要先預設節點扮演的角色(傳送端或接收端)。但是預設角色這種做法在無線感測網路中也是不太可行的,因為一個節點時常會同時進行資料的傳送和接收。在這篇論文中,我們提出了一個可以抵抗攻擊而且不用預先分享資訊的跳頻演算法,Tri-CH,同時我們的演算法也能在有限的時間內相遇,並且不需要先預設節點扮演的角色。
摘要(英) In cognitive radio networks (CRNs), channel hopping-based communications are widely used to solve the licensed spectrum shortage problem. However, jamming attacks is one of the major threats in CRNs because of the highly dynamic spectrum availability and the lack of ownership of the spectrum. Pre-sharing secrets (e.g., hopping sequences) is one of approaches to resist against jamming attacks. Senders and receivers exploit these secrets to establish communications. But in CRNs, pre-shared secrets is usually impractical because neighborhoods may dynamic change. Hence, antijamming channel hopping algorithm without pre-shared secrets become more and more important. Most of existing approaches, e.g., uncoordinated frequency hopping (UFH), either have unbounded rendezvous time or require role pre-assignment. Role pre-assignment is inapplicable since each SU may play sender or receiver simultaneously. In this paper, we propose an antijamming channel hopping algorithm without pre-shared secrets, Tri-CH, which has bounded rendezvous time and without role pre-assignment.
關鍵字(中) ★ 無線感測網路
★ 跳頻演算法
★ 防禦攻擊
關鍵字(英) ★ Cognitive Radio
★ Channel Hopping
★ Jamming Attack
論文目次 中文摘要 i
Abstract ii
Contents iii
List of Figures v
1 Introduction 1
2 Related Work 4
2.1 CH algorithms without anti-jamming 4
2.2 CH algorithms with anti-jamming 5
3 Preliminary 7
3.1 Metrics of Rendezvous schemes 7
3.2 Attack Model 7
3.3 System Model 8
4 The Proposed Anti-Jamming Channel Hopping Algorithm 10
4.1 Defense against Jamming Attacks 13
4.2 Communications of SUs in Tri-CH system 13
5 Performance Analysis 17
5.1 Rendezvous of Tri-CH sequences 17
6 Simulation 27
6.1 With anti-jamming strategy 28
6.2 Without anti-jamming strategy 28
7 Conclusion 31
Reference 32
參考文獻 [1] Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran, and Shantidev Mohanty. Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Comput. Netw., 50(13):2127–2159, September 2006.
[2] A. Ghasemi and E.S. Sousa. Spectrum sensing in cognitive radio networks: requirements, challenges and design trade-offs. Communications Magazine, IEEE, 46(4):
32–39, April 2008.
[3] Kaigui Bian and Jung-Min Park. Maximizing rendezvous diversity in rendezvous protocols for decentralized cognitive radio networks. Mobile Computing, IEEE Transactions on, 12(7):1294–1307, July 2013.
[4] I-Hsun Chuang, Hsiao-Yun Wu, and Yau-Hwang Kuo. A fast blind rendezvous method by alternate hop-and-wait channel hopping in cognitive radio networks. Mobile Computing, IEEE Transactions on, 13(10):2171–2184, Oct 2014.
[5] Zhiyong Lin, Hai Liu, Xiaowen Chu, and Yiu-Wing Leung. Enhanced jump-stay rendezvous algorithm for cognitive radio networks. Communications Letters, IEEE,
17(9):1742–1745, September 2013.
[6] Hai Liu, Zhiyong Lin, Xiaowen Chu, and Y.-W. Leung. Jump-stay rendezvous algorithm for cognitive radio networks. Parallel and Distributed Systems, IEEE Transactions on, 23(10):1867–1881, Oct 2012.
[7] IHsun Chuang, Hsiao-Yun Wu, Kuan-Rong Lee, and Yau-Hwang Kuo. Alternate hop-and-wait channel rendezvous method for cognitive radio networks. In INFOCOM, 2013 Proceedings IEEE, pages 746–754, April 2013.
[8] M. Strasser, S. Capkun, S. Capkun, and M. Cagalj. Jamming-resistant key establishment using uncoordinated frequency hopping. In Security and Privacy, 2008. SP 2008. IEEE Symposium on, pages 64–78, May 2008.
[9] Qian Wang, Ping Xu, Kui Ren, and Xiang-Yang Li. Delay-bounded adaptive ufhbased anti-jamming wireless communication. In INFOCOM, 2011 Proceedings IEEE, pages 1413–1421, April 2011.
[10] Eun-Kyu Lee, Soon Y. Oh, and Mario Gerla. Frequency quorum rendezvous for fast and resilient key establishment under jamming attack. SIGMOBILE Mob. Comput. Commun. Rev., 14(4):1–3, November 2010.
[11] Young-Hyun Oh and D.J. Thuente. Limitations of quorum-based rendezvous and key establishment schemes against sophisticated jamming attacks. In MILITARY COMMUNICATIONS CONFERENCE, 2012 - MILCOM 2012, pages 1–6, Oct 2012.
[12] Yongle Wu, Beibei Wang, K.J.R. Liu, and T.C. Clancy. Anti-jamming games in multi-channel cognitive radio networks. Selected Areas in Communications, IEEE Journal on, 30(1):4–15, January 2012.
指導教授 張貴雲(Guey-Yun Chang) 審核日期 2015-8-20
推文 facebook   plurk   twitter   funp   google   live   udn   HD   myshare   reddit   netvibes   friend   youpush   delicious   baidu   
網路書籤 Google bookmarks   del.icio.us   hemidemi   myshare   

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明