English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 80990/80990 (100%)
造訪人次 : 41634738      線上人數 : 2212
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/61571


    題名: 可抵抗阻斷式攻擊的非合作式對稱跳頻演算法;A Jamming-Resilient Asynchronous Symmetric Uncoordinated Frequency Hopping Scheme
    作者: 洪國勛;Hung,Guo-Xin
    貢獻者: 資訊工程學系
    關鍵詞: 無線跳頻技術;干擾攻擊;媒體存取控制層;quorum systems;frequency hopping;jamming attacks;MAC;quorum systems
    日期: 2013-08-19
    上傳時間: 2013-10-08 15:22:37 (UTC+8)
    出版者: 國立中央大學
    摘要: 在無線網路中,干擾攻擊在近期被探討為一種會中斷RF間通訊的安全威脅,過去展頻技術 (例如. 跳頻展頻 (FHSS)以及直接序列展頻(DHSS)),常被廣泛的用來對抗干擾者無線通訊。這些對抗干擾者的技術必須依賴在通訊之前,事先在干擾者不知情的情況下共享密鑰。然而,這引發出在有干擾攻擊前安全交換初始密鑰的困難議題。
      為了解決這個問題,有幾種方式是在有干擾者的狀況下,依據不合作式跳頻(Uncoordinated Frequency Hopping)方法來建立鑰匙。在不合作式跳頻方法中,兩個節點可以在有干擾者的情況下,不需事先交換共享密鑰 (pre-shared key) 或展頻碼 (spread code) 即可彼此通訊。然而,現存的不合作式跳頻方法不是抵禦干擾者的能力較低,就是無法保證在對稱式或是在時間不同步的環境底下能夠相遇。
    本篇論文,我們提出兩個新穎可抵抗干擾者攻擊的非合作式對稱跳頻方法, JRAS-1 以及 JRAS-2,相較於過去所提出的方法,我們的方法在有干擾者攻擊下,在平均相遇時間以及封包傳送成功率皆有較好的性能。
    In wireless networks, jamming attacks have been recently studied as wireless security threats disrupting reliable RF communication. Traditionally, spread spectrum techniques (e.g., Frequency Hopping Spread Spectrum (FHSS) and Direct Sequence Spread Spectrum (DSSS)) have been widely used for anti-jamming wireless communications. These anti-jamming techniques are inevitable reliance on the pre-shared secret key which is unknown to the jammer between the communicating node pairs prior to the communication. However, it raises the non-trivial issue of secure exchange of initial key before the jamming attack.
    To address this problem, several schemes relying on Uncoordinated Frequency Hopping (UFH) schemes have been studied to achieve resilient key establishment in presence of a jammer. In UFH, two nodes can communicate with each other in the presence of the jammers without sharing any pre-shared key or spread code. However, existing UFH schemes either suffer from low resilience ability or unguaranteed rendezvous in symmetric environments and time asynchronous environments.
    In this paper, we introduce two novel Jamming-Resilient Asynchronous-Symmetric UFH schemes, JRAS-1 and JRAS-2. Compared with existing FQR schemes, our schemes can outperform in terms of the two metrics: average time to rendezvous and packet delivery ratio under the jamming attacks
    顯示於類別:[資訊工程研究所] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML680檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明