SIA OpenIR  > 工业控制网络与系统研究室
Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks
Yang B(杨博); Liang W(梁炜); Zheng M(郑萌); Liang YC(梁应敞)
作者部门工业控制网络与系统研究室
关键词Cognitive Radio Networks Channel Rendezvous Heterogeneous Networks Sunflower Sets
发表期刊IEEE Transactions on Vehicular Technology
ISSN0018-9545
2016
卷号65期号:10页码:8629-8643
收录类别SCI ; EI
EI收录号20173304054367
WOS记录号WOS:000386658000064
产权排序1
资助机构National Natural Science Foundation of China under Grant 61233007, 61304263, and 61571100.
摘要Channel rendezvous is a vital step to form a cognitive radio network (CRN). It is intractable to guarantee rendezvous for secondary users (SUs) within a short finite time in asynchronous, heterogeneous and anonymous CRNs. However, most previous heterogeneous algorithms rely on explicit SUs’ identifiers (IDs) to guide rendezvous, which is not fully distributed. In this paper, we exploit the mathematical construction of sunflower sets to develop a Single-radio Sunflower- Sets-based (SSS) pairwise rendezvous algorithm. We propose an approximation algorithm to construct disjoint sunflower sets. Then SSS leverages the variant permutations of elements in sunflower sets to adjust the order of accessing channels instead of SUs’ IDs, which is more favorable for anonymous SUs in distributed environments. We also propose a Multi-radio Sunflower-Sets-based (MSS) pairwise rendezvous algorithm in order to bring additional rendezvous diversity and accelerate the rendezvous process. Moreover, for the case with more than two SUs, we propose a multi-user collaborative scheme in which SUs cooperatively exchange and update their channel-hopping sequences until rendezvous. We derive the theoretical upper and lower bounds of rendezvous latency of the proposed algorithms. Extensive simulation comparisons with the state-of-the-art blind rendezvous algorithms are conducted incorporating the metrics of maximum and expected time-to-rendezvous. The simulation results show that our algorithms can achieve rendezvous faster than previous works.
语种英语
WOS标题词Science & Technology ; Technology
WOS类目Engineering, Electrical & Electronic ; Telecommunications ; Transportation Science & Technology
关键词[WOS]RADIO NETWORKS ; SEQUENCE APPROACH
WOS研究方向Engineering ; Telecommunications ; Transportation
引用统计
文献类型期刊论文
条目标识符http://ir.sia.cn/handle/173321/17694
专题工业控制网络与系统研究室
通讯作者Liang W(梁炜)
作者单位1.Key Laboratory of Networked Control Systems, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
2.University of Chinese Academy of Sciences, Beijing 100049, China
3.University of Electronic Science and Technology of China, Chengdu, 610051, China
4.Institute for Infocomm Research, 138632, Singapore
推荐引用方式
GB/T 7714
Yang B,Liang W,Zheng M,et al. Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks[J]. IEEE Transactions on Vehicular Technology,2016,65(10):8629-8643.
APA Yang B,Liang W,Zheng M,&Liang YC.(2016).Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks.IEEE Transactions on Vehicular Technology,65(10),8629-8643.
MLA Yang B,et al."Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multiradio Networks".IEEE Transactions on Vehicular Technology 65.10(2016):8629-8643.
条目包含的文件 下载所有文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
Fully Distributed Ch(2033KB)期刊论文作者接受稿开放获取ODC PDDL浏览 下载
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Yang B(杨博)]的文章
[Liang W(梁炜)]的文章
[Zheng M(郑萌)]的文章
百度学术
百度学术中相似的文章
[Yang B(杨博)]的文章
[Liang W(梁炜)]的文章
[Zheng M(郑萌)]的文章
必应学术
必应学术中相似的文章
[Yang B(杨博)]的文章
[Liang W(梁炜)]的文章
[Zheng M(郑萌)]的文章
相关权益政策
暂无数据
收藏/分享
文件名: Fully Distributed Channel-Hopping Algorithms for Rendezvous Setup in Cognitive Multi-Radio Networks.pdf
格式: Adobe PDF
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。