在無線感測網路下的雙天線可抵抗攻擊式跳頻演算法;A Dual-Radio Anti-Jamming Scheme for Cognitive Radio Networks

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > Electronic Thesis & Dissertation > Item 987654321/81190

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/81190

Title:	在無線感測網路下的雙天線可抵抗攻擊式跳頻演算法;A Dual-Radio Anti-Jamming Scheme for Cognitive Radio Networks
Authors:	陳泓維;Chen, Hung-Wei
Contributors:	資訊工程學系
Keywords:	無線感測網路;跳頻演算法;防禦攻擊;Cognitive radio;Channel hopping;Jamming attack
Date:	2019-07-26
Issue Date:	2019-09-03 15:38:55 (UTC+8)
Publisher:	國立中央大學
Abstract:	在無線感測網路中常以跳頻的通訊方式去提高頻譜資源的使用率並解決頻譜資源短缺的問題。隨者天線成本的降低，每個裝置可以藉由多根的天線的幫助來提升通訊的品質。當使用越多根天線進行傳輸時，可以同時在更多頻道上進行通訊，進而降低裝置之間建立通訊的等待時間。然而，隨者天線數量的增加，更多的訊號也會隨之疊加，進而造成裝置上的運算單元去處理訊號的負擔，並伴隨者電量的劇烈消耗。在無線感測網路大多數裝置的電量以及運算能力是有限的，所以我們認為在無線感測網路之中的裝置應該使用兩根天線較為適合。此外，在無線感測網路中可能會有想要阻礙裝置之間通訊的攻擊者，這些攻擊者會不斷地發出訊號在不同的頻道上，阻礙兩個裝置之間的通訊。然而，大部分的跳頻演算法所產生的跳頻序列都具有固定的規律性或者長時間使用相同的頻道，這會造成裝置之間的通訊很容易地被攻擊者阻礙。雖然有些能抵抗攻擊者的跳頻方法需要傳送端和接收端預先分享的資訊，並藉此資訊建立一條互相連通的通訊去躲避惡意的攻擊，但在無線感測網路之中可以使用的頻道以及鄰近的裝置的資訊可能是一直在變動的，所以這種使用預先分享資訊來去抵抗攻擊者的方法並不適合在感測網路之中使用。因此，不使用預先分享資訊的防禦攻擊者的跳頻演算法變得越來越重視。在這篇論文中，我們提出了一個不使用預先分享資訊的跳頻演算法去抵抗攻擊，DR-CH。同時我們的跳頻演算法也能夠在有限的時間之內讓任兩個裝置能夠建立通訊。;In cognitive radio networks (CRNs), channel hopping communications are widely used to improve the utilization of licensed spectrum and solve unlicensed spectrum shortage problem. Besides, since the price of wireless transceivers becomes lower, devices in CRNs can be equipped with more radios to reduce the time to rendezvous (TTR). However, if SUs are equipped with many radios, all signals add together which brings a risk of destructive interference. It implies the devices should spend more computational resource and power to reduce interference. We consider that the devices in CRNs may be low power and low computing capability. Hence, the users (SUs) in CRNs are proper to be equipped with two radios. However, some existing multi-radios channel hopping schemes for CRNs, which have obvious patterns (i.e., a user utilizes a fixed channel for a long while), are vulnerable to jamming attacks in CRNs. Many existing anti-jamming channel hopping scheme in CRNs rely on pre-shared information (e.g., pre-shared channel hopping sequences) to build communication link between senders and receivers. However, pre-shared information among communication pairs is impractical in CRNs. Hence, anti-jamming channel hopping schemes without pre-sharing information have gained more research interests. In this paper, we propose an anti-jamming channel hopping scheme with two radios, DR-CH, and it has bounded time to rendezvous.
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	112	View/Open

社群 sharing

Loading...