摘要(英) |
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. |
參考文獻 |
[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. |