臺灣博碩士論文加值系統

在無線電感知網路 (Cognitive Radio Networks, CRNs) 中，節點可以使用未被授權用戶使用的頻道。在CRN中的任何一對節點碰面是一項挑戰。設計跳頻協定是解決碰面問題常用的方法。但是固定模式的跳頻協定很容易受到攻擊，因此設計一個能夠抗攻擊的跳頻協定是一個重要的議題。現存具代表性的抗攻擊協定如LAA、OLAA等，都會建立跳頻矩陣以產生跳頻序列。在這些方法中，兩個節點的碰面機率是依跳頻矩陣的架構而定。為提升碰面機率，本文提出了一個方法，讓送端可以依據收端調整跳頻矩陣的架構。模擬結果顯示本文提出的方法與OLAA相比，碰面機會提升25%，平均碰面間隔時間降低20%。

In Cognitive Radio Networks (CRNs), an unlicensed user can use channels that the licensed user does not. It is a challenge to rendezvous with any pair of the unlicensed user in the CRN. Channel hopping protocol is one commonly used methods to solve the rendezvous problem. However, channel hopping protocols with fixed types are vulnerable to attack, so designing one protocol with anti-jamming is a critical issue. Existing anti-jamming protocols will construct a channel hopping matrix to generate a channel hopping sequence, such as LAA and OLAA. In these methods, the rendezvous probability is determined by the structure of the channel hopping matrix. To improve the rendezvous probability, we propose one method so that the sender can adjust the structure of the channel hopping matrix according to the receiver. Simulation results verify that our methods enhance the existing most practical anti-jamming channel hopping protocol OLAA by up 25% in network throughput.

摘要 III
Abstract IV
Index V
Figure Index VI
Table Index VII
I. Introduction 1
II. RELATED WORK 2
III. Preliminary & System model 4
IV. Proposed Solution 7
V SIMULATION 14
VI. CONCLUSION 25
Reference 26

[1] Federal Communications Commission Spectrum Policy Task Force. Report of the Spectrum Efficiency Working Group, 2002.
[2] I. F. Akyildiz, W.-Y. Lee, M. C. Vuran, and S. Mohanty, “Next generation/dynamic spectrum access/cognitive radio wireless networks: a survey,” Computer Networks, vol. 50, no. 13, pp. 2127–2159, September 2006.
[3] Y. T. Hou, Y. Shi, 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, January 2008.
[4] C. Cormio and K. R. Chowdhury, “Common control channel design for cognitive radio wireless ad hoc networks using adaptive frequency hopping,” Ad Hoc Networks, vol. 8, no. 4, pp. 430–438, June 2010.
[5] M.-R. Kim and S.-J. Yoo, “Distributed coordination protocol for ad hoc cognitive radio networks,” Journal of Communications and Networks, vol. 14, no. 1, pp. 51–62, February 2012.
[6] B. F. Lo, I. F. Akyildiz, and A. M. Al-Dhelaan, “Efficient recovery control channel design in cognitive radio ad hoc networks,” IEEE Transactions on Vehicular Technology, vol. 59, no. 9, pp. 4513–4526, November 2010.
[7] X. Wang, X. Zhang, Q. Zhang, and C. Tang, “Common control channel model on mac protocols in cognitive radio networks,” in Proceedings of 2011 International Conference on Computer Science and Network Technology, December 2011, pp. 2230–2234.
[8] C.-M. Chao, H.-Y. Fu, and L.-R. Zhang, “A fast rendezvous-guarantee channel hopping protocol for cognitive radio networks,” IEEE Transactions on Vehicular Technology, vol. 64, no. 12, pp. 5804–5816, December 2015.
[9] C.-M. Chao and H.-Y. Fu, “Supporting fast rendezvous guarantee by randomized quorum and latin square for cognitive radio networks,” IEEE Transactions on Vehicular Technology, vol. 65, no. 10, pp. 101–106, January 2015.
[10] C.-M. Chao and H.-Y. Fu, “A fast and fair rendezvous guarantee channel hopping protocol for cognitive radio networks,” in 2016 8th IEEE International Conference on Communication Software and Networks, June 2016, pp. 483–487.
[11] S.-H. Wu, C.-C. Wu, W.-K. Hon, and K. G. Shin, “Rendezvous for heterogeneous spectrum-agile devices,” in IEEE INFOCOM 2014 - IEEE Conference on Computer Communications, April 2014, pp. 2247–2255.
[12] C.-C. Wu and S.-H. Wu, “On bridging the gap between homogeneous and heterogeneous rendezvous schemes for cognitive radios,” in 14th ACM international symposium on Mobile ad hoc networking and computing, July 2013, pp. 207–216.
[13] L. Chen, K. Bian, L. Chen, C. Liu, J.-M. J. Park, and X. Li, “A grouptheoretic framework for rendezvous in heterogeneous cognitive radio networks,” in 15th ACM international symposium on Mobile ad hoc networking and computing, August 2014, pp. 165–174.
[14] Z. Gu, H. Pu, Q.-S. Hua, and F. C. M. Lau, “Improved rendezvous algorithms for heterogeneous cognitive radio networks,” in 2015 IEEE Conference on Computer Communications, April 2015, pp. 154–162.
[15] H. Liu, Z. Lin, X. Chu, and Y.-W. Leung, “Jump-stay rendezvous algorithm for cognitive radio networks,” IEEE Transactions on parallel and distributed systems, vol. 23, no. 10, pp. 1867–1881, October 2012.
[16] Q. Wang, P. Xu, K. Ren, and X. yang Li, “Delay-bounded adaptive
ufh-based anti-jamming wireless communication,” in 2011 Proceedings
IEEE INFOCOM, April 2011, pp. 1413–1421.
[17] E.-K. Lee, S. Y. Oh, and M. Gerla, “Frequency quorum rendezvous for fast and resilient key establishment under jamming attack,” ACM SIGMOBILE Mobile Computing and Communications, vol. 14, no. 4, pp. 1–3, January 2010.
[18]Y.-H. Oh and D. Thuente, "Limitations of quorum-based rendezvous and key establishment schemes against sophisticated jamming attacks", Proc. IEEE Military Commun. Conf., pp. 1-6, 2012.
[19] A. J. Viterbi, CDMA: Principles of Spread Spectrum Communication. Pearson, 1995.
[20] R. Poisel, Modern Communications Jamming Principles and Techniques,
Second Edition. Artech House, 2011.
[21] M. Strasser, C. Popper, S. Capkun, and M. Cagalj, “Jamming-resistant
key establishment using uncoordinated frequency hopping,” in 2008
IEEE Symposium on Security and Privacy, May 2008, pp. 64–78.
[22] Y. Wu, B. Wang, K. J. 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, January 2012.
[23] 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, March 2017.
[24] G.-Y. Chang, S.-Y. Wang, and Y.-X. Liu, “A jamming-resistant channel hopping scheme for cognitive radio networks,” IEEE Transactions on Wireless Communications, vol. 16, no. 10, pp. 6712–6725, October 2017.
[25] C.-M. Chao, W.-C. Lee, C.-X. Wang, S.-C. Huang, and Y.-C. Yang, "A flexible anti-jamming channel hopping for cognitive radio networks", 2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW), pp. 549-551, November, 2018.
[26] R. Paul and Y. Choi, "Adaptive Rendezvous for Heterogeneous Channel Environments in Cognitive Radio Networks", IEEE Transactions on Wireless Communications, vol. 15, no. 11, pp. 7753-65, Nov. 2016.
[27] C.-M. Chao and C.-T. Chen, “Ratio adjustable channel hopping enhancement for heterogeneous cognitive radio networks”, 2017 IEEE International Conference on Communications Workshops (ICC Workshops), May, 2017.
[28] C.-M. Chao, C.-T. Chen and S.-J. Huang “An Adjustable Channel Hopping Algorithm Based on Channel Usage Ratio for Multi-Radio CRNs”, 2019 International Conference on Information Networking (ICOIN), January 2019.
[29] C.-M. Chao and W.-C. Lee, “Load-aware anti-jamming channel hopping design for cognitive radio networks,” Computer Networks, vol. 184,p.107681,January 2021 [30] C.-M. Chao and G.-W. Chen, “Anti-Jamming Channel Hopping Protocol Design Based on Channel Occupancy Probability for Cognitive Radio Networks”, Computer Networks, p.109125, January 2022.
[31] T. Moulahi, S. Nasri and H. Guyennet, "Amelioration of MPR by a backbone-based broadcasting algorithm for WSNs," 2012 International Conference on Information Technology and e-Services, 2012, pp. 1-5, doi: 10.1109/ICITeS.2012.6216676.
[32] C. D. Langford, “Problem,” The Mathematical Gazette, vol. 42, no. 341, p. 228–228, 1958.
[33] J. E. Simpson, “Langford sequences: perfect and hooked,” Discrete Mathematics, vol. 44, no. 1, pp. 97–104, 1983.