A highly-random hopping sequence for jamming-resilient channel rendezvous in distributed cognitive radio networks

doi:10.1016/j.cose.2020.101809

	A highly-random hopping sequence for jamming-resilient channel rendezvous in distributed cognitive radio networks
	Yang, Bo
	2020-09-01
发表期刊	COMPUTERS & SECURITY
ISSN	0167-4048
卷号	96 页码:12
摘要	Channel hopping (CH) is an effective technique to reach a rendezvous in cognitive radio networks (CRNs). However, the holistic requirements of asynchronous clocks, heterogeneous channels, symmetric roles and anonymous identifiers make it particularly challenging to achieve deterministic and fast rendezvous. Moreover, some existing regular CH algorithms are easy to be detected and blocked by adversarial jammers. To overcome these deficiencies, this paper designs a novel Parity and Binary CH (PBCH) algorithm in a highly-random manner to enhance the level of anti-jamming. The key idea behind PBCH is to convert a randomly selected parity channel into a carefully designed binary template. Whether secondary users (SUs) select the same parity channel or not, the interleaved zeros and ones naturally included in the adequate binary template can guide fast rendezvous undoubtedly. We analyze the theoretical maximum time-to-rendezvous and the anti-jamming capability by virtue of the Chinese remainder theorem and the information entropy, respectively. We also compare PBCH with the prevailing rendezvous algorithms through extensive simulations. Evaluation results reveal that PBCH yields superior rendezvous latencies even under moderate jammer attacks.(C) 2020 Elsevier Ltd. All rights reserved.
关键词	Cognitive radio networks Hopping sequences Distributed rendezvous algorithms Chinese remainder theorem Anti-jamming Information entropy
DOI	10.1016/j.cose.2020.101809
收录类别	SCI
语种	英语
资助项目	China Postdoctoral Science Foundation[2018M631582] ; Zhejiang Lab's International Talent Fund for Young Professionals
WOS研究方向	Computer Science
WOS类目	Computer Science, Information Systems
WOS记录号	WOS:000564606700014
出版者	ELSEVIER ADVANCED TECHNOLOGY
引用统计	被引频次：2[WOS] [WOS记录] [WOS相关记录]
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/15766
专题	中国科学院计算技术研究所期刊论文_英文
通讯作者	Yang, Bo
作者单位	Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China
推荐引用方式 GB/T 7714	Yang, Bo. A highly-random hopping sequence for jamming-resilient channel rendezvous in distributed cognitive radio networks[J]. COMPUTERS & SECURITY,2020,96:12.
APA	Yang, Bo.(2020).A highly-random hopping sequence for jamming-resilient channel rendezvous in distributed cognitive radio networks.COMPUTERS & SECURITY,96,12.
MLA	Yang, Bo."A highly-random hopping sequence for jamming-resilient channel rendezvous in distributed cognitive radio networks".COMPUTERS & SECURITY 96(2020):12.