在無線感測網路下的雙天線可抵抗攻擊式跳頻演算法

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：11

、訪客IP：18.119.108.33

姓名

陳泓維(Hung-Wei Chen) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

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

相關論文

★ 基於OP-TEE的可信應用程式軟體生態系統	★ 在低軌道衛星無線通訊中的CSI預測方法
★ 為多流量低軌道衛星系統提出的動態換手策略	★ 基於Trustzone的智慧型設備語音隱私保護系統
★ 一種減輕LEO衛星網路干擾的方案	★ TruzGPS:基於TrustZone的位置隱私權保護系統
★ 衛星地面整合網路之隨機接入前導訊號設計與偵測	★ SatPolicy: 基於Trustzone的衛星政策執行系統
★ TruzMalloc: 基於TrustZone 的隱私資料保護系統	★ 衛星地面網路中基於物理層安全的CSI保護方法
★ 低軌道衛星地面整合網路之安全非正交多重存取傳輸	★ 低軌道衛星地面網路中的DRX機制設計
★ 衛星地面整合網路之基於集合系統的前導訊號設計	★ 基於省電的低軌衛星網路路由演算法
★ 衛星上可重組化計算之安全FPGA動態部分可重組架構	★ 衛星網路之基於空間多樣性的前導訊號設計

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

至系統瀏覽論文 (2024-7-1以後開放)

摘要(中)

在無線感測網路中常以跳頻的通訊方式去提高頻譜資源的使用率並解決頻譜資源短缺的問題。隨者天線成本的降低，每個裝置可以藉由多根的天線的幫助來提升通訊的品質。當使用越多根天線進行傳輸時，可以同時在更多頻道上進行通訊，進而降低裝置之間建立通訊的等待時間。然而，隨者天線數量的增加，更多的訊號也會隨之疊加，進而造成裝置上的運算單元去處理訊號的負擔，並伴隨者電量的劇烈消耗。在無線感測網路大多數裝置的電量以及運算能力是有限的，所以我們認為在無線感測網路之中的裝置應該使用兩根天線較為適合。此外，在無線感測網路中可能會有想要阻礙裝置之間通訊的攻擊者，這些攻擊者會不斷地發出訊號在不同的頻道上，阻礙兩個裝置之間的通訊。然而，大部分的跳頻演算法所產生的跳頻序列都具有固定的規律性或者長時間使用相同的頻道，這會造成裝置之間的通訊很容易地被攻擊者阻礙。雖然有些能抵抗攻擊者的跳頻方法需要傳送端和接收端預先分享的資訊，並藉此資訊建立一條互相連通的通訊去躲避惡意的攻擊，但在無線感測網路之中可以使用的頻道以及鄰近的裝置的資訊可能是一直在變動的，所以這種使用預先分享資訊來去抵抗攻擊者的方法並不適合在感測網路之中使用。因此，不使用預先分享資訊的防禦攻擊者的跳頻演算法變得越來越重視。在這篇論文中，我們提出了一個不使用預先分享資訊的跳頻演算法去抵抗攻擊，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.

關鍵字(中)

★ 無線感測網路
★ 跳頻演算法
★ 防禦攻擊

關鍵字(英)

★ Cognitive radio
★ Channel hopping
★ Jamming attack

論文目次

中文摘要 i
Abstract ii
1 Introduction 1
2 Related Work 4
2.1 Single-radio channel hopping schemes for CRNs.............4
2.2 Multi-radio channel hopping schemes for CRNs..............5
2.3 Anti-jamming channel hopping schemes for CRNS............6
3 Preliminary 8
3.1 Channel hopping scheme..........................8
3.2 Metrics of channel hopping scheme....................9
3.3 Attack Model................................9
3.4 System Model................................10
4 The Purposed Algorithm 12
4.1 Rendezvous sequence............................12
4.2 Anti-jamming sequence...........................13
4.2.1 Low-level Anti-jamming sequence.................14
4.2.2 High-level Anti-jamming sequence................16
5 Performance Analysis 18
5.1 Rendezvous of non-anti-jamming sequences................18
iii
5.2 Rendezvous of low-level anti-jamming sequences.............21
5.3 Rendezvous of high-level anti-jamming sequences............24
6 Simulation 26
6.1 Performance under jamming attacks....................26
6.2 Performance under no jamming attacks..................27
7 Conclusion 31
bibliography 32

參考文獻

[1] E. FCC, “Docket no 03-222 notice of proposed rule making and order,” 2003.
[2] M. C. Ian F.Akyildiz, Won-YeolLee and ShantidevMohanty, “Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey,” ACM SIGCOMM Computer Networks, vol. 50, no. 13, pp. 2127–2159, 2006.
[3] A. Ghasemi and E. Sousa, “Spectrum sensing in cognitive radio networks: requirements, challenges and design trade-offs,” IEEE Communications Magazine, vol. 46,
no. 4, pp. 32–39, 2008.
[4] J. P. Paramvir Bahl, Atul Adya and A. Wolman, “Reconsidering wireless systems
with multiple radios,” SIGCOMM, vol. 34, no. 5, pp. 39–46, 2008.
[5] Y. S. Y. Thomas Hou and H. D. Sherali, “Spectrum sharing for multi-hop networking
with cognitive radios,” IEEE Journal on Selected Areas in Communications, vol. 26,
no. 1, pp. 146–155, 2008.
[6] Z. Lin, H. Liu, X. Chu, and Y.-W. Leung, “Jump-stay based channel-hopping algorithm with guaranteed rendezvous for cognitive radio networks,” INFOCOM, pp.
2444–2452, 2011.
[7] Y. W. Zhaoquan Gu, Qiang-Sheng Hua and F. C. M. Lau, “Nearly optimal asynchronous blind rendezvous algorithm for cognitive radio networks,” SECON, pp.
371–379, 2013.
[8] J.-F. H. Guey-Yun Chang and Yao-Shia, “Matrix-based channel hopping algorithms
for cognitive radio networks,” IEEE Transactions Wireless Commun, vol. 14, no. 5,
pp. 2755–2768, 2015.
[9] Y.-W. L. X. C. Lu Yu, Hai Liu and Z. Lin, “Multiple Radios for Fast Rendezvous
in Cognitive Radio Networks,” IEEE Transactions Mobile Computing, vol. 14, pp.
1917–1931, 2015.
[10] X. L. H. P. Guyue Li, Zhaoquan Gu and Q.-S. Hua, “Deterministic Distributed
Rendezvous Algorithms for Multi-Radio Cognitive Radio Networks,” MSWiM, pp.
313–320, 2014.
[11] J.-P. Sheu and J.-J. Lin, “A Multi-Radio Rendezvous Algorithm Based on Chinese
Remainder Theorem in Heterogeneous Cognitive Radio Networks,” IEEE Transactions Mobile Computing, vol. 17, pp. 1980–1990, 2018.
[12] Q. Wang, P. Xu, K. Ren, and X.-y. Li, “Delay-bounded adaptive ufh-based antijamming wireless communication,” INFOCOM, pp. 1413–1421, 2011.
[13] Y. Wu, B. Wang, K. R. Liu, and T. C. Clancy, “Anti-jamming games in multi-channel
cognitive radio networks,” IEEE Journal on Selected Areas in Communications,
vol. 30, no. 1, pp. 4–15, 2012.
[14] J.-F. Huang, G.-Y. Chang, and J.-X. Huang, “Anti-jamming Rendezvous Scheme
for Cognitive Radio Networks,” IEEE Transactions on Mobile Computing, vol. 16,
no. 3, pp. 648–661, 2017.
[15] I.-H. Chuang, H.-Y. Wu, K.-R. Lee, and Y.-H. Kuo, “Alternate hop-and-wait channel
rendezvous method for cognitive radio networks,” INFOCOM, pp. 746–754, 2013.
[16] K. Bian et al., “Maximizing rendezvous diversity in rendezvous protocols for decentralized cognitive radio networks,” IEEE Transactions on Mobile Computing,
vol. 12, no. 7, pp. 1294–1307, 2013.
[17] C. P. Mario Strasser and S. Capkun, “Efficient uncoordinated FHSS anti-jamming
communication,” MobiHoc, pp. 207–218, 2009.

指導教授

張貴雲(Guey-Yun Chang)

審核日期

2019-7-26

推文